activity
20002005
most citedA lower bound for the chemical distance in sparse long-range percolation models

22 citations · 30 across the 7 of their papers we have counts for

collaborators
Showing math.PRShow all

6 papers · 1 filter

math.PR200422 cited

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

Noam Berger

We consider long-range percolation in dimension , where distinct sites and are connected with probability . Assuming that is translation…

math.PR2003

Nonuniqueness for specifications in

Noam Berger, Christopher Hoffman, Vladas Sidoravicius

For every , we construct a regular and continuous specification (-function), which has a variation sequence that is in and which admits multiple Gibbs measures. Combi…

math.PR2002

The speed of biased random walk on percolation clusters

Noam Berger, Nina Gantert, Yuval Peres

We consider biased random walk on supercritical percolation clusters in . We show that the random walk is transient and that there are two speed regimes: If the bias is large…

math.PR2002

Mixing times of the biased card shuffling and the asymmetric exclusion process

Itai Benjamini, Noam Berger, Christopher Hoffman +1

Consider the following method of card shuffling. Start with a deck of cards numbered 1 through N. Fix a parameter between 0 and 1. In this model a ``shuffle'' consists of u…

math.PR20026 cited

Transience of percolation clusters on wedges

Omer Angel, Itai Benjamini, Noam Berger +1

We study random walks on supercritical percolation clusters on wedges in , and show that the infinite percolation cluster is (a.s.) transient whenever the wedge is transient.…

math.PR2000

The Diameter of Long-Range Percolation Clusters on Finite Cycles

Itai Benjamini, Noam Berger

Bounds for the diameter and for the expansion of long-range percolation clusters on the cycle are given.