Search arXiv⌕ Search

arXiv · 1401.7847

High-precision percolation thresholds and Potts-model critical manifolds from graph polynomials

Abstract

The critical curves of the q-state Potts model can be determined exactly for regular two-dimensional lattices G that are of the three-terminal type. Jacobsen and Scullard have defined a graph polynomial P_B(q,v) that gives access to the critical manifold for general lattices. It depends on a finite repeating part of the lattice, called the basis B, and its real roots in the temperature variable v = e^K - 1 provide increasingly accurate approximations to the critical manifolds upon increasing the size of B. These authors computed P_B(q,v) for large bases (up to 243 edges), obtaining determinations of the ferromagnetic critical point v_c > 0 for the (4,8^2), kagome, and (3,12^2) lattices to a precision (of the order 10^{-8}) slightly superior to that of the best available Monte Carlo simulations. In this paper we describe a more efficient transfer matrix approach to the computation of P_B(q,v) that relies on a formulation within the periodic Temperley-Lieb algebra. This makes possible computations for substantially larger bases (up to 882 edges), and the precision on v_c is hence taken to the range 10^{-13}. We further show that a large variety of regular lattices can be cast in a form suitable for this approach. This includes all Archimedean lattices, their duals and their medials. For all these lattices we tabulate high-precision estimates of the bond percolation thresholds p_c and Potts critical points v_c. We also trace and discuss the full Potts critical manifold in the (q,v) plane, paying special attention to the antiferromagnetic region v < 0. Finally, we adapt the technique to site percolation as well, and compute the polynomials P_B(p) for certain Archimedean and dual lattices (those having only cubic and quartic vertices), using very large bases (up to 243 vertices). This produces the site percolation thresholds p_c to a precision of the order 10^{-9}.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jesper Lykke Jacobsen. 2015-07-15. High-precision percolation thresholds and Potts-model critical manifolds from graph polynomials. https://arxiv.org/abs/1401.7847

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Sharp Bounds on the Mean Efficiency of a Fluctuating Machine

The efficiency of a machine at the scale of thermal fluctuations is random, and the conventional ratio $-W/Q_h$ has no moment of any order: its input heat fluctuates through zero. We work instead with the exergetic ratio $η=W/(W+T_0S)$, which lies in $[0,1]$ pointwise for non-negative dissipation, and ask what the energy budget alone determines about its mean. With $α=T_0\langle S\rangle/W$ and $σ^2$ the relative variance of the dissipation, $1/(1+α)<\langleη\rangle\leσ^2/(1+σ^2)+1/\{(1+σ^2)[1+α(1+σ^2)]\}$, both ends sharp, with no distributional assumption. The floor is Jensen's inequality: fluctuating dissipation raises the mean efficiency above its deterministic value, and the mean alone gives nothing more. The ceiling is attained by an intermittently reversible law, dissipating nothing in a fraction $σ^2/(1+σ^2)$ of realisations, a prediction testable on trajectories. A third moment lifts the floor. Fixed delivered work is not required: when it too fluctuates, the bounds hold with the moments taken on $T_0S/W$, and the thermodynamic uncertainty relation on the work current converts the ceiling into a precision-efficiency frontier, whose zero-variance member is the known bound on a motor's ratio-of-means efficiency, shown here to be unsafe for the mean of the fluctuating ratio. Inside the interval lies the maximum-entropy benchmark $α^{-1}e^{1/α}E_1(1/α)$. Finally the bounds are worked out for a motor with futile cycles, observed until a fixed number of steps is delivered. There the dissipation cannot fall below the reversible cost of that work, and this floor $b$ sharpens the ceiling to $q/(1+αb)+(1-q)/(1+αc)$, $q=σ^2/[σ^2+(1-b)^2]$, $c=1+σ^2/(1-b)$, removing 40-67 per cent of the width. It is saturated when slips are rare: the extremal law is an operating regime, not an idealisation.

cond-mat.stat-mech↗

Amplified Memory and Finite-Time Regularity in Driven Non-Hermitian Systems

We study the roles of broken spectra and exceptional points in finite-time driven non-Hermitian fermionic dynamics. We compute the Nambu biorthogonal correlation matrix for this purpose. The imbalanced-pairing Kitaev chain serves as our concrete realization. Transient passage through a broken-spectrum region amplifies preparation memory. The effect survives when the final Hamiltonian returns to a real-spectrum regime. Negative imbalance forces spectral nonpositivity in the static endpoint state. We isolate the genuine drive history by subtracting out this baseline, leaving an excess that is strictly controlled by the accumulated imaginary-energy action and persists over the entire post-ramp time window. A connected longitudinal correlation mirrors this physics. Its slow-ramp growth tracks the corresponding doubled action. Unstable sectors instead continue amplifying post-ramp if the drive halts inside the broken-spectrum region. Exceptional points yield distinct physics. The finite-time propagator and subsystem correlation matrix remain entirely regular near an exceptional endpoint, even as the quasiparticle gap exhibits its characteristic square-root closing. This finite-time regularity reflects the analyticity of the matrix evolution in the endpoint parameter; a diagonalizable endpoint is strictly not required. A diverging long-time crossover eventually reveals the exceptional scale. We halt the drive exactly at the exceptional point to find that the correlation projector and the connected longitudinal correlation share an identical ballisti front. The subsystem saturation length establishes a distinct but comparable spatial scale. Memory and exceptional-endpoint scalings show no divergence across the tested negative-imbalance range. Memory scaling is fixed by the drive and remains insensitive to the specific choice of real-spectrum final endpoint.

cond-mat.stat-mech↗

Multidimensional dynamical centrality from Green functions in complex networks

Conventional centrality measures provide compact descriptions of node importance, but they emphasize specific structural relations and do not directly resolve the temporal and spectral organization of dynamical perturbation responses. Building on the Green function of a linearized networked system, we develop a multidimensional framework for dynamical node characterization. From the same response function, we extract three complementary indicators---Influence, Efficiency, and Distortion---that quantify cumulative response strength, temporal rate of response, and spectral concentration, respectively, together with a contribution matrix that resolves these quantities into source--target pathways. As a numerical demonstration, we apply the framework to weighted Kuramoto--Sakaguchi dynamics on heterogeneous Barabási--Albert networks. The three indicators distinguish implanted dynamical node classes through complementary dimensions of the perturbation response, while remaining strongly coupled to conventional topological centralities. These results demonstrate how a common dynamical response can be decomposed into distinct, physically interpretable characteristics rather than represented by a single aggregate descriptor. We finally discuss the scope and limitations of the linear-response assumption and extensions to time-dependent and nonlinear regimes.

cond-mat.stat-mech↗