Pith. sign in

REVIEW

Cross-over behaviour in a communication network

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 cond-mat/0312090 v1 pith:FBRNX27T submitted 2003-12-03 cond-mat.stat-mech

Cross-over behaviour in a communication network

classification cond-mat.stat-mech
keywords networkbehaviourconnectionshubsanothercross-overdistributionnodes
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We address the problem of message transfer in a communication network. The network consists of nodes and links, with the nodes lying on a two dimensional lattice. Each node has connections with its nearest neighbours, whereas some special nodes, which are designated as hubs, have connections to all the sites within a certain area of influence. The degree distribution for this network is bimodal in nature and has finite variance. The distribution of travel times between two sites situated at a fixed distance on this lattice shows fat fractal behaviour as a function of hub-density. If extra assortative connections are now introduced between the hubs so that each hub is connected to two or three other hubs, the distribution crosses over to power-law behaviour. Cross-over behaviour is also seen if end-to-end short cuts are introduced between hubs whose areas of influence overlap, but this is much milder in nature. In yet another information transmission process, namely, the spread of infection on the network with assortative connections, we again observed cross-over behaviour of another type, viz. from one power-law to another for the threshold values of disease transmission probability. Our results are relevant for the understanding of the role of network topology in information spread processes.

discussion (0)

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