Dimension reduction for maximum matchings and the Fastest Mixing Markov Chain
Let $G = (V,E)$ be an undirected graph with maximum degree $\Delta $ and vertex conductance $\Psi ^*(G)$. We show that there exists a symmetric, stochastic matrix $P$, with off-diagonal entries supported on $E$, whose spectral gap $\gamma ^*(P)$ satisfies \[ \Psi ^*(G)^{2}/\log \Delta \lesssim \gamm...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Académie des sciences
2023-07-01
|
| Series: | Comptes Rendus. Mathématique |
| Online Access: | https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.447/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|