Skip to content

Path-Dependent Entropic Lagrangian for Probability Flows: Balance-Entropy Routing and Composable Information Potentials

Jul 2026 · arXiv.org · Vol abs/2607.10493 · 0 citations · 35 references
Computer Science Physics Mathematics

TL;DR

A path-dependent entropic Lagrangian calculus that extends static state selection to probability-path evolution through restricted generators, upper-limit history terms, and explicit balance--entropy port routing is developed.

Abstract

Probability distributions are central to information theory, statistical inference, and modern probabilistic learning. Maximum entropy selects a probability state under prescribed constraints, but it does not specify how that state is reached, how probability is transported, or how dissipation and external information exchange are accounted for along the path. We develop a path-dependent entropic Lagrangian calculus that extends static state selection to probability-path evolution through restricted generators, upper-limit history terms, and explicit balance--entropy port routing. The construction yields the thermal state relation, conservative probability balance, and nonnegative production under standard mobility closure. Its KL/Shannon sector recovers maximum-entropy and Bayesian laws as stationary no-flux states, while time-dependent information potentials separate internal dissipation from supplied information power. Composable information and structural potentials control tails, sparsity, robustness, regularization, and nonlocal multimodality without changing the accounting architecture. Two numerical examples verify mass conservation, energy decomposition, and the total free-energy ledger.

View source

Similar papers

Preprint Sep 2026

Physics of Information Geometry - Part I: Principle of Least Action on the Probability Simplex

We develop a least-action framework for describing how a probability distribution can evolve from an equilibrium state to a prescribed nonequilibrium state under constrained incremental changes. Taking a Gibbs distribution as the equilibrium reference, the framework gives a direct physical meaning to the geometry of th...

C. Koksal, Deniz Sargun · 1 citation
Preprint Jul 2026

Sinkhorn Hamiltonian Monte Carlo for Entropic Optimal Transport Generalized Bayes

This work introduces Sinkhorn divergences as Generalized Bayes losses for Hamiltonian Monte Carlo (HMC) and No-U-Turn Sampler (NUTS) and proposes heuristics to set hyperparameters that affect the stability and calibration quality, such as the number of Sinkhorn iterations, the entropic regularization strength, and the...

Guilhem Nespoulous, F. Bertrand, Myriam Maumy et al. · 0 citations
Preprint Aug 2026

A Structural Characterization of Entropy Functionals

Entropy functionals and their associated divergences underlie many statistical methods, including maximum entropy inference, minimum divergence estimation, and goodness-of-fit testing, yet choosing among Shannon, R\'enyi, Tsallis, and more general entropies is often a matter of convention rather than structural princip...

D. Lazarev · 0 citations
Preprint Jul 2026

The nonequilibrium statistical mechanics of Markov interacting particles

We consider coupled stochastic systems decomposed into exterior, boundary, and interior variables, with the boundary variables sometimes carrying the directed structure of a sensor and actuator. The central question is when the conditional law of histories factorises, and how this path space statement is detected by lo...

D. A. R. Sakthivadivel · 0 citations
Preprint Jul 2026

When trajectory-based bounds fail: information thermodynamics under noisy feedback

Information engines exploit feedback to extract work from thermal fluctuations, extending the second law of thermodynamics through information-theoretic bounds. While several such bounds have been proposed, their relative performance under realistic conditions---where measurements are noisy and feedback is temporally c...

Natalia Ruiz-Pino, Ludovic Bellon, Antonio Prados · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.