Results 11 to 20 of about 6,285,799 (375)
Ergodic Theory and Dynamical Systems, 2013 AbstractWe consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to give a new proof that URTs are sofic, a result of Elek.
Benjamini, Itai +2 more
openaire +5 more sources
Fragmentation of random trees [PDF]
Journal of Physics A: Mathematical and Theoretical, 2014 We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees,
Kalay, Z, Ben-Naim, E
openaire +5 more sources
Journal of Statistical Mechanics: Theory and Experiment, 2010 We investigate a network growth model in which the genealogy controls the evolution. In this model, a new node selects a random target node and links either to this target node, or to its parent, or to its grandparent, etc; all nodes from the target node to its most ancient ancestor are equiprobable destinations.
Ben-Naim, E., Krapivsky, P. L.
openaire +3 more sources
Acta Mathematica Hungarica, 2013 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 a random tree sequence where the probability of a given tree is proportional to $\prod_{v_i\in V(T)}d(v_i)!$.
Deák, Attila
openaire +7 more sources
Random ultrametric trees and applications* [PDF]
ESAIM: Proceedings and Surveys, 2017 Ultrametric trees are trees whose leaves lie at the same distance from the root. They are used to model the genealogy of a population of particles co-existing at the same point in time.
Lambert Amaury
doaj +3 more sources
Perturbative Quantum Field Theory on Random Trees [PDF]
Communications in Mathematical Physics, 2019 In this paper we start a systematic study of quantum field theory on random trees. Using precise probability estimates on their Galton–Watson branches and a multiscale analysis, we establish the general power counting of averaged Feynman amplitudes and ...
N. Delporte, V. Rivasseau
semanticscholar +3 more sources
Annales de la Faculté des sciences de Toulouse : Mathématiques, 2009 We survey recent developments about random real trees, whose prototype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in particular of the relations between discrete Galton-Watson trees and continuous random trees.
Gall, J. F. Le
openaire +6 more sources
Spanning trees in random satisfiability problems [PDF]
, 2006 Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning trees in the ...
A Ramezanpour, S Moghimi-Araghi
openalex +3 more sources
Profiles of random trees: plane-oriented recursive trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We summarize several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance, asymptotic approximations of the expected width and the ...
Hsien-Kuei Hwang
doaj +1 more source
Additive tree functionals with small toll functions and subtrees of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Many parameters of trees are additive in the sense that they can be computed recursively from the sum of the branches plus a certain toll function. For instance, such parameters occur very frequently in the analysis of divide-and-conquer algorithms. Here
Stephan Wagner
doaj +1 more source