Searcharxiv⌕ Search

arXiv · 2610.27811

A Transport-Information Framework for Continuous-Fiber-Aligned Coarse-Graining Representation Sets

Abstract

Consider representation sets of interest whose elements are associated with continuous realizations related to them through coarse-graining (CG). CG can be regarded as an operation that reduces a representation by discarding information that is not retained in its output. However, a systematic description of the information structure associated with CG in general remains to be established. Here, we propose a transport-information framework for continuous-fiber-aligned representation sets, in which each representation is associated with a continuous realization through a fiber structure, with CG defining the projection onto the representation. Within this framework, CG is described through a local-map operation that transports continuous probability mass onto representative points. The resulting transport cost is expressed as the contraction of the second-moment structure of the underlying continuous representation with the transport metric. Building on the previously proposed framework of unavoidable canonical nonlinearity (UCN), this construction provides a non-arbitrary information-theoretic interpretation of the CG-associated transport cost in terms of information indistinguishability, quantified by an expected Kullback-Leibler divergence associated with the CG geometry. The present framework provides a basis for describing information costs associated with individual CG operations and for comparing representation sets while accounting for their underlying continuous realizations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Koretaka Yuge. 2026-10-20. A Transport-Information Framework for Continuous-Fiber-Aligned Coarse-Graining Representation Sets. https://arxiv.org/abs/2610.27811

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↗