Related papers: The Aldous chain on cladograms in the diffusion li…
We introduce a simple tree growth process that gives rise to a new two-parameter family of discrete fragmentation trees that extends Ford's alpha model to multifurcating trees and includes the trees obtained by uniform sampling from…
The process by which one may take a discrete model of a biophysical process and construct a continuous model based on it is of mathematical interest as well as being of practical use. In this paper, we first study the singular limit of a…
We provide a new geometric representation of a family of fragmentation processes by nested laminations, which are compact subsets of the unit disk made of noncrossing chords. We specifically consider a fragmentation obtained by cutting a…
This paper is a survey of various proofs of the so called {\em fundamental theorem of Markov chains}: every ergodic Markov chain has a unique positive stationary distribution and the chain attains this distribution in the limit independent…
A multi-type branching process is defined as a random tree with labeled vertices, where each vertex produces offspring independently according to the same multivariate probability distribution. We demonstrate that in realizations of the…
We consider the symmetric inclusion process on a general finite graph. Our main result establishes universal upper and lower bounds for the spectral gap of this interacting particle system in terms of the spectral gap of the random walk on…
In this letter, we address the relationship between the statistical fluctuations of grain displacements for a full quasistatic plane shear experiment, and the corresponding anomalous diffusion exponent, $\alpha$. We experimentally validate…
We consider point particle that collides with a periodic array of hard-core elastic scatterers where the length of the free flights is unbounded (the infinite-horizon Lorentz gas, LG). The Bleher central limit theorem (CLT) states that the…
Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…
We first study crossing statistics in random connection models (RCM) built on marked Poisson point processes on $\mathbb R^d$. Under general assumptions, we show exponential tail bounds for the number of crossings of a box contained in the…
This paper investigates random walks and diffusion limits on a broad class of fractal graphs generated by Edge Iterated Graph Systems (EIGS). We prove that the rescaled simple random walks converge in the…
The problem of efficiently sampling from a set of (undirected, or directed) graphs with a given degree sequence has many applications. One approach to this problem uses a simple Markov chain, which we call the switch chain, to perform the…
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…
We study the continuum limit in 2+1 dimensions of nanoscale anisotropic diffusion processes on crystal surfaces relaxing to become flat below roughening. Our main result is a continuum law for the surface flux in terms of a new…
A semi-martingale reflecting Brownian motion is a popular process for diffusion approximations of queueing models including their networks. In this paper, we are concerned with the case that it lives on the nonnegative half-line, but the…
We study invasion percolation on Aldous' Poisson-weighted infinite tree, and derive two distinct Markovian representations of the resulting process. One of these is the $\sigma\to\infty$ limit of a representation discovered by Angel et al.…
We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…
I present a first-principles theory of diffusion-limited aggregation in two dimensions. A renormalized mean-field approximation gives the form of the unstable manifold for branch competition, following the method of Halsey and Leibig [Phys.…
Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We provide a central limit theorem for general additive…
We consider bootstrap percolation and diffusion in sparse random graphs with fixed degrees, constructed by configuration model. Every node has two states: it is either active or inactive. We assume that to each node is assigned a…