A structural approach to the temporal modeling of networks
Pages 788 - 796
Abstract
Simulation of many dynamic real world systems such as the Internet and social networks requires developing dynamic models for the underlying networks in these systems. Currently, there is a large body of work devoted towards determining the underlying mechanisms that create these networks, but the resulting models have not realistically captured many of the important structural characteristics when compared with real world examples. Towards creating more realistic dynamic models, we propose a method of structurally constructing models of an evolving network. We then conduct a series of computational experiments in modeling the evolution of the autonomous system (AS) topology of the Internet to test the effectiveness of our approach.
References
[1]
Abu-Khzam, F. N., R. L. Collins, M. R. Fellows, M. A. Langston, W. H. Suters, and C. T. Symons. 2004. Kernelization algorithms for the vertex cover problem: Theory and experiments. In Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALC), ed. L. Arge, G. F. Italiano, and R. Sedgewick, 62--69: SIAM.
[2]
Alderson, D. L., and L. Li. 2007, April. Diversity of graphs with highly variable connectivity. Physical Review E 75 (4): Art. No. 046102.
[3]
Amaral, L. A., A. Scala, M. Barthelemy, and H. E. Stanley. 2000, October. Classes of small-world networks. Proceedings of the National Academy of Sciences of the United States of America 97 (21): 11149--11152.
[4]
Barabási, A.-L., and R. Albert. 1999. Emergence of scaling in random networks. Science 286:509--512.
[5]
Beichl, I., and B. Cloteaux. 2008a. Generating network models using the S-metric. In Proceedings of the International Conference on Modeling, Simulation and Visualization Methods, ed. H. R. Arabnia and L. Deligiannidis, 159--164.
[6]
Beichl, I., and B. Cloteaux. 2008b. Measuring the effectiveness of the s-metric to produce better network models. In Proceedings of the 2008 Winter Simulation Conference, ed. S. J. Mason, R. R. Hill, L. Mönch, O. Rose, T. Jefferson, and J. W. Fowler, 1020--1028. Piscataway, NJ: Institute of Electrical and Electronics Engineers, Inc.
[7]
Blitzstein, J. 2007. Program for generating random graphs with prescribed degrees. http://www.people.fas.harvard.edu/~blitz/Site/Research_files/GraphAlgorithmR.txt. Accessed 10/12/2007.
[8]
Blitzstein, J., and P. Diaconis. 2006. A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Submitted to Annals of Applied Probability.
[9]
Dueck, G., and T. Scheuer. 1990. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics 90 (1): 161--175.
[10]
Faloutsos, M., P. Faloutsos, and C. Faloutsos. 1999. On power-law relationships of the internet topology. In Proceedings of the 1999 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), 251--262. New York, NY, USA: ACM.
[11]
Garey, M. R., and D. S. Johnson. 1990. Computers and intractability; a guide to the theory of NP-completeness. New York, NY, USA: W. H. Freeman & Co.
[12]
Gkantsidis, C., M. Mihail, and E. Zegura. 2003. The Markov chain simulation method for generating connected power law random graphs. In Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX), ed. R. E. Ladner, 16--25: SIAM.
[13]
Hakimi, S. 1962. On realizability of a set of integers as degrees of the vertices of a linear graph. I. Journal of the Society for Industrial and Applied Mathematics 10 (3): 496--506.
[14]
Jeong, H., B. Tombor, R. Albert, Z. Oltvai, and A. L. Barabási. 2000, October. The large-scale organization of metabolic networks. Nature 407 (6804): 651--654.
[15]
Li, L., D. Alderson, J. C. Doyle, and W. Willinger. 2005. Towards a theory of scale-free graphs: Definition, properties, and implications. Internet Mathematics 2 (4): 431--523.
[16]
Mihail, M., and N. Vishnoi. 2002. On generating graphs with prescribed degree sequences for complex network modeling applications. In Proceedings of the Third Workshop on Approximation and Randomized Algorithms for Communication Networks (ARACNE), 1--10.
[17]
Oliveira, R. V., B. Zhang, and L. Zhang. 2007. Observing the evolution of Internet AS topology. In Proceedings of the 2007 conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 313--324. New York, NY, USA: ACM.
[18]
Potanin, A., J. Noble, M. Frean, and R. Biddle. 2005. Scale-free geometry in OO programs. Communications of the ACM 48 (5): 99--103.
[19]
Tarjan, R. 1972. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1 (2): 146--160.
[20]
UCLA 2009. UCLA Internet topology collection. http://irl.cs.ucla.edu/topology. Accessed 2/12/2009.
[21]
Viger, F., and M. Latapy. 2005. Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In Proceedings of the Eleventh International Computing and Combinatorics Conference (COCOON), ed. L. Wang, Volume 3595 of Lecture Notes in Computer Science, 440--449: Springer.
[22]
Watts, D. J., and S. H. Strogatz. 1998. Collective dynamics of 'small-world' networks. Nature 393:440--442.
[23]
Williams, R. J., and N. D. Martinez. 2000, March. Simple rules yield complex food webs. Nature 404 (6774): 180--183.
- A structural approach to the temporal modeling of networks
Recommendations
Dynamic Structural Role Node Embedding for User Modeling in Evolving Networks
Complex user behavior, especially in settings such as social media, can be organized as time-evolving networks. Through network embedding, we can extract general-purpose vector representations of these dynamic networks which allow us to analyze them ...
Signed Network Modeling Based on Structural Balance Theory
CIKM '18: Proceedings of the 27th ACM International Conference on Information and Knowledge ManagementThe modeling of networks, specifically generative models, has been shown to provide a plethora of information about the underlying network structures, as well as many other benefits behind their construction. There has been a considerable increase in ...
Identification of Co-evolving Temporal Networks
BCB '18: Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health InformaticsBiological networks describes the mechanisms which govern cellular functions. Temporal networks show how these networks evolve over time. Studying the temporal progression of network topologies is of utmost importance since it uncovers how a network ...
Comments
Information & Contributors
Information
Published In
Sponsors
- IIE: Institute of Industrial Engineers
- INFORMS-SIM: Institute for Operations Research and the Management Sciences: Simulation Society
- SIGSIM: ACM Special Interest Group on Simulation and Modeling
- SCS: Society for Modeling and Simulation International
Publisher
Winter Simulation Conference
Publication History
Published: 13 December 2009
Check for updates
Qualifiers
- Research-article
Conference
WSC09
Sponsor:
- IIE
- INFORMS-SIM
- SIGSIM
- SCS
Acceptance Rates
WSC '09 Paper Acceptance Rate 137 of 256 submissions, 54%;
Overall Acceptance Rate 3,413 of 5,075 submissions, 67%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 34Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 18 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in