scientific article; zbMATH DE number 3906527
From MaRDI portal
Publication:3684147
zbMATH Open0568.05032MaRDI QIDQ3684147FDOQ3684147
Authors: Brendan D. McKay 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3878944
- ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- On asymmetric \((0,1)\)-matrices with given row and column sum vectors
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Asymptotic enumeration of integer matrices with large equal row and column sums
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
- Asymptotics for the number of row-Fishburn matrices
Cited In (61)
- Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
- Triangles and subgraph probabilities in random regular graphs
- \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph
- Asymptotic enumeration of sparse 2-connected graphs
- Subgraph counts for dense random graphs with specified degrees
- Title not available (Why is that?)
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- The average number of spanning hypertrees in sparse uniform hypergraphs
- Uniform generation of spanning regular subgraphs of a dense graph
- Critical percolation on random regular graphs
- The average number of spanning trees in sparse graphs with given degrees
- Graph drawings with few slopes
- Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics
- Generating simple random graphs with prescribed degree distribution
- Subgraph distributions in dense random regular graphs
- Induced subgraphs in sparse random graphs with given degree sequences
- Random groups, random graphs and eigenvalues of \(p\)-Laplacians
- Local Kesten-McKay law for random regular graphs
- Characterizing optimal sampling of binary contingency tables via the configuration model
- Diffusion in Random Networks: Impact of Degree Distribution
- Limit theorems for a random graph epidemic model
- The number of matchings in random regular graphs and bipartite graphs
- Approximate counting, uniform generation and rapidly mixing Markov chains
- On the robustness of random \(k\)-cores
- A sequential algorithm for generating random graphs
- Asymptotic normality of the \(k\)-core in random graphs
- Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
- Counting strongly-connected, moderately sparse directed graphs
- The number of perfect matchings, and the nesting properties, of random regular graphs
- Bootstrapping on undirected binary networks via statistical mechanics
- Asymptotic Enumeration of Hypergraphs by Degree Sequence
- Title not available (Why is that?)
- Enumeration of graphs with a heavy-tailed degree sequence
- A transition of limiting distributions of large matchings in random graphs
- Counting connected graphs inside-out
- Hitting times for Shamir's problem
- Automorphisms of random graphs with specified vertices
- Counting loopy graphs with given degrees
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- Distribution of the number of spanning regular subgraphs in random graphs
- Applications of the variance of final outbreak size for disease spreading in networks
- On asymmetric \((0,1)\)-matrices with given row and column sum vectors
- Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges
- Independence numbers of random subgraphs of some distance graph
- A critical point for random graphs with a given degree sequence
- Asymptotic enumeration by degree sequence of graphs of high degree
- Asymptotic enumeration of sparse graphs with a minimum degree constraint
- ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS
- Bivariate fluctuations for the number of arithmetic progressions in random sets
- Cutoff phenomena for random walks on random regular graphs
- Random graphs with given vertex degrees and switchings
- Title not available (Why is that?)
- On a random graph evolving by degrees
- The probability that a random multigraph is simple. II
- Uniform generation of \(d\)-factors in dense host graphs
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
- Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges
- Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
- A new approach to the giant component problem
- Approximate counting of regular hypergraphs
- The spectral gap of random regular graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3684147)
