MathDB1 problem
- 0 votes0 replies0 views
Kozma's rough-isometry conjecture for mixing times
Kozma's conjecture. The mixing time of a bounded-degree graph should be robust, up to constant factors, under rough isometry.
Kozma's rough-isometry conjecture for mixing times
Kozma's conjecture. The mixing time of a bounded-degree graph should be robust, up to constant factors, under rough isometry.