scientific article; zbMATH DE number 1097578
From MaRDI portal
Publication:4372784
DOI<299::AID-RSA2>3.0.CO;2-U 10.1002/(SICI)1098-2418(199712)11:4<299::AID-RSA2>3.0.CO;2-UzbMath0889.90154MaRDI QIDQ4372784
Publication date: 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
semidefinite programmingeigenvaluesspectral gapPoincaré inequalitiesmulticommodity flowreversible Markov chain
Deterministic network models in operations research (90B10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Markov and semi-Markov decision processes (90C40)
Related Items (7)
Upper bounds on algebraic connectivity via convex optimization ⋮ Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes ⋮ Graph clustering ⋮ Tight estimates for convergence of some non-stationary consensus algorithms ⋮ When does allow the Hardy inequality to calculate an exact Poincaré constant on a line? ⋮ Efficient Simulation of High Dimensional Gaussian Vectors ⋮ Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
This page was built for publication:
