activity
20032009
most citedCritical random graphs: Diameter and mixing time

113 citations · 156 across the 10 of their papers we have counts for

collaborators
Showing 2009Show all

5 papers · 1 filter

math.CO20095 cited

Anatomy of a young giant component in the random graph

Jian Ding, Jeong Han Kim, Eyal Lubetzky +1

We provide a complete description of the giant component of the Erdős-Rényi random graph as soon as it emerges from the scaling window, i.e., for where $ε^3…

cs.GT2009

Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks

Yossi Azar, Benjamin Birnbaum, L. Elisa Celis +2

Bargaining games on exchange networks have been studied by both economists and sociologists. A Balanced Outcome for such a game is an equilibrium concept that combines notions of s…

math.DS2009

Heaviness in Toral Rotations

Yuval Peres, David Ralston

We investigate the dimension of the set of points in the d-torus which have the property that their orbit under rotation by some alpha hits a fixed closed target A more often than…

math.DS2009

A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes

Guangyue Han, Brian Marcus, Yuval Peres

In this note, we show that small complex perturbations of positive matrices are contractions, with respect to a complex version of the Hilbert metric, on the standard complex simpl…

math.PR20094 cited

Is the critical percolation probability local?

Itai Benjamini, Asaf Nachmias, Yuval Peres

We show that the critical probability for percolation on a d-regular non-amenable graph of large girth is close to the critical probability for percolation on an infinite d-regular…