1592 papers
Statistical mechanics explores how the chaotic motion of countless tiny particles gives rise to the predictable laws governing heat, pressure, and phase transitions. This field bridges the gap between the microscopic world of atoms and the macroscopic reality we experience daily, offering deep insights into why materials behave the way they do.
On Gist.Science, we process every new preprint in this category as it appears on arXiv to make these complex findings accessible to everyone. For each paper, we provide both a plain-language explanation for the curious reader and a detailed technical summary for specialists, ensuring that groundbreaking research is never lost behind a wall of jargon.
Below are the latest papers in statistical mechanics, freshly curated and summarized to help you understand the cutting edge of this fascinating discipline.
This paper presents a general theoretical framework for group resetting dynamics in a potential landscape, deriving a Fokker-Planck equation for the group's center of mass to analyze stationary properties and optimize collective search and avoidance strategies in applications ranging from bacterial evolution to financial risk control.
This paper proposes a general standardization function to correct the non-zero expected value of weighted ranking correlation coefficients under independence, utilizing Monte Carlo sampling and polynomial regression to estimate necessary distributional parameters for large ranking lengths.
This paper proposes a purely classical interacting particle system composed of boxes and balls that, through stochastic occupation-dependent update rules, reproduces the dynamics of a discrete-time quantum walk without invoking a wavefunction, thereby offering a minimal microscopic framework for understanding the emergence of quantum-like behavior in active matter.
This paper analytically determines the exact critical exponents and for the Motzkin and Fredkin chains by utilizing a transfer matrix derived from their matrix product state representation combined with renormalization group analysis, thereby overcoming previous limitations in characterizing their exotic quantum phase transition.
The paper proposes a variational boundary-based tensor network renormalization group algorithm that utilizes globally optimized boundary tensors to construct accurate renormalization projectors, achieving higher precision than existing methods while maintaining the computational complexity of the original TRG approach.
This paper derives a previously overlooked entropic Casimir contribution to the binding potential for 3D short-ranged wetting from a microscopic Landau-Ginzburg-Wilson Hamiltonian, demonstrating that while this term preserves the global surface phase diagram, it fundamentally alters predictions for fluctuation effects at first-order and tricritical wetting transitions.
This paper demonstrates that interacting paraparticle chains with flavor-blind Hamiltonians exhibit a factorized Hilbert space where periodic boundary conditions induce flux sectors that render parastatistics observable as shifted conformal towers in the energy spectrum, effectively mapping the system to an exactly solvable XXZ chain with flux.
This paper investigates the coarse-graining of nonequilibrium planar diffusion processes into discrete-state Markov chains, demonstrating that while such approximations can converge to the true entropy production rate under specific conditions, they generally underestimate it yet remain effective tools for detecting nonequilibrium behavior in both simulated and empirical systems.
Using numerical simulations of a stress-imposed vane rheometer, this study reveals that the rheology of dense vibrated granular flows is governed by the balance between grain-scale agitation energy and confinement, leading to a non-monotonic viscosity response to vibration frequency that reconciles previously observed trends in friction and viscosity weakening.
This paper introduces a novel, verified algorithm that leverages spectral graph theory and vertex curvatures to efficiently and accurately determine graph isomorphism in polynomial time, successfully resolving challenging instances that defeat classical spectral techniques.