Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

The University of British Columbia

$29,000.00

Particle systems and universality of the cutoff phenomenon

EF 2023-24

Résumé
The objective of the proposed research program is to develop general techniques for bounding mixing times and establishing universality of the cutoff phenomenon. Our purpose is also to apply these techniques to a wide range of important models of random graphs and particle systems including ones whose analysis is beyond the reach of the techniques currently available in the literature, including: the interchange, exclusion and zero-range processes, random Cayley graphs and a large class of quasi random graphs. For exclusion process, our goal is to establish the cutoff phenomenon when the base graphs are fixed dimensional tori/boxes of diverging side lengths. For the exclusion and the interchange processes we aim to resolve a conjecture of Oliveira that asserts that the mixing time is bounded by that of (the same number of) independent particles. For the interchange process we also aim to prove an operator version of Aldous' spectral-gap conjecture which will have striking consequences not only regarding the mixing time, but also regarding the emergence of macroscopic cycles in the cycle decomposition obtained by running the interchange process (for inverse of the spectral-gap time units). We aim to establish universality of cutoff for the zero range process. Currently even the order of the mixing time is understood in a handful of examples. The proposed method should have numerous applications. We also intend to establish universality of the cutoff phenomenon for a wide range of random graphs including random Cayley graphs. Lastly, we intend to study the important question of robustness of mixing times of (random walks on) vertex-transitive graphs, which is at least conceptually related to the famous question concerning stability of the Liouville property, and may shed some light on it.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2020-04251
Name nom
Hermon, Jonathan
Department département
Mathematics
Organization id
2
Institution établissement
The University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2020
Award amount
29000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1202
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Physical sciences
Area of application fr
Sciences physiques
Research subject code
3007
Research subject group en
Statistics and probability
Research subject group fr
Stochastic processes
Research subject en
Statistique et probabilité
Research subject fr
Processus stochastiques
Application title
Particle systems and universality of the cutoff phenomenon
Keyword
Cutoff; Cycle decomposition; Markov chains; Mixing times; Particle systems; Phase transitions; Random graphs; Random walks; Robustness; Statistical mechanics
Application summary
The objective of the proposed research program is to develop general techniques for bounding mixing times and establishing universality of the cutoff phenomenon. Our purpose is also to apply these techniques to a wide range of important models of random graphs and particle systems including ones whose analysis is beyond the reach of the techniques currently available in the literature, including: the interchange, exclusion and zero-range processes, random Cayley graphs and a large class of quasi random graphs. For exclusion process, our goal is to establish the cutoff phenomenon when the base graphs are fixed dimensional tori/boxes of diverging side lengths. For the exclusion and the interchange processes we aim to resolve a conjecture of Oliveira that asserts that the mixing time is bounded by that of (the same number of) independent particles. For the interchange process we also aim to prove an operator version of Aldous' spectral-gap conjecture which will have striking consequences not only regarding the mixing time, but also regarding the emergence of macroscopic cycles in the cycle decomposition obtained by running the interchange process (for inverse of the spectral-gap time units). We aim to establish universality of cutoff for the zero range process. Currently even the order of the mixing time is understood in a handful of examples. The proposed method should have numerous applications. We also intend to establish universality of the cutoff phenomenon for a wide range of random graphs including random Cayley graphs. Lastly, we intend to study the important question of robustness of mixing times of (random walks on) vertex-transitive graphs, which is at least conceptually related to the famous question concerning stability of the Liouville property, and may shed some light on it.