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

8 papers

cond-mat.dis-nn20052 cited

Degree Distribution of Competition-Induced Preferential Attachment Graphs

N. Berger, C. Borgs, J. T. Chayes +2

We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this fami…

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…

cond-mat.stat-mech2004

Competition-Induced Preferential Attachment

N. Berger, C. Borgs, J. T. Chayes +2

Models based on preferential attachment have had much success in reproducing the power law degree distributions which seem ubiquitous in both natural and engineered systems. Here,…

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…