Congestion and Centrality in Traffic Flow on Complex Networks

@article{Holme2003CongestionAC,
  title={Congestion and Centrality in Traffic Flow on Complex Networks},
  author={Petter Holme},
  journal={Advances in Complex Systems},
  year={2003},
  volume={6},
  pages={163-176}
}
  • Petter Holme
  • Published 2003
  • Physics, Mathematics, Computer Science
  • Advances in Complex Systems
  • The central points of communication network flow have often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the underlying network structure. In this work we investigate the relationship between centrality measures and the density of traffic for some simple particle hopping models on networks with emerging scale-free degree distributions. We also study how the speed of the… CONTINUE READING

    Figures and Topics from this paper.

    Explore key concepts

    Links to highly relevant papers for key concepts in this paper:

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 160 CITATIONS

    Transport on Complex Networks: Flow, Jamming and Optimization

    VIEW 1 EXCERPT

    Transmission of packets on a hierarchical network: Statistics and explosive percolation

    FILTER CITATIONS BY YEAR

    2003
    2020

    CITATION STATISTICS

    • 2 Highly Influenced Citations

    • Averaged 9 Citations per year from 2018 through 2020

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES

    Particle hopping models and traffic flow theory.

    • Nagel
    • Medicine, Physics
    • Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
    • 1996

    D ow nl oa de d fr om w w w .w or ld sc ie nt if ic .c om by M O N A SH U N IV E R SI T Y o n

    • A. Vazquez, R. Pastor-Satorras, A. Vespignani
    • Phys. Rev. E65,
    • 2002
    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Downloaded from www.worldscientific.com by MONASH UNIVERSITY on 01/07/15. For personal use only

    • Advs Complex Syst
    • 2003

    In the case of vertex load in a communication network with load balancing the “flow betweenness

    • B. J. Kim, A. Trusina, +3 authors M. Y. Choi
    • Phys. Rev. E66,
    • 2002

    Pattern detection in complex networks: Correlation profile of the internet

    • S. Maslov, K. Sneppen, A. Zaliznyak
    • cond-mat/0205379, May 2002.
    • 2002
    VIEW 1 EXCERPT

    Routing in the Internet (2nd ed.)

    VIEW 1 EXCERPT

    The flow betweenness takes all paths, not only the shortest, into account