Counting graphic sequences via integrated random walks

DOI10.1090/TRAN/9403MaRDI QIDQ6971255zbMATH OpenFDO

Authors Paul Balister, Serte Donderwinkel, Carla Groenland, Tom Johnston, Alex Scott

Publication date 17 June 2025

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/TRAN/9403

zbMATH Keywords

degree sequencesgraphic sequencesrandom walks

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Vertex degrees (05C07) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Sums of independent random variables; random walks (60G50)

Cites work

• A note on graphical partitions
• A remark on the existence of finite graphs
• An American tournament treated by the calculus of symmetric functions.
• Asymptotic bounds on graphical partitions and partition comparability
• Asymptotic enumeration by degree sequence of graphs of high degree
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Asymptotic enumeration of graphs with given degree sequence
• Brownian bridge asymptotics for random mappings
• Conditional persistence of Gaussian random walks
• Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number
• Confirming two conjectures about the integer partitions
• Efficient counting of degree sequences
• Exit times for integrated random walks
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3906527 (Why is no real title available?)
• scientific article; zbMATH DE number 3906533 (Why is no real title available?)
• scientific article; zbMATH DE number 17664 (Why is no real title available?)
• scientific article; zbMATH DE number 840688 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• scientific article; zbMATH DE number 3375521 (Why is no real title available?)
• scientific article; zbMATH DE number 3392294 (Why is no real title available?)
• On graphical partitions
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On the asymptotic number of tournament score sequences
• On the probability that integrated random walks stay positive
• Parallel enumeration of degree sequences of simple graphs
• Parallel enumeration of degree sequences of simple graphs. II
• Persistence of iterated partial sums
• Persistence probabilities and exponents
• Persistence probabilities for a Bridge of an integrated simple random walk
• Positivity of integrated random walks
• Random maps
• Random trees and applications
• Seven criteria for integer sequences being graphic
• The asymptotic number of score sequences
• The Brownian limit of separable permutations
• The number of graphs and a random graph with a given degree sequence

Cited in

(1)

• Sinaĭ excursions: an analogue of Sparre Andersen's formula for the area process of a random walk

This page was built for publication: Counting graphic sequences via integrated random walks

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