# Degree distribution

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2013

Highly Cited

2013

- 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

- Bioinformatics
- 2010

Motivation: Analogous to biological sequence comparison, comparing cellular networks is an important problem that could provideâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Nature
- 2010

Complex networks have been studied intensively for a decade, but research still focuses on the limited case of a single, nonâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- 2009

A random intersection graph is constructed by independently assigning each vertex a subset of a given set and drawing an edgeâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Ninth IEEE International Conference on Dataâ€¦
- 2009

We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. Theâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- TKDD
- 2007

How do real graphs evolve over time? What are normal growth patterns in social, technological, and information networks? Manyâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- 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

- IEEE Transactions on Information Theory
- 2006

We derive the average weight distribution function and its asymptotic growth rate for low-density parity-check (LDPC) codeâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- ICON
- 2003

This article is a contribution to mathematical modeling and better understanding of fundamental properties of wireless ad-hocâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- IEEE Transactions on Information Theory
- 2003

Stopping sets determine the performance of low-density parity-check (LDPC) codes under iterative decoding over erasure channelsâ€¦Â (More)

Is this relevant?