Network as a Computer: Ranking Paths to Find Flows

@article{Pavlovic2008NetworkAA,
  title={Network as a Computer: Ranking Paths to Find Flows},
  author={Dusko Pavlovic},
  journal={ArXiv},
  year={2008},
  volume={abs/0802.1306}
}
  • Dusko Pavlovic
  • Published 2008
  • Computer Science, Mathematics
  • ArXiv
  • We explore a simple mathematical model of network computation, based on Markov chains. Similar models apply to a broad range of computational phenomena, arising in networks of computers, as well as in genetic, and neural nets, in social networks, and so on. The main problem of interaction with such spontaneously evolving computational systems is that the data are not uniformly structured. An interesting approach is to try to extract the semantical content of the data from their distribution… CONTINUE READING

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-6 OF 6 CITATIONS

    Personalized Learning Paths based on Wikipedia Article Statistics

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Quantitative Concept Analysis

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Tracing the Man in the Middle in Monoidal Categories

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks

    • Dusko Pavlovic
    • Computer Science
    • Formal Aspects in Security and Trust
    • 2010
    VIEW 1 EXCERPT
    CITES BACKGROUND

    Privacy protocols

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    References

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

    Modularity and community structure in networks.

    • Micaleah Newman
    • Computer Science, Physics, Medicine
    • Proceedings of the National Academy of Sciences of the United States of America
    • 2006
    VIEW 1 EXCERPT

    PageRank as a function of the damping factor

    VIEW 1 EXCERPT

    Inside PageRank

    VIEW 1 EXCERPT