2000 character limit reached
Spectral Entropy via Random Spanning Forests
Published 15 Dec 2025 in cond-mat.stat-mech and cond-mat.dis-nn | (2512.13318v1)
Abstract: We establish an exact analytic relation between random spanning forests and the heat-kernel partition function. This identity enables estimation of partition functions, energies, and the Von Neumann entropy by Wilson sampling of forests, avoiding costly Laplacian eigendecompositions. We validate inverse-Laplace reconstructions stabilized by a Stieltjes spectral-density regularization on synthetic networks. The approach is scalable and yields local node and edge thermodynamic descriptors.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.