Degree distribution

In the study of graphs and networks, the degree of a node in a network is the number of connections it has to other nodes and the degree distribution… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
We establish asymptotic vertex degree distribution and examine its relation to the clustering coefficient in two popular random… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Motivation: Analogous to biological sequence comparison, comparing cellular networks is an important problem that could provide… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Complex networks have been studied intensively for a decade, but research still focuses on the limited case of a single, non… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
A random intersection graph is constructed by independently assigning each vertex a subset of a given set and drawing an edge… (More)
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
How do real graphs evolve over time? What are normal growth patterns in social, technological, and information networks? Many… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Let F be a probability distribution with support on the non-negative integers. Four methods for generating a simple undirected… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) code… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This article is a contribution to mathematical modeling and better understanding of fundamental properties of wireless ad-hoc… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Stopping sets determine the performance of low-density parity-check (LDPC) codes under iterative decoding over erasure channels… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?