Nayantara Bhatnagar
where else to find them
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Ivona Bezákováonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| The Computational Complexity of Estimating Convergence Time | Approximate Counting, Markov Chains and Phase Transitions | 2016-02-22 |
Constructs Markov chains whose states are Turing‑machine configurations (edges given by a circuit) and tunes an edge weight W so that yes‑instances mix in poly… | ||
| Markov Chain Mixing Times and Applications I | Counting Complexity and Phase Transitions Boot Camp | 2016-01-26 |
Starts from Markov chains, defines ergodic chains and mixing time, links convergence to the spectral gap (eigenvalue 1 vs second eigenvalue) and shows how to… | ||
| Markov Chain Mixing Times and Applications II | Counting Complexity and Phase Transitions Boot Camp | 2016-01-26 |
Metropolis chain on proper colorings mixes in order O(n log n) when the number of colors satisfies q > 4Δ via a simple coupling that contracts expected Hamming… | ||
| nothing matches | ||