Dimension reduction for maximum matchings and the Fastest Mixing Markov Chain
Work
Year: 2023
Type: article
Abstract: Let G=(V,E) be an undirected graph with maximum degree Δ and vertex conductance Ψ * (G). We show that there exists a symmetric, stochastic matrix P, with off-diagonal entries supported on E, whose spe... more
Source: Comptes Rendus Mathématique
Institutions University of Illinois Chicago, Stanford University
Cites: 13
Cited by: 1
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond