2025/03/11 by Yoann Offret, Offret, Yoann, Sergey Dovgal +1 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Combinatorics (math.CO) #Complex Network Analysis Techniques #Computability, Logic, AI Algorithms #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Probability (math.PR)
paper · pdf · doi:10.48550/arxiv.2503.08172
openalex publication_date 2025/03/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce and develop the concept of Maximal Entropy Random Walks (MERWs) on Weighted Bratteli Diagrams (WBDs), maximizing entropy production along paths as a natural criterion for choosing random walks on networks. Initially defined for irreducible finite graphs, MERWs were recently extended to the infinite setting in [1]. Bratteli Diagrams model various growth processes, such as the Young Lattice, where the Plancherel growth process emerges as a MERW. We show that MERWs are special cases of central Markov chains, which, in general, provide a powerful framework for deriving combinatorial identities. Regarding growing trees, in particular, we retrieve and extend Han's hook-length formula for binary trees and demonstrate that the Binary Search Tree (BST) process is a MERW, recovering its asymptotic behavior. We also introduce preferential attachment to generalize BSTs. For comb models, significant central measures appear, including the Chinese restaurant process, providing an alternative proof of the Poisson-Dirichlet limit distribution. Finally, we propose a Monte Carlo method, based on Knuth's algorithm, to approximate MERWs. We apply it to a pyramidal growth model, drawing connections with the limit shape of Young diagrams under the Plancherel measure.