The following pages link to Ravi Montenegro (Q850391):
Displaying 14 items.
- Mixing time bounds via the spectral profile (Q850392) (← links)
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm (Q968774) (← links)
- Sharp edge, vertex, and mixed Cheeger inequalities for finite Markov kernels (Q2461043) (← links)
- A sharp isoperimetric bound for convex bodies (Q2480559) (← links)
- Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem (Q2941189) (← links)
- Mathematical Aspects of Mixing Times in Markov Chains (Q3587573) (← links)
- The simple random walk and max-degree walk on a directed graph (Q3633018) (← links)
- Vertex and edge expansion properties for rapid mixing (Q4667856) (← links)
- How long does it take to catch a wild kangaroo? (Q5172750) (← links)
- Edge isoperimetry and rapid mixing on matroids and geometric Markov chains (Q5176029) (← links)
- Algorithms and Computation (Q5191695) (← links)
- Blocking Conductance and Mixing in Random Walks (Q5295401) (← links)
- Intersection Conductance and Canonical Alternating Paths: Methods for General Finite Markov Chains (Q5495677) (← links)
- Groups of rotating squares (Q5740801) (← links)
