A general model of web graphs

DOI10.1002/rsa.10084zbMath1018.60007OpenAlexW1984137208WikidataQ57401520 ScholiaQ57401520MaRDI QIDQ4805220

Colin Cooper, Alan M. Frieze

Publication date: 11 May 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10084

zbMATH Keywords

random graphdifference equationweb graphcopying

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)

Related Items (75)

Convergence properties of the degree distribution of some growing network models ⋮ Scale-free property for degrees and weights in an \(N\)-interactions random graph model ⋮ Exponential extinction time of the contact process on finite graphs ⋮ Random graphs associated to some discrete and continuous time preferential attachment models ⋮ Power laws for family sizes in a duplication model ⋮ The Web Graph as an Equilibrium ⋮ A preferential attachment model with random initial degrees ⋮ Evolving protein-protein interaction networks: a model based on duplication and mutation at different rates ⋮ Preferential deletion in dynamic models of web-like networks ⋮ Scale-free behavior of networks with the copresence of preferential and uniform attachment rules ⋮ Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model ⋮ The partial duplication random graph with edge deletion ⋮ The degree distribution of the generalized duplication model ⋮ Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms ⋮ Evolution of the Media Web ⋮ On a 2-parameter class of scale free random graphs ⋮ On the continuous-time limit of the Barabási-Albert random graph ⋮ Approximability of the vertex cover problem in power-law graphs ⋮ Category-based routing in social networks: membership dimension and the small-world phenomenon ⋮ Uniform preferential selection model for generating scale-free networks ⋮ A generalization of the Buckley-Osthus model for web graphs ⋮ Weights and degrees in a random graph model based on 3-interactions ⋮ Asymptotic Properties of a Random Graph with Duplications ⋮ On Bollobás‐Riordan random pairing model of preferential attachment graph ⋮ Enumeration of graphs with a heavy-tailed degree sequence ⋮ Catastrophic event phenomena in communication networks: a survey ⋮ On several properties of a class of hybrid recursive trees ⋮ Core/periphery scientific collaboration networks among very similar researchers ⋮ Large deviations for the degree structure in preferential attachment schemes ⋮ Contact processes on scale-free networks ⋮ Justifying the small-world phenomenon via random recursive trees ⋮ Pólya urns with immigration at random times ⋮ The three kinds of degree distributions and nash equilibrium on the limiting random network ⋮ Preferential attachment random graphs with edge-step functions ⋮ Local degree distributions: examples and counterexamples ⋮ An estimate of the probability of localisation of the diameter of a random scale-free graph ⋮ Sparse random graphs with clustering ⋮ Social network formation and strategic interaction in large networks ⋮ A Geometric Preferential Attachment Model of Networks II ⋮ Growth of preferential attachment random graphs via continuous-time branching processes ⋮ Growth of common friends in a preferential attachment model ⋮ Change point detection in network models: preferential attachment and long range dependence ⋮ ANALYSIS OF WEB SEARCH ALGORITHM HITS ⋮ Degree distribution of a scale-free random graph model ⋮ Robust Analysis of Preferential Attachment Models with Fitness ⋮ Diameters in preferential attachment models ⋮ Preferential attachment with choice ⋮ Phase transition on the degree sequence of a random graph process with vertex copying and deletion ⋮ Scale-free property for degrees and weights in a preferential attachment random graph model ⋮ Dynamic random networks in dynamic populations ⋮ Contact processes on random graphs with power law degree distributions have critical value 0 ⋮ The clustering coefficient of a scale-free random graph ⋮ A new class of scale free random graphs ⋮ Scale‐free graphs of increasing degree ⋮ A web model with power law exponents less than 2 ⋮ Markov chain-based analysis of a modified Cooper-Frieze model ⋮ The degree distribution of random \(k\)-trees ⋮ A random model of publication activity ⋮ Universality for distances in power-law random graphs ⋮ Confidence sets for network structure ⋮ Twitter event networks and the superstar model ⋮ TheN-star network evolution model ⋮ Unnamed Item ⋮ Large deviations for the leaves in some random trees ⋮ A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence ⋮ Some Properties of Random Apollonian Networks ⋮ The Degree Distribution and the Number of Edges Between Nodes of given Degrees in Directed Scale-Free Graphs ⋮ On the Degree Sequence of an Evolving Random Graph Process and Its Critical Phenomenon ⋮ Popularity based random graph models leading to a scale-free degree sequence ⋮ Asymptotic degree distribution in preferential attachment graph models with multiple type edges ⋮ On a random graph evolving by degrees ⋮ Taylor's power law for the \(N\)-stars network evolution model ⋮ Clustering in preferential attachment random graphs with edge-step ⋮ On the mean distance in scale free graphs ⋮ On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities

Cites Work

• Crawling on web graphs
• A Brief History of Generative Models for Power Law and Lognormal Distributions

This page was built for publication: A general model of web graphs