Related papers: Percolation on self-dual polygon configurations
We argue that presymmetry, a hidden predynamical electroweak quark-lepton symmetry that explains the fractional charges and triplication of families, must be extended beyond the Standard Model as to have a residual presymmetry that embraces…
We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.
We study a generalization of site percolation on a simple cubic lattice, where not only single sites are removed randomly, but also entire parallel columns of sites. We show that typical clusters near the percolation transition are very…
We introduce the \emph{leaf-excluded} percolation model, which corresponds to independent bond percolation conditioned on the absence of leaves (vertices of degree one). We study the leaf-excluded model on the square and simple-cubic…
A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…
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…
Eulerian percolation on Z 2 with parameter p is the classical Bernoulli bond percolation with parameter p conditioned on the fact that every site has an even degree. We first explain why Eulerian percolation with parameter p coincides with…
Let $d\geq 2$. We consider an i.i.d. supercritical bond percolation on $\mathbb{Z}^d$, every edge is open with a probability $p>p_c(d)$, where $p_c(d)$ denotes the critical point. We condition on the event that $0$ belongs to the infinite…
Duality properties of the $SU(2)$ Principal Chiral Model are investigated starting from a one-parameter family of its equivalent Hamiltonian descriptions generated by a non-Abelian deformation of the cotangent space $T^*SU(2) \simeq SU(2)…
On a locally finite, infinite tree $T$, let $p_c(T)$ denote the critical probability for Bernoulli percolation. We prove that every positively associated, finite-range dependent percolation model on $T$ with marginals $p > p_c(T)$ must…
In 1991 Aizenman and Grimmett claimed that any `essential enhancement' of site or bond percolation on a lattice lowers the critical probability, an important result with many implications, such as strict inequalities between critical…
We study the near-critical FK-Ising model. First, a determination of the correlation length defined via crossing probabilities is provided. Second, a phenomenon about the near-critical behavior of FK-Ising is highlighted, which is…
In conventional site percolation, all lattice sites are occupied with the same probability. For a bipartite lattice, sublattice-selective percolation instead involves two independent occupation probabilities, depending on the sublattice to…
Three-dimensional bond or site percolation theory on a lattice can be interpreted as a gauge theory in which the Wilson loops are viewed as counters of topological linking with random clusters. Beyond the percolation threshold large Wilson…
A 1-independent bond percolation model on a graph $G$ is a probability distribution on the spanning subgraphs of $G$ in which, for all vertex-disjoint sets of edges $S_1$ and $S_2$, the states of the edges in $S_1$ are independent of the…
Using the saddle point method, we give an explicit form of the planar free energy and Wilson loops of unitary matrix models in the one-cut regime. The multi-critical unitary matrix models are shown to undergo third-order phase transitions…
We generalize the switching lemma of Griffiths, Hurst and Sherman to the random current representation of the Ashkin-Teller model. We then use it together with properties of two-dimensional topology to derive linear relations for…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
The optimal matching of point clouds in $\mathbb{R}^d$ is a combinatorial problem; applications in statistics motivate to consider random point clouds, like the Poisson point process. There is a crucial dependance on dimension $d$, with…
In the previous author's paper the Macdonald norm conjecture (including the famous constant term conjecture) was proved. This paper contains the proof of the remaining two (the duality and evaluation conjectures). The evaluation theorem is…