Counting loopy graphs with given degrees

DOI10.1016/j.laa.2011.03.052zbMath1236.05108arXiv1103.0080OpenAlexW2962853152MaRDI QIDQ763074

Catherine Greenhill, Brendan D. McKay

Publication date: 8 March 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

graphasymptotic enumerationrandom matrixloopPoisson binomial distributionrandom graph1 matrixsymmetric 0

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumeration in graph theory (05C30) Vertex degrees (05C07)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rational realization of maximum eigenvalue multiplicity of symmetric tree sign patterns
• Asymptotic expansions for sums of nonidentically distributed Bernoulli random variables
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• The asymptotic number of labeled graphs with given degree sequences
• Asymptotic enumeration by degree sequence of graphs of high degree
• A dichotomy for minimum cost graph homomorphisms
• Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
• An approximation theorem for the Poisson binomial distribution
• Subgraphs of Dense Random Graphs with Specified Degrees
• On the rate of Poisson convergence
• Concentration Inequalities and Martingale Inequalities: A Survey
• The degree sequence of a random graph. I. The models
• The number of graphs and a random graph with a given degree sequence
• On Recursions Connected With Symmetric Groups I
• On Solutions of x^d = 1 In Symmetric Groups