Typicality and entropy of processes on infinite trees

DOI10.1214/21-AIHP1233zbMath1498.05192arXiv2102.02653MaRDI QIDQ2083861

Charles Bordenave, Balázs Szegedy, Agnes Backhausz

Publication date: 11 October 2022

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.02653

zbMATH Keywords

infinite treessofic entropyinvariant processunimodular Galton-Watson random trees

Mathematics Subject Classification ID

Gaussian processes (60G15) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Large deviations (60F10) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Right-convergence of sparse random graphs
• Expansion of random graphs: new proofs, new results
• Large deviations of empirical neighborhood distribution in sparse random graphs
• The asymptotic number of labeled graphs with given degree sequences
• Spectral measures of factor of i.i.d. processes on vertex-transitive graphs
• Replica bounds by combinatorial interpolation for diluted spin systems
• Recurrence of distributional limits of finite planar graphs
• Replica bounds for optimization problems and diluted spin systems
• Broken replica symmetry bounds in the mean field spin glass model
• Differential equations for random processes and random graphs
• Spin systems on Bethe lattices
• Entropy and expansion
• Maximum independent sets on random regular graphs
• On the almost eigenvectors of random regular graphs
• Limits of locally-globally convergent graph sequences
• Processes on unimodular random networks
• Random Graphs and Complex Networks
• Ramanujan graphings and correlation decay in local algorithms
• A proof of Alon’s second eigenvalue conjecture and related problems
• Information, Physics, and Computation
• The Independence Ratio of Regular Graphs
• On large‐girth regular graphs and random processes on trees
• Exposé Bourbaki 1153 : Normalité asymptotique des vecteurs propres d'un graphe régulier aléatoire d'après Ágnes Backhausz et Balázs Szegedy
• A BRIEF INTRODUCTION TO SOFIC ENTROPY THEORY
• On the Independent Domination Number of Random Regular Graphs
• The Interpolation Method for Random Graphs with Prescribed Degrees
• Combinatorial approach to the interpolation method and scaling limits in sparse random graphs

This page was built for publication: Typicality and entropy of processes on infinite trees