Advertisement

Interpolating between Random Walks and Shortest Paths: A Path Functional Approach

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7710)

Abstract

General models of network navigation must contain a deterministic or drift component, encouraging the agent to follow routes of least cost, as well as a random or diffusive component, enabling free wandering. This paper proposes a thermodynamic formalism involving two path functionals, namely an energy functional governing the drift and an entropy functional governing the diffusion. A freely adjustable parameter, the temperature, arbitrates between the conflicting objectives of minimising travel costs and maximising spatial exploration. The theory is illustrated on various graphs and various temperatures. The resulting optimal paths, together with presumably new associated edges and nodes centrality indices, are analytically and numerically investigated.

Keywords

Random Walk Betweenness Centrality Resistance Distance Uniform Transition Admissible Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Theory, algorithms and applications. Prentice Hall (1993)Google Scholar
  2. Alamgir, M., von Luxburg, U.: Phase transition in the family of p-resistances. In: Neural Information Processing Systems (NIPS 2011), pp. 379–387 (2011)Google Scholar
  3. Bollobás, B.: Modern Graph Theory. Springer (1998)Google Scholar
  4. Borgatti, S.P.: Centrality and network flow. Social Networks 27, 55–71 (2005)CrossRefGoogle Scholar
  5. Brandes, U., Fleischer, D.: Centrality Measures Based on Current Flow. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 533–544. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. Chebotarev, P.: A class of graph-geodetic distances generalizing the shortest-path and the resistance distances. Discrete Applied Mathematics 159, 295–302 (2010)MathSciNetCrossRefGoogle Scholar
  7. Dubois-Ferrière, H., Grossglauser, M., Vetterli, M.: Valuable Detours: Least-Cost Anypath Routing. IEEE/ACM Transactions on Networking 19, 333–346 (2011)CrossRefGoogle Scholar
  8. Iryo, T., Shintaku, H., Senoo, S.: Experimental Study of Spatial Searching Behaviour of Travellers in Pedestrian Networks. In: 1st European Symposium on Quantitative Methods in Transportation Systems, EPFL Lausanne (2012) (contributed talk)Google Scholar
  9. Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer (1976)Google Scholar
  10. Farnsworth, K.D., Beecham, J.A.: How Do Grazers Achieve Their Distribution? A Continuum of Models from Random Diffusion to the Ideal Free Distribution Using Biased Random Walks. The American Naturalist 153, 509–526 (1999)CrossRefGoogle Scholar
  11. Fouss, F., Pirotte, A., Renders, J.-M., Saerens, M.: Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation. IEEE Transactions on Knowledge and Data Engineering 19, 355–369 (2007)CrossRefGoogle Scholar
  12. Freeman, L.C.: Centrality in networks: I. Conceptual clarification. Social Networks 1, 215–239 (1979)CrossRefGoogle Scholar
  13. Freeman, L.C., Borgatti, S.P., White, D.R.: Centrality in valued graphs: A measure of betweenness based on network flow. Social Networks 13, 141–154 (1991)MathSciNetCrossRefGoogle Scholar
  14. Kirchhoff, G.: On a deduction of Ohm’s laws, in connexion with the theory of electro-statics. Philosophical Magazine 37, 463 (1850)Google Scholar
  15. Newman, M.E.J.: A measure of betweenness centrality based on random walks. Social Networks 27, 39–54 (2005)CrossRefGoogle Scholar
  16. Noh, J.-D., Rieger, H.: Random walks on complex networks. Phys. Rev. Lett. 92, 118701 (2004)CrossRefGoogle Scholar
  17. Saerens, M., Achbany, Y., Fouss, F., Yen, L.: Randomized Shortest-Path Problems: Two Related Models. Neural Computation 21, 2363–2404 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  18. Travers, J., Milgram, S.: An experimental study of the small world problem. Sociometry 32, 425–443 (1969)CrossRefGoogle Scholar
  19. Yen, L., Saerens, M., Mantrach, A., Shimbo, M.: A Family of Dissimilarity Measures between Nodes Generalizing both the Shortest-Path and the Commute-time Distances. In: Proceedings of the 14th SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 785–793 (2008)Google Scholar
  20. Zhou, T.: Mixing navigation on networks. Physica A 387, 3025–3032 (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Department of Computer Science and Mathematical MethodsUniversity of LausanneSwitzerland
  2. 2.Department of GeographyUniversity of LausanneSwitzerland

Personalised recommendations