Abstract
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 among the nodes. A concept is then identified by finding the community of nodes that share it. The task of data structuring is thus reduced to the task of finding the network communities, as groups of nodes that together perform some non-local data processing. Towards this goal, we extend the ranking methods from nodes to paths. This allows us to extract some information about the likely flow biases from the available static information about the network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berners-Lee, T.: Semantic Web road map (October 1998)
Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Trans. Inter. Tech. 5(1), 92–128 (2005)
Boldi, P., Santini, M., Vigna, S.: PageRank as a function of the damping factor. In: WWW 2005: Proceedings of the 14th international conference on World Wide Web, pp. 557–566. ACM Press, New York, NY, USA (2005)
Cover, T.M., Thomas, J.A.: Elements of information theory. Wiley-Interscience, New York, NY, USA (1991)
Gierz, G., Hoffmann, K.H., Keimel, K., Lawson, J., Mislove, M., Scott, D.: Continuous Lattices and Domains. Encyclopedia of Mathematics and its Applications, vol. 93. Cambridge University Press, Cambridge (2003)
Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, New York, NY, USA (2004)
Golub, G.H., Greif, C.: An Arnoldi-type algorithm for computing PageRank. BIT Numerical Mathematics 43(1), 1–18 (2003)
Gyöngyi, Z., Garcia-Molina, H., Pedersen, J.: Combating Web spam with TrustRank. In: VLDB, pp. 576–587 (2004)
Haveliwala, T.H.: Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng. 15(4), 784–796 (2003)
Hubbell, C.H.: An input-output approach to clique identification. Sociometry 28, 377–399 (1965)
Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18, 39–43 (1953)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5), 604–632 (1999)
Langville, A.N., Meyer, C.D.: Google’s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton, NJ, USA (2006)
Mac Lane, S.: Categories for the Working Mathematician. Number 5 in Graduate Texts in Mathematics. Springer, Heidelberg (1971)
Newman, M., Barabasi, A.-L., Watts, D.J.: The Structure and Dynamics of Networks. Princeton Studies in Complexity. Princeton University Press, Princeton, NJ, USA (2006)
Newman, M.E.J.: Modularity and community structure in networks. PNAS 103(23), 8577–8582 (2006)
Ollivier, Y., Senellart, P.: Finding related pages using Green measures: An illustration with Wikipedia. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence, Menlo Park, California, July 2007, pp. 1427–1433. AAAI Press (2007)
O’Reilly, T.: What is Web 2 (September 2005)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford Digital Library Technologies Project (1998)
Pavlovic, D.: Network as a computer: ranking paths to find flows (February 2008), http://aps.arxiv.org/abs/0802.1306 (Preliminary version of this paper, with proofs)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ’small-world’ networks. Nature 393(6684), 440–442 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pavlovic, D. (2008). Network as a Computer: Ranking Paths to Find Flows . In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds) Computer Science – Theory and Applications. CSR 2008. Lecture Notes in Computer Science, vol 5010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79709-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-79709-8_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79708-1
Online ISBN: 978-3-540-79709-8
eBook Packages: Computer ScienceComputer Science (R0)