181 citations
- Johns Hopkins UniversityUS2 papers
- Microsoft (United States)US2 papers
- Australian National UniversityAU1 paper
- Berkeley CollegeUS1 paper
- Centrum Wiskunde & InformaticaNL1 paper
- Columbia UniversityUS1 paper
- Cornell UniversityUS1 paper
- Courant Institute of Mathematical SciencesUS1 paper
- Délégation Paris 6FR1 paper
- Institut de Mathématiques de Jussieu-Paris Rive GaucheFR1 paper
- Massachusetts Institute of TechnologyUS1 paper
- Santa Cruz County Office of EducationUS1 paper
Showing 2003Show all
2 papers · 1 filter
math.PR2003
Linear speed large deviations for percolation clusters
Yevgeniy Kovchegov, Scott Sheffield
Let C_n be the origin-containing cluster in subcritical percolation on the lattice (1/n) Z^d, viewed as a random variable in the space Omega of compact, connected, origin-containin…
math.PR2003
On the Maximum Satisfiability of Random Formulas
Dimitris Achlioptas, Assaf Naor, Yuval Peres
Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consi…