English
Related papers

Related papers: Maximum and minimum of local times for two-dimensi…

200 papers

We give explictly the probability density of the local time of the Brox diffusion at first passage times. Such formula is used to find the moments and to related the minima and maxima of the environment to the most and least visted points…

Probability · Mathematics 2019-09-16 Jonathan Gutierrez-Pavón , Carlos G. Pacheco

We consider a random walk in random environment with random holding times, that is, the random walk jumping to one of its nearest neighbors with some transition probability after a random holding time. Both the transition probabilities and…

Probability · Mathematics 2014-12-30 Ryoki Fukushima , Naoki Kubota

We consider the scaling behavior of the range and $p$-multiple range, that is the number of points visited and the number of points visited exactly $p\geq 1$ times, of simple random walk on ${\mathbb Z}^d$, for dimensions $d\geq 2$, up to…

Probability · Mathematics 2020-03-25 Thomas Doehrman , Sunder Sethuraman , Shankar C. Venkataramani

We consider Sinai's random walk in random environment. We prove that the logarithm of the local time is a good estimator of the random potential associated to the random environment. We give a constructive method allowing us to built the…

Probability · Mathematics 2007-09-04 Pierre Andreoletti

We consider the continuous time version of the `true' or `myopic' self-avoiding random walk with site repulsion in 1d. The Ray-Knight-type method which was applied to the discrete time and edge repulsion case, is applicable to this model…

Probability · Mathematics 2019-05-20 Balint Toth , Balint Veto

For a zero-delayed random walk on the real line, let $\tau(x)$, $N(x)$ and $\rho(x)$ denote the first passage time into the interval $(x,\infty)$, the number of visits to the interval $(-\infty,x]$ and the last exit time from $(-\infty,x]$,…

Probability · Mathematics 2011-12-12 Alexander Iksanov , Matthias Meiners

This note is devoted to the study of the maximum of the excursion of a random walk with negative drift and light-tailed increments. More precisely, we determine the local asymptotics of the joint distribution of the length, maximum and the…

Probability · Mathematics 2019-07-08 Elena Perfilev , Vitali Wachtel

We consider the maximum of the discrete two dimensional Gaussian free field (GFF) in a box, and prove that its maximum, centered at its mean, is tight, settling a long-standing conjecture. The proof combines a recent observation of…

Probability · Mathematics 2010-09-20 Maury Bramson , Ofer Zeitouni

We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.

Probability · Mathematics 2008-12-17 Endre Csáki , Antónia Földes , Pál Révész

We study arithmetic properties of short uniform random walks in arbitrary dimensions, with a focus on explicit (hypergeometric) evaluations of the moment functions and probability densities in the case of up to five steps. Somewhat to our…

Classical Analysis and ODEs · Mathematics 2015-08-20 Jonathan M. Borwein , Armin Straub , Christophe Vignat

We study the asymptotics for the maximum on a random time interval of a random walk with a long-tailed distribution of its increments and negative drift. We extend to a general stopping time a result by Asmussen (1998), simplify its proof,…

Probability · Mathematics 2017-11-29 Sergey Foss , Stan Zachary

We study behavior in space and time of random walks in an i.i.d. random environment on Z^d, d>=3. It is assumed that the measure governing the environment is isotropic and concentrated on environments that are small perturbations of the…

Probability · Mathematics 2013-10-29 Erich Baur

The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…

Data Structures and Algorithms · Computer Science 2010-07-20 John Alexandris , Gregory Karagiorgos 'and' Ioannis Stavrakakis

We present a quantum algorithm for efficiently sampling transformed Gaussian random fields on $d$-dimensional domains, based on an enhanced version of the classical moving average method. Pointwise transformations enforcing boundedness are…

Quantum Physics · Physics 2025-08-20 Matthias Deiml , Daniel Peterseim

We investigate the effects of markovian resseting events on continuous time random walks where the waiting times and the jump lengths are random variables distributed according to power law probability density functions. We prove the…

Statistical Mechanics · Physics 2021-02-10 Vicenç Méndez , Axel Masó-Puigdellosas , Trifce Sandev , Daniel Campos

Given any $\gamma>0$ and for $\eta=\{\eta_v\}_{v\in \mathbb Z^2}$ denoting a sample of the two-dimensional discrete Gaussian free field on $\mathbb Z^2$ pinned at the origin, we consider the random walk on~$\mathbb Z^2$ among random…

Probability · Mathematics 2020-01-28 Marek Biskup , Jian Ding , Subhajit Goswami

We consider the $d$-neighbor bootstrap percolation process on the $d$-dimensional torus, with vertex set $V=\{1,\cdots,n\}^d$ and edge set $\{xy:\sum_{i=1}^d|x_i-y_i (\text{mod} \; n)|=1\}$. We determine the percolation time up to a…

Combinatorics · Mathematics 2025-05-19 Fengxing Zhu

In this article, the continuous time random walk on the circle is studied. We derive the corresponding generalized master equation and discuss the effects of topology, especially important when Levy flights are allowed. Then, we work out…

Statistical Mechanics · Physics 2009-11-13 Ivan Calvo , B. A. Carreras , R. Sanchez , B. Ph. van Milligen

We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…

Probability · Mathematics 2007-10-12 Francis Comets , Francois Simenhaus

We consider random walk on dynamical percolation on the discrete torus $\mathbb{Z}_n^d$. In previous work, mixing times of this process for $p<p_c(\mathbb{Z}^d)$ were obtained in the annealed setting where one averages over the dynamical…

Probability · Mathematics 2017-07-25 Yuval Peres , Perla Sousi , Jeffrey E. Steif
‹ Prev 1 8 9 10 Next ›