Simultaneous Cutoff on the Multitype Configuration Model
Preprint
Abstract
We find Gaussian cutoff profiles for the total variation distance to stationarity of a random walk on a multiplex network: a finite number of directed configuration models sharing a vertex set, each with its own bounded degree distribution and edge probability. Further we consider the minimal total variation distance over this space of possible doubly stochastic edge probabilities at each point in time. Looking at all possible dynamics simultaneously on one realisation of the random graph, we find that this sequence of minimal distances converges in probability to the same cutoff profile as the chain with entropy maximising transition probabilities.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Effective Berry–Esseen and concentration bounds for Markov chains with a spectral gapThe Annals of Applied Probability, 2019
- Random walk on sparse random digraphsProbability Theory and Related Fields, 2017
- Statistical mechanics of multiplex networks: Entropy and overlapPhysical Review E, 2013
- Stein’s method for concentration inequalitiesProbability Theory and Related Fields, 2006
- Mathematical Aspects of Mixing Times in Markov ChainsFoundations and Trends® in Theoretical Computer Science, 2006
- Strong uniform times and finite random walksAdvances in Applied Mathematics, 1987