The labeled and unlabeled versions of a capacity-constrained congestion dynamics both exhibit abrupt convergence (cutoff), at times (1/2)n log n and (1/2)(1-ρ)n log n respectively.
Log-concave polynomials II : H igh-dimensional walks and an FPRAS for counting bases of a matroid
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Cutoff for congestion dynamics and related generalized exclusion processes
The labeled and unlabeled versions of a capacity-constrained congestion dynamics both exhibit abrupt convergence (cutoff), at times (1/2)n log n and (1/2)(1-ρ)n log n respectively.