اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStatistical optimization for passive scalar transport: maximum entropy production vs maximum Kolmogorov-Sinay entropy
137
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We derive rigorous results on the link between the principle of maximum entropy production and the principle of maximum Kolmogorov-Sinai entropy using a Markov model of the passive scalar diffusion called the Zero Range Process. We show analytically that both the entropy production and the Kolmogorov-Sinai entropy seen as functions of f admit a unique maximum denoted fmaxEP and fmaxKS. The behavior of these two maxima is explored as a function of the system disequilibrium and the system resolution N. The main result of this article is that fmaxEP and fmaxKS have the same Taylor expansion at _rst order in the deviation of equilibrium. We find that fmaxEP hardly depends on N whereas fmaxKS depends strongly on N. In particular, for a fixed difference of potential between the reservoirs, fmaxEP (N) tends towards a non-zero value, while fmaxKS (N) tends to 0 when N goes to infinity. For values of N typical of that adopted by Paltridge and climatologists we show that fmaxEP and fmaxKS coincide even far from equilibrium. Finally, we show that one can find an optimal resolution N_ such that fmaxEP and fmaxKS coincide, at least up to a second order parameter proportional to the non-equilibrium uxes imposed to the boundaries.
قيم البحث
اقرأ أيضاً
Many modern techniques employed in physics, such a computation of path integrals, rely on random walks on graphs that can be represented as Markov chains. Traditionally, estimates of running times of such sampling algorithms are computed using the nu
mber of steps in the chain needed to reach the stationary distribution. This quantity is generally defined as mixing time and is often difficult to compute. In this paper, we suggest an alternative estimate based on the Kolmogorov-Sinai entropy, by establishing a link between the maximization of KSE and the minimization of the mixing time. Since KSE are easier to compute in general than mixing time, this link provides a new faster method to approximate the minimum mixing time that could be interesting in computer sciences and statistical physics. Beyond this, our finding will also be of interest to the out-of-equilibrium community, by providing a new rational to select stationary states in out-of-equilibrium physics: it seems reasonable that in a physical system with two simultaneous equiprobable possible dynamics, the final stationary state will be closer to the stationary state corresponding to the fastest dynamics (smallest mixing time).Through the empirical link found in this letter, this state will correspond to a state of maximal Kolmogorov-Sinai entropy. If this is true, this would provide a more satisfying rule for selecting stationary states in complex systems such as climate than the maximization of the entropy production.
Computing the stochastic entropy production associated with the evolution of a stochastic dynamical system is a well-established problem. In a small number of cases such as the Ornstein-Uhlenbeck process, of which we give a complete exposition, the d
istribution of entropy production can be obtained analytically, but in general it is much harder. A recent development in solving the Fokker-Planck equation, in which the solution is written as a product of positive functions, enables the distribution to be obtained approximately, with the assistance of simple numerical techniques. Using examples in one and higher dimension, we demonstrate how such a framework is very convenient for the computation of stochastic entropy production in diffusion processes.
Based on Jaynes maximum entropy principle, exponential random graphs provide a family of principled models that allow the prediction of network properties as constrained by empirical data (observables). However, their use is often hindered by the deg
eneracy problem characterized by spontaneous symmetry-breaking, where predictions fail. Here we show that degeneracy appears when the corresponding density of states function is not log-concave, which is typically the consequence of nonlinear relationships between the constraining observables. Exploiting these nonlinear relationships here we propose a solution to the degeneracy problem for a large class of systems via transformations that render the density of states function log-concave. The effectiveness of the method is illustrated on examples.
Maximum entropy (maxEnt) inference of state probabilities using state-dependent constraints is popular in the study of complex systems. In stochastic dynamical systems, the effect of state space topology and path-dependent constraints on the inferred
state probabilities is unknown. To that end, we derive the transition probabilities and the stationary distribution of a maximum {it path} entropy Markov process subject to state- and path-dependent constraints. The stationary distribution reflects a competition between path multiplicity and imposed constraints and is significantly different from the Boltzmann distribution. We illustrate our results with a particle diffusing on an energy landscape. Connections with the path integral approach to diffusion are discussed.
We study the entropy production in non-equilibrium quantum systems without dissipation, which is generated exclusively by the spontaneous breaking of time-reversal invariance. Systems which preserve the total energy and particle number and are in con
tact with two heat reservoirs are analysed. Focussing on point-like interactions, we derive the probability distribution induced by the entropy production operator. We show that all its moments are positive in the zero frequency limit. The analysis covers both Fermi and Bose statistics.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
