On the Degree Distribution of k-Connected Random Networks
ICC 2010
Pages: 1 - 6
Published: May 23, 2010
Abstract
In performance evaluations of communication and computer networks the underlying topology is sometimes modeled as a random graph. To avoid unwanted side effects, some researchers force the simulated topologies to be connected. Consequently, the resulting distribution of the node degrees does then no longer correspond to that of the underlying random graph model. Being not aware of this change in the degree distribution might result in a...
Paper Details
Title
On the Degree Distribution of k-Connected Random Networks
Published Date
May 23, 2010
Pages
1 - 6
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History