Related papers: Scaling Limits for the Gibbs States on Distance-Re…
In this paper we study decay of correlations and limit theorems for generalized baker's transformations. Our examples are piecewise non-uniformly hyperbolic maps on the unit square that posses two spatially separated lines of indifferent…
We work out the graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function $W(x,y)$ on the unit square, with $x$ and $y$ uniform on the interval $(0,1)$.…
We identify the scaling limit of random intersection graphs inside their critical windows. The limit graphs vary according to the clustering regimes, and coincide with the continuum Erdos--Renyi graph in two out of the three regimes. Our…
We extend the spectral method for proving limit theorems to random non-uniformly expanding dynamical systems. This yields the CLT and moderate deviations principles (MDP). We show that as the amount of non-uniformity decreases the CLT rates…
We show that the class of quantum baker's maps defined by Schack and Caves have the proper classical limit provided the number of momentum bits approaches infinity. This is done by deriving a semi-classical approximation to the…
We study scaling limits of deterministic Jacobi matrices at a fixed point, $x_0$, and their connection to the scaling limits of the Christoffel-Darboux kernel at that point. We show that in the case that the orthogonal polynomials are…
We employ the machinery of smooth scaling and coarse-graining of observables, developed recently by us in the context of so-called fluctuation operators (inspired by prior work of Verbeure et al) to make a rigorous renormalisation group…
Statistical mechanics describes interaction between particles of a physical system. Particle properties of the system can be modelled with a random field on a lattice and studied at different distance scales using renormalization group…
We study the relation between quantum mechanical and classical Gibbs states of spin systems with spin quantum number $s$. It is known that quantum states and observables can be represented by functions defined on the phase space ${\mathcal…
The objective of this study is to investigate the limiting behavior of a subgraph counting process. The subgraph counting process we consider counts the number of subgraphs having a specific shape that exist outside an expanding ball as the…
We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…
In this talk I first review at an elementary level a selection of central limit theorems, including some lesser known cases, for sums and maxima of uncorrelated and correlated random variables. I recall why several of them appear in…
We refine the classical Lindeberg-Feller central limit theorem by obtaining asymptotic bounds on the Kolmogorov distance, the Wasserstein distance, and the parametrized Prokhorov distances in terms of a Lindeberg index. We thus obtain more…
Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of…
The investigation of quantum-classical correspondence may lead to gain a deeper understanding of the classical limit of quantum theory. We develop a quantum formalism on the basis of a linear-invariant theorem, which gives an exact…
We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
The central limit theorem provides the theoretical foundation for the universality of the normal distribution: under broad conditions, the asymptotic distribution of a sum of independent random variables approaches a Gaussian. Yet, physical…
Using the renormalization method introduced in \cite{GJ}, we prove what we call the {\em local} Boltzmann-Gibbs principle for conservative, stationary interacting particle systems in dimension $d=1$. As applications of this result, we…
We consider dense graph sequences that converge to a connected graphon and prove that the GHP scaling limit of their uniform spanning trees is Aldous' Brownian CRT. Furthermore, we are able to extract the precise scaling constant from the…