Noam Berger
University of California, Berkeley
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Noam Berger.
Probability Theory and Related Fields | 2006
Noam Berger; Marek Biskup
We consider the simple random walk on the (unique) infinite cluster of super-critical bond percolation in ℤd with d≥2. 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.
Proceedings of the National Academy of Sciences of the United States of America | 2007
Raissa M. D'Souza; Christian Borgs; Jennifer T. Chayes; Noam Berger; Robert Kleinberg
We show how preferential attachment can emerge in an optimization framework, resolving a long-standing theoretical controversy. We also show that the preferential attachment model so obtained has two novel features, saturation and viability, which have natural interpretations in the underlying network and lead to a power-law degree distribution with exponential cutoff. Moreover, we consider a generalized version of this preferential attachment model with independent saturation and viability, leading to a broader class of power laws again with exponential cutoff. We present a collection of empirical observations from social, biological, physical, and technological networks, for which such degree distributions give excellent fits. We suggest that, in general, optimization models that give rise to preferential attachment with saturation and viability effects form a good starting point for the analysis of many networks.
Annales De L Institut Henri Poincare-probabilites Et Statistiques | 2008
Noam Berger; Marek Biskup; Christopher Hoffman; Gady Kozma
We consider the nearest-neighbor simple random walk on
Communications in Mathematical Physics | 2002
Noam Berger
\Z^d
international colloquium on automata languages and programming | 2003
Noam Berger; Béla Bollobás; Christian Borgs; Jennifer T. Chayes; Oliver Riordan
,
international colloquium on automata, languages and programming | 2004
Noam Berger; Christian Borgs; Jennifer T. Chayes; R. M. D’Souza; Robert Kleinberg
d\ge2
arXiv: Probability | 2008
Noam Berger; Ofer Zeitouni
, driven by a field of bounded random conductances
Combinatorics, Probability & Computing | 2005
Noam Berger; Christian Borgs; Jennifer T. Chayes; Raissa M. D'Souza; Robert Kleinberg
\omega_{xy}\in[0,1]
Combinatorics, Probability & Computing | 2008
Itai Benjamini; Noam Berger; Ariel Yadin
. The conductance law is i.i.d. subject to the condition that the probability of
Annals of Probability | 2008
Noam Berger
\omega_{xy}>0