4 citations · 8 across the 5 of their papers we have counts for
5 papers
Total progeny in killed branching random walk
Louigi Addario-Berry, Nicolas Broutin
We consider a branching random walk for which the maximum position of a particle in the n'th generation, M_n, has zero speed on the linear scale: M_n/n --> 0 as n --> infinity. We…
The continuum limit of critical random graphs
Louigi Addario-Berry, Nicolas Broutin, Christina Goldschmidt
We consider the Erdos-Renyi random graph G(n,p) inside the critical window, that is when p=1/n+ lambda*n^{-4/3}, for some fixed lambda in R. Then, as a metric space with the graph…
The longest minimum-weight path in a complete graph
Louigi Addario-Berry, Nicolas Broutin, Gabor Lugosi
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variables…
The height of random binary unlabelled trees
Nicolas Broutin, Philippe Flajolet
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 is…
Effective resistance of random trees
Louigi Addario-Berry, Nicolas Broutin, Gábor Lugosi
We investigate the effective resistance and conductance between the root and leaves of a binary tree of height . In this electrical network, the resistance of each e…