activity
20042014
most citedA Birthday Paradox for Markov chains with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

30 citations · 59 across the 12 of their papers we have counts for

collaborators
Showing math.COShow all

3 papers · 1 filter

math.CO2014

Groups of rotating squares

Ravi Montenegro, David A. Huckaby, Elaine White Harmon

This paper discusses the permutations that are generated by rotating blocks of squares in a union of overlapping rectangles. It is found that the sing…

math.CO2006★ 1 cited

Intersection conductance and canonical alternating paths, methods for general finite Markov chains

Ravi Montenegro

We extend the conductance and canonical paths methods to the setting of general finite Markov chains, including non-reversible non-lazy walks. The new path method is used to show t…

math.CO2006★ 7 cited

The simple random walk and max-degree walk on a directed graph

Ravi Montenegro

We show bounds on total variation and mixing times, spectral gap and magnitudes of the complex valued eigenvalues of a general (non-reversible non-lazy) Markov chain w…