Vincent Tassion
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
Vincent Tassion has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Hugo Duminil-Copin
Institut des Hautes Études Scientifiques, Bures-sur-Yvette, France
5 shared publications - Augusto Teixeira
IMPA Estrada Dona Castorina 110 22460-320 Rio de Janeiro RJ Brazil
2 shared publications - Hugo Duminil-Copin
Institut des Hautes Études Scientifiques, Bures-sur-Yvette, France
2 shared publications - Aran Raoufi1 shared publication
- Daniel Ahlberg
University of Gothenburg and Chalmers University of Technology
1 shared publication - Itai Benjamini
Weizmann Institute of Science
1 shared publication
Latest Publications
- 23 March 2018
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 359 (2) , 821-822
Correction to: A New Proof of the Sharpness of the Phase Transition for Bernoulli Percolation and the Ising Model
- 23 March 2018
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 359 (2) , 821-822
Correction to: A New Proof of the Sharpness of the Phase Transition for Bernoulli Percolation and the Ising Model
- Open Access
A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
We provide a new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model. The proof applies to infinite range models on arbitrary locally finite transitive infinite graphs. For Bernoulli percolation, we prove finiteness of the susceptibility in the subcritical regime $\beta<\beta_c$, and the mean-field lower bound $\mathbb{P}_\beta[0\longleftrightarrow\infty]\ge (\beta-\beta_c)/\beta$ for $\beta>\beta_c$. For finite-range models, we also prove that for any $\beta<\beta_c$, the probability of an open path from the origin to distance $n$ decays exponentially fast in $n$. For the Ising model, we prove finiteness of the susceptibility for $\beta<\beta_c$, and the mean-field lower bound $\langle \sigma_0\rangle_\beta^+\ge \sqrt{(\beta^2-\beta_c^2)/\beta^2}$ for $\beta>\beta_c$. For finite-range models, we also prove that the two-point correlations functions decay exponentially fast in the distance for $\beta<\beta_c$.Open AccessA new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
We provide a new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model. The proof applies to infinite range models on arbitrary locally finite transitive infinite graphs. For Bernoulli percolation, we prove finiteness of the susceptibility in the subcritical regime $\beta<\beta_c$, and the mean-field lower bound $\mathbb{P}_\beta[0\longleftrightarrow\infty]\ge (\beta-\beta_c)/\beta$ for $\beta>\beta_c$. For finite-range models, we also prove that for any $\beta<\beta_c$, the probability of an open path from the origin to distance $n$ decays exponentially fast in $n$. For the Ising model, we prove finiteness of the susceptibility for $\beta<\beta_c$, and the mean-field lower bound $\langle \sigma_0\rangle_\beta^+\ge \sqrt{(\beta^2-\beta_c^2)/\beta^2}$ for $\beta>\beta_c$. For finite-range models, we also prove that the two-point correlations functions decay exponentially fast in the distance for $\beta<\beta_c$. - 29 June 2017
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 171 (3-4) , 685-708
The box-crossing property for critical two-dimensional oriented percolation
- 29 June 2017
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 171 (3-4) , 685-708
The box-crossing property for critical two-dimensional oriented percolation
- Open Access
The box-crossing property for critical two-dimensional oriented percolation
We consider critical oriented Bernoulli percolation on the square lattice $\mathbb{Z}^2$. We prove a Russo-Seymour-Welsh type result which allows us to derive several new results concerning the critical behavior: - We establish that the probability that the origin is connected to distance $n$ decays polynomially fast in $n$. - We prove that the critical cluster of the origin conditioned to survive to distance $n$ has a typical width $w_n$ satisfying $\epsilon n^{2/5} < w_n < n^{1-\epsilon}$ for some $\epsilon > 0$. The sub-linear polynomial fluctuations contrast with the supercritical regime where $w_n$ is known to behave linearly in $n$. It is also different from the critical picture obtained for non-oriented Bernoulli percolation, in which the scaling limit is non-degenerate in both directions. All our results extend to the graphical representation of the one-dimensional contact process.Open AccessThe box-crossing property for critical two-dimensional oriented percolation
We consider critical oriented Bernoulli percolation on the square lattice $\mathbb{Z}^2$. We prove a Russo-Seymour-Welsh type result which allows us to derive several new results concerning the critical behavior: - We establish that the probability that the origin is connected to distance $n$ decays polynomially fast in $n$. - We prove that the critical cluster of the origin conditioned to survive to distance $n$ has a typical width $w_n$ satisfying $\epsilon n^{2/5} < w_n < n^{1-\epsilon}$ for some $\epsilon > 0$. The sub-linear polynomial fluctuations contrast with the supercritical regime where $w_n$ is known to behave linearly in $n$. It is also different from the critical picture obtained for non-oriented Bernoulli percolation, in which the scaling limit is non-degenerate in both directions. All our results extend to the graphical representation of the one-dimensional contact process. - Open AccessA new computation of the critical point for the planar random-cluster model with $q\ge1$We present a new computation of the critical value of the random-cluster model with cluster weight $q\ge 1$ on $\mathbb{Z}^2$. This provides an alternative approach to the result of Beffara and Duminil-Copin. We believe that this approach has several advantages. First, most of the proof can easily be extended to other planar graphs with sufficient symmetries. Furthermore, it invokes RSW-type arguments which are not based on self-duality. And finally, it contains a new way of applying sharp threshold results which avoid the use of symmetric events and periodic boundary conditions.Open AccessA new computation of the critical point for the planar random-cluster model with $q\ge1$We present a new computation of the critical value of the random-cluster model with cluster weight $q\ge 1$ on $\mathbb{Z}^2$. This provides an alternative approach to the result of Beffara and Duminil-Copin. We believe that this approach has several advantages. First, most of the proof can easily be extended to other planar graphs with sufficient symmetries. Furthermore, it invokes RSW-type arguments which are not based on self-duality. And finally, it contains a new way of applying sharp threshold results which avoid the use of symmetric events and periodic boundary conditions.
- 9 April 2016
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 69 (7) , 1397-1411
Absence of Infinite Cluster for Critical Bernoulli Percolation on Slabs
We prove that for Bernoulli percolation on a graph , there is no infinite cluster at criticality, almost surely. The proof extends to finite‐range Bernoulli percolation models on ℤ2 that are invariant under ‐rotation and reflection.
- 9 April 2016
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 69 (7) , 1397-1411
Absence of Infinite Cluster for Critical Bernoulli Percolation on Slabs
We prove that for Bernoulli percolation on a graph , there is no infinite cluster at criticality, almost surely. The proof extends to finite‐range Bernoulli percolation models on ℤ2 that are invariant under ‐rotation and reflection.
- Top Cited Papers
- 5 November 2015
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 343 (2) , 725-745
A New Proof of the Sharpness of the Phase Transition for Bernoulli Percolation and the Ising Model
- 5 November 2015
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 343 (2) , 725-745
Top Cited PapersA New Proof of the Sharpness of the Phase Transition for Bernoulli Percolation and the Ising Model
- Open Access
Crossing probabilities for Voronoi percolation
We prove that the standard Russo-Seymour-Welsh theory is valid for Voronoi percolation. This implies that at criticality the crossing probabilities for rectangles are bounded by constants depending only on their aspect ratio. This result has many consequences, such as the polynomial decay of the one-arm event at criticality.
Open AccessCrossing probabilities for Voronoi percolation
We prove that the standard Russo-Seymour-Welsh theory is valid for Voronoi percolation. This implies that at criticality the crossing probabilities for rectangles are bounded by constants depending only on their aspect ratio. This result has many consequences, such as the polynomial decay of the one-arm event at criticality.
- Open Access
Homogenization via sprinkling
We show that a superposition of an $\varepsilon$-Bernoulli bond percolation and any everywhere percolating subgraph of $\mathbb Z^d$, $d\ge 2$, results in a connected subgraph, which after a renormalization dominates supercritical Bernoulli percolation. This result, which confirms a conjecture of the first author together with H\"aggstr\"om and Schramm (2000), is mainly motivated by obtaining finite volume characterizations of uniqueness for general percolation processes.Open AccessHomogenization via sprinkling
We show that a superposition of an $\varepsilon$-Bernoulli bond percolation and any everywhere percolating subgraph of $\mathbb Z^d$, $d\ge 2$, results in a connected subgraph, which after a renormalization dominates supercritical Bernoulli percolation. This result, which confirms a conjecture of the first author together with H\"aggstr\"om and Schramm (2000), is mainly motivated by obtaining finite volume characterizations of uniqueness for general percolation processes. - Open Access
Quenched Voronoi percolation
We prove that the probability of crossing a large square in quenched Voronoi percolation converges to 1/2 at criticality, confirming a conjecture of Benjamini, Kalai and Schramm from 1999. The main new tools are a quenched version of the box-crossing property for Voronoi percolation at criticality, and an Efron-Stein type bound on the variance of the probability of the crossing event in terms of the sum of the squares of the influences. As a corollary of the proof, we moreover obtain that the quenched crossing event at criticality is almost surely noise sensitive.
Open AccessQuenched Voronoi percolation
We prove that the probability of crossing a large square in quenched Voronoi percolation converges to 1/2 at criticality, confirming a conjecture of Benjamini, Kalai and Schramm from 1999. The main new tools are a quenched version of the box-crossing property for Voronoi percolation at criticality, and an Efron-Stein type bound on the variance of the probability of the crossing event in terms of the sum of the squares of the influences. As a corollary of the proof, we moreover obtain that the quenched crossing event at criticality is almost surely noise sensitive.