Alexis Prévost
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Alexis Prévost has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Drewitz
Department Mathematik/Informatik, Universität zu Köln
14 shared publications - Pierre-François Rodriguez
University of Cambridge, UK
11 shared publications Alexander Drewitz
Universität zu Köln
1 shared publication- Christopher Chalhoub
Department of Mathematics Imperial College London SW7 2AZ London United Kingdom
1 shared publication F. Viklund
KTH Royal Institute of Technology
1 shared publication- Gioele Gallo
Department Mathematik/Informatik, Universität zu Köln, Weyertal 86–90, 50931 Köln, Germany
1 shared publication
Latest Publications
- Open Access
- 27 June 2026
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 195 (3-4) , 1189-1274
Phase transition for the late points of random walk
Let X be a random walk on the torus of side length N in dimension $$d\geqslant 3$$ with uniform starting point, and $$t_{\textrm{cov}}$$ be the expected value of its cover time, which is the first time that X has visited every vertex of the torus at least once. For $$\alpha > 0$$ , the set $$\mathcal {L}^{\alpha }$$ of $$\alpha $$ -late points consists of those points not visited by X at time $$\alpha t_{\textrm{cov}}$$ . We prove the existence of a value $$\alpha _{{*}} \in (\frac{1}{2},1)$$ across which $$\mathcal {L}^{\alpha }$$ trivialises as follows: for all $$\alpha > \alpha _{{*}}$$ and $$\varepsilon \geqslant N^{-c}$$ there exists a coupling of $$\mathcal {L}^\alpha $$ and two occupation sets $$\mathcal {B}^{\alpha _\pm }$$ of i.i.d. Bernoulli fields having the same density as $$\mathcal {L}^{\alpha \pm \varepsilon }$$ , which is asymptotic to $$N^{-(\alpha \pm \varepsilon )d}$$ , with the property that the inclusion $$ \mathcal {B}^{\alpha _+} \subseteq \mathcal {L}^{\alpha } \subseteq \mathcal {B}^{\alpha _-}$$ holds with high probability as $$N \rightarrow \infty $$ . On the contrary, when $$\alpha \leqslant \alpha _*$$ there is no such coupling. Corresponding results also hold for the vacant set of random interlacements at high intensities. The transition at $$\alpha _{{*}}$$ corresponds to the (dis-)appearance of ‘double-points’ (i.e. neighboring pairs of points) in $$\mathcal {L}^\alpha $$ . We further describe the law of $$\mathcal {L}^{\alpha }$$ for $$\alpha >\frac{1}{2}$$ by adding independent patterns to $$\mathcal {B}^{\alpha _{\pm }}$$ . In dimensions $$d \geqslant 4$$ these are exactly all two-point sets. When $$d=3$$ one must also include all connected three-point sets, but no other.- 27 June 2026
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 195 (3-4) , 1189-1274
Open AccessPhase transition for the late points of random walk
Let X be a random walk on the torus of side length N in dimension $$d\geqslant 3$$ with uniform starting point, and $$t_{\textrm{cov}}$$ be the expected value of its cover time, which is the first time that X has visited every vertex of the torus at least once. For $$\alpha > 0$$ , the set $$\mathcal {L}^{\alpha }$$ of $$\alpha $$ -late points consists of those points not visited by X at time $$\alpha t_{\textrm{cov}}$$ . We prove the existence of a value $$\alpha _{{*}} \in (\frac{1}{2},1)$$ across which $$\mathcal {L}^{\alpha }$$ trivialises as follows: for all $$\alpha > \alpha _{{*}}$$ and $$\varepsilon \geqslant N^{-c}$$ there exists a coupling of $$\mathcal {L}^\alpha $$ and two occupation sets $$\mathcal {B}^{\alpha _\pm }$$ of i.i.d. Bernoulli fields having the same density as $$\mathcal {L}^{\alpha \pm \varepsilon }$$ , which is asymptotic to $$N^{-(\alpha \pm \varepsilon )d}$$ , with the property that the inclusion $$ \mathcal {B}^{\alpha _+} \subseteq \mathcal {L}^{\alpha } \subseteq \mathcal {B}^{\alpha _-}$$ holds with high probability as $$N \rightarrow \infty $$ . On the contrary, when $$\alpha \leqslant \alpha _*$$ there is no such coupling. Corresponding results also hold for the vacant set of random interlacements at high intensities. The transition at $$\alpha _{{*}}$$ corresponds to the (dis-)appearance of ‘double-points’ (i.e. neighboring pairs of points) in $$\mathcal {L}^\alpha $$ . We further describe the law of $$\mathcal {L}^{\alpha }$$ for $$\alpha >\frac{1}{2}$$ by adding independent patterns to $$\mathcal {B}^{\alpha _{\pm }}$$ . In dimensions $$d \geqslant 4$$ these are exactly all two-point sets. When $$d=3$$ one must also include all connected three-point sets, but no other. - Top Cited PapersOpen Access
- 1 March 2026
- Published by Institute of Mathematical Statistics in The Annals of Probability
- Vol. 54 (2) , 644-668
Arm exponent for the Gaussian free field on metric graphs in intermediate dimensions
We investigate the bond percolation model on transient weighted graphs G induced by the excursion sets of the Gaussian free field on the corresponding metric graph. We assume that balls in G have polynomial volume growth with growth exponent α and that the Green’s function for the random walk on G exhibits a power law decay with exponent ν, in the regime 1≤ν≤α2. In particular, this includes the cases of G=Z3 for which ν=1, and G=Z4 for which ν=α2=2. For all such graphs, we determine the leading-order asymptotic behavior for the critical one-arm probability, which we prove decays with distance R, like R−ν2+o(1). Our results are, in fact, more precise and yield logarithmic corrections when ν>1 as well as corrections of order loglogR when ν=1. We further obtain very sharp upper bounds on truncated two-point functions close to criticality, which are new when ν>1 and essentially optimal when ν=1. This extends previous results from (Invent. Math. 232 (2023) 229–299; Ann. Probab. 48 (2020) 1411–1435).
- 1 March 2026
- Published by Institute of Mathematical Statistics in The Annals of Probability
- Vol. 54 (2) , 644-668
Top Cited PapersOpen AccessArm exponent for the Gaussian free field on metric graphs in intermediate dimensions
We investigate the bond percolation model on transient weighted graphs G induced by the excursion sets of the Gaussian free field on the corresponding metric graph. We assume that balls in G have polynomial volume growth with growth exponent α and that the Green’s function for the random walk on G exhibits a power law decay with exponent ν, in the regime 1≤ν≤α2. In particular, this includes the cases of G=Z3 for which ν=1, and G=Z4 for which ν=α2=2. For all such graphs, we determine the leading-order asymptotic behavior for the critical one-arm probability, which we prove decays with distance R, like R−ν2+o(1). Our results are, in fact, more precise and yield logarithmic corrections when ν>1 as well as corrections of order loglogR when ν=1. We further obtain very sharp upper bounds on truncated two-point functions close to criticality, which are new when ν>1 and essentially optimal when ν=1. This extends previous results from (Invent. Math. 232 (2023) 229–299; Ann. Probab. 48 (2020) 1411–1435).
- Open Access
- 5 November 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 196 (3-4) , 1
Correction: Critical one-arm probability for the metric Gaussian free field in low dimensions
- 5 November 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 196 (3-4) , 1
Open AccessCorrection: Critical one-arm probability for the metric Gaussian free field in low dimensions
- Open Access
- 15 July 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 195 (1-2) , 497-520
Critical one-arm probability for the metric Gaussian free field in low dimensions
We investigate the bond percolation model on transient weighted graphs G induced by the excursion sets of the Gaussian free field on the corresponding metric graph. Under the sole assumption that its sign clusters do not percolate, we derive an extension of Lupu’s formula for the two-point function at criticality. We then focus on the low-dimensional case $$0< \nu < \frac{\alpha }{2}$$ , where $$\alpha $$ governs the polynomial volume growth of G and $$\nu $$ the decay rate of the Green’s function on G . In particular, this includes the benchmark case $${G}=\mathbb {Z}^3$$ , for which $$\alpha =3$$ and $$\nu = \alpha -2=1$$ . We prove under these assumptions that the critical one-arm probability decays with distance R like $$R^{-\frac{\nu }{2}}$$ , up to multiplicative constants.- 15 July 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 195 (1-2) , 497-520
Open AccessCritical one-arm probability for the metric Gaussian free field in low dimensions
We investigate the bond percolation model on transient weighted graphs G induced by the excursion sets of the Gaussian free field on the corresponding metric graph. Under the sole assumption that its sign clusters do not percolate, we derive an extension of Lupu’s formula for the two-point function at criticality. We then focus on the low-dimensional case $$0< \nu < \frac{\alpha }{2}$$ , where $$\alpha $$ governs the polynomial volume growth of G and $$\nu $$ the decay rate of the Green’s function on G . In particular, this includes the benchmark case $${G}=\mathbb {Z}^3$$ , for which $$\alpha =3$$ and $$\nu = \alpha -2=1$$ . We prove under these assumptions that the critical one-arm probability decays with distance R like $$R^{-\frac{\nu }{2}}$$ , up to multiplicative constants. - Open Access
- 11 January 2025
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 406 (2) , 1-75
First Passage Percolation, Local Uniqueness for Interlacements and Capacity of Random Walk
The study of first passage percolation (FPP) for the random interlacements model has been initiated in Andres and Prévost (Ann Appl Probab 34(2):1846–1895), where it is shown that on $$\mathbb {Z}^d$$ , $$d\ge 3$$ , the FPP distance is comparable to the graph distance with high probability. In this article, we give an asymptotically sharp lower bound on this last probability, which additionally holds on a large class of transient graphs with polynomial volume growth and polynomial decay of the Green function. When considering the interlacement set in the low-intensity regime, the previous bound is in fact valid throughout the near-critical phase. In low dimension, we also present two applications of this FPP result: sharp large deviation bounds on local uniqueness of random interlacements, and on the capacity of a random walk in a ball.- 11 January 2025
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 406 (2) , 1-75
Open AccessFirst Passage Percolation, Local Uniqueness for Interlacements and Capacity of Random Walk
The study of first passage percolation (FPP) for the random interlacements model has been initiated in Andres and Prévost (Ann Appl Probab 34(2):1846–1895), where it is shown that on $$\mathbb {Z}^d$$ , $$d\ge 3$$ , the FPP distance is comparable to the graph distance with high probability. In this article, we give an asymptotically sharp lower bound on this last probability, which additionally holds on a large class of transient graphs with polynomial volume growth and polynomial decay of the Green function. When considering the interlacement set in the low-intensity regime, the previous bound is in fact valid throughout the near-critical phase. In low dimension, we also present two applications of this FPP result: sharp large deviation bounds on local uniqueness of random interlacements, and on the capacity of a random walk in a ball. - Open Access
Cluster volumes for the Gaussian free field on metric graphs
We study the volume of the critical clusters for the percolation of the level sets of the Gaussian free field on metric graphs. On $\mathbb{Z}^d$ below the upper-critical dimension $d=6$, we show that the largest such cluster in a box of side length $r$ has volume of order $r^{\frac{d+2}{2}}$, as conjectured by Werner in arXiv:2002.11487. This is in contrast to the mean-field regime $d>6$, where this volume is of order $r^4$. We further obtain precise asymptotic tails for the volume of the critical cluster of the origin, and a lower bound on the tail of the volume of the near-critical cluster of the origin below the upper-critical dimension. Our proof extends to any graph with polynomial volume growth and polynomial decay of the Green's function as long as the critical one-arm probability decays as the square root of the Green's function, which is satisfied in low enough dimension.Open AccessCluster volumes for the Gaussian free field on metric graphs
We study the volume of the critical clusters for the percolation of the level sets of the Gaussian free field on metric graphs. On $\mathbb{Z}^d$ below the upper-critical dimension $d=6$, we show that the largest such cluster in a box of side length $r$ has volume of order $r^{\frac{d+2}{2}}$, as conjectured by Werner in arXiv:2002.11487. This is in contrast to the mean-field regime $d>6$, where this volume is of order $r^4$. We further obtain precise asymptotic tails for the volume of the critical cluster of the origin, and a lower bound on the tail of the volume of the near-critical cluster of the origin below the upper-critical dimension. Our proof extends to any graph with polynomial volume growth and polynomial decay of the Green's function as long as the critical one-arm probability decays as the square root of the Green's function, which is satisfied in low enough dimension. - Open Access
- 15 June 2024
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 192 (1-2) , 625-720
Geometry of Gaussian free field sign clusters and random interlacements
For a large class of amenable transient weighted graphs G, we prove that the sign clusters of the Gaussian free field on G fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign), and finite sign clusters are necessarily tiny, with overwhelming probability. Examples of graphs belonging to this class include regular lattices such as $${\mathbb {Z}}^d$$ , for $$d\ge 3$$ , but also more intricate geometries, such as Cayley graphs of suitably growing (finitely generated) non-Abelian groups, and cases in which random walks exhibit anomalous diffusive behavior, for instance various fractal graphs. As a consequence, we also show that the vacant set of random interlacements on these objects, introduced by Sznitman (Ann Math 171(3):2039–2087, 2010), and which is intimately linked to the free field, contains an infinite connected component at small intensities. In particular, this result settles an open problem from Sznitman (Invent Math 187(3):645–706, 2012).- 15 June 2024
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 192 (1-2) , 625-720
Open AccessGeometry of Gaussian free field sign clusters and random interlacements
For a large class of amenable transient weighted graphs G, we prove that the sign clusters of the Gaussian free field on G fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign), and finite sign clusters are necessarily tiny, with overwhelming probability. Examples of graphs belonging to this class include regular lattices such as $${\mathbb {Z}}^d$$ , for $$d\ge 3$$ , but also more intricate geometries, such as Cayley graphs of suitably growing (finitely generated) non-Abelian groups, and cases in which random walks exhibit anomalous diffusive behavior, for instance various fractal graphs. As a consequence, we also show that the vacant set of random interlacements on these objects, introduced by Sznitman (Ann Math 171(3):2039–2087, 2010), and which is intimately linked to the free field, contains an infinite connected component at small intensities. In particular, this result settles an open problem from Sznitman (Invent Math 187(3):645–706, 2012). - Open Access
- 1 June 2024
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 34 (3) , 2844-2884
Generating Galton–Watson trees using random walks and percolation for the Gaussian free field
The study of Gaussian free field level sets on supercritical Galton–Watson trees has been initiated by Abächerli and Sznitman in 2018. By means of entirely different tools, we continue this investigation and generalize their main result on the positivity of the associated percolation critical parameter h∗ to the setting of arbitrary supercritical offspring distribution and random conductances. In our setting, this establishes a rigorous proof of the physics literature mantra that positive correlations facilitate percolation when compared to the independent case. Our proof proceeds by constructing the Galton–Watson tree through an exploration via finite random walk trajectories. This exploration of the tree progressively unveils an infinite connected component in the random interlacements set on the tree, which is stable under small quenched noise. Using a Dynkin-type isomorphism theorem, we then infer the strict positivity of the critical parameter h∗. As a byproduct, we obtain transience results for the above-mentioned sets.
- 1 June 2024
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 34 (3) , 2844-2884
Open AccessGenerating Galton–Watson trees using random walks and percolation for the Gaussian free field
The study of Gaussian free field level sets on supercritical Galton–Watson trees has been initiated by Abächerli and Sznitman in 2018. By means of entirely different tools, we continue this investigation and generalize their main result on the positivity of the associated percolation critical parameter h∗ to the setting of arbitrary supercritical offspring distribution and random conductances. In our setting, this establishes a rigorous proof of the physics literature mantra that positive correlations facilitate percolation when compared to the independent case. Our proof proceeds by constructing the Galton–Watson tree through an exploration via finite random walk trajectories. This exploration of the tree progressively unveils an infinite connected component in the random interlacements set on the tree, which is stable under small quenched noise. Using a Dynkin-type isomorphism theorem, we then infer the strict positivity of the critical parameter h∗. As a byproduct, we obtain transience results for the above-mentioned sets.
- Open Access
Universality classes for percolation models with long-range correlations
We consider a class of percolation models where the local occupation variables have long-range correlations decaying as a power law $\sim r^{-a}$ at large distances $r$, for some $0< a< d$ where $d$ is the underlying spatial dimension. For several of these models, we present both, rigorous analytical results and matching simulations that determine the critical exponents characterizing the fixed point associated to their phase transition, which is of second order. The exact values we obtain are rational functions of the two parameters $a$ and $d$ alone, and do not depend on the specifics of the model.Open AccessUniversality classes for percolation models with long-range correlations
We consider a class of percolation models where the local occupation variables have long-range correlations decaying as a power law $\sim r^{-a}$ at large distances $r$, for some $0< a< d$ where $d$ is the underlying spatial dimension. For several of these models, we present both, rigorous analytical results and matching simulations that determine the critical exponents characterizing the fixed point associated to their phase transition, which is of second order. The exact values we obtain are rational functions of the two parameters $a$ and $d$ alone, and do not depend on the specifics of the model. - Open Access
Generating Galton-Watson trees using random walks and percolation for the Gaussian free field
The study of Gaussian free field level sets on supercritical Galton-Watson trees has been initiated by Ab\"acherli and Sznitman in Ann. Inst. Henri Poincar\'{e} Probab. Stat., 54(1):173--201, 2018. By means of entirely different tools, we continue this investigation and generalize their main result on the positivity of the associated percolation critical parameter $h_*$ to the setting of arbitrary supercritical offspring distribution and random conductances. A fortiori, this provides a positive answer to the open question raised at the end of the aforementioned article. What is more, in our setting it also establishes a rigorous proof of the physics literature mantra that positive correlations facilitate percolation when compared to the independent case. Our proof proceeds by constructing the Galton-Watson tree through an exploration via finite random walk trajectories. This exploration of the tree progressively unveils an infinite connected component in the random interlacements set on the tree, which is stable under small quenched noise. Using a Dynkin-type isomorphism theorem, we then infer the strict positivity of the critical parameter $ h_* .$ As a byproduct of our proof we obtain the transience of the random interlacement set and the level sets of the Gaussian free field above small positive levels on such Galton-Watson trees.Open AccessGenerating Galton-Watson trees using random walks and percolation for the Gaussian free field
The study of Gaussian free field level sets on supercritical Galton-Watson trees has been initiated by Ab\"acherli and Sznitman in Ann. Inst. Henri Poincar\'{e} Probab. Stat., 54(1):173--201, 2018. By means of entirely different tools, we continue this investigation and generalize their main result on the positivity of the associated percolation critical parameter $h_*$ to the setting of arbitrary supercritical offspring distribution and random conductances. A fortiori, this provides a positive answer to the open question raised at the end of the aforementioned article. What is more, in our setting it also establishes a rigorous proof of the physics literature mantra that positive correlations facilitate percolation when compared to the independent case. Our proof proceeds by constructing the Galton-Watson tree through an exploration via finite random walk trajectories. This exploration of the tree progressively unveils an infinite connected component in the random interlacements set on the tree, which is stable under small quenched noise. Using a Dynkin-type isomorphism theorem, we then infer the strict positivity of the critical parameter $ h_* .$ As a byproduct of our proof we obtain the transience of the random interlacement set and the level sets of the Gaussian free field above small positive levels on such Galton-Watson trees.