Related papers: Dependence and phase changes in random $m$-ary sea…
By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…
The Colijn--Plazzotta ranking is a bijective encoding of the unlabeled binary rooted trees with positive integers. We show that the rank $f(t)$ of a tree $t$ is closely related to its height $h$, the length of the longest path from a leaf…
The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…
In this paper we study the number of returns to the coordinate hyperplanes for multidimensional nearest-neighbour random walks. While one-dimensional results on returns are classical, much less is known in higher dimensions. We analyse the…
In the context of a random walk on an undirected graph, Kemeny's constant can measure the average travel time for a random walk between two randomly chosen vertices. We are interested in graphs that behave counter-intuitively in regard to…
Consider a tree network $T$, where each edge acts as an independent copy of a given channel $M$, and information is propagated from the root. For which $T$ and $M$ does the configuration obtained at level $n$ of $T$ typically contain…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…
We study asymptotic properties of diffusion and other transport processes (including self-avoiding walks and electrical conduction) on large randomly branched polymers using renormalized dynamical field theory. We focus on the swollen phase…
We study the asymptotic behavior of four statistics associated with subtrees of complete graphs: the uniform probability $p_n$ that a random subtree is a spanning tree of $K_n$, the weighted probability $q_n$ (where the probability a…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
In this paper we consider a random walk in random environment on a tree and focus on the boundary case for the underlying branching potential. We study the range $R\_n$ of this walk up to time $n$ and obtain its correct asymptotic in…
We examine the normal approximation of the modified likelihood root, an inferential tool from higher-order asymptotic theory, for the linear exponential and location-scale family. We show that the $r^\star$ statistic can be thought of as a…
In this paper we investigate the asymptotic optimality property of a randomized sampling based motion planner, namely RRT. We prove that a RRT planner is not an asymptotically optimal motion planner. Our result, while being consistent with…
We provide information about the asymptotic regimes for a homogeneous fragmentation of a finite set. We establish a phase transition for the asymptotic behaviours of the shattering times, defined as the first instants when all the blocks of…
We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…
This article introduces a flexible and adaptive nonparametric method for estimating the association between multiple covariates and power spectra of multiple time series. The proposed approach uses a Bayesian sum of trees model to capture…
We introduce a generalisation of Sch\"{u}tz and Trimper's elephant random walk to finitely generated groups. We focus on the simplest non-abelian setting, i.e. groups whose Cayley graphs are homogeneous trees of degree $d \ge 3$. We show…
The paper studies asymptotic behavior of the loss probability for the $GI/M/m/n$ queueing system as $n$ increases to infinity. The approach of the paper is based on applications of classic results of Tak\'acs (1967) and the Tauberian…
We consider the continuous time version of the Random Walk Pinning Model (RWPM), studied in [5,6,7]. Given a fixed realization of a random walk Y$ on Z^d with jump rate rho (that plays the role of the random medium), we modify the law of a…
We study the leaf-to-leaf distances on full and complete m-ary graphs using a recursive approach. In our formulation, leaves are ordered along a line. We find explicit analytical formulae for the sum of all paths for arbitrary leaf-to-leaf…