arXiv subjects

Ofer Zeitouni

Publications and source records attributed to Ofer Zeitouni.

135 records · Page 8Linked to original sources

arXiv2004

Limit theorems for one-dimensional transient random walks in Markov environments

We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for random walks in i.i.d. environments. The basic assumption is that the underlying Markov chain is irreducible and either with a finite state space or with the transition kernel dominated above and below by a probability measure.

math.PR↗

arXiv2003

Cover Times for Brownian Motion and Random Walks in Two Dimensions

Let T(x,r) denote the first hitting time of the disc of radius r centered at x for Brownian motion on the two dimensional torus. We prove that sup_{x} T(x,r)/|log r|^2 --> 2/pi as r --> 0. The same applies to Brownian motion on any smooth, compact connected, two-dimensional, Riemannian manifold with unit area and no boundary. As a consequence, we prove a conjecture, due to Aldous (1989), that the number of steps it takes a simple random walk to cover all points of the lattice torus Z_n^2 is asymptotic to (2n log n)^2/pi. Determining these asymptotics is an essential step toward analyzing the fractal structure of the set of uncovered sites before coverage is complete; so far, this structure was only studied non-rigorously in the physics literature. We also establish a conjecture, due to Kesten and Revesz, that describes the asymptotics for the number of steps needed by simple random walk in Z^2 to cover the disc of radius n.

math.PR↗

arXiv2003

The Poisson-Dirichlet law is the unique invariant distribution for uniform split-merge transformations

We consider a Markov chain on the space of (countable) partitions of the interval [0,1], obtained first by size biased sampling twice (allowing repetitions) and then merging the parts (if the sampled parts are distinct) or splitting the part uniformly (if the same part was sampled twice). We prove a conjecture of Vershik stating that the Poisson-Dirichlet law with parameter theta=1 is the unique invariant distribution for this Markov chain. Our proof uses a combination of probabilistic, combinatoric, and representation-theoretic arguments.

math.PR↗

arXiv2003

Random walks in random environments

Random walks in random environments (RWRE's) have been a source of surprising phenomena and challenging problems since they began to be studied in the 70's. Hitting times and, more recently, certain regeneration structures, have played a major role in our understanding of RWRE's. We review these and provide some hints on current research directions and challenges.

math.PR↗

arXiv2002

A law of large numbers for random walks in random mixing environments

We prove a law of large numbers for a class of multidimensional random walks in random environments where the environment satisfies appropriate mixing conditions, which hold when the environment is a weak mixing field in the sense of Dobrushin and Shlosman. Our result holds if the mixing rate balances moments of some random times depending on the path. It applies in the non-nestling case, but we also provide examples of nestling walks that satisfy our assumptions. The derivation is based on an adaptation, using coupling, of the regeneration argument of Sznitman-Zerner.

math.PR↗

arXiv2001

Aging properties of Sinai's model of random walk in random environment

We study in this short note aging properties of Sinai's (nearest neighbour) random walk in random environment. With $\PP^o$ denoting the annealed law of the RWRE $X_n$, our main result is a full proof of the following statement due to P. Le Doussal, C. Monthus and D. S. Fisher: $$\lim_{η\to0} \lim_{n\to\infty} \PP^o (\frac{|X_{n^h} - X_n|}{(\log n)^2} < η) = \frac{1}{h^2} [ {5/3} - {2/3} e^{-(h-1)} ]. $$

math.PR↗

arXiv2001

Asymptotics of certain coagulation-fragmentation processes and invariant Poisson-Dirichlet measures

We consider Markov chains on the space of (countable) partitions of the interval $[0,1]$, obtained first by size biased sampling twice (allowing repetitions) and then merging the parts with probability $β_m$ (if the sampled parts are distinct) or splitting the part with probability $β_s$ according to a law $σ$ (if the same part was sampled twice). We characterize invariant probability measures for such chains. In particular, if $σ$ is the uniform measure then the Poisson-Dirichlet law is an invariant probability measure, and it is unique within a suitably defined class of ``analytic'' invariant measures. We also derive transience and recurrence criteria for these chains.

math.PR↗

arXiv2001

Thick points for intersections of planar sample paths

Let $L_n^{X}(x)$ denote the number of visits to $x \in {\bf Z}^2$ of the simple planar random walk $X$, up till step $n$. Let $X'$ be another simple planar random walk independent of $X$. We show that for any $0<b<1/(2 π)$, there are $n^{1-2πb+o(1)}$ points $x \in {\bf Z}^2$ for which $L_n^{X}(x)L_n^{X'}(x)\geq b^2 (\log n)^4$. This is the discrete counterpart of our main result, that for any $a<1$, the Hausdorff dimension of the set of {\it thick intersection points} $x$ for which $\limsup_{r \to 0} {\mathcal I}(x,r)/(r^2|\log r|^4)=a^2$, is almost surely $2-2a$. Here ${\mathcal I}(x,r)$ is the projected intersection local time measure of the disc of radius $r$ centered at $x$ for two independent planar Brownian motions run till time 1. The proofs rely on a `multi-scale refinement' of the second moment method. In addition, we also consider analogous problems where we replace one of the Brownian motions by a transient stable process, or replace the disc of radius $r$ centered at $x$ by $x+rK$ for general sets $K$.

math.PR↗

arXiv2000

Random polynomials having few or no real zeros

Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros with probability n^{-b+o(1)}$ as n --> infinity through integers of the same parity as the fixed integer k >= 0. In particular, the probability that a random polynomial of large even degree n has no real zeros is n^{-b+o(1)}. The finite, positive constant b is characterized via the centered, stationary Gaussian process of correlation function sech(t/2). The value of b depends neither on k nor upon the specific law of the coefficients. Under an extra smoothness assumption about the law of the coefficients, with probability n^{-b+o(1)} one may specify also the approximate locations of the k zeros on the real line. The constant b is replaced by b/2 in case the i.i.d. coefficients have a nonzero mean.

math.PR↗