We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...
While an exact stationarization of a process with a given spectrum magnitude can be obtained via a complete randomization of the spectrum phase (“surrogates” technique), we pr...
We propose a framework to extend Markov random walks (Szummer and Jaakkola, 2001) to a continuum of points. In this framework, the transition probability between two points is the...