A general model of web graphs

DOI10.1002/RSA.10084MaRDI QIDQ4805220zbMATH OpenOpenAlexWikidataFDO

Authors Colin Cooper, Alan 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)

Recommendations

• Concentration of vertex degrees in a scale‐free random graph process
• scientific article; zbMATH DE number 1875439
• Distribution of Vertex Degree in Web-Graphs
• Popularity based random graph models leading to a scale-free degree sequence
• A generalization of the Buckley-Osthus model for web graphs

Cites work

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

Cited in

(only showing first 100 items - show all)

• Change point detection in network models: preferential attachment and long range dependence
• The \(N\)-star network evolution model
• A preferential attachment model with random initial degrees
• An estimate of the probability of localisation of the diameter of a random scale-free graph
• Exponential extinction time of the contact process on finite graphs
• Contact processes on scale-free networks
• On the degree sequence of an evolving random graph process and its critical phenomenon
• A random model of publication activity
• Popularity based random graph models leading to a scale-free degree sequence
• Growing Protean Graphs
• A generalization of the Buckley-Osthus model for web graphs
• Core/periphery scientific collaboration networks among very similar researchers
• scientific article; zbMATH DE number 2038750 (Why is no real title available?)
• Contact processes on random graphs with power law degree distributions have critical value 0
• Robust analysis of preferential attachment models with fitness
• Justifying the small-world phenomenon via random recursive trees
• Approximability of the vertex cover problem in power-law graphs
• Universality for distances in power-law random graphs
• Randomised reproducing graphs
• Random graphs associated to some discrete and continuous time preferential attachment models
• Phase transition on the degree sequence of a random graph process with vertex copying and deletion
• Catastrophic event phenomena in communication networks: a survey
• A new class of scale free random graphs
• scientific article; zbMATH DE number 1875439 (Why is no real title available?)
• Preferential attachment with choice
• Distribution of Vertex Degree in Web-Graphs
• Sparse random graphs with clustering
• On Bollobás‐Riordan random pairing model of preferential attachment graph
• Diameters in preferential attachment models
• Markov chain-based analysis of a modified Cooper-Frieze model
• Nonderogatory directed webgraph
• Twitter event networks and the superstar model
• Random sprouts as internet models, and Pólya processes
• The degree distribution of random \(k\)-trees
• Preferential deletion in dynamic models of web-like networks
• Enumeration of graphs with a heavy-tailed degree sequence
• Protean Graphs with a Variety of Ranking Schemes
• Degree distribution of a scale-free random graph model
• Category-based routing in social networks: membership dimension and the small-world phenomenon
• Infinite Limits of Copying Models of the Web Graph
• The degree distribution of the generalized duplication model
• Local degree distributions: examples and counterexamples
• A course on the web graph
• A Geometric Preferential Attachment Model of Networks II
• Pólya urns with immigration at random times
• Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
• A Random Graph Model for Power Law Graphs
• Dynamic random networks in dynamic populations
• Scale-free property for degrees and weights in a preferential attachment random graph model
• On a 2-parameter class of scale free random graphs
• Large deviations for the leaves in some random trees
• Directed scale-free graphs
• Generalized nonlinear Yule models
• A fast algorithm to find all high degree vertices in graphs with a power law degree sequence
• Scale-free graphs of increasing degree
• On a random graph evolving by degrees
• Coupling Online and Offline Analyses for Random Power Law Graphs
• Convergence properties of the degree distribution of some growing network models
• scientific article; zbMATH DE number 1792101 (Why is no real title available?)
• Growth of preferential attachment random graphs via continuous-time branching processes
• Scale-free property for degrees and weights in an \(N\)-interactions random graph model
• Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
• Weights and degrees in a random graph model based on 3-interactions
• Concentration of vertex degrees in a scale‐free random graph process
• The clustering coefficient of a scale-free random graph
• A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence
• The degree distribution and the number of edges between nodes of given degrees in directed scale-free graphs
• On several properties of a class of hybrid recursive trees
• Uniform preferential selection model for generating scale-free networks
• Asymptotic properties of a random graph with duplications
• Confidence sets for network structure
• Power laws for family sizes in a duplication model
• The Erdős Webgraph Server
• On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
• Bounded expansion in web graphs.
• Infinite limits and adjacency properties of a generalized copying model
• Asymptotic degree distribution in preferential attachment graph models with multiple type edges
• The three kinds of degree distributions and Nash equilibrium on the limiting random network
• Crawling on Simple Models of Web Graphs
• Recent advances on mechanisms of network generation: community, exchangeability, and scale-free properties
• Clustering and cliques in preferential attachment random graphs with edge insertion
• A continuous-time N -interaction random graph model
• ANALYSIS OF WEB SEARCH ALGORITHM HITS
• A web model with power law exponents less than 2
• Large deviations for the degree structure in preferential attachment schemes
• scientific article; zbMATH DE number 2096435 (Why is no real title available?)
• scientific article; zbMATH DE number 7268107 (Why is no real title available?)
• Preferential attachment random graphs with edge-step functions
• Evolution of the Media Web
• A coupled model for the indegree and outdegree analysis of the web
• The distribution of second degrees in the Buckley-Osthus random graph model
• Growth of common friends in a preferential attachment model
• Evolving protein-protein interaction networks: a model based on duplication and mutation at different rates
• Social network formation and strategic interaction in large networks
• Some properties of random Apollonian networks
• Taylor's power law for the \(N\)-stars network evolution model
• Archaeology of random recursive dags and Cooper-Frieze random networks
• Clustering in preferential attachment random graphs with edge-step
• A Graph-Based Approach for Web Database Sampling
• On the mean distance in scale free graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4805220)