Pages that link to "Item:Q1159215"

The following pages link to Bounds for eigenvalues of certain stochastic matrices (Q1159215):

Displaying 17 items.

• Normalized graph Laplacians for directed graphs (Q414701) (← links)
• A general steady state distribution based stopping criteria for finite length genetic algorithms (Q853021) (← links)
• Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
• Statistical complexity of the power method for Markov chains (Q1122306) (← links)
• The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
• The maximum relaxation time of a random walk (Q1795486) (← links)
• Bounds on the cover time (Q1823547) (← links)
• Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians (Q2112759) (← links)
• Network cohesion (Q2363420) (← links)
• Uniform upper bound of the second largest eigenvalue of stochastic matrices with equal-neighbor rule (Q2411420) (← links)
• Geometric bounds for convergence rates of averaging algorithms (Q2672273) (← links)
• Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains (Q4289296) (← links)
• Linear Time Average Consensus and Distributed Optimization on Fixed Graphs (Q4599719) (← links)
• On the spectral radius and stiffness of Markov jump process rate matrices (Q4994065) (← links)
• The Convergence of Bird Flocking (Q5501926) (← links)
• Fast Convergence for Consensus in Dynamic Networks (Q5890568) (← links)
• Fast Convergence for Consensus in Dynamic Networks (Q5892613) (← links)