Results 101 to 110 of about 6,285,799 (375)
Random trees constructed by aggregation [PDF]
, 2014 We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree.
N. Curien, Bénédicte Haas
semanticscholar +1 more source
Limits of Random Trees. II [PDF]
Acta Mathematica Hungarica, 2014 Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given degree distributions. Denote by ${\cal D}_n$ the set of possible degree sequences of a tree on $n$ nodes.
openaire +4 more sources
, 2018 We consider infinite Galton-Watson trees without leaves together with i.i.d.~random variables called marks on each of their vertices. We define a class of flow rules on marked Galton-Watson trees for which we are able, under some algebraic assumptions ...
Rousselin, Pierre
core +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Glioma recurrence severely impacts patient prognosis, with current treatments showing limited efficacy. Traditional methods struggle to analyze recurrence mechanisms due to challenges in assessing tumor heterogeneity, spatial dynamics, and gene networks.
Lei Qiu +10 more
wiley +1 more source
Holonomic equations and efficient random generation of binary trees [PDF]
Discrete Mathematics & Theoretical Computer ScienceHolonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees.
Pierre Lescanne
doaj +1 more source
Non-crossing trees revisited: cutting down and spanning subtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random cuts to destroy a size-$n$ non-crossing tree and $\textit{(ii)}$ the spanning subtree-size of $p$ randomly chosen nodes in a size-$n$ non-crossing tree ...
Alois Panholzer
doaj +1 more source
Arthritis Care &Research, EarlyView.Objective This study aims to develop hip morphology‐based radiographic hip osteoarthritis (RHOA) risk prediction models and investigates the added predictive value of hip morphology measurements and the generalizability to different populations. Methods We combined data from nine prospective cohort studies participating in the Worldwide Collaboration ...
Myrthe A. van den Berg +26 more
wiley +1 more source
Degree distribution of random Apollonian network structures and Boltzmann sampling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Random Apollonian networks have been recently introduced for representing real graphs. In this paper we study a modified version: random Apollonian network structures (RANS), which preserve the interesting properties of real graphs and can be handled ...
Alexis Darrasse, Michèle Soria
doaj +1 more source
Random walks on random trees [PDF]
Journal of the Australian Mathematical Society, 1973 Let T denote one of the nn−2 trees with n labelled nodes that is rooted at a given node x (see [6] or [8] as a general reference on trees). If i and j are any two nodes of T, we write i ∼ j if they are joined by an edge in T. We want to consider random walks on T; we assume that when we are at a node i of degree d the probability that we proceed to ...
openaire +1 more source
Arthritis Care &Research, EarlyView.Objective The aim of this study was to investigate the cost‐effectiveness of low‐dose colchicine prophylaxis for preventing gout flares when starting allopurinol using the “start‐low go‐slow” approach. Methods Participants with gout, fulfilling the American College of Rheumatology recommendations for starting urate‐lowering therapy and with serum urate
Yana Pryymachenko +4 more
wiley +1 more source