Generating network models using the S-metric

Proceedings of the 2008 International Conference on Modeling, Simulation and Visualization Methods, MSV 2008

Volumn , Issue , 2008, Pages 159-164

  Beichl, Isabel ^a   Cloteaux, Brian ^a  

^a NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY   (United States)

Author keywords

Network models; S metric; Threshold acceptance

Indexed keywords

COMPLEX NETWORKS; DEGREE SEQUENCES; NETWORK MODELS; NODE DEGREE DISTRIBUTIONS; POWER-LAW DISTRIBUTIONS; RANDOM GRAPHS; RANDOM MODELS; REAL NETWORKS; S METRIC; THRESHOLD ACCEPTANCE;

GRAPH THEORY; PUBLIC WORKS;

VISUALIZATION;

EID: 60749096764     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, pp. 509-512, 1999.
2. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, pp. 440-442, 1998.
3. H. Jeong, B. Tombor, R. Albert, Z. Oltvai, and A. L. Barabási, "The large-scale organization of metabolic networks," Nature, vol. 407, no. 6804, pp. 651-654, October 2000.
4. R. J. Williams and N. D. Martinez, "Simple rules yield complex food webs," Nature, vol. 404, no. 6774, pp. 180-183, March 2000.
5. L. A. Amaral, A. Scala, M. Barthelemy, and H. E. Stanley, "Classes of small-world networks," Proc Natl Acad Sci USA, vol. 97, no. 21, pp. 11149-11 152, October 2000.
6. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the internet topology," in Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication (SIGCOMM). New York, NY, USA: ACM, 1999, pp. 251-262.
7. A. Potanin, J. Noble, M. Frean, and R. Biddle, "Scale-free geometry in OO programs," Communications of the ACM, vol. 48, no. 5, pp. 99-103, 2005.
8. L. Li, D. Alderson, J. C. Doyle, and W. Willinger, "Towards a theory of scale-free graphs: Definition, properties, and implications," Internet Mathematics, vol. 2, no. 4, pp. 431-523, 2005.
9. I. Beichl and B. Cloteaux, "Measuring the effectiveness of the s-metric to produce better network models," 2008, submitted.
10. G. Dueck and T. Scheuer, "Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing," Journal of Computational Physics, vol. 90, no. 1, pp. 161-175, 1990.
11. F. Viger and M. Latapy, "Efficient and simple generation of random simple connected graphs with prescribed degree sequence," in Proceedings of the Eleventh International Computing and Combinatorics Conference (COCOON), ser. Lecture Notes in Computer Science, L. Wang, Ed., vol. 3595. Springer, 2005, pp. 440-449.
12. C. Gkantsidis, M. Mihail, and E. Zegura, "The Markov chain simulation method for generating connected power law random graphs," in Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX), R. E. Ladner, Ed. SIAM, 2003, pp. 16-25.
13. D. Randall, "Rapidly mixing Markov chains with applications in computer science and physics," Computing in Science and Engg., vol. 8, no. 2, p. 30, 2006.
14. J. Blitzstein and P. Diaconis, "A sequential importance sampling algorithm for generating random graphs with prescribed degrees," 2005, submitted to Annals of Applied Probability.
15. A. Tripathi and S. Vijay, "A note on a theorem of Erd?os & Gallai," Discrete Mathematics, vol. 265, no. 1-3, pp. 417-420, 2003.
16. K. Sriram, D. Montgomery, O. Borchert, O. Kim, and D. R. Kuhn, "Study of BGP peering session attacks and their impacts on routing performance," IEEE Journal on Selected Areas in Communications, vol. 24, no. 10, pp. 1901-1915, October 2006.