scientific article
From MaRDI portal
Publication:3684147
zbMath0568.05032MaRDI QIDQ3684147
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (55)
The number of matchings in random regular graphs and bipartite graphs ⋮ Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges ⋮ Random groups, random graphs and eigenvalues of \(p\)-Laplacians ⋮ Graph drawings with few slopes ⋮ Generating simple random graphs with prescribed degree distribution ⋮ Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity ⋮ Approximate counting, uniform generation and rapidly mixing Markov chains ⋮ A sequential algorithm for generating random graphs ⋮ The number of perfect matchings, and the nesting properties, of random regular graphs ⋮ The spectral gap of random regular graphs ⋮ Independence numbers of random subgraphs of some distance graph ⋮ Subgraph distributions in dense random regular graphs ⋮ Local Kesten-McKay law for random regular graphs ⋮ Enumeration of graphs with a heavy-tailed degree sequence ⋮ A transition of limiting distributions of large matchings in random graphs ⋮ Triangles and subgraph probabilities in random regular graphs ⋮ Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph ⋮ Induced subgraphs in sparse random graphs with given degree sequences ⋮ Random graphs with given vertex degrees and switchings ⋮ Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges ⋮ Approximate counting of regular hypergraphs ⋮ The average number of spanning hypertrees in sparse uniform hypergraphs ⋮ Asymptotic normality of the \(k\)-core in random graphs ⋮ Diffusion in Random Networks: Impact of Degree Distribution ⋮ Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\) ⋮ \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph ⋮ Characterizing optimal sampling of binary contingency tables via the configuration model ⋮ Counting connected graphs inside-out ⋮ Uniform generation of \(d\)-factors in dense host graphs ⋮ Cutoff phenomena for random walks on random regular graphs ⋮ Graphs with specified degree distributions, simple epidemics, and local vaccination strategies ⋮ Bivariate fluctuations for the number of arithmetic progressions in random sets ⋮ Applications of the variance of final outbreak size for disease spreading in networks ⋮ A critical point for random graphs with a given degree sequence ⋮ A new approach to the giant component problem ⋮ On the robustness of random \(k\)-cores ⋮ Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics ⋮ Bootstrapping on undirected binary networks via statistical mechanics ⋮ Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs ⋮ Asymptotic enumeration by degree sequence of graphs of high degree ⋮ Automorphisms of random graphs with specified vertices ⋮ Counting loopy graphs with given degrees ⋮ Subgraph counts for dense random graphs with specified degrees ⋮ Counting strongly-connected, moderately sparse directed graphs ⋮ The probability that a random multigraph is simple. II ⋮ On a random graph evolving by degrees ⋮ Limit theorems for a random graph epidemic model ⋮ Uniform generation of spanning regular subgraphs of a dense graph ⋮ Distribution of the number of spanning regular subgraphs in random graphs ⋮ Asymptotic enumeration of sparse 2-connected graphs ⋮ Hitting times for Shamir’s problem ⋮ Asymptotic Enumeration of Hypergraphs by Degree Sequence ⋮ Asymptotic enumeration of sparse graphs with a minimum degree constraint ⋮ Critical percolation on random regular graphs ⋮ The average number of spanning trees in sparse graphs with given degrees
This page was built for publication:
