相关论文: An introduction to the trapping experienced by bia…
In this note, we try to analyze and clarify the intriguing interplay between some counting problems related to specific thermalized weighted graphs and random walks consistent with such graphs.
These are lecture notes from my talks at the "Current Developments in Mathematics" conference (Harvard, 2006). They cover a variety of topics involving symplectic cohomology. In particular, a discussion of (algorithmic) classification…
Correction to "Limit theorems for coupled continuous time random walks" (Ann. Probab. 32 (2004) 730-756).
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
We study a biased random walk on the interlacement set of $\mathbb{Z}^d$ for $d\geq 3$. Although the walk is always transient, we can show, in the case $d=3$, that for any value of the bias the walk has a zero limiting speed and actually…
In this paper we study some properties of random walks perturbed at extrema, which are generalizations of the walks considered e.g., in Davis (1999). This process can also be viewed as a version of {\em excited random walk}, studied…
Random walks find extensive application across various complex network domains, including embedding generation and link prediction. Despite the widespread utilization of random walks, the precise impact of distinct biases on embedding…
This thesis is devoted to the study of extreme value statistics in stochastic processes and their applications. In the first part, we obtain exact analytical results on the extreme value statistics of both discrete-time and continuous-time…
This paper is a collection of recent results on discrete-time and continuous-time branching random walks. Some results are new and others are known. Many aspects of this theory are considered: local, global and strong local survival, the…
This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.
We prove CLTs for biased randomly trapped random walks in one dimension. In particular, we will establish an annealed invariance principal by considering a sequence of regeneration times under the assumption that the trapping times have…
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
In this paper we consider the one-dimensional, biased, randomly trapped random walk when the trapping times have infinite variance. We prove sufficient conditions for the suitably scaled walk to converge to a transformation of a stable…
We give an expression of the speed of the biased random walk on a Galton--Watson tree. In the particular case of the simple random walk, we recover the result of Lyons, Pemantle and Peres \cite{LyPePe95}. The proof uses a description of the…
We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…
We consider a random walker whose motion is tethered around a focal point. We use two models that exhibit the same spatial dependence in the steady state but widely different dynamics. In one case, the walker is subject to a deterministic…
The probability distribution p(l) of an atom to return to a step at distance l from the detachment site, with a random walk in between, is exactly enumerated. In particular, we study the dependence of p(l) on step roughness, presence of…
In the first part of the article our subject of interest is a simple symmetric random walk on the integers which faces a random risk to be killed. This risk is described by random potentials, which in turn are defined by a sequence of…