Abstract

Abstract : We consider Markov chains to simulate graphs with a fixed degree sequence and binary matrices with fixed row and column sums. By means of a combinatorial construction, we bound the subdominant eigenvalues of the chains. Under certain additional conditions, we show that the bounds are polynomial functions of the degree sequences and the row and column sums, respectively. Markov chain, spectral estimate, binary matrices, rapid mixing.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.