Techniques for analyzing dynamic random graph models of web-like networks: An overview

DOI10.1002/net.20215zbMath1147.68335OpenAlexW4229898130MaRDI QIDQ3515881

Narsingh Deo, Aurel Cami

Publication date: 29 July 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20215

zbMATH Keywords

scale-free networksweb graphsdynamic random graphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Dynamic random networks in dynamic populations ⋮ Parallelism in simulation and modeling of scale-free complex networks

Uses Software

• ANF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Human sexual contact network as a bipartite graph
• A Random Graph Model for Power Law Graphs
• The small-world phenomenon
• Concentration Inequalities and Martingale Inequalities: A Survey
• Infinite Limits of Copying Models of the Web Graph
• Coupling Scale-Free and Classical Random Graphs
• A Brief History of Generative Models for Power Law and Lognormal Distributions
• Coupling Online and Offline Analyses for Random Power Law Graphs
• Random Deletion in a Scale-Free Random Graph Process
• Link Evolution: Analysis and Algorithms
• Robustness and Vulnerability of Scale-Free Random Graphs
• Crawling on Simple Models of Web Graphs
• The Average Distance in a Random Graph with Given Expected Degrees
• Algorithmic Challenges in Web Search Engines
• Fast PageRank Computation via a Sparse Linear System
• Lower Bounds and Algorithms for Dominating Sets in Web Graphs
• Time-Aware Authority Ranking
• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
• Modeling the Small-World Phenomenon with Local Network Flow
• Paradoxical Effects in PageRank Incremental Computations
• Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
• Editorial: The Future of Power Law Research

This page was built for publication: Techniques for analyzing dynamic random graph models of web-like networks: An overview