The number of graphs and a random graph with a given degree sequence
From MaRDI portal
Publication:4921886
DOI10.1002/rsa.20409zbMath1264.05125arXiv1003.0356OpenAlexW2004542856MaRDI QIDQ4921886
J. A. Hartigan, Alexander I. Barvinok
Publication date: 28 May 2013
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.0356
Related Items
Moments of Uniform Random Multigraphs with Fixed Degree Sequences, Maximum entropy and integer partitions, Independent sets of a given size and structure in the hypercube, Is breaking of ensemble equivalence monotone in the number of constraints?, Covariance structure behind breaking of ensemble equivalence in random graphs, Detection thresholds for the \(\beta\)-model on sparse graphs, Probabilistic existence of regular combinatorial structures, Large deviation for uniform graphs with given degrees, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), Friendly bisections of random graphs, Threshold functions for small subgraphs in simple graphs and multigraphs, Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, Asymptotic theory in bipartite graph models with a growing number of parameters, The switch Markov chain for sampling irregular graphs and digraphs, Lower bounds for contingency tables via Lorentzian polynomials, Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges, Random doubly stochastic matrices: the circular law, MAX-plus objects to study the complexity of graphs, Phase transition in random contingency tables with non-uniform margins, Testing goodness of fit of random graph models, Sparse maximum-entropy random graphs with a given power-law degree distribution, Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications, Matrices with prescribed row and column sums, Counting loopy graphs with given degrees, An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums, Sandwiching dense random regular graphs between binomial random graphs
Cites Work
- Random graphs with a given degree sequence
- Limits of dense graph sequences
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
- Matrix integrals and map enumeration: an accessible introduction
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
- Asymptotic enumeration by degree sequence of graphs of high degree
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- Subgraphs of Dense Random Graphs with Specified Degrees
- Random dense bipartite graphs and directed graphs with specified degrees
- Reverse Holder Inequalities for Spherical Harmonics
- Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
