arXiv (Cornell University) · 2019 · 12 citations · 20 references
Open access
Natural SciencesComputer ScienceMathematicsCombinatoricsProbability TheoryStochastic ProcessesGraph TheoryMarkov ChainsMarkov ProcessesProbabilistic CombinatoricsErdős - Rényi GraphsMarkov Chain Mixing RatesMarkov Chains On GraphsMixing Time AnalysisMixing TimesPower-law Degree DistributionRandom Graph TheoryRandom Graphs
Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results were proved on rapidly mixing Markov chains on unconstrained, bipartite, and directed sequences, using different mechanisms. The aim of this paper is to unify these approaches. We will illustrate the strength of the unified method by showing that on any $P$-stable family of unconstrained/bipartite/directed degree sequences the switch Markov chain is rapidly mixing. This is a common generalization of every known result that shows the rapid mixing nature of the switch Markov chain on a region of degree sequences. Two applications of this general result will be presented. One is an almost uniform sampler for power-law degree sequences with exponent $\gamma>1+\sqrt{3}$. The other one shows that the switch Markov chain on the degree sequence of an Erdős-Renyi random graph $G(n,p)$ is asymptotically almost surely rapidly mixing if $p$ is bounded away from 0 and 1 by at least $\frac{5\log n}{n-1}$.
20
Emergence of Scaling in Random Networks
Albert-Ĺaszló Barabási, Réka Albert · Science · 1999 · 36.4K citations · Full text
Mark Jerrum, Alistair Sinclair · SIAM Journal on Computing · 1989 · 793 citations
Network control principles predict neuron function in the Caenorhabditis elegans connectome
Gang Yan, Petra E. Vértes, Emma K. Towlson et al. · Nature · 2017 · 364 citations · Full text
Life Sciences, Biology, Neuroscience +12