Related papers: On the asymptotics of drift

We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…

We develop entropy and variance results for the product of independent identically distributed random variables on Lie groups. Our results apply to the study of stationary measures in various contexts.

Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…

We study biased variable-speed random walks in dynamical random conductances. Assuming that the conductances are upper-bounded, we prove that the walk has strictly positive speed for every bias $\lambda>0$. We then give an explicit…

We consider reflecting random walks on the nonnegative integers with drift of order 1/x at height x. We establish explicit asymptotics for various probabilities associated to such walks, including the distribution of the hitting time of 0…

Let $Y=\sum_{k\ge 1} 1_{A_k}$ be an infinite sum of the indicators of independent events. We investigate a precise (as opposed to logarithmic) first-order asymptotic behavior of the tail probabilities $\mathbb{P}\{Y\ge n\}$ and the point…

For any pseudo-Anosov diffeomorphism on a closed orientable surface $S$ of genus greater than one, it is known by the work of Bers and Thurston that the topological entropy agrees with the translation distance on the Teichm\"uller space…

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.

We prove that supercritical branching random walk on a transient graph converges almost surely under rescaling to a random measure on the Martin boundary of the graph. Several open problems and conjectures about this limiting measure are…

A simple symmetric random walk in the space $\mathbb{Z}^2$ is considered. The asymptotic behavior as the number of jumps tends to infinity of the probability that a fixed edge of the random walk lies in the polygon that forms the boundary…

In this paper, following earlier results in [2] we derive the asymptotic distribution as $t \to \infty$, of the excursion of Brownian motion straddling $t$, into an interval $(a,b)$, conditional on the event that there is such an excursion.

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…

An asymptotic theory is developed for a moving drop driven by a wettability gradient. We distinguish the mesoscale where an exact solution is known for the properly simplified problem. This solution is matched at both -- the advancing and…

The entropy of the random walk on the discrete contable group could be used for comparison of the system of the generators. Fundamental inequality between growth, entropy and escape gives the possibility to define "the best" system of the…

We establish sharp asymptotic bounds for the critical intensity of the Finitary Random Interlacements (FRI) model in four and higher dimensions with general trajectory length distributions. Our proof reveals that the construction of…

In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…

Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…

We prove an upper bound for the asymptotics of counting functions of number fields with nilpotent Galois groups.

In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting…

It is proven that if a finitely presented group is one ended it has asymptotic dimension bigger than one. It follows that finitely presented groups with asdim 1 are virtually free. A counterexample is given for the finitely generated case.