Subsequential Scaling Limits for Liouville Graph Distance
نویسندگان
چکیده
منابع مشابه
Subsequential scaling limits of simple random walk on the two-dimensional uniform spanning tree
The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of the intrinsic metrics, measures and embeddings of the subsequential limits in this space are obtained, with it being proved in particular that the Hausdor↵ ...
متن کاملUniversal scaling limits of matrix models , and ( p , q ) Liouville gravity
We show that near a point where the equilibrium density of eigenvalues of a matrix model behaves like y ∼ x p/q , the correlation functions of a random matrix, are, to leading order in the appropriate scaling, given by determinants of the universal (p, q)-minimal models kernels. Those (p, q) kernels are written in terms of functions solutions of a linear equation of order q, with polynomial coe...
متن کاملOn the Scaling Limits of Determinantal Point Processes with Kernels Induced by Sturm–Liouville Operators
By applying an idea of Borodin and Olshanski [J. Algebra 313 (2007), 40–60], we study various scaling limits of determinantal point processes with trace class projection kernels given by spectral projections of selfadjoint Sturm–Liouville operators. Instead of studying the convergence of the kernels as functions, the method directly addresses the strong convergence of the induced integral opera...
متن کاملScaling Limits for Mixed Kernels
Let μ and ν be measures supported on (−1, 1) with corresponding orthonormal polynomials { pn } and {pn} respectively. Define the mixed kernel K n (x, y) = n−1 ∑ j=0 pμj (x) p ν j (y) . We establish scaling limits such as lim n→∞ π √ 1− ξ √ μ′ (ξ) ν′ (ξ) n K n ( ξ + aπ √ 1− ξ n , ξ + bπ √ 1− ξ n ) = S ( π (a− b) 2 ) cos ( π (a− b) 2 +B (ξ) ) , where S (t) = sin t t is the sinc kernel, and B (ξ) ...
متن کاملScaling Limits for Workload Process
We study different scaling behavior of a very general telecommunications workload process. The activities of a telecommunication system are described by a marked point process ((Tn, Zn))n∈Z, where Tn is the arrival time of a packet brought to the system or the starting time of the activity of an individual source and the mark Zn is the amount of work brought to the system at time Tn. This model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2020
ISSN: 0010-3616,1432-0916
DOI: 10.1007/s00220-020-03684-6