English
Related papers

Related papers: Maximal local time of a d-dimensional simple rando…

200 papers

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…

In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…

Signal Processing · Electrical Eng. & Systems 2026-05-18 Karl-Ludwig Besser

We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.

Quantum Physics · Physics 2010-05-12 Norio Konno

We consider a one-dimensional diffusion process $X$ in a $(-\kappa/2)$-drifted Brownian potential for $\kappa\neq 0$. We are interested in the maximum of its local time, and study its almost sure asymptotic behaviour, which is proved to be…

Probability · Mathematics 2015-11-19 Alexis Devulder

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

In this work, we discuss certain ballistic random walks in random environments on $\mathbb{Z}^d$, and prove the equivalence between the static and dynamic points of view in dimension $d\geq4$. Using this equivalence, we also prove a version…

Probability · Mathematics 2016-09-05 Noam Berger , Moran Cohen , Ron Rosenthal

Our paper gives bounds for the rate of convergence for a class of random walks on the d-dimensional torus generated by a set of n vectors in R^d/Z^d. We give bounds on the discrepancy distance from Haar measure; our lower bound holds for…

Probability · Mathematics 2007-05-23 Timothy Prescott , Francis Edward Su

The aim of this paper is to represent any continuous local martingale as an almost sure limit of a nested sequence of simple, symmetric random walks, time changed by a discrete quadratic variation process. One basis of this is a similar…

Probability · Mathematics 2010-08-10 Balazs Szekely , Tamas Szabados

We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…

Statistical Mechanics · Physics 2009-11-11 Tonguc Rador

We apply the supersymmetric procedure to one-step random walks in one dimension at the level of the usual master equation, extending a study initiated by H.R. Jauslin [Phys. Rev. A {\bf 41}, 3407 (1990)]. A discussion of the supersymmetric…

High Energy Physics - Theory · Physics 2009-10-28 Haret C. Rosu , Marco Reyes

Given $d\geq2$, we construct a Zariski-dense random walk on the space of lattices SL$_d(\mathbb{R})/$SL$_d(\mathbb{Z})$ that exhibits escape of mass. This negates the suggestion of recurrence made by Benoist [Ben14] (ICM 2014) and by…

Probability · Mathematics 2025-04-16 Axel Péneau , Cagri Sert

The run-and-tumble walk, consisting in randomly reoriented ballistic excursions, models phenomena ranging from gas kinetics to bacteria motility. We evaluate the mean time required for this walk to find a fixed target within a 2D or 3D…

Statistical Mechanics · Physics 2016-07-18 Jean-Francois Rupprecht , Olivier Bénichou , Raphael Voituriez

Consider a class of null-recurrent randomly biased walks on a super-critical Gaton-Watson tree. We obtain the rates of convergence of the local times and the quenched local probability for the biased walk in the sub-diffusive case. These…

Probability · Mathematics 2019-01-03 Yueyun Hu

We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…

Probability · Mathematics 2023-03-31 Amine Asselah , Bruno Schapira , Perla Sousi

Let $(X_t,t\geq0)$ be a continuous time simple random walk on $\mathbb{Z}^d$ ($d\geq3$), and let $l_T(x)$ be the time spent by $(X_t,t\geq0)$ on the site $x$ up to time $T$. We prove a large deviations principle for the $q$-fold…

Probability · Mathematics 2010-10-05 Fabienne Castell

We investigate the local times of a continuous-time Markov chain on an arbitrary discrete state space. For fixed finite range of the Markov chain, we derive an explicit formula for the joint density of all local times on the range, at any…

Probability · Mathematics 2009-09-29 David Brydges , Remco van der Hofstad , Wolfgang König

We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Time to cover all nodes and number of returns to original states are analyzed in resulting model.

Probability · Mathematics 2023-03-02 Yunus Emre Demirci , Ümit Işlak , Mehmet Akif Yıldız

We survey recent results of normal and anomalous diffusion of two types of random motions with long memory in ${\Bbb R}^d$ or ${\Bbb Z}^d$. The first class consists of random walks on ${\Bbb Z}^d$ in divergence-free random drift field,…

Probability · Mathematics 2019-01-01 Bálint Tóth

We show a remarkable similarity between strategies to realize a large intersection or self-intersection local times in dimension five or more. This leads to the same rate functional for large deviation principles for the two objects…

Probability · Mathematics 2008-01-28 Amine Asselah

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