Related papers: Poissonization-based collision threshold derivatio…
In discrete time, $\ell$-blocks of red lights are separated by $\ell$-blocks of green lights. Cars arrive at random. We seek the distribution of maximum line length of idle cars, and justify conjectured probabilistic asymptotics for $2 \leq…
By developing the entropy theory of random walks on equivalence relations and analyzing the asymptotic geometry of horospheric products we describe the Poisson boundary for random walks on random horospheric products of trees.
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…
Let $\Gamma$ be a countable discrete group, $H$ a lcsc totally disconnected group and $\rho : \Gamma \rightarrow H$ a homomorphism with dense image. We develop a general and explicit technique which provides, for every compact open subgroup…
We identify a relationship between a certain family of random walks on Euclidean lattices and difference matrices over cyclic groups. We then use the techniques of Fourier analysis to estimate the return probabilities of these random walks,…
A celebrated result in probability theory is that a simple symmetric random walk on the $d$-dimensional lattice $\mathbb{Z}^d$ is recurrent for $d=1,2$ and transient for $d\geq 3$. In this note, we derive a closed-form expression, in terms…
We prove a scaling limit theorem for the simple random walk on critical lattice trees in $\mathbb{Z}^d$, for $d\geq 8$. The scaling limit is the Brownian motion on the Integrated Super-Brownian Excursion (BISE) which is the same one that we…
Consider the dynamic environment governed by a Poissonian field of independent particles evolving as simple random walks on $\mathbb{Z}^d$. The random walk on random walks model refers to a particular stochastic process on $\mathbb{Z}^d$…
We prove strong invariance principle between a transient Bessel process and a certain nearest neighbor (NN) random walk that is constructed from the former by using stopping times. It is also shown that their local times are close enough to…
We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is…
The subject of this paper is the simple random walk on $\mathbb{Z}$. We give a very simple answer to the following problem: under the condition that a random walk has already spent $\alpha$-percent of the traveling time on the positive side…
In the weak backscattering limit, point contact tunneling between quantum Hall edges is well described by a Poissonian process where Laughlin quasiparticles tunnel independently, leading to the unambiguous measurement of their fractional…
We answer positively a question of Kaimanovich and Vershik from 1979, showing that the final configuration of lamps for simple random walk on the lamplighter group over ${\Bbb Z}^d$ ($d \ge 3$) is the Poisson boundary. For $d \ge 5$, this…
We analyze a class of continuous time random walks in $\mathbb R^d,d\geq 2,$ with uniformly distributed directions. The steps performed by these processes are distributed according to a generalized Dirichlet law. Given the number of changes…
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…
For $\lambda>0$, we define a $\lambda$-damped random walk to be a random walk that is started from a random vertex of a graph and stopped at each step with probability $\frac{\lambda}{1+\lambda}$, otherwise continued with probability…
In this article we obtain uniform estimates on the absorption of Brownian motion by porous interfaces surrounding a compact set. An important ingredient is the construction of certain resonance sets, which are hard to avoid for Brownian…
We obtain large deviations estimates for the self-intersection local times for a symmetric random walk in dimension 3. Also, we show that the main contribution to making the self-intersection large, in a time period of length $n$, comes…
Asymptotics of the variances of many cost measures in random digital search trees are often notoriously messy and involved to obtain. A new approach is proposed to facilitate such an analysis for several shape parameters on random symmetric…
We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…