Related papers: Ergodicity of multiplicative statistics
Asymptotics are given for the number of rational points in the domain of a morphism of weighted projective stacks whose images have bounded height and satisfy a (possibly infinite) set of local conditions. As a consequence we obtain results…
The Riemannian Bures metric on the space of (normalized) complex positive matrices is used for parameter estimation of mixed quantum states based on repeated measurements just as the Fisher information in classical statistics. It appears…
We study the statistical properties of piecewise expanding maps in the general setting of metric measure spaces. We provide sufficient conditions for exponential mixing of such systems with explicit estimates on the constants. We also…
This article studies exponential families $\mathcal{E}$ on finite sets such that the information divergence $D(P\|\mathcal{E})$ of an arbitrary probability distribution from $\mathcal{E}$ is bounded by some constant $D>0$. A particular…
Empirical determination of the scaling properties and exponents of time series presents a formidable challenge in testing, and developing, a theoretical understanding of turbulence and other out-of-equilibrium phenomena. We discuss the…
In this note we obtain tight bounds on the space-complexity of computing the ergodic measure of a low-dimensional discrete-time dynamical system affected by Gaussian noise. If the scale of the noise is $\varepsilon$, and the function…
We study a compactification of the space of invariant probability measures for a transitive countable Markov shift. We prove that it is affine homeomorphic to the Poulsen simplex. Furthermore, we establish that, depending on a combinatorial…
We show how the modular symmetries that have been found to be consistent with most available scaling data from quantum Hall systems, derive from a rigid family of algebraic curves of the elliptic type. The complicated special functions…
We solve the graph bi-partitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut-size to scale universally with <k^1/2>. In contrast, earlier results studying the problem in graphs with…
We show that any self-conformal measure $\mu$ on $\mathbb{R}$ is uniformly scaling and generates an ergodic fractal distribution. This generalizes existing results by removing the need for any separation condition. We also obtain…
Scalable frames are frames with the property that the frame vectors can be rescaled resulting in tight frames. However, if a frame is not scalable, one has to aim for an approximate procedure. For this, in this paper we introduce three…
We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…
The class of minimal difference partitions MDP($q$) (with gap $q$) is defined by the condition that successive parts in an integer partition differ from one another by at least $q\ge 0$. In a recent series of papers by A. Comtet and…
We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular functions and monotone subadditive functions. Even though…
The limiting shape of the random Young diagrams associated with an inhomogeneous random word is identified as a multidimensional Brownian functional. This functional is identical in law to the spectrum of a random matrix. The Poissonized…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
This article is a contribution to the project of classifying the torsion growth of elliptic curve upon base-change. In this article we treat the case of elliptic curve defined over the rationals with complex multiplication. For this…
We develop novel tools for computing the likelihood correspondence of an arrangement of hypersurfaces in a projective space. This uses the module of logarithmic derivations. This object is well-studied in the linear case, when the…
It has been recently shown that probabilistic protocols based on postselection boost the performances of phase estimation and the replication of quantum clocks. Here we demonstrate that the improvements in these two tasks have to match…
A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…