Limit distributions and scaling functions
نویسنده
چکیده
We discuss the asymptotic behaviour of models of lattice polygons, mainly on the square lattice. In particular, we focus on limiting area laws in the uniform perimeter ensemble where, for fixed perimeter, each polygon of a given area occurs with the same probability. We relate limit distributions to the scaling behaviour of the associated perimeter and area generating functions, thereby providing a geometric interpretation of scaling functions. To a major extent, this article is a pedagogic review of known results.
منابع مشابه
Lyapunov functions, stationary distributions, and non-equilibrium potential for chemical reaction networks
We consider the relationship between stationary distributions for stochastic models of chemical reaction systems and Lyapunov functions for their deterministic counterparts. Specifically, we derive the well known Lyapunov function of chemical reaction network theory as a scaling limit of the non-equilibrium potential of the stationary distribution of stochastically modeled complex balanced syst...
متن کاملLow-lying Zeroes of Maass Form L-functions
The Katz-Sarnak density conjecture states that the scaling limits of the distributions of zeroes of families of automorphic L-functions agree with the scaling limits of eigenvalue distributions of classical subgroups of the unitary groups U(N). This conjecture is often tested by way of computing particular statistics, such as the one-level density, which evaluates a test function with compactly...
متن کاملLyapunov Functions, Stationary Distributions, and Non-equilibrium Potential for Reaction Networks.
We consider the relationship between stationary distributions for stochastic models of reaction systems and Lyapunov functions for their deterministic counterparts. Specifically, we derive the well-known Lyapunov function of reaction network theory as a scaling limit of the non-equilibrium potential of the stationary distribution of stochastically modeled complex balanced systems. We extend thi...
متن کاملScaling and universality of the complexity of analog computation.
We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We numerically analyze various ensembles of linear programming problems and obtain, for each of these ensembles, the probability distribution functions of certain quantities which measure the computational complexity, known as the convergence rate, the barrier and...
متن کامل2 A pr 1 99 9 DISTRIBUTIONS ON PARTITIONS , POINT PROCESSES , AND THE HYPERGEOMETRIC KERNEL
We study a 3–parametric family of stochastic point processes on the one–dimensional lattice originated from a remarkable family of representations of the infinite symmetric group. We prove that the correlation functions of the processes are given by determinantal formulas with a certain kernel. The kernel can be expressed through the Gauss hypergeometric function; we call it the hypergeometric ...
متن کامل