Beichl, I.
and Cloteaux, B.
(2008),
Generating Network Models Using the S-Metric, Proceedings of the International Conference on Modeling, Simulation and Visualization Methods, Las Vegas, NV, USA, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=152129
(Accessed October 10, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Generating Network Models Using the S-Metric
Published
Author(s)
,
Abstract
The ability to create random models of real networks is useful for understanding the interactions of the networks. Several researchers have proposed modeling of complex networks using the degree distribution, the most popular being a power-law distribution for vertex degrees. Recent work by Li et al. introduced the S metric as a way to characterize the structure of these networks. In this paper, we examine some of the practical difficulties of producing a random graph with given degree sequence and a given approximate S value. We also give a solution for this problem with which we have had success using in our research.Proceedings Title
Proceedings of the International Conference on Modeling, Simulation and Visualization Methods
Conference Dates
July 14-17, 2008
Conference Location
Las Vegas, NV, USA
Pub Type
Conferences
Download Paper
Keywords
network models, S metric, threshold acceptance
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created July 13, 2008, Updated October 12, 2021