Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/9702249

Comparison of rigidity and connectivity percolation in two dimensions

Cristian F. Moukarzel·Phillip M. Duxbury
View original source ↗Read source document ↗Export metadata ↓

Abstract

Using a recently developed algorithm for generic rigidity of two-dimensional graphs, we analyze rigidity and connectivity percolation transitions in two dimensions on lattices of linear size up to L=4096. We compare three different universality classes: The generic rigidity class; the connectivity class and; the generic ``braced square net''(GBSN). We analyze the spanning cluster density P_\infty, the backbone density P_B and the density of dangling ends P_D. In the generic rigidity and connectivity cases, the load-carrying component of the spanning cluster, the backbone, is fractal at p_c, so that the backbone density behaves as B ~ (p-p_c)^{β'} for p>p_c. We estimate β'_{gr} = 0.25 +/- 0.02 for generic rigidity and β'_c = 0.467 +/- 0.007 for the connectivity case. We find the correlation length exponents, ν_{gr} = 1.16 +/- 0.03 for generic rigidity compared to the exact value for connectivity ν_c = 4/3. In contrast the GBSN undergoes a first-order rigidity transition, with the backbone density being extensive at p_c, and undergoing a jump discontinuity on reducing p across the transition. We define a model which tunes continuously between the GBSN and GR classes and show that the GR class is typical.

Explore related subjects

cond-mat.stat-mechcond-mat.mtrl-sci

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cristian F. Moukarzel, Phillip M. Duxbury. 1998-09-21. Comparison of rigidity and connectivity percolation in two dimensions. https://doi.org/10.1103/physreve.59.2614

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

KEEP EXPLORING

Related papers

arXiv2026

The meaning of entropy (demonstration of a much needed theorem)

The association of information with entropy has been argued on plausibility arguments involving the operation of imaginary engines and beings, and it is not a universal theorem. In this paper, a theorem by Charles Bennett on reversible computation that associates entropy with erasure of information is recognized as this much needed theorem. It is proposed a real, non thermal engine, operated by humans. It is proved: (1) The engine obeys two laws, identical {\it mutatis mutandis} to the two laws of thermodynamics; therefore, the entropy that arises in the operation of the engine has the same meaning of the entropy that arises in the operation of thermal engines. (2) The engine operates in stages similar to the stages in Bennett's three tapes reversible computer; therefore the entropy in the engine has the same meaning of the entropy in computation. The conclusion is that also the thermal entropy is a measure of erased or missing information. As a side result, information is measured in physical units, which complies with Landauer's principle. A prototype at work is shown in video.

cond-mat.stat-mech↗
arXiv2026

Information geometry of perturbed gradient flow systems on hypergraphs: A perspective towards nonequilibrium physics

This article serves to concisely review the link between gradient flow systems on hypergraphs and information geometry which has been established within the last five years. Gradient flow systems describe a wealth of physical phenomena and provide powerful analytical technquies which are based on the variational energy-dissipation principle. Modern nonequilbrium physics has complemented this classical principle with thermodynamic uncertaintly relations, speed limits, entropy production rate decompositions, and many more. In this article, we formulate these modern principles within the framework of perturbed gradient flow systems on hypergraphs. In particular, we discuss the geometry induced by the Bregman divergence, the physical implications of dual foliations, as well as the corresponding infinitesimal Riemannian geometry for gradient flow systems. Through the geometrical perspective, we are naturally led to new concepts such as moduli spaces for perturbed gradient flow systems and thermodynamical area which is crucial for understanding speed limits. We hope to encourage the readers working in either of the two fields to further expand on and foster the interaction between the two fields.

cond-mat.stat-mech↗
arXiv2026

Anomalous diffusion and singular transport from hydrodynamic recoupling

In charge neutral fluids, such as the Dirac fluid in graphene at the Dirac point, charge transport remains diffusive despite the presence of ballistically propagating sound waves: sound waves ``hydrodynamically decouple'' from the slower charge fluctuations. For quasi-one-dimensional charge neutral fluids, we show that this convective charge diffusion is not smoothly connected to the normal diffusion that arises when momentum conservation is broken by noise (or static impurities). Instead, the charge diffusion constant is a discontinuous function of noise, which (in the weak-noise limit) depends only on the ratio of momentum and energy relaxation rates. In the special limit of momentum-conserving noise (e.g., spatially uniform fluctuations of the Hamiltonian), the diffusion constant diverges in the presence of noise. We describe the resulting superdiffusion in terms of coupled Burgers equations. We present a general mechanism---hydrodynamic recoupling---by which weak noise can induce singular changes in transport coefficients. Our results highlight the limits of zero-noise extrapolation for predicting dynamical quantities like diffusion constants.

cond-mat.stat-mech↗