English
Related papers

Related papers: High-precision percolation thresholds and Potts-mo…

200 papers

A transfer-matrix simulation scheme for the three-dimensional (d=3) bond percolation is presented. Our scheme is based on Novotny's transfer-matrix formalism, which enables us to consider arbitrary (integral) number of sites N constituting…

Statistical Mechanics · Physics 2009-11-11 Yoshihiro Nishiyama

We numerically examine the large-q asymptotics of the q-state random bond Potts model. Special attention is paid to the parametrisation of the critical line, which is determined by combining the loop representation of the transfer matrix…

Disordered Systems and Neural Networks · Physics 2009-10-31 Jesper Lykke Jacobsen , Marco Picco

The $Q$-state Potts model on the simple-cubic lattice is studied using the zeros of the exact partition function on a finite lattice. The critical behavior of the model in the ferromagnetic and antiferromagnetic phases is discussed based on…

Statistical Mechanics · Physics 2015-06-24 Seung-Yeon Kim

Extended Chebyshev spaces that also comprise the constants represent large families of functions that can be used in real-life modeling or engineering applications that also involve important (e.g. transcendental) integral or rational…

Numerical Analysis · Mathematics 2015-08-25 Ágoston Róth

We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the…

Probability · Mathematics 2023-03-21 Alexander Drewitz , Alexis Prévost , Pierre-François Rodriguez

By bootstrap percolation we mean the following deterministic process on a graph $G$. Given a set $A$ of vertices "infected" at time 0, new vertices are subsequently infected, at each time step, if they have at least $r\in\mathbb{N}$…

Combinatorics · Mathematics 2009-08-31 József Balogh , Béla Bollobás , Robert Morris

In this work we present PercIS, an algorithm based on Importance Sampling to approximate the percolation centrality of all the nodes of a graph. Percolation centrality is a generalization of betweenness centrality to attributed graphs, and…

Social and Information Networks · Computer Science 2025-09-16 Antonio Cruciani , Leonardo Pellegrina

We consider Bayesian estimation of a $p\times p$ precision matrix, when $p$ can be much larger than the available sample size $n$. It is well known that consistent estimation in such ultra-high dimensional situations requires regularization…

Statistics Theory · Mathematics 2014-11-07 Sayantan Banerjee , Subhashis Ghosal

We study representations of Temperley-Lieb algebras associated with the transfer matrix formulation of statistical mechanics on arbitrary lattices. We first discuss a new hyperfinite algebra, the Diagram algebra $D_{\underline{n}}(Q)$,…

High Energy Physics - Theory · Physics 2016-09-06 P. Martin , Herbert Saleur

We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a…

Probability · Mathematics 2020-04-03 Srikanth K. Iyer , Sanjoy Kr. Jhawar

We propose an iterative proposal to estimate critical points for statistical models based on configurations by combing machine-learning tools. Firstly, phase scenarios and preliminary boundaries of phases are obtained by…

Disordered Systems and Neural Networks · Physics 2019-10-23 X. L. Zhao , L. B. Fu

We derive the equation of state of a two-dimensional Bose gas in an optical lattice in the framework of the Bose-Hubbard model. We focus on the vicinity of the multicritical points where the quantum phase transition between the Mott…

Quantum Gases · Physics 2015-06-16 A. Rancon , N. Dupuis

Recent advances on the glass problem motivate reexamining classical models of percolation. Here, we consider the displacement of an ant in a labyrinth near the percolation threshold on cubic lattices both below and above the upper critical…

Statistical Mechanics · Physics 2019-02-20 Giulio Biroli , Patrick Charbonneau , Yi Hu

We show analytically that the $[0,1]$, $[1,1]$ and $[2,1]$ Pad{\'e} approximants of the mean cluster number $S(p)$ for site and bond percolation on general $d$-dimensional lattices are upper bounds on this quantity in any Euclidean…

Statistical Mechanics · Physics 2015-06-12 Salvatore Torquato , Yang Jiao

In the paper random-site percolation thresholds for simple cubic lattice with sites' neighborhoods containing next-next-next-nearest neighbors (4NN) are evaluated with Monte Carlo simulations. A recently proposed algorithm with low sampling…

Statistical Mechanics · Physics 2015-04-08 K. Malarz

Given two independent Poisson point processes $\Phi^{(1)},\Phi^{(2)}$ in $R^d$, the continuum AB percolation model is the graph with points of $\Phi^{(1)}$ as vertices and with edges between any pair of points for which the intersection of…

Probability · Mathematics 2010-12-20 Srikanth K. Iyer , D. Yogeshwaran

We use a new algorithm to find the stress-carrying backbone of ``generic'' site-diluted triangular lattices of up to 10^6 sites. Generic lattices can be made by randomly displacing the sites of a regular lattice. The percolation threshold…

Statistical Mechanics · Physics 2009-10-28 Cristian F. Moukarzel , Phillip M. Duxbury

We study the q-state Potts model with nearest-neighbor coupling v=e^{\beta J}-1 in the limit q,v \to 0 with the ratio w = v/q held fixed. Combinatorially, this limit gives rise to the generating polynomial of spanning forests; physically,…

Statistical Mechanics · Physics 2015-06-24 Jesper Lykke Jacobsen , Jesus Salas , Alan D. Sokal

The three-dimensional, three-state Potts model is studied as a paradigm for high temperature quantum chromodynamics. In a high statistics numerical simulation using a Swendson-Wang algorithm, we study cubic lattices of dimension as large as…

High Energy Physics - Lattice · Physics 2008-11-26 Jing-Dong Wang , Carleton DeTar

We present a method for computing transition points of the random cluster model using a generalization of the Newman-Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is…