Results 41 to 50 of about 5,474,085 (350)
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 +1 more source
30th Annual Symposium on Foundations of Computer Science, 1989 A randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior is presented. In particular, in the expected case an update takes logarithmic time and requires fewer than two rotations. Moreover, the update time remains logarithmic, even if the cost of a rotation is taken to be proportional to the ...
Cecilia Aragon +2 more
openaire +2 more sources
ESAIM: Proceedings, 2011 These notes provide an elementary and self-contained introduction to branching ran- dom walks. Section 1 gives a brief overview of Galton-Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly in- dispensable, but they introduce the idea of using size-biased trees,
openaire +2 more sources
The continuous limit of large random planar maps [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We discuss scaling limits of random planar maps chosen uniformly over the set of all $2p$-angulations with $n$ faces. This leads to a limiting space called the Brownian map, which is viewed as a random compact metric space.
Jean-François Le Gall
doaj +1 more source
Recursive construction of continuum random trees [PDF]
Annals of Probability, 2016 We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related structures.
Franz Rembart, Matthias Winkel
semanticscholar +1 more source
Distribution of inter-node distances in digital trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We investigate distances between pairs of nodes in digital trees (digital search trees (DST), and tries). By analytic techniques, such as the Mellin Transform and poissonization, we describe a program to determine the moments of these distances.
Rafik Aguech +2 more
doaj +1 more source
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)!$.
openaire +4 more sources
Election algorithms with random delays in trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is studied.
Jean-François Marckert +2 more
doaj +1 more source
The height of random binary unlabelled trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local
Nicolas Broutin, Philippe Flajolet
doaj +1 more source
The scaling of the minimum sum of edge lengths in uniformly random trees [PDF]
arXiv.org, 2016 The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly.
J. L. Esteban +2 more
semanticscholar +1 more source