Related papers: Ergodicity of multiplicative statistics

We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…

We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…

Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. The Dyck and Motzkin shifts are well-known examples of transitive subshifts over a finite alphabet that are not…

We consider random Young diagrams with respect to the measure induced by the decomposition of the $p$-th exterior power of $\mathbb{C}^{n}\otimes \mathbb{C}^{k}$ into irreducible representations of $GL_{n}\times GL_{k}$. We demonstrate that…

Many problems of interest in computer science and information theory can be phrased in terms of a probability distribution over discrete variables associated to the vertices of a large (but finite) sparse graph. In recent years,…

This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…

We obtain a partial converse of Vershik's description of ergodic probability measures on a compact metric space with respect to an isometric action by an inductively compact group. This allows us to identify, in this setting, the set of…

We consider a new kind of straight and shifted plane partitions/Young tableaux --- ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the…

This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…

We study the universal scaling limit of random partitions obeying the Schur measure. Extending our previous analysis [arXiv:2012.06424], we obtain the higher-order Pearcey kernel describing the multi-critical behavior in the cusp scaling…

In a series of papers we classify the possible torsion structures of rational elliptic curves base-extended to number fields of a fixed degree. In this paper we turn our attention to the question of how the torsion of an elliptic curve with…

Originally motivated by the morphogenesis of bacterial microcolonies, the aim of this article is to explore models through different scales for a spatial population of interacting, growing and dividing particles. We start from a microscopic…

Ergodic optimization aims to single out dynamically invariant Borel probability measures which maximize the integral of a given "performance" function. For a continuous self-map of a compact metric space and a dense set of continuous…

Random growth models are fundamental objects in modern probability theory, have given rise to new mathematics, and have numerous applications, including tumor growth and fluid flow in porous media. In this article, we introduce some of the…

The nature of statistics, statistical mechanics and consequently the thermodynamics of stochastic systems is largely determined by how the number of states $W(N)$ depends on the size $N$ of the system. Here we propose a scaling expansion of…

We address the scaling limits of random curves arising from, e.g., planar lattice models, especially in rough domains. The well-known precompactness conditions of Kemppainen and Smirnov show that certain crossing probability estimates…

We examine the interaction of multigrid methods and shape optimization in appropriate shape spaces. Our aim is a scalable algorithm for application on supercomputers, which can only be achieved by mesh-independent convergence. The impact of…

A growing body of research on probabilistic programs and causal models has highlighted the need to reason compositionally about model classes that extend directed graphical models. Both probabilistic programs and causal models define a…

We study scaling limits of random permutations ("permutons") constrained by having fixed densities of a finite number of patterns. We show that the limit shapes are determined by maximizing entropy over permutons with those constraints. In…

We introduce the concept of an imprecise Markov semigroup \(\mathbf Q\). It is a tool that allows us to represent ambiguity around both the transition probabilities and the invariant measure of a continuous-time Markov process via a…