Search arXiv⌕ Search

arXiv · 2610.24317

Encoding Hyperuniformity in Geometric Networks: Structural Signatures and Diffusion Dynamics

Abstract

Disordered hyperuniformity is a recently discovered exotic state exhibiting anomalously suppressed density fluctuations at long wavelengths, and its generalization to network systems remains an important open question. Here, we show that, across a wide range of systems, geometric networks retain substantially more long-wavelength density information from the underlying point configurations than Delaunay triangulations. Within geometric networks, hyperuniformity manifests as suppressed vertex-to-vertex fluctuations in a range of network structural observables, including closeness centrality, vertex strength, and eigenvector centrality. These measures not only distinguish hyperuniform networks from non-hyperuniform ones, but also separate near-hyperuniform configurations from hyperuniform systems with strong local disorder, solving a central challenge in network hyperuniformity. We connect these structural signatures to network dynamics by introducing a relaxation-time centrality based on diffusion and demonstrate that hyperuniform geometric networks exhibit more homogeneous relaxation behavior than non-hyperuniform geometric networks. These results reveal how the suppression of large-scale density fluctuations manifests in both network structure and diffusion dynamics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yongyi Wang, Eli Newby, Yang Jiao, Salvatore Torquato, Réka Albert. 2026-10-16. Encoding Hyperuniformity in Geometric Networks: Structural Signatures and Diffusion Dynamics. https://arxiv.org/abs/2610.24317

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

KEEP EXPLORING

Related papers

A universal emulator for planar Ising lattices

We introduce the notion of an Ising emulator for two-dimensional Ising models: a broad class of flat, unit-edge-length lattices can be represented as site- or bond-diluted supercells of a single host lattice, for which the Feynman--Vdovichenko/Kac--Ward solution is fixed once and for all. We construct explicit square and triangular emulators and show that a single transition matrix, supplemented by lattice-specific binary masks, gives all the thermodynamic quantities of interest for both ferro- and antiferromagnetic couplings. We apply the framework to all eleven Archimedean lattices, to all twenty 2-uniform lattices -- whose thermodynamics is obtained here for the first time -- and to several pentagonal lattices, and show that the same construction extends directly to fractal and disordered Ising models, with no modification to the underlying machinery.

cond-mat.stat-mech↗

Extreme First-Passage Time of Many Interacting Particles

Extreme first-passage events are broadly relevant to biological, chemical, and physical processes in which the first successful arrival determines the outcome. Existing theories are largely confined to noninteracting searchers. Interacting extreme-statistics problems are notoriously difficult because correlations destroy probability factorization. We establish a general framework for interacting extreme search. A no-go theorem shows that broad classes of short-range interactions cannot beat the $1/\ln N$ extreme timescale of $N$ independent Brownian searchers, and complementary upper bounds prove that this scale is exact for repulsive interactions. We then identify three sharp mechanisms beyond the logarithmic class and derive a unified interaction-driven acceleration limit. In particular, deterministic pairwise interaction can at most reduce the extreme search time to order $1/N$, while stochastic pairwise forcing attains $1/(N\ln N)$. Our results separate acceleration due to statistical redundancy from that generated by coherent many-body transport or amplified fluctuations, deepening our understanding of interacting many-body systems.

cond-mat.stat-mech↗

Tensor network Monte Carlo study of the J1-J2 Ising model on the square lattice

The frustrated square-lattice J1-J2 Ising model exhibits rich magnetic phases, yet its phase transitions remain difficult to characterize due to critical slowing down in conventional Monte Carlo and truncation errors inherent to tensor renormalization group methods. We develop a tensor-network Monte Carlo (TNMC) algorithm for this frustrated model, which supports both open and periodic boundary conditions. For periodic lattices, we use a sweeping block-update strategy that updates spin blocks while fixing surrounding spins. To boost efficiency, we couple our sampler with histogram reweighting, and test each technique standalone to validate these independent optimizations. We perform extensive finite-size scaling analyses at g=0.55 and g=1.0, extracting apparent critical temperatures and effective thermal exponents from Binder-cumulant data. Our method offers an efficient, nearly bias-free path for large-scale simulations of J1-J2-type frustrated magnets under periodic boundaries and generalizes readily to other frustrated spin lattices.

cond-mat.stat-mech↗