English
Related papers

Related papers: Optimal bounds for self-intersection local times

200 papers

Local time of a stochastic process quantifies the amount of time that sample trajectories $x(\tau)$ spend in the vicinity of an arbitrary point $x$. For a generic Hamiltonian, we employ the phase-space path-integral representation of random…

Mathematical Physics · Physics 2017-05-31 Vaclav Zatloukal

We consider elliptic random walks in i.i.d. random environments on $\mathbb{Z}^d$. The main goal of this paper is to study under which ellipticity conditions local trapping occurs. Our main result is to exhibit an ellipticity criterion for…

Probability · Mathematics 2015-06-30 Alexander Fribergh , Daniel Kious

Recently, many streaming algorithms have utilized generalizations of the fact that the expected maximum distance of any $4$-wise independent random walk on a line over $n$ steps is $O(\sqrt{n})$. In this paper, we show that $4$-wise…

Probability · Mathematics 2020-09-04 Shyam Narayanan

We consider a real random walk S_n = X_1 + ... + X_n attracted (without centering) to the normal law: this means that for a suitable norming sequence a_n we have the weak convergence S_n / a_n --> f(x) dx, where f(x) is the standard normal…

Probability · Mathematics 2007-05-23 Francesco Caravenna

We consider a Random Walk in Random Environment (RWRE) moving in an i.i.d.\ random field of obstacles. When the particle hits an obstacle, it disappears with a positive probability. We obtain quenched and annealed bounds on the tails of the…

Probability · Mathematics 2012-01-31 Nina Gantert , Serguei Popov , Marina Vachkovskaia

We consider the thick points of random walk, i.e. points where the local time is a fraction of the maximum. In two dimensions, we answer a question of Dembo, Peres, Rosen and Zeitouni and compute the number of thick points of planar random…

Probability · Mathematics 2020-03-02 Antoine Jego

We prove that the local time process of a planar simple random walk, when time is scaled logarithmically, converges to a non-degenerate pure jump process. The convergence takes place in the Skorokhod space with respect to the $M1$ topology…

Probability · Mathematics 2016-03-25 Péter Nándori , Zeyu Shen

We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…

Probability · Mathematics 2007-12-06 Nobuo Yoshida

For a symmetric random walk in $Z^2$ which does not necessarily have bounded jumps we study those points which are visited an unusually large number of times. We prove the analogue of the Erd\H{o}s-Taylor conjecture and obtain the…

Probability · Mathematics 2007-05-23 Richard F. Bass , Jay Rosen

Consider a continuous time random walk in $\mathbb{Z}$ with independent and exponentially distributed jumps $\pm1$. The model in this paper consists in an infinite number of such random walks starting from the complement of…

Mathematical Physics · Physics 2013-07-25 Mark Adler , Patrik L. Ferrari , Pierre van Moerbeke

In this paper, we obtain a local limit theorem for the Kemperman's model of oscillating random walk on $\mathbb{Z}$; it extends the existing results for classical random walks on $\mathbb Z$ or reflected random walks on $\mathbb N_0$. The…

Probability · Mathematics 2025-09-22 M. Peigné , C. Pham , T. D. Vo

We study the maximal displacement of branching random walks in a class of time inhomogeneous environments. Specifically, binary branching random walks with Gaussian increments will be considered, where the variances of the increments change…

Probability · Mathematics 2011-12-07 Ofer Zeitouni , Ming Fang

On the trace of a discrete-time simple random walk on $\mathbb{Z}^d$ for $d\geq 2$, we consider the evolution of favorite sites, i.e., sites that achieve the maximal local time at a certain time. For $d=2$, we show that almost surely three…

Probability · Mathematics 2025-11-13 Chenxu Hao , Xinyi Li , Izumi Okada , Yushu Zheng

We study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $\varepsilon>0$, there exists a constant $C$ such that the cover time of an $(n,d,\lambda)$-graph $G$ with $d/\lambda\ge C$ is…

Combinatorics · Mathematics 2026-02-12 Yaobin Chen , Yiting Wang

Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…

Probability · Mathematics 2007-05-23 Yuval Peres , David Revelle

We consider random walks in Dirichlet environment (RWDE) on $\Z ^d$, for $ d \geq 3 $, in the sub-ballistic case. We associate to any parameter $ (\alpha_1, ..., \alpha_{2d}) $ of the Dirichlet law a time-change to accelerate the walk. We…

Probability · Mathematics 2012-05-28 Élodie Bouchet

Coalescing-branching random walks, or {\em cobra walks} for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spread of information in networks. In a $k$-cobra walk, at each…

Data Structures and Algorithms · Computer Science 2016-03-22 Michael Mitzenmacher , Rajmohan Rajaraman , Scott Roche

Let $X$ and $Y$ be two independent random walks on $\Z^2$ with zero mean and finite variances, and let $L_t(X,Y)$ be the local time of $X-Y$ at the origin at time $t$. We show that almost surely with respect to $Y$, $L_t(X,Y)/\log t$…

Probability · Mathematics 2008-06-10 Jürgen Gärtner , Rongfeng Sun

In this work, we study the large deviation properties of random walk in a random environment on $\mathbb{Z}^d$ with $d\geq1$. We start with the quenched case, take the point of view of the particle, and prove the large deviation principle…

Probability · Mathematics 2008-09-09 Atilla Yilmaz

We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups $S_n$ and $A_n$. We consider the following models: random transposition, transpose top with…

Probability · Mathematics 2008-09-04 L. Saloff-Coste , J. Zuniga