Related papers: Maximizing measures for countable alphabet shifts …
Current massive datasets demand light-weight access for analysis. Discrete hashing methods are thus beneficial because they map high-dimensional data to compact binary codes that are efficient to store and process, while preserving semantic…
We show that for a potential with summable variations on an irreducible sofic shift in one dimension, the equilibrium measures are precisely the shift-invariant Gibbs measures. The main tool in the proof is a preservation of Gibbsianness…
In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the…
For a full shift with Np+1 symbols and for a non-positive potential, locally proportional to the distance to one of N disjoint full shifts with p symbols, we prove that the equilibrium state converges as the temperature goes to 0. The main…
We prove the existence of calibrated uniformly continuous subactions for coercive potentials with bounded variation defined on topologically transitive Markov shifts with countable alphabet through the construction of the Peierls barrier in…
We consider topological Markov chains (also called Markov shifts) on countable graphs. We show that a transient graph can be extended to a recurrent graph of equal entropy which is either positive recurrent of null recurrent, and we give an…
Starting from the full--shift on a finite alphabet $A$, mingling some symbols of $A$, we obtain a new full shift on a smaller alphabet $B$. This amalgamation defines a factor map from $(A^{\mathbb N},T_A)$ to $(B^{\mathbb N},T_B)$, where…
We suggest a new method of describing invariant measures on Markov compacta and path spaces of graphs, and thus of describing characters of some groups and traces of AF-algebras. The method relies on properties of filtrations associated…
We introduce a new way of encoding general topology in second order arithmetic that we call hybrid maximal filter (hybrid MF) spaces. This notion is a modification of the notion of a proper MF space introduced by Montalb\'an. We justify the…
How can one lift a functional defined on maps from a space X to a space Y into a functional defined on maps from X into P(Y) the space of probability distributions over Y? Looking at measure-valued maps can be interpreted as knowing a…
To each partition $\lambda$ with distinct parts we assign the probability $Q_\lambda(x) P_\lambda(y)/Z$ where $Q_\lambda$ and $P_\lambda$ are the Schur $Q$-functions and $Z$ is a normalization constant. This measure, which we call the…
We study the bootstrap for the maxima of the sums of independent random variables, a problem of high relevance to many applications in modern statistics. Since the consistency of bootstrap was justified by Gaussian approximation in…
We provide a quantification of the uniqueness of Gibbs measure for topologically mixing countable Markov shifts with locally H\"older continuous potentials. Corollaries for speed of convergence for approximation by finite subsystems are…
If $\mathcal{A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal{A}^{\mathbb{N}}$ of sequences with entries in $\mathcal{A}$, along with the left shift operator $S$. Closed $S$-invariant subsets are…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
Let $G$ be a non-amenable countable group. We show that every almost automorphic $G$-action on a compact Hausdorff space, with a maximal equicontinuous factor whose phase space is a Cantor set, admits invariant probability measures (this…
On a one-sided shift of finite type we prove that for a generic Holder continuous function there is a unique maximizing measure. We show that b-Holder continuous functions can be approximated in the a-Holder topology, a<b, by a function…
We derive two types of representation results for increasing convex functionals in terms of countably additive measures. The first is a max-representation of functionals defined on spaces of real-valued continuous functions and the second a…
We analyze the clustering problem through a flexible probabilistic model that aims to identify an optimal partition on the sample X 1 , ..., X n. We perform exact clustering with high probability using a convex semidefinite estimator that…
We propose a new class of multiplier bootstraps for count functionals, ranging from a fast, approximate linear bootstrap tailored to sparse, massive graphs to a quadratic bootstrap procedure that offers refined accuracy for smaller, denser…