Vertex routing models

Details Vertex routing models Vertex routing models

2009-06-26

arxiv.org/abs/0906.4905v1

Physics

Physics and Society

12 pages, 6 figures

Scientific paper

A class of models describing the flow of information within networks via routing processes is proposed and investigated, concentrating on the effects of memory traces on the global properties. The long-term flow of information is governed by cyclic attractors, allowing to define a measure for the information centrality of a vertex given by the number of attractors passing through this vertex. We find the number of vertices having a non-zero information centrality to be extensive/sub-extensive for models with/without a memory trace in the thermodynamic limit. We evaluate the distribution of the number of cycles, of the cycle length and of the maximal basins of attraction, finding a complete scaling collapse in the thermodynamic limit for the latter. Possible implications of our results on the information flow in social networks are discussed.

Affiliated with

Also associated with

No associations

Rating

Vertex routing models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Vertex routing models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertex routing models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-670867