Related papers: Dependence and phase changes in random $m$-ary sea…
We investigate statistics of lead changes of the maxima of two discrete-time random walks in one dimension. We show that the average number of lead changes grows as $\pi^{-1}\ln(t)$ in the long-time limit. We present theoretical and…
We analyze the differences between the horizontal and the vertical component of the simple random walk on the 2-dimensional comb. In particular we evaluate by combinatorial methods the asymptotic behaviour of the expected value of the…
Let $d \geq 3$ be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random $d$-regular graph with $n$ vertices. (The asymptotics are as $n\to\infty$, restricted to even $n$ if $d$ is…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…
We derive tractable criteria for the consistency of Bayesian tree reconstruction procedures, which constitute a central class of algorithms for inferring common ancestry among DNA sequence samples in phylogenetics. Our results encompass…
Returning to one of the original generalizations of the AKLT state, we extend prior analysis on the Bethe lattice (or Cayley tree) to a variant with a series of $n$ spin-1 decorations placed on each edge. The recurrence relations derived…
Cross-country soaring flights rely on intermittent atmospheric updrafts to cover long distances, producing trajectories that alternate between rapid relocation and local exploration. From a large dataset of paraglider, hang glider, and…
Kinetically grown self-avoiding walks on various types of generalized random networks have been studied. Networks with short- and long-tailed degree distributions $P(k)$ were considered ($k$, degree or connectivity), including scale-free…
We are interested in the random walk in random environment on an infinite tree. Lyons and Pemantle [11] give a precise recurrence/transience criterion. Our paper focuses on the almost sure asymptotic behaviours of a recurrent random walk…
In this paper we study the asymptotic behavior of the (skew) Macdonald and Jack symmetric polynomials as the number of variables grows to infinity. We characterize their limits in terms of certain variational problems. As an intermediate…
In this article, we study linearly edge-reinforced random walk on general multi-level ladders for large initial edge weights. For infinite ladders, we show that the process can be represented as a random walk in a random environment, given…
S{\o}gaard (2020) obtained results suggesting the fraction of trees occurring in the test data isomorphic to trees in the training set accounts for a non-trivial variation in parser performance. Similar to other statistical analyses in NLP,…
In this paper, we present asymptotic analysis of self-adjusting contraction trees for incremental sliding window analytics.
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…
We consider the model of random trees introduced by Devroye [SIAM J. Comput. 28 (1999) 409-432]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We develop a technique that provides a lower bound on the speed of transient random walk in a random environment on regular trees. A refinement of this technique yields upper bounds on the first regeneration level and regeneration time. In…
The degree-degree correlation is crucial in understanding the structural properties of and dynamics occurring upon network, and is often measured by the assortativity coefficient $r$. In this paper, we first study this measure in detail and…
We study an unbiased, discrete time random walk on the nonnegative integers, with the origin absorbing. The process has a history-dependent step length: the walker takes steps of length v while in a region which has been visited before, and…
We present computer simulations of three systems of randomly branching polymers in d=3 dimensions: ideal trees and self-avoiding trees with annealed and quenched connectivities. In all cases, we performed a detailed analysis of trees…