Localization Landscapes as Operator-Induced Geometry for Heterogeneous Systems

Josué García-Ávila

Home/Archive/arXiv

arXiv · 2609.13256

Localization Landscapes as Operator-Induced Geometry for Heterogeneous Systems

Josué García-Ávila

View original source ↗Read source document ↗Export metadata ↓

Abstract

Heterogeneous operators often organize response through hidden barriers, wells, and weakly communicating compartments that are not faithfully described by Euclidean distance or raw graph connectivity alone. We study this structure through the localization landscape, obtained from a single source solve, and the associated effective potential $W_{\mathrm{eff}} = 1/u$. Starting from both discrete Schrödinger-type operators and heterogeneous reaction-diffusion operators, we show how $W_{\mathrm{eff}}$ induces effective wells, basin partitions, and Agmon-type neighborhoods that serve as an operator-aware geometry for localization and transport. This geometry explains the spatial support of low-energy eigenmodes, produces adaptive receptive fields on a fixed graph, sharpens locality in attention-like interactions, and yields bottleneck-sensitive modulation of diffusion. We also include a finite-element reaction-diffusion example with strongly compartmentalized coefficients, demonstrating that the same framework extends beyond simple grid operators to heterogeneous continuum systems. The results support a precise conclusion: localization-landscape geometry is a strong inductive bias when relevance is controlled by confinement, barriers, and low-energy accessibility, but its benefits are task-dependent rather than universal.

Explore related subjects

cond-mat.dis-nn math-ph math.MP

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Josué García-Ávila. 2026-09-06. Localization Landscapes as Operator-Induced Geometry for Heterogeneous Systems. https://arxiv.org/abs/2609.13256

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

KEEP EXPLORING

Related papers

arXiv2026

The critical slowing down in training diffusion models

Computational sampling has been central to the sciences since the mid-20th century. While machine-learning-based approaches have recently enabled major advances, their behavior remains poorly understood, with limited theoretical control over when and why they succeed. Here we provide such insight for diffusion models---a class of generative schemes highly effective in practice---by analyzing their application to the $O(n)$ model of statistical field theory in the Gaussian limit $n \to \infty$. In this analytically tractable setting, we show that training a score model with a one-layer network architecture matching the exact solution exhibits a form of critical slowing down in parameter learning. This slowing down also impacts the generation process, indicating that the well-known difficulties of sampling near criticality persist even for learned generative models. To overcome this bottleneck, we consider the power of architectural depth. We find that using a two-layer architecture drastically reduces the critical slowing down, with the training time scaling logarithmically rather than quadratically with system size. Using a Fourier implementation of the architecture, we further show that this acceleration in training time can be achieved without drastically increasing operational complexity. Taken together, these results demonstrate that diffusion models can overcome the critical slowing down through appropriate architectural design, and establish a controlled framework for understanding and improving learned sampling methods in statistical physics and beyond.

cond-mat.dis-nn↗

arXiv2026

Switching diffusivity selects Pareto tail exponent in random growth with redistribution

Random multiplicative growth with redistribution generates stationary Pareto wealth tails in the Bouchaud-Mézard model, but assumes a fixed multiplicative noise intensity. This is restrictive for physical and financial growth processes, where volatility (diffusivity) is often fluctuating. We replace the constant noise intensity by a switching diffusivity and ask how these fluctuations select the Pareto stationary tail. For a geometric Brownian motion with switching diffusivity, the long-time Gaussian limit holds when the redraw law has finite mean and variance. The asymptotic variance retains a contribution from diffusivity persistence. With redistribution and a general redraw law, the stationary large-wealth problem is characterized by a spectral condition for admissible algebraic modes. For a two-state diffusivity, an exact tail analysis gives a Pareto exponent interpolating between the high-diffusivity slow-refresh limit and the mean-diffusivity fast-refresh Bouchaud-Mézard limit.

cond-mat.dis-nn↗

arXiv2026

Signatures of Nonergodicity in Sparse Random Matrices

The prevalence of sparsity in the Fock space graph of interacting many-body systems motivates an investigation into the spectral statistics of sparse random matrices with on-site disorder. We numerically determine the delocalization-localization transition in the ground state as a function of the sparsity. The short-range energy correlation in the bulk indicates that the Anderson transition at infinite temperature occurs at the critical percolation limit of the sparse graph. By analytically deriving the energy moments and calculating the shifted kurtosis, we show that the critical sparsity threshold matches the Anderson transition. Furthermore, long-range energy correlations in the bulk spectrum reveal a Thouless energy scale, suggesting a broad nonergodic regime within the delocalized phase.

cond-mat.dis-nn↗