55 citations · 252 across the 32 of their papers we have counts for
7 papers · 2 filters
Fast simulation of new coins from old
Serban Nacu, Yuval Peres
Let S\subset (0,1). Given a known function f:S\to (0,1), we consider the problem of using independent tosses of a coin with probability of heads p (where p\in S is unknown) to simu…
Extra heads and invariant allocations
Alexander E. Holroyd, Yuval Peres
Let Πbe an ergodic simple point process on R^d and let Π^* be its Palm version. Thorisson [Ann. Probab. 24 (1996) 2057-2064] proved that there exists a shift coupling of Πand Π^*;…
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…
Evolving sets, mixing and heat kernel bounds
Ben Morris, Yuval Peres
We show that a new probabilistic technique, recently introduced by the first author, yields the sharpest bounds obtained to date on mixing times of Markov chains in terms of isoper…
Brownian intersections, cover times and thick points via trees
Yuval Peres
There is a close connection between intersections of Brownian motion paths and percolation on trees. Recently, ideas from probability on trees were an important component of the mu…
New coins from old: computing with unknown bias
Elchanan Mossel, Yuval Peres
Suppose that we are given a function f : (0,1) -> (0,1) and, for some unknown p in (0,1), a sequence of independent tosses of a p-coin (i.e., a coin with probability p of ``heads''…