Related papers: On large intersection and self-intersection local …
Consider a one-dimensional shift-invariant attractive spin-flip system in equilibrium, constituting a dynamic random environment, together with a nearest-neighbor random walk that on occupied sites has a local drift to the right but on…
We prove a law of large numbers for a class of multidimensional random walks in random environments where the environment satisfies appropriate mixing conditions, which hold when the environment is a weak mixing field in the sense of…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
We study downward deviations of the maximum local time of the discrete-time simple random walk on $\mathbb{Z}^d$, $d\ge 3$. In our previous paper \cite{li2026ldmaxlocal}, the corresponding upper bound was established, while the matching…
Temporal graphs are commonly used to represent time-resolved relations between entities in many natural and artificial systems. Many techniques were devised to investigate the evolution of temporal graphs by comparing their state at…
Behind the nice unification provided by the notion of the level 2.5 in the field of large deviations for time-averages over a long Markov trajectory, there are nevertheless very important qualitative differences between the meaning of the…
We introduce a model of self-repelling random walks where the short-range interaction between two elements of the chain decreases as a power of the difference in proper time. Analytic results on the exponent $\nu$ are obtained. They are in…
We study the multifractal analysis of self-similar measures arising from random homogeneous iterated function systems. Under the assumption of the uniform strong separation condition, we see that this analysis parallels that of the…
A global picture of a random particle movement is given by the convex hull of the visited points. We obtained numerically the probability distributions of the volume and surface of the convex hulls of a selection of three types of…
We consider $p$ independent Brownian motions in $\R^d$. We assume that $p\geq 2$ and $p(d-2)<d$. Let $\ell_t$ denote the intersection measure of the $p$ paths by time $t$, i.e., the random measure on $\R^d$ that assigns to any measurable…
In this article we study the distribution of the number of points of a simple random walk, visited a given number of times (the k-multiple point range). In a previous article we had developed a graph theoretical approach which is now…
In this paper, we study a transient spatially inhomogeneous random walk with asymptotically zero drifts on the lattice of the positive half line. We give criteria for the finiteness of the number of points having exactly the same local time…
We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…
We establish conditions on sequences of graphs which ensure that the mixing times of the random walks on the graphs in the sequence converge. The main assumption is that the graphs, associated measures and heat kernels converge in a…
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…
We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…
Expected urban population doubling calls for a compelling theory of the city. Random walks and diffusions defined on spatial city graphs spot hidden areas of geographical isolation in the urban landscape going downhill. First--passage time…
In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…
We study the full distribution $P_M(S)$ of the number of distinct sites $S$ visited by a random walker on a $d$-dimensional lattice after $M$ steps. We focus on the case $d \ge 2$, and we are interested in the long-time limit $M \gg 1$. Our…
We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…