A Random Graph Model for Power Law Graphs
From MaRDI portal
Publication:2729376
DOI10.1080/10586458.2001.10504428zbMath0971.05100OpenAlexW2067247412MaRDI QIDQ2729376
Linyuan Lu, Fan R. K. Chung, William Aiello
Publication date: 22 July 2001
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/227051
power law graphsrandom graph model of world wide webrandom graphs with given degree sequencessizes of components
Related Items
An impossibility result for reconstruction in the degree-corrected stochastic block model, Minimum vertex cover in generalized random graphs with power law degree distribution, Evolving protein-protein interaction networks: a model based on duplication and mutation at different rates, Catching homologies by geometric entropy, Networks of causal relationships in the U.S. stock market, The phase transition in inhomogeneous random graphs, Distances in random graphs with finite variance degrees, Power-law distribution of degree–degree distance: A better representation of the scale-free property of complex networks, True scale-free networks hidden by finite size effects, Modeling Memory Effects in Activity-Driven Networks, MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass, Information geometric methods for complexity, Evolution of scale-free random graphs: Potts model formulation, Distance in random graphs with infinite mean degrees, Approximability of the vertex cover problem in power-law graphs, A generalization of the Buckley-Osthus model for web graphs, A random graph model for clustering graphs, Unnamed Item, Differentially private graph publishing through noise-graph addition, Generating large scale‐free networks with the Chung–Lu random graph model, Enumeration of graphs with a heavy-tailed degree sequence, Navigational guidance -- a deep learning approach, The winner takes it all but one, Techniques for analyzing dynamic random graph models of web-like networks: An overview, Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems, Greed is good for deterministic scale-free networks, Modularity of Erdős‐Rényi random graphs, Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems, Activity maxima in random networks in the heavy tail case, New techniques for approximating optimal substructure problems in power-law graphs, Inapproximability of dominating set on power law graphs, Percolation on complex networks: theory and application, Ising model with invisible states on scale-free networks, Satisfiability threshold for power law random 2-SAT in configuration model, Approximation algorithm for partial positive influence problem in social network, Scaling limits and generic bounds for exploration processes, Statistical analysis of financial networks, De-anonymization of heterogeneous random graphs in quasilinear time, A tolerance-based heuristic approach for the weighted independent set problem, On the hardness of optimization in power-law graphs, On certain connectivity properties of the internet topology, How likely is an LLD degree sequence to be graphical?, Quasi‐random graphs with given degree sequences, Mining market data: a network approach, How to distribute antidote to control epidemics, On the Chromatic Number of Random Graphs with a Fixed Degree Sequence, Thek-Core and Branching Processes, A web model with power law exponents less than 2, The average distances in random graphs with given expected degrees, Spectra of random graphs with given expected degrees, Unnamed Item, From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial), Some Properties of Random Apollonian Networks, Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?, Parameterized clique on inhomogeneous random graphs, On the mean distance in scale free graphs, Activity maxima in some models of information networks with random weights and heavy tails
Cites Work
- The asymptotic connectivity of labelled regular graphs
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- A random graph model for massive graphs
- On the strength of connectedness of a random graph
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- A critical point for random graphs with a given degree sequence
