Multicritical continuous random trees

DOI10.1088/1742-5468/2006/04/P04004MaRDI QIDQ5239285zbMATHOpenAlexFDO

Authors Bouttier, Philippe Di Francesco, Emmanuel Guitter

Publication date 22 October 2019

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math-ph/0603007

zbMATH Keywords

networksrandom graphscorrelation functionsrigorous results in statistical mechanics

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Combinatorial probability (60C05) Enumeration in graph theory (05C30) Applications of hypergeometric functions (33C90)

Abstract: We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root singularity in their generating function. The scaling limit involves continuous trees with branching points of order up to k+1. We derive explicit integral representations for the average profile of this k-th order multicritical continuous random tree, as well as for its history distributions measuring multi-point correlations. The latter distributions involve non-positive universal weights at the branching points together with fractional derivative couplings. We prove universality by rederiving the same results within a purely continuous axiomatic approach based on the resolution of a set of consistency relations for the multi-point correlations. The average profile is shown to obey a fractional differential equation whose solution involves hypergeometric functions and matches the integral formula of the discrete approach.

Recommendations

• The continuum random tree. III
• scientific article; zbMATH DE number 19286
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• The continuum random tree. I
• The continuum random tree is the scaling limit of unlabeled unrooted trees

Cites work

• scientific article; zbMATH DE number 19286 (Why is no real title available?)
• scientific article; zbMATH DE number 88818 (Why is no real title available?)
• scientific article; zbMATH DE number 1344715 (Why is no real title available?)
• An introduction to fractional calculus
• Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
• Census of planar maps: From the one-matrix model solution to a combinatorial proof
• Combinatorics of bicubic maps with hard particles
• Combinatorics of hard particles on planar graphs
• Counting colored random triangulations
• Critical and multicritical semi-random (1 +d)-dimensional lattices and hard objects inddimensions
• Critical and tricritical hard objects on bicolourable random lattices: exact solutions
• Enumeration of planar constellations
• Geodesic distance in planar graphs
• Non-perturbative Lorentzian quantum gravity, causality and topology change
• Nonperturbative two-dimensional quantum gravity
• Planar diagrams
• Planar maps as labeled mobiles
• The continuum random tree. I
• The continuum random tree. III
• Tree-based models for random distribution of mass

This page was built for publication: Multicritical continuous random trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239285)