English
Related papers

Related papers: Iterative Site Percolation on Triangular Lattice

200 papers

Critical site percolation on the triangular lattice is described by the Yang-Baxter solvable dilute $A_2^{(2)}$ loop model with crossing parameter specialized to $\lambda=\frac\pi3$, corresponding to the contractible loop fugacity…

Mathematical Physics · Physics 2023-05-10 Alexi Morin-Duchesne , Andreas Klümper , Paul A. Pearce

In recent years, important progress has been made in the field of two-dimensional statistical physics. One of the most striking achievements is the proof of the Cardy-Smirnov formula. This theorem, together with the introduction of…

Probability · Mathematics 2013-06-10 Vincent Beffara , Hugo Duminil-Copin

We describe infinite clusters which arise in nearest-neighbour percolation for so-called cocycle measures on the square lattice. These measures arise naturally in the study of random transformations. We show that infinite clusters have a…

Probability · Mathematics 2007-05-23 Ronald Meester

We study the generalisation of Baxter's three-colour problem to a random lattice. Rephrasing the problem as a matrix model problem we discuss the analyticity structure and the critical behaviour of the resulting matrix model. Based on a set…

Statistical Mechanics · Physics 2009-10-30 B. Eynard , C. Kristjansen

We consider discrete random fractal surfaces with negative Hurst exponent $H<0$. A random colouring of the lattice is provided by activating the sites at which the surface height is greater than a given level $h$. The set of activated sites…

Statistical Mechanics · Physics 2020-10-14 Nina Javerzat , Sebastian Grijalva , Alberto Rosso , Raoul Santachiara

We investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…

Statistical Mechanics · Physics 2007-05-23 S. K. Nechaev , O. A. Vasilyev

Sites in an infinite d-dimensional lattice, open with probability greater or equal to 1/d, form an infinite open path.

Mathematical Physics · Physics 2013-08-29 Marko Puljic

We determine thresholds $p_c$ for random-site percolation on a triangular lattice for all available neighborhoods containing sites from the first to the fifth coordination zones, including their complex combinations. There are 31 distinct…

Statistical Mechanics · Physics 2021-05-12 K. Malarz

We present a study of site and bond percolation on periodic lattices with (on average) fewer than three nearest neighbors per site. We have studied this issue in two contexts: By simulating oxides with a mixture of 2-coordinated and…

Statistical Mechanics · Physics 2015-06-19 Ted Y. Yoo , Jonathan Tran , Shane P. Stahlheber , Carina E. Kaainoa , Kevin Djepang , Alexander R. Small

A random growth lattice filling model of percolation with touch and stop growth rule is developed and studied numerically on a two dimensional square lattice. Nucleation centers are continuously added one at a time to the empty sites and…

Statistical Mechanics · Physics 2018-06-13 Bappaditya Roy , S. B. Santra

In this article, we revisit random site and bond percolation in square lattice focusing primarily on the behavior of entropy and order parameter. In the case of traditional site percolation, we find that both the quantities are zero at…

Statistical Mechanics · Physics 2019-12-10 M. S. Rahman , M. K. Hassan

Recently Mertens and Moore [arXiv:1909.01484v1] showed that site percolation "is odd." By this they mean that on an $M\times N$ square lattice the number of distinct site configurations that allow for vertical percolation is odd. We report…

Statistical Mechanics · Physics 2020-09-04 C. Appert-Rolland , H. J. Hilhorst

Percolation problems appear in a large variety of different contexts ranging from the design of composite materials to vaccination strategies on community networks. The key observable for many applications is the percolation threshold.…

Statistical Mechanics · Physics 2025-06-16 Fabian Coupette , Tanja Schilling

We prove a remarkable combinatorial symmetry in the number of spanning configurations in site percolation: for a large class of lattices, the number of spanning configurations with an odd or even number of occupied sites differs by $\pm 1$.…

Statistical Mechanics · Physics 2019-12-11 Stephan Mertens , Cristopher Moore

We study the percolative properties of bi-dimensional systems generated by a random sequential adsorption of line-segments on a square lattice. As the segment length grows, the percolation threshold decreases, goes through a minimum and…

Condensed Matter · Physics 2009-10-22 Y. Leroyer , E. Pommiers

Classical blockmodel is known as the simplest among models of networks with community structure. The model can be also seen as an extremely simply example of interconnected networks. For this reason, it is surprising that the percolation…

Disordered Systems and Neural Networks · Physics 2014-09-23 Maksymilian Bujok , Piotr Fronczak , Agata Fronczak

A local order parameter which is important in the analysis of phase transitions in frustrated combinatorial problems is the probability that a node is frozen in a particular state. There is a percolative transition when an infinite…

Disordered Systems and Neural Networks · Physics 2007-05-23 P. M. Duxbury

We consider the percolation problem in the high-temperature Ising model on the two-dimensional square lattice at or near critical external fields. The incipient infinite cluster (IIC) measure in the sense of Kesten is constructed. As a…

Probability · Mathematics 2013-07-30 Yasunari Higuchi , Kazunari Kinoshita , Masato Takei , Yu Zhang

We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…

Disordered Systems and Neural Networks · Physics 2018-12-19 Aurelio W. T. de Noronha , André A. Moreira , André P. Vieira , Hans J. Herrmann , José S. Andrade , Humberto A. Carmona

A necessary and sufficient condition is established for the strict inequality $p_c(G_*)<p_c(G)$ between the critical probabilities of site percolation on a quasi-transitive, plane graph $G$ and on its matching graph $G_*$. It is assumed…

Probability · Mathematics 2024-02-21 Geoffrey R. Grimmett , Zhongyang Li