Partition Functions of Discrete Coalescents: From Cayley’s Formula to Frieze’s ζ(3) Limit Theorem

DOI10.1007/978-3-319-13984-5_1zbMath1498.60348arXiv1407.8538OpenAlexW2288811137MaRDI QIDQ5038259

Louigi Addario-Berry

Publication date: 30 September 2022

Published in: XI Symposium on Probability and Stochastic Processes (Search for Journal in Brave)

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

zbMATH Keywords

partition functionrandom graphsexecution pathminimum span treespan treeoriented edge

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Exchangeability for stochastic processes (60G09) Coalescent processes (60J90)

Related Items

Depth of vertices with high degree in random recursive trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random trees and applications
• On the value of a random minimum spanning tree problem
• Coalescent random forests
• Some large deviation results for sparse random graphs
• The scaling limit of the minimum spanning tree of the complete graph
• On a ternary coalescent process
• Critical random graphs and the structure of a minimum spanning tree
• A random tree model associated with random graphs
• A note on the height of binary search trees
• Large‐deviations/thermodynamic approach to percolation on the complete graph
• On the height of trees