Related papers: Modeling electrical distribution networks with inh…
Branching processes pervade many models in statistical physics. We investigate the survival probability of a Galton-Watson branching process after a finite number of generations. We reveal the finite-size scaling law of the survival…
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…
Reinforced Galton--Watson processes describe the dynamics of a population where reproduction events are reinforced, in the sense that offspring numbers of forebears can be repeated randomly by descendants. More specifically, the evolution…
We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…
We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…
This paper is centered on covariant dynamics on unimodular random graphs and random networks, namely maps from the set of vertices to itself which are preserved by graph or network isomorphisms. Such dynamics are referred to as…
Let $\mathcal{T}$ denote a Galton--Watson tree with offspring distribution $\xi$ satisfying $\mathbb{E}(\xi) = 1$, and let $\mathcal{T}_n$ be the Galton--Watson tree conditioned to have exactly $n$ nodes. We show that, under a mild moment…
We study the extremes of branching random walks under the assumption that the underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or they have lighter tails. In the…
Mechanistic models can provide an intuitive and interpretable explanation of network growth by specifying a set of generative rules. These rules can be defined by domain knowledge about real-world mechanisms governing network growth or may…
In this note, we introduce a unified analytic framework that connects simple varieties of trees, Bienayme-Galton-Watson processes and Khinchin families. Using Lagrange's inversion formula, we derive new coefficient-based expressions for…
We analyze simple random walk on a supercritical Galton-Watson tree, where the walk is conditioned to return to the root at time $2n$. Specifically, we establish the asymptotic order (up to a constant factor) as $n\to\infty$, of the maximal…
We establish a general sufficient condition for a sequence of Galton Watson branching processes in varying environment to converge weakly. This condition extends previous results by allowing offspring distributions to have infinite…
Fix $n\in\mathbb{N}$. Let $\mathbf{T}_n$ be the set of rooted trees $(T,o)$ whose vertices are labeled by elements of $\{1,...,n\}$. Let $\nu$ be a strongly connected multi-type Galton-Watson measure. We give necessary and sufficient…
We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…
We consider distributed networks, such as peer-to-peer networks, whose structure can be manipulated by adjusting the rules by which vertices enter and leave the network. We focus in particular on degree distributions and show that, with…
D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…
We study two different versions of the simple exclusion process on augmented Galton-Watson trees, the constant speed model and the varying speed model. In both cases, the simple exclusion process starts from an equilibrium distribution with…