相关论文: On the asymptotic internal path length and the asy…

We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…

In this paper, we study a class of random walks that build their own tree. At each step, the walker attaches a random number of leaves to its current position. The model can be seen as a subclass of the Random Walk in Changing Environments…

Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the…

The Steiner distance of vertices in a set $S$ is the minimum size of a connected subgraph that contain these vertices. The sum of the Steiner distances over all sets $S$ of cardinality $k$ is called the Steiner $k$-Wiener index and studied…

We present a Darboux-Wiener type lemma and apply it to obtain an exact asymptotic for the variance of the self-intersection of one and two-dimensional random walks. As a corollary, we obtain a central limit theorem for random walk in random…

There is a long history of establishing central limit theorems for Markov chains. Quantitative bounds for chains with a spectral gap were proved by Mann and refined later. Recently, rates of convergence for the total variation distance were…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of…

By decomposing the random walk path, we construct a multitype branching process with immigration in random environment for corresponding random walk with bounded jumps in random environment. Then we give two applications of the branching…

Consider a finite irreducible Markov chain with invariant distribution $\pi$. We use the inner product induced by $\pi$ and the associated heat operator to simplify and generalize some results related to graph partitioning and the small-set…

Inspired by Stufler's recent probabilistic proof of Otter's asymptotic number of unlabeled trees, we revisit work of Palmer and Schwenk, and study unlabeled forests from a probabilistic point of view. We show that the number of trees in a…

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…

The eccentricity of a vertex $u$ in a connected graph $G$ is the distance between $u$ and a vertex farthest from it; the eccentric sequence of $G$ is the nondecreasing sequence of the eccentricities of $G$. In this paper, we determine the…

In this article, we consider limit theorems for some weighted type random sums (or discrete rough integrals). We introduce a general transfer principle from limit theorems for unweighted sums to limit theorems for weighted sums via rough…

The Wiener index of a network, introduced by the chemist Harry Wiener, is the sum of distances between all pairs of nodes in the network. This index, originally used in chemical graph representations of the non-hydrogen atoms of a molecule,…

As known, the commonly-utilized ways to determine mean first-passage time $\overline{\mathcal{F}}$ for random walk on networks are mainly based on Laplacian spectra. However, methods of this type can become prohibitively complicated and…

We study tree-indexed random walks as introduced by Benjamini, H\"aggstr\"om, and Mossel, i.e. labelings of a tree for which adjacent vertices have labels differing by 1. It is a conjecture of those authors that the distribution of the…

We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…

We study the number of random records in an arbitrary split tree (or equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for convergence of sums of triangular arrays to…

Splitting trees are those random trees where individuals give birth at constant rate during a lifetime with general distribution, to i.i.d. copies of themselves. The width process of a splitting tree is then a binary, homogeneous…