18.1k citations
- University of California, Santa BarbaraUS314 papers
- Microsoft Research (United Kingdom)GB248 papers
- Massachusetts Institute of TechnologyUS170 papers
- University of California, BerkeleyUS170 papers
- University of WashingtonUS165 papers
- Stanford UniversityUS156 papers
- Carnegie Mellon UniversityUS149 papers
- ETH ZurichCH131 papers
- Princeton UniversityUS119 papers
- University of Maryland, College ParkUS108 papers
- California Institute of TechnologyUS107 papers
- Cornell UniversityUS98 papers
4 papers · 2 filters
Mixing Time of the Rudvalis Shuffle
David Bruce Wilson
We extend a technique for lower-bounding the mixing time of card-shuffling Markov chains, and use it to bound the mixing time of the Rudvalis Markov chain, as well as two variants…
Conformal restriction: the chordal case
Gregory Lawler, Oded Schramm, Wendelin Werner
We characterize and describe all random subsets of a given simply connected planar domain (the upper half-plane $\H$, say) which satisfy the ``conformal restriction'' property,…
Uniform Infinite Planar Triangulations
Omer Angel, Oded Schramm
The existence of the weak limit as n --> infinity of the uniform measure on rooted triangulations of the sphere with n vertices is proved. Some properties of the limit are studied.…
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…