From the 2 of 14 linked papers with an AI index.
14 papers
A shape theorem for BBM in a periodic environment
Louigi Addario-Berry, Arturo Arellano Arias, Jessica Lin
The paper proves that binary branching Brownian motion with a spatially periodic branching rate, when rescaled by time, converges almost surely to a deterministic convex shape, and…
Optimal root recovery for uniform attachment trees and -regular growing trees
Louigi Addario-Berry, Catherine Fontaine, Robin Khanfir +2
The paper studies algorithms that locate the root of random trees grown by uniform attachment, showing that an optimal method can identify a small set of candidate nodes whose size…
Scaling limits of multitype Bienaymé trees
Louigi Addario-Berry, Philipp Beltran, Benedikt Stufler +1
We consider critical multitype Bienaymé trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied…
Symmetric Cooperative Motion in Higher Dimensions
Louigi Addario-Berry, Gavin Barill, Hannah Cairns +1
We prove a distributional convergence result for a multidimensional version of symmetric cooperative motion which was introduced and studied in one dimension in \cite{HRW, SCM1}. O…
Diameters and mixing times for giant components of random graphs with given degrees
Louigi Addario-Berry, Bruce Reed, Corrine Yap
A sequence is a feasible degree sequence if there is a graph on such that has degree . For such a sequence, is a graph chosen uni…
What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
Louigi Addario-Berry, Bruce Reed, Dao Chen Yuan
An -tuple is a \emph{feasible degree sequence} if there is a graph on such that has degree . Any such graph will have $m=\sum_{i=…