Related papers: Persistent hubs in CMJ branching processes with in…
We investigate centrality and root-inference properties in a class of growing random graphs known as sublinear preferential attachment trees. We show that a continuous time branching processes called the Crump-Mode-Jagers (CMJ) branching…
We consider models of evolving networks $\{\mathcal{G}_n:n\geq 0\}$ modulated by two parameters: an attachment function $f:\mathbb{N}_0\to\mathbb{R}_+$ and a (possibly random) attachment sequence $\{m_i:i\geq 1\}$. Starting with a single…
We study the structure of genealogical trees associated with explosive Crump-Mode-Jagers branching processes (stopped at the explosion time), proving criteria for the associated tree to contain a node of infinite degree (a star) or an…
We study a family of Crump--Mode--Jagers branching processes in random environment that explode, i.e. that grow infinitely large in finite time with positive probability. Building on recent work of the author and Iyer (``On the structure of…
Consider a generalised preferential attachment tree with attachment function $f$, that is a random tree, where at each time-step a node connects to an existing node $v$ with probability proportional to $f(\mathrm{deg}(v))$, where…
A vertex of a randomly growing graph is called a persistent hub if at all but finitely many moments of time it has the maximal degree in the graph. We establish the existence of a persistent hub in the Barab\'asi--Albert random graph model…
We provide sufficient criteria for explosion in Crump-Mode-Jagers branching process, via the process producing an infinite path in finite time. As an application, we deduce a curious phase-transition in the infinite tree associated with a…
We investigate properties of node centrality in random growing tree models. We focus on a measure of centrality that computes the maximum subtree size of the tree rooted at each node, with the most central node being the tree centroid. For…
Consider a supercritical Crump-Mode-Jagers process $(\mathcal{Z}_{t}^{\varphi})_{t \geq 0}$ counted with a random characteristic $\varphi$ that depends on an individual's life and their descendant process up to a fixed generation. Under…
Crump-Mode-Jagers (CMJ) trees generalize Galton-Watson trees by allowing individuals to live for an arbitrary duration and give birth at arbitrary times during their life-time. In this paper, we exhibit a simple condition under which the…
In this paper we initiate the theory of Crump-Mode-Jagers branching processes (BP) in the setting where no Malthusian parameter exist, i.e., the process grows faster than exponential. A Crump-Mode-Jagers BP is a branching process (in…
We prove almost sure convergence of the maximum degree in an evolving tree model combining local choice and preferential attachment. At each step in the growth of the graph, a new vertex is introduced. A fixed, finite number of possible…
Consider a general branching process, a.k.a. Crump-Mode-Jagers process, generated by a perturbed random walk $\eta_1$, $\xi_1+\eta_2$, $\xi_1+\xi_2+\eta_3,\ldots$. Here, $(\xi_1,\eta_1)$, $(\xi_2, \eta_2),\ldots$ are independent identically…
In this paper, we give sufficient conditions for a Crump-Mode-Jagers process to be bounded in $L_k$ for a given $k>1$. This result is then applied to a recent random graph process motivated by pairwise collaborations and driven by…
This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump-Mode-Jagers branching process, stopped at a suitable time. This includes random recursive…
We consider an evolving random discrete tree model called Preferential Attachment with Vertex Death, as introduced by Deijfen. Initialised with an alive root labelled $1$, at each step $n\geq1$ either a new vertex with label $n+1$ is…
In this short note, we provide an explicit sufficient condition for non-explosion of Crump--Mode--Jagers branching processes with pure birth reproduction. It shows that the standard sufficient condition for explosion, namely the convergence…
We show that for many models of random trees, the independence number divided by the size converges almost surely to a constant as the size grows to infinity; the trees that we consider include random recursive trees, binary and $m$-ary…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
We study the phenomenon of explosion in general (Crump-Mode-Jagers) branching processes, which refers to the event where an infinite number of individuals are born in finite time. In a critical setting where the expected number of immediate…