Pages that link to "Item:Q4372784"
From MaRDI portal
The following pages link to A semidefinite bound for mixing rates of Markov chains (Q4372784):
Displaying 12 items.
- Graph clustering (Q458448) (← links)
- Upper bounds on algebraic connectivity via convex optimization (Q855560) (← links)
- Tight estimates for convergence of some non-stationary consensus algorithms (Q953469) (← links)
- When does allow the Hardy inequality to calculate an exact Poincaré constant on a line? (Q959015) (← links)
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? (Q1296583) (← links)
- Bounding fastest mixing (Q2433660) (← links)
- (Q3197826) (← links)
- (Q3363684) (← links)
- Efficient Simulation of High Dimensional Gaussian Vectors (Q5219708) (← links)
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix (Q5251622) (← links)
- On Subexponential Mixing Rate for Markov Processes (Q5700619) (← links)
- Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes (Q6136582) (← links)