Related papers: Flatness is a Criterion for Selection of Maximizin…

We establish the Level-1 and Level-3 Large Deviation Principles (LDPs) for invariant measures on shift spaces over finite alphabets under very general decoupling conditions for which the thermodynamic formalism does not apply. Such…

For strongly dissipative H\'enon maps at the first bifurcation where the uniform hyperbolicity is destroyed by the formation of tangencies inside the limit set, we establish a thermodynamic formalism, i.e., prove the existence and…

We construct a family of shift spaces with almost specification and multiple measures of maximal entropy. This answers a question from Climenhaga and Thompson [Israel J. Math. 192 (2012), no. 2, 785--817]. Elaborating on our examples we…

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

In this work we propose a new algorithm for the computation of statistical equilibrium quantities on a cubic lattice when both an energy and a statistical temperature are involved. We demonstrate that the pivot algorithm used in situations…

Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…

We obtain effective potential of $O(N)$-symmetric $\phi^4$ theory for large $N$ starting with a finite lattice system and taking the thermodynamic limit with great care. In the thermodynamic limit, it is globally real-valued and convex in…

We formulate, under general conditions, the problem of maximisation of the total entropy of the system, assumed to be in a composable form, for fixed total value of the constrained quantity. We derive the general form of the composability…

Ergodic optimization is the study of problems relating to maximizing orbits, maximizing invariant measures and maximum ergodic averages. An orbit of a dynamical system is called f-maximizing if the time average of the real-valued function f…

We pose and study a fundamental algorithmic problem which we term mixture selection, arising as a building block in a number of game-theoretic applications: Given a function $g$ from the $n$-dimensional hypercube to the bounded interval…

We study the dynamics of piecewise affine surface homeomorphisms from the point of view of their entropy. Under the assumption of positive topological entropy, we establish the existence of finitely many ergodic and invariant probability…

We prove that given a computable metric space and two computable measures, the set of points that have high universal uniform test scores with respect to the first measure will have a lower bound with respect to the second measure. This…

We study the equilibrium measure for a logarithmic potential in the presence of an external field V*(x) + tp(x), where t is a parameter, V*(x) is a smooth function and p(x) a monic polynomial. When p(x) is of an odd degree, the equilibrium…

We consider the Random Euclidean Assignment Problem in dimension $d=1$, with linear cost function. In this version of the problem, in general, there is a large degeneracy of the ground state, i.e. there are many different optimal matchings…

We consider the estimation of an unknown parameter $\theta$ through a quantum probe at thermal equilibrium. The probe is assumed to be in a Gibbs state according to its Hamiltonian $H_\theta$, which is divided in a parameter-encoding term…

We revisit the classical problem of inverting dimension-reducing linear mappings using the maximum entropy (MaxEnt) criterion. In the literature, solutions are problem-dependent, inconsistent, and use different entropy measures. We propose…

Statistical physics in equilibrium grants us one of its most powerful tools: the equipartition principle. It states that the degrees of freedom of a mechanical system act as a thermometer: temperature is equal to the mean variance of their…

We give a new characterization of relative entropy, also known as the Kullback-Leibler divergence. We use a number of interesting categories related to probability theory. In particular, we consider a category FinStat where an object is a…

We present a constructive criterion for flatness of a morphism of analytic spaces X -> Y or, more generally, for flatness over Y of a coherent sheaf of modules on X. The criterion is a combination of a simple linear-algebra condition "in…

Given a set of $m$ agents and a set of $n$ items, where agent $A$ has utility $u_{A,i}$ for item $i$, our goal is to allocate items to agents to maximize fairness. Specifically, the utility of an agent is the sum of its utilities for items…