Random walks on random n-lifts of any irreducible weighted base graph with two oriented cycles mix at time h^{-1} log n with cutoff, h the universal-cover entropy.
Random lifts of graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Cutoff for random lifts of weighted graphs
Random walks on random n-lifts of any irreducible weighted base graph with two oriented cycles mix at time h^{-1} log n with cutoff, h the universal-cover entropy.