Cut-off for large sums of graphs

DOI10.5802/aif.2331zbMath1135.05039OpenAlexW2493459419MaRDI QIDQ2477558

Bernard Ycart

Publication date: 14 March 2008

Published in: Annales de l'Institut Fourier (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=AIF_2007__57_7_2197_0

zbMATH Keywords

spectrumLaplaciancut-offKullback distancesum of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items

Cutoffs for product chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplace eigenvalues of graphs---a survey
• Cut-off for \(n\)-tuples of exponentially converging processes
• Recent results in the theory of graph spectra
• Hamiltonian paths in Cartesian powers of directed cycles
• Weighted graph Laplacians and isoperimetric inequalities
• Edge-isoperimetric problems for Cartesian powers of regular graphs
• A User's Guide to Measure Theoretic Probability
• Shuffling Cards and Stopping Times
• Cutoff for samples of Markov chains