Connected components in random graphs with given expected degree sequences
From MaRDI portal
Publication:1865669
DOI10.1007/PL00012580zbMath1009.05124OpenAlexW2112976607MaRDI QIDQ1865669
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
Related Items
Towards a Systematic Evaluation of Generative Network Models, Moments of Uniform Random Multigraphs with Fixed Degree Sequences, An elementary approach to component sizes in critical random graphs, Strong couplings for static locally tree-like random graphs, Estimating the size of populations at high risk for HIV using respondent‐driven sampling data, Unnamed Item, Approximate estimation in a class of directed networks, Large deviations for empirical measures of generalized random graphs, Scalable subspace methods for derivative-free nonlinear least-squares optimization, Modularity Maximization for Graphons, INTERPLAY BETWEEN HIV/AIDS EPIDEMICS AND DEMOGRAPHIC STRUCTURES BASED ON SEXUAL CONTACT NETWORKS, Approximating sparse graphs: The random overlapping communities model, An Updated Experimental Evaluation of Graph Bipartization Methods, The impact of heterogeneity and geometry on the proof complexity of random satisfiability, Local limits of spatial inhomogeneous random graphs, Phase transition in random intersection graphs with communities, Generating large scale‐free networks with the Chung–Lu random graph model, A proof of the Erdős-Faber-Lovász conjecture, On the chromatic number in the stochastic block model, Phase transitions in a power-law uniform hypergraph, Bootstrap percolation in inhomogeneous random graphs, CONTROL CONTRIBUTION IDENTIFIES TOP DRIVER NODES IN COMPLEX NETWORKS, Long-term stability of interacting Hawkes processes on random graphs, Structural controllability and observability of complex network with output feedback, Finding Cliques in Social Networks: A New Distribution-Free Model, Unnamed Item, Stochastic recursions on directed random graphs, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, Unnamed Item, Analytical maximum-likelihood method to detect patterns in real networks, Constructing and sampling directed graphs with given degree sequences, First-Order Model-Checking in Random Graphs and Complex Networks, The percolation transition in correlated hypergraphs, Motif statistics and spike correlations in neuronal networks, Entropy production and fluctuation theorems on complex networks, Clustering and the Hyperbolic Geometry of Complex Networks, Unnamed Item, Modelling the emergence of the interbank networks, The Critical Phase for Random Graphs with a Given Degree Sequence, Large Cliques in a Power-Law Random Graph, Optimization via low-rank approximation for community detection in networks, Universality for distances in power-law random graphs, Spectral densities of scale-free networks, Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs., Managing Default Contagion in Inhomogeneous Financial Networks, Unbiased sampling of network ensembles, Typical distances in a geometric model for complex networks, Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees, From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial), RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness, Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities, Component structure of the configuration model: Barely supercritical case, Directed random graphs with given degree distributions, Sampling Geometric Inhomogeneous Random Graphs in Linear Time, The Phase Transition in Multitype Binomial Random Graphs, Unnamed Item, Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs, First Passage Percolation on Inhomogeneous Random Graphs, New analytical lower bounds on the clique number of a graph, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness, Large deviations for power-law thinned Lévy processes, Null models and community detection in multi-layer networks, Not all interventions are equal for the height of the second peak, Networks beyond pairwise interactions: structure and dynamics, Diameter of random spanning trees in a given graph, Edgeworth expansions for network moments, Motif-based tests for bipartite networks, A preferential attachment model with random initial degrees, Swarming on random graphs, Minimum vertex cover in generalized random graphs with power law degree distribution, Bootstrap percolation in random \(k\)-uniform hypergraphs, Matching graphs with unique node labels, Robustness of power-law networks: its assessment and optimization, A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs, Network security and contagion, Generating simple random graphs with prescribed degree distribution, Controlling edge dynamics in multilayer networks, MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass, Multivariate Hawkes processes on inhomogeneous random graphs, Evolution of scale-free random graphs: Potts model formulation, Scale-free percolation, A sequential algorithm for generating random graphs, Model hierarchies in edge-based compartmental modeling for infectious disease spread, Distance in random graphs with infinite mean degrees, Local weak convergence for PageRank, Wildfire fuel management: network-based models and optimization of prescribed burning, Universality for critical heavy-tailed network models: metric structure of maximal components, The nature of explosive percolation phase transition, Bounds for pairs in judicious partitioning of graphs, Subsampling bootstrap of count features of networks, Sufficient Conditions for Graphicality of Bidegree Sequences, An integer programming framework for critical elements detection in graphs, Degree assortativity in networks of spiking neurons, Bootstrap percolation and the geometry of complex networks, Thresholds for virus spread on networks, Sampling dynamic networks with application to investigation of HIV epidemic drivers, Systemic cascades on inhomogeneous random financial networks, Discrete Ricci curvatures for directed networks, Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems, Greed is good for deterministic scale-free networks, The effects of within-neuron degree correlations in networks of spiking neurons, Contact processes on scale-free networks, Homophily and long-run integration in social networks, Geometric inhomogeneous random graphs, Complex macroscopic behavior in systems of phase oscillators with adaptive coupling, Connected components and evolution of random graphs: An algebraic approach, The method of moments and degree distributions for network models, An equation-free approach to coarse-graining the dynamics of networks, Dense subgraphs of power-law random graphs, Percolation on complex networks: theory and application, The largest component in a subcritical random graph with a power law degree distribution, PageRank on inhomogeneous random digraphs, PageRank's behavior under degree correlations, Generating graphs by creating associative and random links between existing nodes, Evolution of a modified binomial random graph by agglomeration, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Continuum limit of critical inhomogeneous random graphs, Scaling limits and generic bounds for exploration processes, Law of large numbers for the largest component in a hyperbolic model of complex networks, Bounding basic characteristics of spatial epidemics with a new percolation model, Cluster tails for critical power-law inhomogeneous random graphs, Bootstrap percolation in power-law random graphs, Synchronization in random networks with given expected degree sequences, De-anonymization of heterogeneous random graphs in quasilinear time, Universality for the distance in finite variance random graphs, Sparse maximum-entropy random graphs with a given power-law degree distribution, Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees, From ecology to finance (and back?): a review on entropy-based null models for the analysis of bipartite networks, Percolation in invariant Poisson graphs with i.i.d. degrees, Generation of networks with prescribed degree-dependent clustering, A note on the derivation of epidemic final sizes, Novel scaling limits for critical inhomogeneous random graphs, Long-distance travel behaviours accelerate and aggravate the large-scale spatial spreading of infectious diseases, Radio communication in random graphs, Chimeras in random non-complete networks of phase oscillators, Network extreme eigenvalue: From mutimodal to scale-free networks, Cliques in rank-1 random graphs: the role of inhomogeneity, Decompositions of Triangle-Dense Graphs, Statistical ensembles for economic networks, RESILIENCE TO CONTAGION IN FINANCIAL NETWORKS, Capacity of an associative memory model on random graph architectures, The degree sequences of an asymmetrical growing network, The spectra of multiplicative attribute graphs, Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs, A scale-free graph model based on bipartite graphs, Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems, Bootstrap percolation in directed inhomogeneous random graphs, Structural sparsity of complex networks: bounded expansion in random models and real-world graphs, Breaking the \(\log n\) barrier on rumor spreading, Critical behavior in inhomogeneous random graphs, The graph spectra and spectral moments of random graphs, Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs, A note on the warmth of random graphs with given expected degrees, COVID-19 epidemic under the K-quarantine model: network approach, Parameterized clique on inhomogeneous random graphs, Swarming on random graphs. II, A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence, On the mean distance in scale free graphs, Large degrees in scale-free inhomogeneous random graphs, Synchronization of coupled chaotic maps
