Related papers: Sharp thresholds for the random-cluster and Ising …
In this work we consider the two-dimensional percolation model arising from the majority dynamics process at a given time $t\in\mathbb{R}_+$. We show the emergence of a sharp threshold phenomenon for the box crossing event at the critical…
Consider the discrete cube $\{-1,1\}^N$ and a random collection of half spaces which includes each half space $H(x) := \{y \in \{-1,1\}^N: x \cdot y \geq \kappa \sqrt{N}\}$ for $x \in \{-1,1\}^N$ independently with probability $p$. Is the…
The class of random-cluster models is a unification of a variety of stochastic processes of significance for probability and statistical physics, including percolation, Ising, and Potts models; in addition, their study has impact on the…
In this paper, we prove sharpness of the phase transition for the random-cluster model in summable positive external fields, with cluster weight q=2,3,..., on the hypercubic lattice. That is, there exists some nontrivial critical parameter…
We prove an inequality on decision trees on monotonic measures which generalizes the OSSS inequality on product spaces. As an application, we use this inequality to prove a number of new results on lattice spin models and their…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
The purpose of this modest note is to provide a short proof of the sharpness of the phase transition for the Random-cluster model with $q=2$ by extending the approach developed by Duminil-Copin and Tassion for $q=1$. This in particular…
We prove that random-cluster models with q larger than 1 on a variety of planar lattices have a sharp phase transition, that is that there exists some parameter p_c below which the model exhibits exponential decay and above which there…
A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of independently generated candidates, falling within a given set.…
Let $d\geq 3$ be a constant and let $F$ be a $d$-regular graph on $[n]$ with not too many symmetries. By the union bound, the probability threshold for the existence of a spanning subgraph in $G(n,p)$ isomorphic to $F$ is at least…
We consider a two-dimensional Ising model with random i.i.d. nearest-neighbor ferromagnetic couplings and no external magnetic field. We show that, if the probability of supercritical couplings is small enough, the system admits a…
Consider a random sequence of $N$ integers, each chosen uniformly and independently from the set $\{1,\dots,x\}$. Motivated by applications to factorisation algorithms such as Dixon's algorithm, the quadratic sieve, and the number field…
We prove sharpness of the phase transition for the random-cluster model with $q \geq 1$ on graphs of the form $\mathcal{S} := \mathcal{G} \times S$, where $\mathcal{G}$ is a planar lattice with mild symmetry assumptions, and $S$ a finite…
The orthant model is a directed percolation model on $\mathbb{Z}^d$, in which all clusters are infinite. We prove a sharp threshold result for this model: if $p$ is larger than the critical value above which the cluster of $0$ is contained…
An unsupervised classification method for point events occurring on a network of lines is proposed. The idea relies on the distributional flexibility and practicality of random partition models to discover the clustering structure featuring…
The Ising model is a celebrated example of a Markov random field, introduced in statistical physics to model ferromagnetism. This is a discrete exponential family with binary outcomes, where the sufficient statistic involves a quadratic…
We consider two models with disorder dominated critical points and study the distribution of clusters which are confined in strips and touch one or both boundaries. For the classical random bond Potts model in the large-q limit we study…
The critical surface for random-cluster model with cluster-weight $q\ge 4$ on isoradial graphs is identified using parafermionic observables. Correlations are also shown to decay exponentially fast in the subcritical regime. While this…
We investigate threshold phenomena for random polytopes $K_N=\conv\{X_1,\dots,X_N\}$ generated by i.i.d.\ samples from an atomic law $\mu$. We identify and provide a missing justification in the discrete-hypercube threshold argument of…
In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable…