activity
19982005
most citedPercolation on finite graphs and isoperimetric inequalities

87 citations · 100 across the 18 of their papers we have counts for

collaborators
Showing 2002Show all

5 papers · 1 filter

math.CV2002

A negative answer to Nevanlinna's type question and a parabolic surface with a lot of negative curvature

Itai Benjamini, Sergei Merenkov, Oded Schramm

Consider a simply connected Riemann surface represented by a Speiser graph. Nevanlinna asked if the type of the surface is determined by the mean excess of the graph: whether mean…

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.PR200287 cited

Percolation on finite graphs and isoperimetric inequalities

Noga Alon, Itai Benjamini, Alan Stacey

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly…

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.PR2002

Determining the Genus of a Map by Local Observation of a Simple Random Process

Itai Benjamini, Laszlo Lovasz

Given a graph embedded in an orientable surface, a process consisting of random excitations and random node and face balancing is constructed and analyzed. It is shown that given a…