Related papers: Markov models of macrosystems
We develop a method using a coarse graining of the energy fluctuations of an equilibrium quantum system which produces simple parameterizations for the behaviour of the system. As an application, we use these methods to gain more…
We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of the ensemble. Models of this type play the…
This paper deals with N-person nonzero-sum discrete-time Markov games under a probability criterion, in which the transition probabilities and reward functions are allowed to vary with time. Differing from the existing works on the expected…
A principle of hierarchical entropy maximization is proposed for generalized superstatistical systems, which are characterized by the existence of three levels of dynamics. If a generalized superstatistical system comprises a set of…
This paper presents a conceptual model describing the medium and long-term co-evolution of natural and socio-economic subsystems of Earth. An economy is viewed as an out-of-equilibrium dissipative structure that can only be maintained with…
The theory of large deviations has been applied successfully in the last 30 years or so to study the properties of equilibrium systems and to put the foundations of equilibrium statistical mechanics on a clearer and more rigorous footing. A…
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…
This paper is concerned with the study of the stability of dynamical systems evolving on time scales. We first {formalize the notion of matrix measures on time scales, prove some of their key properties and make use of this notion to study…
The May--Leonard model was introduced to examine the behavior of three competing populations where rich dynamics, such as limit cycles and nonperiodic cyclic solutions, arise. In this work, we perturb the system by adding the capability of…
Recurrent temporal dynamics is a phenomenon observed frequently in high-dimensional complex systems and its detection is a challenging task. Recurrence quantification analysis utilizing recurrence plots may extract such dynamics, however it…
We study sequential decision-making when the agent's internal model class is misspecified. Within the infinite-horizon Berk-Nash framework, stable behavior arises as a fixed point: the agent acts optimally relative to a subjective model,…
The evolution of a quantum system, appropriate to describe nano-magnets, can be mapped on a Markov process, continuous in $\beta$. The mapping implies a probability assignment that can be used to study the probability density (PDF) of the…
Mathematical Program Networks (MPNs) are introduced in this work. An MPN is a collection of interdependent Mathematical Programs (MPs) which are to be solved simultaneously, while respecting the connectivity pattern of the network defining…
Markov chains are fundamental models for stochastic dynamics, with applications in a wide range of areas such as population dynamics, queueing systems, reinforcement learning, and Monte Carlo methods. Estimating the transition matrix and…
Maximum entropy method is a constructive criterion for setting up a probability distribution maximally non-committal to missing information on the basis of partial knowledge, usually stated as constrains on expectation values of some…
In this paper, we analyze mean-field game modulated by finite states markov chains. We first develop a sufficient stochastic maximum principle for the optimal control of a Markov-modulated stochastic differential equation (SDE) of…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
We estimate the distance in total variation between the law of a finite state Markov process at time t, starting from a given initial measure, and its unique invariant measure. We derive upper bounds for the time to reach the equilibrium.…
This paper considers a controlled It\^o-L\'evy process where the information available to the controller is possibly less than the overall information. All the system coefficients and the objective performance functional are allowed to be…
We consider a hidden Markov model with multiple observation processes, one of which is chosen at each point in time by a policy---a deterministic function of the information state---and attempt to determine which policy minimises the…