Lower bounds for the Estrada index using mixing time and Laplacian spectrum

DOI10.1216/RMJ-2013-43-6-2009zbMath1345.05042MaRDI QIDQ2439540

Yilun Shang

Publication date: 14 March 2014

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.rmjm/1393336666

zbMATH Keywords

random walkLaplacian matrixmixing timeEstrada indexnatural connectivity

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42) Signed and weighted graphs (05C22) Random walks on graphs (05C81)

Related Items

The many facets of the Estrada indices of graphs and networks ⋮ The Estrada index of evolving graphs ⋮ On some aspects of the generalized Petersen graph ⋮ On the spectrum of linear dependence graph of a finite dimensional vector space ⋮ On the Estrada index of cactus graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fastest expected time to mixing for a Markov chain on a directed graph
• The Kemeny constant for finite homogeneous ergodic Markov chains
• Fault diameter of interconnection networks
• A trace inequality of John von Neumann
• On a class of posets and the corresponding comparability graphs
• Matrix inequalities in statistical mechanics.
• Refined arithmetic, geometric and harmonic mean inequalities
• Non-negative matrices and Markov chains.
• Mixing times with applications to perturbed Markov chains
• Tough graphs and Hamiltonian circuits.
• Isoperimetric numbers of graphs
• Perturbation results for the Estrada index in weighted networks
• Conditional connectivity
• Kemeny's Constant and the Random Surfer
• The Structure and Function of Complex Networks

This page was built for publication: Lower bounds for the Estrada index using mixing time and Laplacian spectrum