Random Evolution in Massive Graphs-Reference-Cited by-同舟云学术

Random Evolution in Massive Graphs

Published:2002 Issue: Volume: Page:97-122
ISSN:1569-2698
Container-title:Massive Computing
language:
Short-container-title:

Author:

Aiello William,Chung Fan,Lu Linyuan

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4615-0005-6_4

Reference35 articles.

1. J. Abello, A. Buchsbaum, and J. Westbrook. A functional approach to external graph algorithms. In Proc. 6th European Symposium on Algorithms, pages 332–343, 1998.

2. W. Aiello, F. Chung, and L. Lu. A random graph model for massive graphs. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pages 171–180, 2000.

3. N. Alon and J.H. Spencer. The Probabilistic Method. Wiley and Sons, 1992.

4. A. Barabâsi, R. Albert, and H. Jeong. Scale-free characteristics of random networks: The topology of the world wide web. Physica A, 272: 173–187, 1999.

5. A.-L. Barabâsi and R. Albert. Emergence of scaling in random networks. Science, 286: 509–512, 1999.

Cited by 46 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Subgraph Counts in Random Clustering Graphs;Lecture Notes in Computer Science;2024

2. A Random Graph Model for Clustering Graphs;Lecture Notes in Computer Science;2023

3. The three kinds of degree distributions and nash equilibrium on the limiting random network;Stochastics and Dynamics;2019-12-30

4. Interdependent Networks from Societal Perspective: MITS (Multi-Context Influence Tracking on Social Network);Studies in Systems, Decision and Control;2018-12-12

5. Random‐walk models of network formation and sequential Monte Carlo methods for graphs;Journal of the Royal Statistical Society: Series B (Statistical Methodology);2018-08-26