scientific article; zbMATH DE number 1792101

MaRDI QIDQ4552043zbMATH OpenFDO

Authors Linyuan Lu, William Aiello, Fan Chung

Publication date 11 November 2002

zbMATH Keywords

Call graphsscale-free power law graphsWWW graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 5732563
• A general model of web graphs
• Directed scale-free graphs
• scientific article; zbMATH DE number 1875439
• Scale-free property for degrees and weights in a preferential attachment random graph model

Cited in

(34)

• A generalization of the Buckley-Osthus model for web graphs
• Distance in random graphs with infinite mean degrees
• Graph Drawing
• Probabilistic Inductive Classes of Graphs
• Scalable generation of scale-free graphs
• A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
• Evolving Graph-Structures and Their Implicit Computational Complexity
• A random graph model for massive graphs
• Social network influence and market instability
• A preferential attachment model with random initial degrees
• Methods for approximating stochastic evolutionary dynamics on graphs
• The diameter of sparse random graphs
• Evolution of scale-free random graphs: Potts model formulation
• Complex networks: structure and dynamics
• The Evolution of Random Graphs
• Scale Free Interval Graphs
• A random graph model for clustering graphs
• Popularity based random graph models leading to a scale-free degree sequence
• Network structure andn-dependence in agent-based herding models
• On the degree sequence of an evolving random graph process and its critical phenomenon
• Preferential deletion in dynamic models of web-like networks
• A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
• Scalable percolation search on complex networks
• On certain connectivity properties of the internet topology
• Evolution of high-order connected components in random hypergraphs
• On the mean distance in scale free graphs
• Scale free interval graphs
• Diameters in preferential attachment models
• Techniques for analyzing dynamic random graph models of web-like networks: An overview
• A web model with power law exponents less than 2
• Computing and Combinatorics
• Synchronization in random networks with given expected degree sequences
• Distances in random graphs with finite variance degrees
• On positive-influence target-domination

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