Fastest Mixing Reversible Markov Chains on Graphs With Degree Proportional Stationary Distributions
From MaRDI portal
Publication:2982900
DOI10.1109/TAC.2014.2322942zbMath1360.60134MaRDI QIDQ2982900
Publication date: 16 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Semidefinite programming (90C22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (6)
Geometric bounds on the fastest mixing Markov chain ⋮ Analysis of distributed consensus protocols with multi-equilibria under time-delays ⋮ Evolving networks based on birth and death process regarding the scale stationarity ⋮ Continuum versus discrete networks, graph Laplacians, and reproducing kernel Hilbert spaces ⋮ Resilient group consensus in the presence of Byzantine agents ⋮ Fastest random walk on a path
This page was built for publication: Fastest Mixing Reversible Markov Chains on Graphs With Degree Proportional Stationary Distributions
