Related papers: Continuum random tree as the scaling limit for a d…
In this note, we provide a new characterization of Aldous' Brownian continuum random tree as the unique fixed point of a certain natural operation on continuum trees (which gives rise to a recursive distributional equation). We also show…
We analyze an evolving network model of Krapivsky and Redner in which new nodes arrive sequentially, each connecting to a previously existing node b with probability proportional to the p-th power of the in-degree of b. We restrict to the…
We analyze dynamic random network models where younger vertices connect to older ones with probabilities proportional to their degrees as well as a propensity kernel governed by their attribute types. Using stochastic approximation…
We discuss scaling limits of large bipartite planar maps. If p is a fixed integer strictly greater than 1, we consider a random planar map M(n) which is uniformly distributed over the set of all 2p-angulations with n faces. Then, at least…
We first establish new local limit estimates for the probability that a nondecreasing integer-valued random walk lies at time $n$ at an arbitrary value, encompassing in particular large deviation regimes. This enables us to derive scaling…
We continue to study the squared Frobenius norm of a submatrix of a $n \times n$ random unitary matrix. When the choice of the submatrix is deterministic and its size is $[ns] \times [nt]$, we proved in a previous paper that, after…
The Brownian tree, also known as the continuum random tree, is a canonical random compact, geodesic $\mathbf R$-tree that arises as the universal scaling limit for numerous models of discrete random trees. A key quasisymmetric invariant of…
We present a framework to calculate the cascade size evolution for a large class of cascade models on random network ensembles in the limit of infinite network size. Our method is exact and applies to network ensembles with almost arbitrary…
The cactus of a pointed graph is a discrete tree associated with this graph. Similarly, with every pointed geodesic metric space $E$, one can associate an $\R$-tree called the continuous cactus of $E$. We prove under general assumptions…
Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its…
We introduce a biologically natural, mathematically tractable model of random phylogenetic network to describe evolution in the presence of hybridization. One of the features of this model is that the hybridization rate of the lineages…
Analogues of stepping--stone models are considered where the site--space is continuous, the migration process is a general Markov process, and the type--space is infinite. Such processes were defined in previous work of the second author by…
We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…
Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply.…
Drmota and Gittenberger (1997) proved a conjecture due to Aldous (1991) on the height profile of a Galton-Watson tree with an offspring distribution of finite variance, conditioned on a total size of $n$ individuals. The conjecture states…
In this paper, we introduce an extension of a Brownian bridge with a random length by including uncertainty also in the pinning level of the bridge. The main result of this work is that unlike for deterministic pinning point, the bridge…
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…
The Aldous diffusion is a conjectured Markov process on the space of real trees that is the continuum analogue of discrete Markov chains on binary trees. We construct this conjectured process via a consistent system of stationary evolutions…
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…