How to determine if a random graph with a fixed degree sequence has a giant component

DOI10.1007/s00440-017-0757-1zbMath1379.05102arXiv1601.03714OpenAlexW2233773646MaRDI QIDQ681521

Bruce A. Reed, Felix Joos, Guillem Perarnau, Dieter Rautenbach

Publication date: 12 February 2018

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.03714

zbMATH Keywords

random network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items

Chase-escape on the configuration model, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, Largest component of subcritical random graphs with given degree sequence, Random graphs with given vertex degrees and switchings, Asymptotic normality in random graphs with given vertex degrees, The spread of fire on a random multigraph, Component structure of the configuration model: Barely supercritical case, Percolation on Random Graphs with a Fixed Degree Sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The component sizes of a critical random graph with given degree sequence
• Distance in random graphs with infinite mean degrees
• On percolation in random graphs with given vertex degrees
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• An old approach to the giant component problem
• Complex networks: structure and dynamics
• A general critical condition for the emergence of a giant component in random graphs with given degrees
• The Phase Transition in the Configuration Model
• The scaling window for a random graph with a given degree sequence
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• A random graph model for massive graphs
• A simple solution to the k‐core problem
• A new approach to the giant component problem
• Some problems in the enumeration of labelled graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• Random graph models of social networks
• A critical point for random graphs with a given degree sequence
• Distances in random graphs with finite variance degrees
• The switch Markov chain for sampling irregular graphs (Extended Abstract)
• The diameter of sparse random graphs
• Sampling Regular Graphs and a Peer-to-Peer Network
• The Critical Phase for Random Graphs with a Given Degree Sequence
• Percolation on Sparse Random Graphs with Given Degree Sequence
• Graph colouring and the probabilistic method