Network reachability of real-world contact sequences.

@article{Holme2005NetworkRO,
  title={Network reachability of real-world contact sequences.},
  author={Petter Holme},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2005},
  volume={71 4 Pt 2},
  pages={
          046119
        }
}
  • Petter Holme
  • Published 2005
  • Mathematics, Physics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • We use real-world contact sequences, time-ordered lists of contacts from one person to another, to study how fast information or disease can spread across network of contacts. Specifically we measure the reachability time--the average shortest time for a series of contacts to spread information between a reachable pair of vertices (a pair where a chain of contacts exists leading from one person to the other)--and the reachability ratio--the fraction of reachable vertex pairs. These measures are… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 173 CITATIONS, ESTIMATED 34% COVERAGE

    Graph Metrics for Temporal Networks

    Temporal reachability graphs

    VIEW 3 EXCERPTS
    CITES BACKGROUND

    Spatio-temporal networks: reachability, centrality and robustness

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Temporal Networks

    • Petter Holme
    • Computer Science
    • Encyclopedia of Social Network Analysis and Mining
    • 2014
    VIEW 9 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Temporal Networks

    Random walk centrality for temporal networks

    VIEW 1 EXCERPT
    CITES METHODS

    FILTER CITATIONS BY YEAR

    2005
    2020

    CITATION STATISTICS

    • 8 Highly Influenced Citations

    • Averaged 15 Citations per year from 2018 through 2020

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 33 REFERENCES

    Attack vulnerability of complex networks.

    Structure and time evolution of an Internet dating community

    VIEW 1 EXCERPT

    The architecture of complex weighted networks.

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Random graphs with arbitrary degree distributions and their applications.

    Modeling the evolution of weighted networks.

    The average distances in random graphs with given expected degrees

    • Fan R. K. Chung, Linyuan Lu
    • Mathematics, Medicine
    • Proceedings of the National Academy of Sciences of the United States of America
    • 2002
    VIEW 1 EXCERPT

    Self-similar community structure in a network of human interactions.

    VIEW 2 EXCERPTS