Related papers: The external lengths in Kingman's coalescent

In \cite{[K]}, Kaimanovich defined an augmented rooted tree $(X, E)$ corresponding to the Sierpinski gasket $K$, and showed that the Martin boundary of the simple random walk $\{Z_n\}$ on it is homeomorphic to $K$. It is of interest to…

Consider a Markov process \omega_t at equilibrium and some event C (a subset of the state-space of the process). A natural measure of correlations in the process is the pairwise correlation \Pr[\omega_0,\omega_t \in C] - \Pr[\omega_0 \in…

A Markov chain $X^i$ on a finite state space $S$ has transition matrix $P$ and initial state $i$. We may run the chains $(X^i: i\in S)$ in parallel, while insisting that any two such chains coalesce whenever they are simultaneously at the…

We consider the long-time behaviour of a branching random walk in random environment on the lattice $\Z^d$. The migration of particles proceeds according to simple random walk in continuous time, while the medium is given as a random…

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…

This paper derives the asymptotic distribution of the normalized $k$-th maximum order statistics of a sequence of non-central chi-square random variables with non-identical non-centrality parameter. We demonstrate the utility of these…

For $n\ge 1$, let $T_n$ be a random recursive tree on the vertex set $[n]=\{1,\ldots,n\}$. Let $\mathrm{deg}_{T_n}(v)$ be the degree of vertex $v$ in $T_n$, that is, the number of children of $v$ in $T_n$. Devroye and Lu showed that the…

By using a probabilistic technique based on the exponential change of measure we find a precise tail asymptotic behavior of some perpetuities with distributions close to the Dickman distribution.

Let $\ell_m$ be a sequence of $m$ points on a line with consecutive points of distance one. For every natural number $n$, we prove the existence of a red/blue-coloring of $\mathbb{E}^n$ containing no red copy of $\ell_2$ and no blue copy of…

We show that for any positive integer $r$ there exists an integer $k$ and a $k$-colouring of the edges of $K_{2^{k}+1}$ with no monochromatic odd cycle of length less than $r$. This makes progress on a problem of Erd\H{o}s and Graham and…

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

We consider random walks with continuous and symmetric step distributions. We prove universal asymptotics for the average proportion of the age of the kth longest lasting record for k=1,2,... and for the probability that the record of the…

We investigate the mixing properties of a finite Markov chain in random environment defined as a mixture of a deterministic chain and a chain whose state space has been permuted uniformly at random. This work is the counterpart of a…

In the present paper, we consider a class of Markov processes on the discrete circle which has been introduced by K\"onig, O'Connell and Roch. These processes describe movements of exchangeable interacting particles and are discrete…

We prove that for any fixed $k$, the probability that a random vertex of a random increasing plane tree is of rank $k$, that is, the probability that a random vertex is at distance $k$ from the leaves, converges to a constant $c_k$ as the…

Let $X_1,X_2,...$ be a sequence of random variables satisfying the distributional recursion $X_1=0$ and $X_n= X_{n-I_n}+1$ for $n=2,3,...$, where $I_n$ is a random variable with values in $\{1,...,n-1\}$ which is independent of…

We discuss the probability of random knotting for a model of self-avoiding polygons whose segments are given by cylinders of unit length with radius $r$. We show numerically that the characteristic length of random knotting is roughly…

Let $(G,\mu)$ be a uniformly elliptic random conductance graph on $\mathbb{Z}^d$ with a Poisson point process of particles at time $t=0$ that perform independent simple random walks. We show that inside a cube $Q_K$ of side length $K$, if…

The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case…

This paper gives a new flavor of what Peter Jagers and his co-authors call `the path to extinction'. In a neutral population with constant size $N$, we assume that each individual at time $0$ carries a distinct type, or allele. We consider…