Searcharxiv⌕ Search

arXiv subjects

Noam Berger

Publications and source records attributed to Noam Berger.

At least 37 records · Page 2Linked to original sources
arXiv2014

Transience, Recurrence and Critical Behavior for Long-Range Percolation

We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions $d=1,2$, where $x$ and $y$ a re connected with probability $\simβ/\|x-y\|^{-s}$. We show that when $d<s<2d$ the walk is transient, and when $s\geq 2d$, the walk is recurrent. The proof of transience is based on a renormalization argument. As a corollary of this renormalization argument, we get that for every dimension $d$, if $d<s<2d$, then critical percolation has no infinite clusters. This result is extended to the free random cluster model. A second corollary is that when $d\geq 2$ and $d<s<2d$ we can erase all long enough bonds and still have an infinite cluster. The proof of recurrence in two dimensions is based on general stability results for recurrence in random electrical networks. In particular, we show that i.i.d. conductances on a recurrent graph of bounded degree yield a recurrent electrical network.

math.PR↗
arXiv2014

Asymptotic behavior and distributional limits of preferential attachment graphs

We give an explicit construction of the weak local limit of a class of preferential attachment graphs. This limit contains all local information and allows several computations that are otherwise hard, for example, joint degree distributions and, more generally, the limiting distribution of subgraphs in balls of any given radius $k$ around a random vertex in the preferential attachment graph. We also establish the finite-volume corrections which give the approach to the limit.

math.PR↗
arXiv2013

On the speed of Random Walks among Random Conductances

We consider random walk among random conductances where the conductance environment is shift invariant and ergodic. We study which moment conditions of the conductances guarantee speed zero of the random walk. We show that if there exists α>1 such that E[log^α(ω_e)]<\infty, then the random walk has speed zero. On the other hand, for each α>1 we provide examples of random walks with non-zero speed and random walks for which the limiting speed does not exist that have E[log^α(ω_e)]<\infty.

math.PR↗
arXiv2013

Behavior of random walk on discrete point processes

We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We give partial characterization of transience and recurrence in the different dimensions. Finally we prove Central Limit Theorem (CLT) for such random walks, under a condition on the distance between coordinate nearest points.

math.PR↗
arXiv2013

Effective Polynomial Ballisticity Condition for Random Walk in Random Environment

The conditions $(T)_γ,$ $γ\in (0,1),$ which have been introduced by Sznitman in 2002, have had a significant impact on research in random walk in random environment. Among others, these conditions entail a ballistic behaviour as well as an invariance principle. They require the stretched exponential decay of certain slab exit probabilities for the random walk under the averaged measure and are asymptotic in nature. The main goal of this paper is to show that in all relevant dimensions (i.e., $d \ge 2$), in order to establish the conditions $(T)_γ$, it is actually enough to check a corresponding condition $(\mathcal{P})$ of polynomial type. In addition to only requiring an a priori weaker decay of the corresponding slab exit probabilities than $(T)_γ,$ another advantage of the condition $(\mathcal{P})$ is that it is effective in the sense that it can be checked on finite boxes. In particular, this extends the conjectured equivalence of the conditions $(T)_γ,$ $γ\in (0,1),$ to all relevant dimensions.

math.PR↗
arXiv2012

Mutually excited random walks

Consider two random walks on $\mathbb{Z}$. The transition probabilities of each walk is dependent on trajectory of the other walker i.e. a drift $p>1/2$ is obtained in a position the other walker visited twice or more. This simple model has a speed which is, according to simulations, not monotone in $p$, without apparent "trap" behaviour. In this paper we prove the process has positive speed for $1/2<p<1$, and present a deterministic algorithm to approximate the speed and show the non-monotonicity.

math.PR↗
arXiv2012

Detecting the trail of a random walker in a random scenery

Suppose that the vertices of the Euclidean lattice Z^d are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins. For which walks and dimensions can the resulting scenery be distinguished from the original scenery? We find the answer for simple random walk, where it does not depend on dimension, and for walks with a nonzero mean, where a transition occurs between dimensions three and four. We also answer this question for other types of graphs and walks, and raise several new questions.

math.PR↗
arXiv2012

A quenched invariance principle for non-elliptic random walk in i.i.d. balanced random environment

We consider a random walk on Z^d in an i.i.d. balanced random environment, that is a random walk for which the probability to jump from x to nearest neighbor x+e is the same as to nearest neighbor x-e. Assuming that the environment is genuinely d-dimensional and balanced we show a quenched invariance principle: for P almost every environment, the diffusive rescaled random walk converges to a Brownian motion with deterministic non-degenerate diffusion matrix. Within the i.i.d. setting, our result extend both Lawler's uniformly elliptic result and Guo and Zeitouni's elliptic result to the general (non elliptic) case. Our proof is based on analytic methods and percolation arguments.

math.PR↗
arXiv2010

Slowdown estimates for ballistic random walk in random environment

For a random walk in an elliptic i.i.d. random environment in dimension greater than or equal to 4, satisfying the a ballisticity condition slightly weaker than condition (T'), We consider the probability of linear slowdown. We show an upper bound for this probability which is very close to the lower bound obtained by the "naive trap" analysis. As a tool for obtaining the main result, we show an almost local version of the quenched central limit theorem under the same ballisticity condition.

math.PR↗
arXiv2009

Long Range Percolation Mixing Time

We provide an estimate, sharp up to poly-logarithmic factors, of the asymptotically almost sure mixing time of the graph created by long-range percolation on the cycle of length N (Z/NZ). While it is known that the almost sure diameter drops from linear to poly-logarithmic as the exponent s decreases below 2, the almost sure mixing time drops from N^2 only to N^(s-1) (up to poly-logarithmic factors).

math.PR↗
arXiv2008

A quenched invariance principle for certain ballistic random walks in i.i.d. environments

We prove that every random walk in i.i.d. environment in dimension greater than or equal to 2 that has an almost sure positive speed in a certain direction, an annealed invariance principle and some mild integrability condition for regeneration times also satisfies a quenched invariance principle. The argument is based on intersection estimates and a theorem of Bolthausen and Sznitman.

math.PR↗
arXiv2007

Anomalous heat-kernel decay for random walk among bounded random conductances

We consider the nearest-neighbor simple random walk on $\Z^d$, $d\ge2$, driven by a field of bounded random conductances $ω_{xy}\in[0,1]$. The conductance law is i.i.d. subject to the condition that the probability of $ω_{xy}>0$ exceeds the threshold for bond percolation on $\Z^d$. For environments in which the origin is connected to infinity by bonds with positive conductances, we study the decay of the $2n$-step return probability $P_ω^{2n}(0,0)$. We prove that $P_ω^{2n}(0,0)$ is bounded by a random constant times $n^{-d/2}$ in $d=2,3$, while it is $o(n^{-2})$ in $d\ge5$ and $O(n^{-2}\log n)$ in $d=4$. By producing examples with anomalous heat-kernel decay approaching $1/n^2$ we prove that the $o(n^{-2})$ bound in $d\ge5$ is the best possible. We also construct natural $n$-dependent environments that exhibit the extra $\log n$ factor in $d=4$. See also math.PR/0701248.

math.PR↗
arXiv2006

Quenched invariance principle for simple random walk on percolation clusters

We consider the simple random walk on the (unique) infinite cluster of super-critical bond percolation in $\Z^d$ with $d\ge2$. We prove that, for almost every percolation configuration, the path distribution of the walk converges weakly to that of non-degenerate, isotropic Brownian motion. Our analysis is based on the consideration of a harmonic deformation of the infinite cluster on which the random walk becomes a square-integrable martingale. The size of the deformation, expressed by the so called corrector, is estimated by means of ergodicity arguments.

math.PR↗
arXiv2005

Nonuniqueness for specifications in $\ell^{2+ε}$

For every $p>2$, we construct a regular and continuous specification ($g$-function), which has a variation sequence that is in $l^p$ and which admits multiple Gibbs measures. Combined with a recent result of Johansson and Oberg, this determines the optimal modulus of continuity for a specification which admits multiple Gibbs measures.

math.PR↗
arXiv2004

A lower bound for the chemical distance in sparse long-range percolation models

We consider long-range percolation in dimension $d\geq 1$, where distinct sites $x$ and $y$ are connected with probability $p_{x,y}\in[0,1]$. Assuming that $p_{x,y}$ is translation invariant and that $p_{x,y}=\|x-y\|^{-s+o(1)}$ with $s>2d$, we show that the graph distance is at least linear with the Euclidean distance.

math.PR↗
arXiv2004

Glauber Dynamics on Trees and Hyperbolic Graphs

We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with $n$ vertices and of bounded degree. We show that the relaxation time (defined as the reciprocal of the spectral gap $|λ_1-λ_2|$) for the dynamics on trees and on planar hyperbolic graphs, is polynomial in $n$. For these hyperbolic graphs, this yields a general polynomial sampling algorithm for random configurations. We then show that if the relaxation time $τ_2$ satisfies $τ_2=O(1)$, then the correlation coefficient, and the mutual information, between any local function (which depends only on the configuration in a fixed window) and the boundary conditions, decays exponentially in the distance between the window and the boundary. For the Ising model on a regular tree, this condition is sharp.

math.PR↗
arXiv2003

The speed of biased random walk on percolation clusters

We consider biased random walk on supercritical percolation clusters in $\Z^2$. We show that the random walk is transient and that there are two speed regimes: If the bias is large enough, the random walk has speed zero, while if the bias is small enough, the speed of the random walk is positive.

math.PR↗