181 citations
- Eindhoven University of TechnologyNL3 papers
- Hebrew University of JerusalemIL3 papers
- University of British ColumbiaCA3 papers
- University of California, BerkeleyUS3 papers
- Courant Institute of Mathematical SciencesUS2 papers
- Microsoft Research (United Kingdom)GB2 papers
- University of Illinois Urbana-ChampaignUS2 papers
- Australian National UniversityAU1 paper
- Board of the Swiss Federal Institutes of TechnologyCH1 paper
- Columbia UniversityUS1 paper
- Délégation Paris 6FR1 paper
- ETH ZurichCH1 paper
6 papers · 1 filter
A probabilistic approach to the geometry of the \ell_p^n-ball
Franck Barthe, Olivier Guedon, Shahar Mendelson +1
This article investigates, by probabilistic methods, various geometric questions on B_p^n, the unit ball of \ell_p^n. We propose realizations in terms of independent random variabl…
Coin flipping from a cosmic source: On error correction of truly random bits
Elchanan Mossel, Ryan O'Donnell
We study a problem related to coin flipping, coding theory, and noise sensitivity. Consider a source of truly random bits $x \in \bits^n$, and parties, who have noisy versions…
Uniqueness of maximal entropy measure on essential spanning forests
Scott Sheffield
An essential spanning forest of an infinite graph is a spanning forest of in which all trees have infinitely many vertices. Let be an increasing sequence of finite co…
Random subgraphs of finite graphs: III. The phase transition for the -cube
Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad +2
We study random subgraphs of the -cube , where nearest-neighbor edges are occupied with probability . Let be the value of for which the expected clust…
Random subgraphs of finite graphs: II. The lace expansion and the triangle condition
Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad +2
In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and sh…
Random subgraphs of finite graphs: I. The scaling window under the triangle condition
Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad +2
We study random subgraphs of an arbitrary finite connected transitive graph obtained by independently deleting edges with probability . Let be the number of ve…