相关论文: Random Cluster Models on the Triangular Lattice

A new model that describes adsorption and clustering of particles on a surface is introduced. A {\it clustering} transition is found which separates between a phase of weakly correlated particle distributions and a phase of strongly…

We calculate thermodynamic properties of soft-core lattice bosons with on-site $n$-body interactions using up to twelfth and tenth order strong coupling expansion in one and two dimensional cubic lattices at zero temperature. Using linked…

The social percolation model \citep{solomon-et-00} considers a 2-dimensional regular lattice. Each site is occupied by an agent with a preference $x_{i}$ sampled from a uniform distribution $U[0,1]$. Agents transfer the information about…

We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…

We investigate the percolation behavior of Fortuin-Kasteleyn--type clusters in the spin-$1/2$ Baxter--Wu model with three-spin interactions on a triangular lattice. The considered clusters are constructed by randomly freezing one of the…

We study the problem of folding of the regular triangular lattice in the presence of a quenched random bending rigidity + or - K and a magnetic field h (conjugate to the local normal vectors to the triangles). The randomness in the bending…

Rigidity percolation provides an important basis for understanding the onset of mechanical stability in disordered materials. While most studies on the triangular lattice have focused on static properties at fixed bond~(site) occupation…

We develop a novel cluster expansion for finite-spin lattice systems subject to multi-body quantum -- and, in particular, classical -- interactions. Our approach is based on the use of ``decoupling parameters", advocated by Park [34], which…

The random-cluster model has been widely studied as a unifying framework for random graphs, spin systems and electrical networks, but its dynamics have so far largely resisted analysis. In this paper we analyze the Glauber dynamics of the…

We discuss the interrelation between phase transitions in interacting lattice or continuum models, and the existence of infinite clusters in suitable random-graph models. In particular, we describe a random-geometric approach to the phase…

A self-energy-functional approach is applied to construct cluster approximations for correlated lattice models. It turns out that the cluster-perturbation theory (Senechal et al, PRL 84, 522 (2000)) and the cellular dynamical mean-field…

A generic lattice model for systems containing particles interacting with short-range attraction long-range repulsion (SALR) potential that can be solved exactly in one dimension is introduced. We assume attraction J_1 between the first…

While clusters of galaxies are considered one of the most important cosmological probes, the standard spherical modelling of the dark matter and the intracluster medium is only a rough approximation. Indeed, it is well established both…

Real-world networks, e.g. the social relations or world-wide-web graphs, exhibit both small-world and scale-free behaviour. We interpret lattice triangulations as planar graphs by identifying triangulation vertices with graph nodes and…

We describe a 3D percolation-type approach to modeling of the processes of aging and certain other properties of tissues analyzed as systems consisting of interacting cells. Lattice sites are designated as regular (healthy) cells, senescent…

The system is described by three mass-shell constraints. After a nonlinear transformation of the momenta, the analytic form taken by admissible interactions (allowing compatibility) is characterized in terms of the new variables. These…

We generalize the standard site percolation model on the $d$-dimensional lattice to a model on random tessellations of $\mathbb R^d$. We prove the uniqueness of the infinite cluster by adapting the Burton-Keane argument…

Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…

We show that for critical site percolation on the triangular lattice two new observables have conformally invariant scaling limits. In particular the expected number of clusters separating two pairs of points converges to an explicit…

A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…