Exponents for Hamiltonian paths on random bicubic maps and KPZ

نویسندگان

چکیده

We evaluate the configuration exponents of various ensembles Hamiltonian paths drawn on random planar bicubic maps. These are estimated from extrapolations exact enumeration results for finite sizes and compared with their theoretical predictions based Knizhnik, Polyakov Zamolodchikov (KPZ) relations, as applied to regular counterpart honeycomb lattice. show that a naive use these relations does not reproduce measured but simple modification in application may possibly correct observed discrepancy. similar is required via KPZ formulas some exactly known problem unweighted fully packed loops

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Logistic Maps and Lyapunov Exponents

We prove that under certain basic regularity conditions, a random iteration of logistic maps converges to a random point attractor when the Lyapunov exponent is negative, and does not converge to a point when the Lyapunov exponent is positive.

متن کامل

Geometrical Interpretation of the KPZ Exponents

We provide evidence that the KPZ exponents in two-dimensional quantum gravity can be interpreted as scaling exponents of correlation functions which are functions of the invariant geodesic distance between the fields.

متن کامل

Hamiltonian increasing paths in random edge orderings

Let f be an edge ordering of Kn: a bijection E(Kn) → {1, 2, . . . , ( n 2 ) }. For an edge e ∈ E(Kn), we call f(e) the label of e. An increasing path in Kn is a simple path (visiting each vertex at most once) such that the label on each edge is greater than the label on the previous edge. We let S(f) be the number of edges in the longest increasing path. Chvátal and Komlós raised the question o...

متن کامل

On Hamiltonian cycles and Hamiltonian paths

A Hamiltonian cycle is a spanning cycle in a graph, i.e., a cycle through every vertex, and a Hamiltonian path is a spanning path. In this paper we present two theorems stating sufficient conditions for a graph to possess Hamiltonian cycles and Hamiltonian paths. The significance of the theorems is discussed, and it is shown that the famous Ore’s theorem directly follows from our result.  2004...

متن کامل

Uniform Hyperbolicity for Random Maps with Positive Lyapunov Exponents

We consider some general classes of random dynamical systems and show that a priori very weak nonuniform hyperbolicity conditions actually imply uniform hyperbolicity.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nuclear Physics B

سال: 2023

ISSN: ['1873-1562', '0550-3213']

DOI: https://doi.org/10.1016/j.nuclphysb.2023.116084