The asymptotic number of labeled graphs with given degree sequences
From MaRDI portal
Publication:1255501
DOI10.1016/0097-3165(78)90059-6zbMath0402.05042OpenAlexW1997698259WikidataQ59508819 ScholiaQ59508819MaRDI QIDQ1255501
E. Rodney Canfield, Edward A. Bender
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(78)90059-6
Asymptotic Number of Labeled GraphsGiven Degree SequencesIncidence MatricesInclusion-ExclusionInteger Matrices
Related Items
Mixing times of random walks on dynamic configuration models, The number of matchings in random regular graphs and bipartite graphs, Total domination in regular graphs, Percolation with small clusters on random graphs, Quantum ergodicity for quantum graphs without back-scattering, Sandwiching random graphs: universality between random graph models, Rare event asymptotics for exploration processes for random graphs, Depth first exploration of a configuration model, On ordered Ramsey numbers of bounded-degree graphs, Minimum vertex cover in generalized random graphs with power law degree distribution, Compact pairwise models for epidemics with multiple infectious stages on degree heterogeneous and clustered networks, 3-star factors in random \(d\)-regular graphs, Are crossing dependencies really scarce?, Edge-colorings avoiding fixed rainbow stars, Epidemics in a population with social structures, Generating simple random graphs with prescribed degree distribution, \(k\)-core architecture and \(k\)-core percolation on complex networks, Edge removal in random contact networks and the basic reproduction number, Validation of community robustness, A sequential algorithm for generating random graphs, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), Asymptotics and random sampling for BCI and BCK lambda terms, The number of Euler tours of random directed graphs, Packing chromatic number of cubic graphs, Threshold functions for small subgraphs: an analytic approach, Enumeration of graphs with a heavy-tailed degree sequence, Effective degree household network disease model, The asymptotic distribution of short cycles in random regular graphs, The asymptotic connectivity of labelled regular graphs, A probabilistic analysis of randomly generated binary constraint satisfaction problems., Generation of arbitrary two-point correlated directed networks with given modularity, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, The average distance and the diameter of dense random regular graphs, Sparse partition universal graphs for graphs of bounded degree, The genus of curve, pants and flip graphs, Fast uniform generation of regular graphs, Araneola: a scalable reliable multicast system for dynamic environments, The asymptotic number of claw-free cubic graphs., Large-scale network motif analysis using compression, The flip Markov chain for connected regular graphs, Dynamic monopolies with randomized starting configuration, The cook-book approach to the differential equation method, The component sizes of a critical random graph with given degree sequence, A testing based extraction algorithm for identifying significant communities in networks, Cubic graphs with small independence ratio, Percolation on complex networks: theory and application, On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase, Rejection sampling of bipartite graphs with given degree sequence, Central limit theorems in the configuration model, Edge percolation on a random regular graph of low degree, On the independence and chromatic numbers of random regular graphs, On the termination of some biclique operators on multipartite graphs, Social network formation and strategic interaction in large networks, Model for disease dynamics of a waterborne pathogen on a random network, \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph, Critical random graphs and the differential equations technique, Mean-field models for non-Markovian epidemics on networks, Continuum limit of critical inhomogeneous random graphs, The Kuramoto model in complex networks, Explosive transitions in complex networks' structure and dynamics: percolation and synchronization, Statistical physics of vaccination, Universality for the distance in finite variance random graphs, Sparse maximum-entropy random graphs with a given power-law degree distribution, Weighted distances in scale-free configuration models, Small graph classes and bounded expansion, Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs, The asymptotic number of non-negative integer matrices with given row and column sums, Counting connected graphs inside-out, Analysis of a stochastic SIR epidemic on a random network incorporating household structure, Uniform generation of \(d\)-factors in dense host graphs, Injective edge-coloring of graphs with given maximum degree, On the chromatic number of the preferential attachment graph, On the maximum betweenness improvement problem, Geometry of the minimal spanning tree of a random 3-regular graph, Phase transition for the threshold contact process, an approximation of heterogeneous random Boolean networks, Fifty years of the journal of combinatorial theory, Asymptotic enumeration by degree sequence of graphs of high degree, Automorphisms of random graphs with specified vertices, Counting loopy graphs with given degrees, Structural sparsity of complex networks: bounded expansion in random models and real-world graphs, Invertibility of adjacency matrices for random \(d\)-regular graphs, Enumeration of cubic graphs by inclusion-exclusion, Discrimination through versioning with advertising in social networks, Constrained Markovian dynamics of random graphs, The Kronecker-clique model for higher-order clustering coefficients, Scaling limit of random forests with prescribed degree sequences, The diameter of random regular graphs, Sampling \(k\)-partite graphs with a given degree sequence, Combinatorial analysis. (Matrix problems, choice theory), Universality for random surfaces in unconstrained genus, Random regular graphs of non-constant degree: concentration of the chromatic number, The evolution of the min-min random graph process, Global lower mass-bound for critical configuration models in the heavy-tailed regime, Typicality and entropy of processes on infinite trees, On a random graph evolving by degrees, Limit theorems for a random graph epidemic model, Almost all regular graphs are Hamiltonian, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees, Metric structure of random networks, Asymptotic enumeration of sparse graphs with a minimum degree constraint, On the modularity of 3‐regular random graphs and random graphs with given degree sequences, Fast uniform generation of random graphs with given degree sequences, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, Cutoff for rewiring dynamics on perfect matchings, On the minimum bisection of random 3-regular graphs, Statistics of Feynman amplitudes in \(\phi^4\)-theory, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, Stable graphs: distributions and line-breaking construction, Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model, A hierarchical intervention scheme based on epidemic severity in a community network, Percolation of arbitrary uncorrelated nested subgraphs, Nearly-Regular Hypergraphs and Saturation of Berge Stars, Spanning trees in random regular uniform hypergraphs, Spectral gap in random bipartite biregular graphs and applications, Sharp load thresholds for cuckoo hashing, Random Simplicial Complexes: Models and Phenomena, THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS, The scaling window for a random graph with a given degree sequence, Almost all cubic graphs are Hamiltonian, Graph drawings with few slopes, Structural Characterization of Networks Using the Cat Cortex as an Example, Inside the critical window for cohomology of random k -complexes, Almost all regular graphs are hamiltonian, The structure of typical clusters in large sparse random configurations, Analyzing local and global properties of multigraphs, Information geometric methods for complexity, Asymptotic bounds on total domination in regular graphs, Critical percolation on scale-free random graphs: new universality class for the configuration model, Complex networks: structure and dynamics, Hamilton Cycles in Random Regular Digraphs, A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three, Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs, Near‐perfect token distribution, Discrepancy properties for random regular digraphs, Push is Fast on Sparse Random Graphs, Cycle Factors and Renewal Theory, GROWING HIERARCHICAL SCALE-FREE NETWORKS BY MEANS OF NONHIERARCHICAL PROCESSES, Ensemble nonequivalence in random graphs with modular structure, The replica symmetric solution for orthogonally constrained Heisenberg model on Bethe lattice, Loose Hamilton Cycles in Regular Hypergraphs, The Multiple-Orientability Thresholds for Random Hypergraphs, Random Regular Graphs: Asymptotic Distributions and Contiguity, Random graphs with given vertex degrees and switchings, The degree-wise effect of a second step for a random walk on a graph, Exactly solvable random graph ensemble with extensively many short cycles, Asymptotic normality in random graphs with given vertex degrees, On the number of nonorientable Wicks forms in a free group, Approximate counting of regular hypergraphs, Limit distributions of the number of loops in a random configuration graph, Perfect Matchings in Random r-regular, s-uniform Hypergraphs, Constructing and sampling directed graphs with given degree sequences, PERFORMANCE AND ROBUSTNESS OF CELLULAR AUTOMATA COMPUTATION ON IRREGULAR NETWORKS, Phase transition in random contingency tables with non-uniform margins, Typical performance of approximation algorithms for NP-hard problems, Synchronization in power-law networks, Counting labeled general cubic graphs, Exact sampling of graphs with prescribed degree correlations, The Probability That a Random Multigraph is Simple, Configuring Random Graph Models with Fixed Degree Sequences, Sampling for Conditional Inference on Network Data, Component structure of the vacant set induced by a random walk on a random graph, ON COVERAGE BOUNDS OF UNSTRUCTURED PEER-TO-PEER NETWORKS, Hamilton cycles containing randomly selected edges in random regular graphs, Synchronization in random networks with given expected degree sequences, Asymptotics of trees with a prescribed degree sequence and applications, ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS, Hamilton cycles in the union of random permutations, Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk, Contagions in random networks with overlapping communities, Minors in random regular graphs, Critical percolation on random regular graphs, Random graphs with forbidden vertex degrees, Giant Component in Random Multipartite Graphs with Given Degree Sequences, On the Chromatic Number of Random Graphs with a Fixed Degree Sequence, Generating asymptotics for factorially divergent sequences, Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks, Lower bounds for random 3-SAT via differential equations, Generating asymptotics for factorially divergent sequences, The Critical Phase for Random Graphs with a Given Degree Sequence, Anatomy of the giant component: the strictly supercritical regime, Almost all graphs with average degree 4 are 3-colorable, The spread of fire on a random multigraph, Near-perfect token distribution, Applications of the variance of final outbreak size for disease spreading in networks, A critical point for random graphs with a given degree sequence, Majorization and the number of bipartite graphs for given vertex degrees, Extreme fluctuations in noisy task-completion landscapes on scale-free networks, On giant components and treewidth in the layers model, Generating Random Networks Without Short Cycles, An edge-based model for non-Markovian sexually transmitted infections in coupled network, Uniform Generation of Random Regular Graphs, Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees, Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?, The bisection width of cubic graphs, Directed random graphs with given degree distributions, Counting strongly-connected, moderately sparse directed graphs, The probability that a random multigraph is simple. II, Rumor spreading on random regular graphs and expanders, Using the bootstrap for statistical inference on random graphs, Uniform generation of spanning regular subgraphs of a dense graph, Limit laws for self-loops and multiple edges in the configuration model, Explicit Near-Ramanujan Graphs of Every Degree, Large deviation and anomalous fluctuations scaling in degree assortativity on configuration networks, Unnamed Item, The diameter of weighted random graphs, An old approach to the giant component problem, Percolation on Random Graphs with a Fixed Degree Sequence, On compactness of logics that can express properties of symmetry or connectivity, Imaginary replica analysis of loopy regular random graphs, Asymptotic Enumeration of Hypergraphs by Degree Sequence
Cites Work
