Skip to main content
archive Search
Submit Donate Log in

Press Enter to search · Advanced search

Computer Science > Information Theory

arXiv:cs/0612099 (cs)
[Submitted on 20 Dec 2006]

Title:Network Information Flow in Small World Networks

Authors:Rui A. Costa, Joao Barros
View a PDF of the paper titled Network Information Flow in Small World Networks, by Rui A. Costa and 1 other authors
View PDF HTML (experimental)
Abstract: Recent results from statistical physics show that large classes of complex networks, both man-made and of natural origin, are characterized by high clustering properties yet strikingly short path lengths between pairs of nodes. This class of networks are said to have a small-world topology. In the context of communication networks, navigable small-world topologies, i.e. those which admit efficient distributed routing algorithms, are deemed particularly effective, for example in resource discovery tasks and peer-to-peer applications. Breaking with the traditional approach to small-world topologies that privileges graph parameters pertaining to connectivity, and intrigued by the fundamental limits of communication in networks that exploit this type of topology, we investigate the capacity of these networks from the perspective of network information flow. Our contribution includes upper and lower bounds for the capacity of standard and navigable small-world models, and the somewhat surprising result that, with high probability, random rewiring does not alter the capacity of a small-world network.
Comments: 23 pages, 8 fitures, submitted to the IEEE Transactions on Information Theory, November 2006
Subjects: Information Theory (cs.IT); Discrete Mathematics (cs.DM)
Cite as: arXiv:cs/0612099 [cs.IT]
  (or arXiv:cs/0612099v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.cs/0612099
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1109/WIOPT.2006.1666504
DOI(s) linking to related resources

Submission history

From: João Barros [view email]
[v1] Wed, 20 Dec 2006 09:11:41 UTC (688 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Network Information Flow in Small World Networks, by Rui A. Costa and 1 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Additional Features

  • Audio Summary

Current browse context:

cs.IT
< prev   |   next >
new | recent | 2006-12

References & Citations

  • SciX
  • Google Scholar
  • Semantic Scholar

DBLP - CS Bibliography

listing | bibtex
Rui A. Costa
João Barros
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)