Related papers: Asymptotic Counting in Conformal Dynamical Systems
We compute the exact asymptotics for the cumulants of linear statistics associated with the zeros counting measure of a large class of real Gaussian processes. Precisely, we show that if the underlying covariance function is regular and…
Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in…
We prove the asymptotic functional Poisson laws in the total variation norm and obtain estimates of the corresponding convergence rates for a large class of hyperbolic dynamical systems. These results generalize the ones obtained before in…
We obtain asymptotic counting results with error terms for complex orthospectrum for Schottky groups and orbit counting function for quadratic polynomials. Moreover, we prove equidistribution of holonomy associated to these dynamical…
Markov branching systems form a fundamental class of stochastic models that are extensively applied in biology, physics, finance, and other domains. These systems are distinguished by their continuous-time evolution and inherent branching…
We consider the supersymmetric approach to gaussian disordered systems like the random bond Ising model and Dirac model with random mass and random potential. These models appeared in particular in the study of the integer quantum Hall…
We study the generalized Galois numbers which count flags of length r in N-dimensional vector spaces over finite fields. We prove that the coefficients of those polynomials are asymptotically Gaussian normally distributed as N becomes…
We realize the Apollonian group associated to an integral Apollonian circle packings, and some of its generalizations, as a group of automorphisms of an algebraic surface. Borrowing some results in the theory of orbit counting, we study the…
Let $\Phi = \{\phi_e\}_{e\in E}$ be a finitely irreducible conformal graph directed Markov system (CGDMS) with symbolic representation $E_A^{\infty}$ and limit set $J$. Under a mild condition on the system, we give a multifractal analysis…
This paper derives normal approximation results for subgraph counts written as multiparameter stochastic integrals in a random-connection model based on a Poisson point process. By combinatorial arguments we express the cumulants of general…
We introduce amorphic complexity as a new topological invariant that measures the complexity of dynamical systems in the regime of zero entropy. Its main purpose is to detect the very onset of disorder in the asymptotic behaviour. For…
We examine two counting problems that seem very group-theoretic on the surface but, on closer examination, turn out to concern integers with restrictions on their prime factors. First, given an odd prime $q$ and a finite abelian $q$-group…
We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…
For expansions in one-dimensional conformal blocks, we provide a rigorous link between the asymptotics of the spectral density of exchanged primaries and the leading singularity in the crossed channel. Our result has a direct application to…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
We investigate dynamical systems obtained by coupling two maps, one of which is chaotic and is exemplified by an Anosov diffeomorphism, and the other is of gradient type and is exemplified by a N-pole-to-S-pole map of the circle. Leveraging…
The sizes of Markov equivalence classes of directed acyclic graphs play important roles in measuring the uncertainty and complexity in causal learning. A Markov equivalence class can be represented by an essential graph and its undirected…
This survey describes the recent advances in the construction of Markov partitions for nonuniformly hyperbolic systems. One important feature of this development comes from a finer theory of nonuniformly hyperbolic systems, which we also…
We propose the study of Markov chains on groups as a "quasi-isometry invariant" theory that encompasses random walks. In particular, we focus on certain classes of groups acting on hyperbolic spaces including (non-elementary) hyperbolic and…
This paper discusses the asymptotic behaviour of the number of descents in a random signed permutation and its inverse, which was posed as an open problem by Chatterjee and Diaconis in a recent publication. For that purpose, we generalize…