Related papers: Continuum random tree as the scaling limit for a d…

We investigate a quadratic dynamical system known as nonlinear recombinations. This system models the evolution of a probability measure over the Boolean cube, converging to the stationary state obtained as the product of the initial…

We generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit…

We propose a general class of co-evolving tree network models driven by local exploration where new vertices attach to the current network via randomly sampling a vertex and then exploring the graph for a random number of steps in the…

We study various models of random non-crossing configurations consisting of diagonals of convex polygons, and focus in particular on uniform dissections and non-crossing trees. For both these models, we prove convergence in distribution…

In this work, a growing network model that can generate a random network with finite degree in infinite time is studied. The dynamics are governed by a rule where the degree increases under a scheme similar to the Malthus-Verhulst model in…

The Aldous--Broder algorithm provides a way of sampling a uniformly random spanning tree for finite connected graphs using simple random walk. Namely, start a simple random walk on a connected graph and stop at the cover time. The tree…

This paper presents an asynchronous distributed algorithm to manage multiple trees for peer-to-peer streaming in a flow level model. It is assumed that videos are cut into substreams, with or without source coding, to be distributed to all…

Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\'{o}lya trees: a uniform random P\'{o}lya tree of size $n$ consists of a conditioned critical…

Power grids are undergoing major changes from a few large producers to smart grids build upon renewable energies. Mathematical models for power grid dynamics have to be adapted to capture, when dynamic nodes can achieve synchronization to a…

We investigate structural transitions in adaptive networks where node states remain fixed and only the connections evolve via state-dependent rewiring. Using a general framework characterized by probabilistic rules for disconnection and…

We introduce multi-type Markov Branching trees, which are simple random population tree models where individuals are characterized by their size and type and give rise to (size,type)-children in a Galton-Watson fashion, with the rule that…

Given a sequence of resistance forms that converges with respect to the Gromov-Hausdorff-vague topology and satisfies a uniform volume doubling condition, we show the convergence of corresponding Brownian motions and local times. As a…

It is well-known that the height profile of a critical conditioned Galton-Watson tree with finite offspring variance converges, after a suitable normalization, to the local time of a standard Brownian excursion. In this work, we study the…

We consider a distributed detection system with communication constraints, where several nodes are arranged in an arbitrary tree topology, under the assumption of conditionally independent observations. We propose a cyclic design procedure…

Let $U$ be a Haar distributed matrix in $\mathbb U(n)$ or $\mathbb O (n)$. In a previous paper, we proved that after centering, the two-parameter process \[T^{(n)} (s,t) = \sum_{i \leq \lfloor ns \rfloor, j \leq \lfloor nt\rfloor}…

We obtain the Brownian net of Sun and Swart (2008) as the scaling limit of the paths traced out by a system of continuous (one-dimensional) space and time branching and coalescing random walks. This demonstrates a certain universality of…

Upon almost-every realisation of the Brownian continuum random tree (CRT), it is possible to define a canonical diffusion process or `Brownian motion'. The main result of this article establishes that the cover time of the Brownian motion…

In a deterministic or random tree, a notion of ancestral diversity can be defined as follows. Sample independently $n$ groups of $k$ leaves and count the number $N_n(k)$ of distinct most recent common ancestors of each of the groups. As $n$…

We study the random simple connected cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices. We show that the Brownian map arises as Gromov--Hausdorff--Prokhorov scaling limit of $\mathsf{C}_n$ as $n \in 2 \ndN$ tends to…

We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…