scientific article; zbMATH DE number 747040

MaRDI QIDQ4697461zbMATH OpenFDO

Authors Tomasz Łuczak

Publication date 11 July 1995

zbMATH Keywords

probabilitydegree sequencerandom graph processisolated cycleslarge component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• A critical point for random graphs with a given degree sequence
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Connected components in random graphs with given expected degree sequences

Cited in

(42)

• Percolation on Sparse Random Graphs with Given Degree Sequence
• The densest subgraph problem in sparse random graphs
• Random graphs with forbidden vertex degrees
• Random graphs with a fixed maximum degree
• Random graphs with a given degree sequence
• New approximations for network reliability
• A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three
• scientific article; zbMATH DE number 7731163 (Why is no real title available?)
• Critical window for connectivity in the configuration model
• Multilayer brain networks
• Sparse quasi-random graphs
• scientific article; zbMATH DE number 3878974 (Why is no real title available?)
• On the robustness of random k-cores
• Phase transitions in graphs on orientable surfaces
• The Threshold of Symmetry in Random Graphs with Specified Degree Sequences
• Push is Fast on Sparse Random Graphs
• The number of graphs and a random graph with a given degree sequence
• MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass
• Geometry of the minimal spanning tree of a random 3-regular graph
• scientific article; zbMATH DE number 2076150 (Why is no real title available?)
• Enumeration of graphs with a heavy-tailed degree sequence
• Counting connected graphs inside-out
• On a surface formed by randomly gluing together polygonal discs
• Applications of the variance of final outbreak size for disease spreading in networks
• The evolution of the min-min random graph process
• Subgraphs of dense random graphs with specified degrees
• A critical point for random graphs with a given degree sequence
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• Building a random network with a given expected giant component
• Fuzzy clustering with Barber modularity regularization
• The first-order contiguity of sparse random graphs with prescribed degrees
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
• Mixing times of random walks on dynamic configuration models
• On resilience of connectivity in the evolution of random graphs
• The phase transition in inhomogeneous random graphs
• Core forging and local limit theorems for the \(k\)-core of random graphs
• Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges
• Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
• The stripping process can be slow. II
• Random graphs of binomial type with sparsely-edged initial graphs
• Loose cores and cycles in random hypergraphs
• How to determine if a random graph with a fixed degree sequence has a giant component

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 Q4697461)