Pith. sign in

REVIEW

Structural constraints in complex networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv physics/0702096 v2 pith:LRICTUGH submitted 2007-02-12 physics.soc-ph

Structural constraints in complex networks

classification physics.soc-ph
keywords rich--clubconnectivitydegreedistributionnetworknetworksassortativecoefficient
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We present a link rewiring mechanism to produce surrogates of a network where both the degree distribution and the rich--club connectivity are preserved. We consider three real networks, the AS--Internet, the protein interaction and the scientific collaboration. We show that for a given degree distribution, the rich--club connectivity is sensitive to the degree--degree correlation, and on the other hand the degree--degree correlation is constrained by the rich--club connectivity. In particular, in the case of the Internet, the assortative coefficient is always negative and a minor change in its value can reverse the network's rich--club structure completely; while fixing the degree distribution and the rich--club connectivity restricts the assortative coefficient to such a narrow range, that a reasonable model of the Internet can be produced by considering mainly the degree distribution and the rich--club connectivity. We also comment on the suitability of using the maximal random network as a null model to assess the rich--club connectivity in real networks.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.