Markov Chain Simulations of Binary Matrices

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 func...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Krebs, William B
Format:	Report
Sprache:	eng
Schlagworte:	CHAINS COMBINATORIAL ANALYSIS CONSTRUCTION EIGENVALUES ESTIMATES FUNCTIONS GRAPHS MARKOV PROCESSES MIXING POLYNOMIALS PROBABILITY SEQUENCES Statistics and Probability
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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. USARO Technicsal rept. no. D-124.