Universality of cutoff for graphs with an added random matching

Cited by: 0|Bibtex|Views5
Other Links: arxiv.org

Abstract:

We establish universality of cutoff for simple random walk on a class of random graphs defined as follows. Given a finite graph $G=(V,E)$ with $|V|$ even we define a random graph $ G^*=(V,E \cup E')$ obtained by picking $E'$ to be the (unordered) pairs of a random perfect matching of $V$. We show that for a sequence of such graphs $G_n$...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments