Related papers: Cluster Percolation in O(n) Spin Models
Information percolation is a new method for analyzing stochastic spin systems through classifying and controlling the clusters of information-flow in the space-time slab. It yielded sharp mixing estimates (cutoff with an $O(1)$-window) for…
Randomly diluted quantum boson and spin models in two dimensions combine the physics of classical percolation with the well-known dimensionality dependence of ordering in quantum lattice models. This combination is rather subtle for models…
Motivated by the idea of using simple macroscopic examples to illustrate the physics of complex systems, we modify a historic experimental setup in which interacting floating magnets spontaneously self-assemble into ordered clusters. By…
An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The…
The existence (or not) of infinite clusters is explored for two stochastic models of intersecting line segments in $d \ge 2$ dimensions. Salient features of the phase diagram are established in each case. The models are based on site…
Spin states of two-dimensional Wigner clusters are considered at low temperatures, when all electrons are in ground coordinate states. The spin subsystem behavior is determined by antiferromagnetic exchange integrals. The spin states in…
In recent times out-of-time-order correlators (OTOC) have been established as a tool to understand butterfly effects, quantum information scrambling, and many-body localization. They can also be useful in determining different phases of…
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…
The fractal dimensions and the percolation exponents of the geometrical spin clusters of like sign at criticality, are obtained numerically for an Ising model with temperature-dependent annealed bond dilution, also known as the thermalized…
We investigate the geometry of a typical spin cluster in random triangulations sampled with a probability proportional to the energy of an Ising configuration on their vertices, both in the finite and infinite volume settings. This model is…
The uniform even subgraph is intimately related to the Ising model, the random-cluster model, the random current model, and the loop $\mathrm{O}$(1) model. In this paper, we first prove that the uniform even subgraph of $Z^d$ percolates for…
We consider geometrical clusters (i.e. domains of parallel spins) in the square lattice random field Ising model by varying the strength of the Gaussian random field, $\Delta$. In agreement with the conclusion of previous investigation…
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…
We study the geometry of the critical clusters in fully coordinated percolation on the square lattice. By Monte Carlo simulations (static exponents) and normal mode analysis (dynamic exponents), we find that this problem is in the same…
Using a simulation technique introduced recently, we study winding clusters in percolation on the torus and the Moebius strip for different aspect ratios. The asynchronous parallelization of the simulation makes very large system and sample…
We study infinite ``$+$'' or ``$-$'' clusters for an Ising model on an connected, transitive, non-amenable, planar, one-ended graph $G$ with finite vertex degree. If the critical percolation probability $p_c^{site}$ for the i.i.d.~Bernoulli…
The percolation of Kandel, Ben-Av and Domany clusters for 2d fully frustrated Ising model is extensively studied through numerical simulations. Critical exponents, cluster distribution and fractal dimension of percolative cluster are given.
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…
The cluster algorithm in the fully frustrated Ising model on the square lattice is essentially different from the ones used in other systems. Thus its better understanding is particularly important for finding new lines of development.…
In cluster tomography, we propose measuring the number of clusters $N$ intersected by a line segment of length $\ell$ across a finite sample. As expected, the leading order of $N(\ell)$ scales as $a\ell$, where $a$ depends on microscopic…