Augusto Teixeira
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
Augusto Teixeira has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Marcelo R. Hilario
Departement of Mathematics, Universidade Federal de Minas Gerais
4 shared publications - Hugo Duminil-Copin
Institut des Hautes Études Scientifiques, Bures-sur-Yvette, France
3 shared publications - Ivailo Hartarsky
Institut für Stochastik und Wirtschaftsmathematik Technische Universität Wien Wiedner Hauptstraße 8-10 A-1040 Vienna Austria
3 shared publications - Rangel Baldasso
Department of Mathematics, PUC-Rio
3 shared publications - Vladas Sidoravicius
IMPA
3 shared publications - Hans Jürgen Herrmann
Universidade Federal do Ceará
2 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (5) , 4120-4159
Fluctuation bounds for symmetric random walks on dynamic environments via Russo–Seymour–Welsh
In this article we prove a lower bound for the fluctuations of symmetric random walks on dynamic random environments in dimension 1+1 in the perturbative regime where the walker is weakly influenced by the environment. We suppose that the random environment is invariant with respect to translations and reflections, satisfy the FKG inequality and a mild mixing condition. The techniques employed are inspired by percolation theory, including a Russo–Seymour–Welsh (RSW) inequality. To exemplify the generality of our results, we provide two families of fields that satisfy our hypotheses: a class of Gaussian fields and confetti percolation models.
- 1 October 2026
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 36 (5) , 4120-4159
Fluctuation bounds for symmetric random walks on dynamic environments via Russo–Seymour–Welsh
In this article we prove a lower bound for the fluctuations of symmetric random walks on dynamic random environments in dimension 1+1 in the perturbative regime where the walker is weakly influenced by the environment. We suppose that the random environment is invariant with respect to translations and reflections, satisfy the FKG inequality and a mild mixing condition. The techniques employed are inspired by percolation theory, including a Russo–Seymour–Welsh (RSW) inequality. To exemplify the generality of our results, we provide two families of fields that satisfy our hypotheses: a class of Gaussian fields and confetti percolation models.
- Top Cited PapersOpen Access
- 28 January 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
- Vol. 5 (2) , 1-24
Dave: A Decentralized, Secure, and Lively Fraud-Proof Algorithm
In this article, we introduce a new fraud-proof algorithm that offers an excellent balance between decentralization, security, and liveness. The resources that must be mobilized by an honest participant to defeat an adversary grow logarithmically relative to the adversary’s ultimate losses. Therefore, there is no need to introduce high bonds to prevent an adversary from creating too many Sybils. This design ensures broad accessibility, freeing participants from the need to pool resources among themselves to engage with the protocol. Additionally, the maximum delay to finalization grows only logarithmically with total adversarial expenditure. Moreover, the factor multiplying the logarithm is the smallest to date. In summary, the entire dispute completes within at most two to five challenge periods; the only way to break consensus is to censor the honest party for more than one challenge period, and the costs of engaging in the dispute are minimal.
- 28 January 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
- Vol. 5 (2) , 1-24
Top Cited PapersOpen AccessDave: A Decentralized, Secure, and Lively Fraud-Proof Algorithm
In this article, we introduce a new fraud-proof algorithm that offers an excellent balance between decentralization, security, and liveness. The resources that must be mobilized by an honest participant to defeat an adversary grow logarithmically relative to the adversary’s ultimate losses. Therefore, there is no need to introduce high bonds to prevent an adversary from creating too many Sybils. This design ensures broad accessibility, freeing participants from the need to pool resources among themselves to engage with the protocol. Additionally, the maximum delay to finalization grows only logarithmically with total adversarial expenditure. Moreover, the factor multiplying the logarithm is the smallest to date. In summary, the entire dispute completes within at most two to five challenge periods; the only way to break consensus is to censor the honest party for more than one challenge period, and the costs of engaging in the dispute are minimal.
- Open Access
Holder continuity of interfaces for scale-invariant Poisson stick soup
We study the interface of covered and vacant sets in the subcritical phase of a scale-invariant Poisson stick soup on the plane. This model is a natural candidate for scaling limit of some planar models and has connections with long-range percolation on the plane with critical parameter $s=4$. We analyze a family of exploration paths on boxes and prove tightness for this family and Holder continuity for its limiting measures.Open AccessHolder continuity of interfaces for scale-invariant Poisson stick soup
We study the interface of covered and vacant sets in the subcritical phase of a scale-invariant Poisson stick soup on the plane. This model is a natural candidate for scaling limit of some planar models and has connections with long-range percolation on the plane with critical parameter $s=4$. We analyze a family of exploration paths on boxes and prove tightness for this family and Holder continuity for its limiting measures. - 17 September 2025
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 192 (10) , 1-42
Can One Condition a Killed Random Walk to Survive?
- 17 September 2025
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 192 (10) , 1-42
Can One Condition a Killed Random Walk to Survive?
- Open Access
- 19 March 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 134 (11) , 117102
Locality Approach to the Bootstrap Percolation Paradox
We revisit the bootstrap percolation model, leveraging recent mathematical advances linking it with its local counterpart. This new perspective resolves, for the first time, historic discrepancies between Monte Carlo simulations and theoretical results: previously, those predictions disagreed even in the first-order asymptotics of the model. In contrast, our framework achieves excellent agreement between numerics and theory, which now match up to the third-order expansion, as the infection probability approaches zero. Our algorithm allows us to generate novel predictions for the model.
- 19 March 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 134 (11) , 117102
Open AccessLocality Approach to the Bootstrap Percolation Paradox
We revisit the bootstrap percolation model, leveraging recent mathematical advances linking it with its local counterpart. This new perspective resolves, for the first time, historic discrepancies between Monte Carlo simulations and theoretical results: previously, those predictions disagreed even in the first-order asymptotics of the model. In contrast, our framework achieves excellent agreement between numerics and theory, which now match up to the third-order expansion, as the infection probability approaches zero. Our algorithm allows us to generate novel predictions for the model.
- Open Access
Locality approach to the bootstrap percolation paradox
We revisit the Bootstrap Percolation model, leveraging recent mathematical advances linking it with its local counterpart. This new perspective resolves, for the first time, historic discrepancies between Monte Carlo simulations and theoretical results: previously, those predictions disagreed even in the first-order asymptotics of the model. In contrast, our framework achieves excellent agreement between numerics and theory, which now match up to the third-order expansion, as the infection probability approaches zero. Our algorithm allows us to generate novel predictions for the model.
Open AccessLocality approach to the bootstrap percolation paradox
We revisit the Bootstrap Percolation model, leveraging recent mathematical advances linking it with its local counterpart. This new perspective resolves, for the first time, historic discrepancies between Monte Carlo simulations and theoretical results: previously, those predictions disagreed even in the first-order asymptotics of the model. In contrast, our framework achieves excellent agreement between numerics and theory, which now match up to the third-order expansion, as the infection probability approaches zero. Our algorithm allows us to generate novel predictions for the model.
- Open Access
Bootstrap percolation is local
Metastability thresholds lie at the heart of bootstrap percolation theory. Yet proving precise lower bounds is notoriously hard. We show that for two of the most classical models, two-neighbour and Froböse, upper bounds are sharp to essentially arbitrary precision, by linking them to their local counterparts. In Froböse bootstrap percolation, iteratively, any vertex of the square lattice that is the only healthy vertex of a $1\times1$ square becomes infected and infections never heal. We prove that if vertices are initially infected independently with probability $p\to0$, then with high probability the origin becomes infected after \[\exp\left(\frac{π^2}{6p}-\frac{π\sqrt{2+\sqrt2}}{\sqrt p}+\frac{O(\log^2(1/p))}{\sqrt[3]p}\right)\] time steps. We achieve this by proposing a new paradigmatic view on bootstrap percolation based on locality. Namely, we show that studying the Froböse model is equivalent in an extremely strong sense to studying its local version. As a result, we completely bypass Holroyd's classical but technical hierarchy method, yielding the first term above and systematically used throughout bootstrap percolation for the last two decades. Instead, the proof features novel links to large deviation theory, eigenvalue perturbations and others. We also use the locality viewpoint to resolve the so-called bootstrap percolation paradox. Indeed, we propose and implement an exact (deterministic) algorithm which exponentially outperforms previous Monte Carlo approaches. This allows us to clearly showcase and quantify the slow convergence we prove rigorously. The same approach applies, with more extensive computations, to the two-neighbour model, in which vertices are infected when they have at least two infected neighbours and do not recover. We expect it to be applicable to a wider range of models and correspondingly conclude with a number of open problems.Open AccessBootstrap percolation is local
Metastability thresholds lie at the heart of bootstrap percolation theory. Yet proving precise lower bounds is notoriously hard. We show that for two of the most classical models, two-neighbour and Froböse, upper bounds are sharp to essentially arbitrary precision, by linking them to their local counterparts. In Froböse bootstrap percolation, iteratively, any vertex of the square lattice that is the only healthy vertex of a $1\times1$ square becomes infected and infections never heal. We prove that if vertices are initially infected independently with probability $p\to0$, then with high probability the origin becomes infected after \[\exp\left(\frac{π^2}{6p}-\frac{π\sqrt{2+\sqrt2}}{\sqrt p}+\frac{O(\log^2(1/p))}{\sqrt[3]p}\right)\] time steps. We achieve this by proposing a new paradigmatic view on bootstrap percolation based on locality. Namely, we show that studying the Froböse model is equivalent in an extremely strong sense to studying its local version. As a result, we completely bypass Holroyd's classical but technical hierarchy method, yielding the first term above and systematically used throughout bootstrap percolation for the last two decades. Instead, the proof features novel links to large deviation theory, eigenvalue perturbations and others. We also use the locality viewpoint to resolve the so-called bootstrap percolation paradox. Indeed, we propose and implement an exact (deterministic) algorithm which exponentially outperforms previous Monte Carlo approaches. This allows us to clearly showcase and quantify the slow convergence we prove rigorously. The same approach applies, with more extensive computations, to the two-neighbour model, in which vertices are infected when they have at least two infected neighbours and do not recover. We expect it to be applicable to a wider range of models and correspondingly conclude with a number of open problems. - Open Access
Finite range interlacements and couplings
In this article, we consider the interlacement set $\mathcal{I}^u$ at level $u>0$ on $\mathbb{Z}^d$, $d \geq3$, and its finite range version $\mathcal{I}^{u,L}$ for $L >0$, given by the union of the ranges of a Poisson cloud of random walks on $\mathbb{Z}^d$ having intensity $u/L$ and killed after $L$ steps. As $L\to \infty$, the random set $\mathcal{I}^{u,L}$ has a non-trivial (local) limit, which is precisely $\mathcal{I}^u$. A natural question is to understand how the sets $\mathcal{I}^{u,L}$ and $\mathcal{I}^{u}$ can be related, if at all, in such a way that their intersections with a box of large radius $R$ almost coincide. We address this question, which depends sensitively on $R$, by developing couplings allowing for a similar comparison to hold with very high probability for $\mathcal{I}^{u,L}$ and $\mathcal{I}^{{u'},2L}$, with $u' \approx u$. In particular, for the vacant set $\mathcal{V}^u=\mathbb{Z}^d \setminus \mathcal{I}^u$ with values of $u$ near the critical threshold, our couplings remain effective at scales $R \gg \sqrt{L}$, which corresponds to a natural barrier across which the walks of length $L$ comprised in $\mathcal{I}^{u,L}$ de-solidify inside $B_R$, i.e. lose their intrinsic long-range structure to become increasingly "dust-like". These mechanisms are complementary to the solidification effects recently exhibited in arXiv:1706.07229. By iterating the resulting couplings over dyadic scales $L$, the models $\mathcal{I}^{u,L}$ are seen to constitute a stationary finite range approximation of $\mathcal{I}^u$ at large spatial scales near the critical point $u_*$. Among others, these couplings are important ingredients for the characterization of the phase transition for percolation of the vacant sets of random walk and random interlacements in two upcoming companion articles.Open AccessFinite range interlacements and couplings
In this article, we consider the interlacement set $\mathcal{I}^u$ at level $u>0$ on $\mathbb{Z}^d$, $d \geq3$, and its finite range version $\mathcal{I}^{u,L}$ for $L >0$, given by the union of the ranges of a Poisson cloud of random walks on $\mathbb{Z}^d$ having intensity $u/L$ and killed after $L$ steps. As $L\to \infty$, the random set $\mathcal{I}^{u,L}$ has a non-trivial (local) limit, which is precisely $\mathcal{I}^u$. A natural question is to understand how the sets $\mathcal{I}^{u,L}$ and $\mathcal{I}^{u}$ can be related, if at all, in such a way that their intersections with a box of large radius $R$ almost coincide. We address this question, which depends sensitively on $R$, by developing couplings allowing for a similar comparison to hold with very high probability for $\mathcal{I}^{u,L}$ and $\mathcal{I}^{{u'},2L}$, with $u' \approx u$. In particular, for the vacant set $\mathcal{V}^u=\mathbb{Z}^d \setminus \mathcal{I}^u$ with values of $u$ near the critical threshold, our couplings remain effective at scales $R \gg \sqrt{L}$, which corresponds to a natural barrier across which the walks of length $L$ comprised in $\mathcal{I}^{u,L}$ de-solidify inside $B_R$, i.e. lose their intrinsic long-range structure to become increasingly "dust-like". These mechanisms are complementary to the solidification effects recently exhibited in arXiv:1706.07229. By iterating the resulting couplings over dyadic scales $L$, the models $\mathcal{I}^{u,L}$ are seen to constitute a stationary finite range approximation of $\mathcal{I}^u$ at large spatial scales near the critical point $u_*$. Among others, these couplings are important ingredients for the characterization of the phase transition for percolation of the vacant sets of random walk and random interlacements in two upcoming companion articles. - Open Access
Phase transition for percolation on a randomly stretched lattice
Let $\{\xi_i\}_{i \geq 1}$ be a sequence of i.i.d.\ positive random variables. Starting from the usual square lattice replace each horizontal edge that links a site in $i$-th vertical column to another in the $(i+1)$-th vertical column by an edge having length $\xi_i$. Then declare independently each edge $e$ in the resulting lattice open with probability $p_e=p^{|e|}$ where $p\in[0,1]$ and $|e|$ is the length of $e$. We relate the occurrence of nontrivial phase transition for this model to moment properties of $\xi_1$. More precisely, we prove that the model undergoes a nontrivial phase transition when $\mathbb{E}(\xi_1^\eta)<\infty$, for some $\eta>1$ whereas, when $\mathbb{E}(\xi_1^\eta)=\infty$ for some $\eta<1$, no phase transition occurs.Open AccessPhase transition for percolation on a randomly stretched lattice
Let $\{\xi_i\}_{i \geq 1}$ be a sequence of i.i.d.\ positive random variables. Starting from the usual square lattice replace each horizontal edge that links a site in $i$-th vertical column to another in the $(i+1)$-th vertical column by an edge having length $\xi_i$. Then declare independently each edge $e$ in the resulting lattice open with probability $p_e=p^{|e|}$ where $p\in[0,1]$ and $|e|$ is the length of $e$. We relate the occurrence of nontrivial phase transition for this model to moment properties of $\xi_1$. More precisely, we prove that the model undergoes a nontrivial phase transition when $\mathbb{E}(\xi_1^\eta)<\infty$, for some $\eta>1$ whereas, when $\mathbb{E}(\xi_1^\eta)=\infty$ for some $\eta<1$, no phase transition occurs. - Open Access
Spread of an infection on the zero range process
We study the spread of an infection on top of a moving population. The environment evolves as a zero range process on the integer lattice starting in equilibrium. At time zero, the set of infected particles is composed by those which are on the negative axis, while particles at the right of the origin are considered healthy. A healthy particle immediately becomes infected if it shares a site with an infected particle. We prove that the front of the infection wave travels to the right with positive and finite velocity. As a central step in the proof of these results, we prove a space-time decoupling for the zero range process which is interesting on its own. Using a sprinkling technique, we derive an estimate on the correlation of functions of the space of trajectories whose supports are sufficiently far away.
Open AccessSpread of an infection on the zero range process
We study the spread of an infection on top of a moving population. The environment evolves as a zero range process on the integer lattice starting in equilibrium. At time zero, the set of infected particles is composed by those which are on the negative axis, while particles at the right of the origin are considered healthy. A healthy particle immediately becomes infected if it shares a site with an infected particle. We prove that the front of the infection wave travels to the right with positive and finite velocity. As a central step in the proof of these results, we prove a space-time decoupling for the zero range process which is interesting on its own. Using a sprinkling technique, we derive an estimate on the correlation of functions of the space of trajectories whose supports are sufficiently far away.