Connected components in random graphs with given expected degree sequences
From MaRDI portal
Publication:1865669
DOI10.1007/PL00012580zbMATH Open1009.05124OpenAlexW2112976607MaRDI QIDQ1865669FDOQ1865669
Authors: Linyuan Lu, Fan Chung 
Publication date: 27 March 2003
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00012580
Recommendations
- Connectedness of certain random graphs
- On the connectedness of a random graph
- Estimation of the number of connected sets in a graph and the structure of components of random subsets
- scientific article; zbMATH DE number 4055665
- Connected components and evolution of random graphs: An algebraic approach
- The component sizes of a critical random graph with given degree sequence
- \(k\)-connectivity in random graphs
- Bounds on probability of connectedness of a random graph
- Random graphs with a given degree sequence
- Giant component in random multipartite graphs with given degree sequences
Cited In (only showing first 100 items - show all)
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- Distance in random graphs with infinite mean degrees
- Contact processes on scale-free networks
- A scale-free graph model based on bipartite graphs
- Percolation in invariant Poisson graphs with i.i.d. degrees
- Modelling the emergence of the interbank networks
- Universality for critical heavy-tailed network models: metric structure of maximal components
- Universality for distances in power-law random graphs
- Sufficient conditions for graphicality of bidegree sequences
- Parameterized clique on inhomogeneous random graphs
- Novel scaling limits for critical inhomogeneous random graphs
- An integer programming framework for critical elements detection in graphs
- Component structure of the configuration model: barely supercritical case
- A preferential attachment model with random initial degrees
- Generating simple random graphs with prescribed degree distribution
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs
- Percolation on complex networks: theory and application
- Universal latent space model fitting for large networks with edge covariates
- Evolution of scale-free random graphs: Potts model formulation
- The nature of explosive percolation phase transition
- Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
- Statistical ensembles for economic networks
- Large deviations for power-law thinned Lévy processes
- Modularity Maximization for Graphons
- Bootstrap percolation and the geometry of complex networks
- Complex macroscopic behavior in systems of phase oscillators with adaptive coupling
- Minimum vertex cover in generalized random graphs with power law degree distribution
- Cluster tails for critical power-law inhomogeneous random graphs
- Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems
- Typical distances in a geometric model for complex networks
- Homophily and long-run integration in social networks
- The spectra of multiplicative attribute graphs
- A sequential algorithm for generating random graphs
- Chimeras in random non-complete networks of phase oscillators
- Multivariate Hawkes processes on inhomogeneous random graphs
- The average size of giant components between the double-jump
- Bootstrap percolation in random \(k\)-uniform hypergraphs
- Robustness of power-law networks: its assessment and optimization
- Dense subgraphs of power-law random graphs
- An elementary approach to component sizes in critical random graphs
- The graph spectra and spectral moments of random graphs
- First passage percolation on inhomogeneous random graphs
- The percolation transition in correlated hypergraphs
- Directed random graphs with given degree distributions
- Thresholds for virus spread on networks
- Network security and contagion
- Connected components and evolution of random graphs: An algebraic approach
- The Critical Phase for Random Graphs with a Given Degree Sequence
- Motif-based tests for bipartite networks
- Synchronization of coupled chaotic maps
- Critical behavior in inhomogeneous random graphs
- Large cliques in a power-law random graph
- Universality for the distance in finite variance random graphs
- An equation-free approach to coarse-graining the dynamics of networks
- Swarming on random graphs
- Bounding basic characteristics of spatial epidemics with a new percolation model
- Constructing and sampling directed graphs with given degree sequences
- Generation of networks with prescribed degree-dependent clustering
- A note on the derivation of epidemic final sizes
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees
- Synchronization in random networks with given expected degree sequences
- Subsampling bootstrap of count features of networks
- Bounds for pairs in judicious partitioning of graphs
- The method of moments and degree distributions for network models
- Scale-free percolation
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Managing Default Contagion in Inhomogeneous Financial Networks
- Scaling limits and generic bounds for exploration processes
- Motif statistics and spike correlations in neuronal networks
- Model hierarchies in edge-based compartmental modeling for infectious disease spread
- The largest component in a subcritical random graph with a power law degree distribution
- Bootstrap percolation in power-law random graphs
- Large deviations for empirical measures of generalized random graphs
- Capacity of an associative memory model on random graph architectures
- The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
- Continuum limit of critical inhomogeneous random graphs
- Networks beyond pairwise interactions: structure and dynamics
- PageRank on inhomogeneous random digraphs
- Analytical maximum-likelihood method to detect patterns in real networks
- COVID-19 epidemic under the K-quarantine model: network approach
- Optimization via low-rank approximation for community detection in networks
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
- A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs
- Null models and community detection in multi-layer networks
- Matching graphs with unique node labels
- Discrete Ricci curvatures for directed networks
- Swarming on random graphs. II
- Scalable subspace methods for derivative-free nonlinear least-squares optimization
- Clustering and the hyperbolic geometry of complex networks
- Edgeworth expansions for network moments
- De-anonymization of heterogeneous random graphs in quasilinear time
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Ultra-fast rumor spreading in social networks
- From ecology to finance (and back?): a review on entropy-based null models for the analysis of bipartite networks
- Sparse maximum-entropy random graphs with a given power-law degree distribution
- Controlling edge dynamics in multilayer networks
- Maximizing the size of the giant
- The effects of within-neuron degree correlations in networks of spiking neurons
This page was built for publication: Connected components in random graphs with given expected degree sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865669)
