Bruno Schapira
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
Bruno Schapira has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Amine Asselah
UMR 8050 Université Paris-Est LAMA UPEC UPEMLV CNRS F-94010 Créteil
23 shared publications - Perla Sousi
University of Cambridge Cambridge UK
11 shared publications - Cécile Mailler
Department of Mathematical Sciences University of Bath Claverton Down BA2 7AY Bath UK
3 shared publications - Daniel Valesin
Department of Statistics, University of Warwick, Coventry, UK
3 shared publications - Amine Asselah2 shared publications
Daniel Kious
Department of Mathematical Sciences University of Bath Claverton Down BA2 7AY Bath UK
2 shared publications
Latest Publications
- 12 August 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 195 (1-2) , 413-449
Catalan percolation
- 12 August 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 195 (1-2) , 413-449
Catalan percolation
- 21 May 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 194 (3-4) , 1443-1493
Local times and capacity for transient branching random walks
- 21 May 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 194 (3-4) , 1443-1493
Local times and capacity for transient branching random walks
- Open Access
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 30 (none) , 1-23
Recurrence and transience of the critical random walk snake in random conductances
In this paper we study the recurrence and transience of the Zd-valued branching random walk in random environment indexed by a critical Bienaymé-Galton-Watson tree, conditioned to survive. The environment is made either of random conductances or of random traps on each vertex. We show that when the offspring distribution is non degenerate with a finite third moment and the environment satisfies some suitable technical assumptions, then the process is recurrent up to dimension four, and transient otherwise. The proof is based on a truncated second moment method, which only requires to have good estimates on the quenched Green’s function.
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 30 (none) , 1-23
Open AccessRecurrence and transience of the critical random walk snake in random conductances
In this paper we study the recurrence and transience of the Zd-valued branching random walk in random environment indexed by a critical Bienaymé-Galton-Watson tree, conditioned to survive. The environment is made either of random conductances or of random traps on each vertex. We show that when the offspring distribution is non degenerate with a finite third moment and the environment satisfies some suitable technical assumptions, then the process is recurrent up to dimension four, and transient otherwise. The proof is based on a truncated second moment method, which only requires to have good estimates on the quenched Green’s function.
- 24 December 2024
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 191 (3-4) , 1289-1322
Branching random walks and Minkowski sum of random walks
- 24 December 2024
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 191 (3-4) , 1289-1322
Branching random walks and Minkowski sum of random walks
- Open Access
On the intersection of critical percolation clusters and other tree-like random graphs
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random walk ranges. We obtain sharp excess deviation bounds on the number of intersection points of two or more clusters, under minimal assumption on the two-point function. The proof are based on new bounds on the n-point function, in case of critical percolation, and on the joint moments of local times of branching random walks
Open AccessOn the intersection of critical percolation clusters and other tree-like random graphs
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random walk ranges. We obtain sharp excess deviation bounds on the number of intersection points of two or more clusters, under minimal assumption on the two-point function. The proof are based on new bounds on the n-point function, in case of critical percolation, and on the joint moments of local times of branching random walks
- 23 October 2024
- Published by Societe Mathematique de France in Bulletin de la Société Mathématiques de France
- Vol. 152 (3)
Branching capacity of a random walk range
- 23 October 2024
- Published by Societe Mathematique de France in Bulletin de la Société Mathématiques de France
- Vol. 152 (3)
Branching capacity of a random walk range
- Open Access
On the intersection of critical percolation clusters and other tree-like random graphs
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random walk ranges. We obtain sharp excess deviation bounds on the number of intersection points of two or more clusters, under minimal assumption on the two-point function. The proofs are based on new bounds on the n-point function, in case of critical percolation, and on the joint moments of local times of branching random walks.
Open AccessOn the intersection of critical percolation clusters and other tree-like random graphs
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random walk ranges. We obtain sharp excess deviation bounds on the number of intersection points of two or more clusters, under minimal assumption on the two-point function. The proofs are based on new bounds on the n-point function, in case of critical percolation, and on the joint moments of local times of branching random walks.
- Open Access
Sharp estimates for distinguished random walks on affine buildings of type Ar
We study a distinguished random walk on affine buildings of type Ar , which was already considered by Cartwright, Saloff-Coste and Woess. In rank r=2, it is the simple random walk and we obtain optimal global bounds for its transition density (same upper and lower bound, up to multiplicative constants). In the higher rank case, we obtain sharp uniform bounds in fairly large space-time regions which are sufficient for most applications.
Open AccessSharp estimates for distinguished random walks on affine buildings of type Ar
We study a distinguished random walk on affine buildings of type Ar , which was already considered by Cartwright, Saloff-Coste and Woess. In rank r=2, it is the simple random walk and we obtain optimal global bounds for its transition density (same upper and lower bound, up to multiplicative constants). In the higher rank case, we obtain sharp uniform bounds in fairly large space-time regions which are sufficient for most applications.
- Open Access
The trace-reinforced ants process does not find shortest paths
In this paper, we study a probabilistic reinforcement-learning model for ants searching for the shortest path(s) between their nest and a source of food. In this model, the nest and the source of food are two distinguished nodes $N$ and $F$ in a finite graph $\mathcal G$. The ants perform a sequence of random walks on this graph, starting from the nest and stopped when first hitting the source of food. At each step of its random walk, the $n$-th ant chooses to cross a neighbouring edge with probability proportional to the number of preceding ants that crossed that edge at least once. We say that {\it the ants find the shortest path} if, almost surely as the number of ants grow to infinity, almost all the ants go from the nest to the source of food through one of the shortest paths, without loosing time on other edges of the graph. Our contribution is three-fold: (1) We prove that, if $\mathcal G$ is a tree rooted at $N$ whose leaves have been merged into node $F$, and with one edge between $N$ and $F$, then the ants indeed find the shortest path. (2) In contrast, we provide three examples of graphs on which the ants do not find the shortest path, suggesting that in this model and in most graphs, ants do not find the shortest path. (3) In all these cases, we show that the sequence of normalised edge-weights converge to a {\it deterministic} limit, despite a linear-reinforcement mechanism, and we conjecture that this is a general fact which is valid on all finite graphs. To prove these results, we use stochastic approximation methods, and in particular the ODE method. One difficulty comes from the fact that this method relies on understanding the behaviour at large times of the solution of a non-linear, multi-dimensional ODE.Open AccessThe trace-reinforced ants process does not find shortest paths
In this paper, we study a probabilistic reinforcement-learning model for ants searching for the shortest path(s) between their nest and a source of food. In this model, the nest and the source of food are two distinguished nodes $N$ and $F$ in a finite graph $\mathcal G$. The ants perform a sequence of random walks on this graph, starting from the nest and stopped when first hitting the source of food. At each step of its random walk, the $n$-th ant chooses to cross a neighbouring edge with probability proportional to the number of preceding ants that crossed that edge at least once. We say that {\it the ants find the shortest path} if, almost surely as the number of ants grow to infinity, almost all the ants go from the nest to the source of food through one of the shortest paths, without loosing time on other edges of the graph. Our contribution is three-fold: (1) We prove that, if $\mathcal G$ is a tree rooted at $N$ whose leaves have been merged into node $F$, and with one edge between $N$ and $F$, then the ants indeed find the shortest path. (2) In contrast, we provide three examples of graphs on which the ants do not find the shortest path, suggesting that in this model and in most graphs, ants do not find the shortest path. (3) In all these cases, we show that the sequence of normalised edge-weights converge to a {\it deterministic} limit, despite a linear-reinforcement mechanism, and we conjecture that this is a general fact which is valid on all finite graphs. To prove these results, we use stochastic approximation methods, and in particular the ODE method. One difficulty comes from the fact that this method relies on understanding the behaviour at large times of the solution of a non-linear, multi-dimensional ODE. - Open Access
The contact process on dynamic regular graphs: monotonicity and subcritical phase
We study the contact process on a dynamic random~$d$-regular graph with an edge-switching mechanism, as well as an interacting particle system that arises from the local description of this process, called the herds process. Both these processes were introduced in~\cite{da2021contact}; there it was shown that the herds process has a phase transition with respect to the infectivity parameter~$λ$, depending on the parameter~$\mathsf{v}$ that governs the edge dynamics. Improving on a result of~\cite{da2021contact}, we prove that the critical value of~$λ$ is strictly decreasing with~$\mathsf{v}$. We also prove that in the subcritical regime, the extinction time of the herds process started from a single individual has an exponential tail. Finally, we apply these results to study the subcritical regime of the contact process on the dynamic $d$-regular graph. We show that, starting from all vertices infected, the infection goes extinct in a time that is logarithmic in the number of vertices of the graph, with high probability.
Open AccessThe contact process on dynamic regular graphs: monotonicity and subcritical phase
We study the contact process on a dynamic random~$d$-regular graph with an edge-switching mechanism, as well as an interacting particle system that arises from the local description of this process, called the herds process. Both these processes were introduced in~\cite{da2021contact}; there it was shown that the herds process has a phase transition with respect to the infectivity parameter~$λ$, depending on the parameter~$\mathsf{v}$ that governs the edge dynamics. Improving on a result of~\cite{da2021contact}, we prove that the critical value of~$λ$ is strictly decreasing with~$\mathsf{v}$. We also prove that in the subcritical regime, the extinction time of the herds process started from a single individual has an exponential tail. Finally, we apply these results to study the subcritical regime of the contact process on the dynamic $d$-regular graph. We show that, starting from all vertices infected, the infection goes extinct in a time that is logarithmic in the number of vertices of the graph, with high probability.