Related papers: The Erlang Weighted Tree, A New Branching Process

We study a model of random weighted uniform spanning trees on the complete graph with $n$ vertices, where each edge is assigned a weight of $n^{1+\gamma}$ with probability $1/n$ and $1$ otherwise. Whenever $\gamma$ is large enough, we prove…

We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…

The paper studies wsat$(G,H)$ which is the minimum number of edges in a weakly $H$-saturated subgraph of $G$. We prove that wsat$(K_n,H)$ is `stable' - remains the same after independent removal of every edge of $K_n$ with constant…

We propose a new perspective on the asymptotic regimes of fast and slow extinction in the contact process on locally converging sequences of sparse finite graphs. We characterise the phase boundary by the existence of a metastable density,…

We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…

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…

In this article, we study concave recursions on trees, which appear widely in information theory through algorithms such as belief propagation, and in statistical mechanics through models on tree-like graphs, including the Ising model,…

We consider uniform spanning tree (UST) in topological polygons with $2N$ marked points on the boundary with alternating boundary conditions. In [LPW21], the authors derive the scaling limit of the Peano curve in the UST. They are variants…

We consider the Shortest Odd Path problem, where given an undirected graph $G$, a weight function on its edges, and two vertices $s$ and $t$ in $G$, the aim is to find an $(s,t)$-path with odd length and, among all such paths, of minimum…

In this manuscript, we continue with the systematic study of the speed of extinction of continuous state branching processes in L\'evy environments under more general branching mechanisms. Here, we deal with the weakly subcritical regime…

We introduce regenerative tree growth processes as consistent families of random trees with n labelled leaves, n>=1, with a regenerative property at branch points. This framework includes growth processes for exchangeably labelled Markov…

It is well known that finding extremal values and structures can be hard in weighted graphs. However, if the weights are random, this problem can become way easier. In this paper, we examine the minimal weight of a union of $k$…

In his, by now, classical work from 1981, Nerman made extensive use of a crucial martingale $(W_t)_{t \geq 0}$ to prove convergence in probability, in mean and almost surely, of supercritical general branching processes (a.k.a.…

In [1] a detailed analysis was given of the large-time asymptotics of the total mass of the solution to the parabolic Anderson model on a supercritical Galton-Watson random tree with an i.i.d. random potential whose marginal distribution is…

Let $X$ be the branching particle diffusion corresponding to the operator $Lu+\beta (u^{2}-u)$ on $D\subseteq \mathbb{R}^{d}$ (where $\beta \geq 0$ and $\beta\not\equiv 0$). Let $\lambda_{c}$ denote the generalized principal eigenvalue for…

We study general properties of the leading eigenvalue $\overline{w}(q)$ of Eigen's evolutionary matrices depending on the probability $q$ of faithful reproduction. This is a linear algebra problem that has various applications in…

We study the exploration (or height) process of a continuous time non-binary Galton-Watson random tree, in the subcritical, critical and supercritical cases. Thus we consider the branching process in continuous time (Z_{t})_{t\geq 0}, which…

In our previous work, we introduced the random $k$-cut number for rooted graphs. In this paper, we show that the distribution of the $k$-cut number in complete binary trees of size $n$, after rescaling, is asymptotically a periodic function…

Many social, technological, biological, and economical systems are best described by weighted networks, whose properties and dynamics depend not only on their structures but also on the connection weights among their nodes. However, most…

A class of branching processes in varying environments is exhibited which become extinct almost surely even though the means M_n grow fast enough so that sum M_n^{-1} is finite. In fact, such a process is constructed for every offspring…