A new approach to shortest paths on networks based on the quantum bosonic mechanism

This paper presents quantum bosonic shortest path searching (QBSPS), a natural, practical and highly heuristic physical algorithm for reasoning about the recognition of network structure via quantum dynamics. QBSPS is based on an Anderson-like itinerant bosonic system in which a boson's Green function is used as a navigation pointer for one to accurately approach the terminals. QBSPS is demonstrated by rigorous mathematical and physical proofs and plenty of simulations, showing how it can be used as a greedy routing to seek the shortest path between different locations. In methodology, it is an interesting and new algorithm rooted in the quantum mechanism other than combinatorics. In practice, for the all-pairs shortest-path problem in a random scale-free network with N vertices, QBSPS runs in O(μ(N) ln ln N) time. In application, we suggest that the corresponding experimental realizations are feasible by considering path searching in quantum optical communication networks; in this situation, the method performs a pure local search on networks without requiring the global structure that is necessary for current graph algorithms.

[1]  Uri Zwick,et al.  All pairs shortest paths in undirected graphs with integer weights , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[2]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[3]  Mikkel Thorup.  Integer priority queues with decrease key in constant time and the single source shortest paths problem , 2004, J. Comput. Syst. Sci..

[4]  Raimund Seidel,et al.  On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs , 1995, J. Comput. Syst. Sci..

[5]  D. Bu,et al.  Topological structure analysis of the protein-protein interaction network in budding yeast. , 2003, Nucleic acids research.

[6]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

[7]  Andrew V. Goldberg,et al.  Scaling algorithms for the shortest paths problem , 1995, SODA '93.

[8]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[9]  Seth Pettie,et al.  A Shortest Path Algorithm for Real-Weighted Undirected Graphs , 2005, SIAM J. Comput..

[10]  Geoff Huston,et al.  Scaling Inter-Domain Routing—A View Forward , 2001 .

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[12]  Marián Boguñá,et al.  Self-similarity of complex networks and hidden metric spaces , 2007, Physical review letters.

[13]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Shlomo Havlin,et al.  Wave localization in complex networks with high clustering. , 2008, Physical review letters.

[15]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[16]  Uri Zwick,et al.  All pairs shortest paths using bridging sets and rectangular matrix multiplication , 2000, JACM.

[17]  Marián Boguñá,et al.  Navigability of Complex Networks , 2007, ArXiv.

[18]  Seth Pettie,et al.  A new approach to all-pairs shortest paths on real-weighted graphs , 2004, Theor. Comput. Sci..

[19]  Sergey N. Dorogovtsev,et al.  Critical phenomena in complex networks , 2007, ArXiv.

[20]  Marián Boguñá,et al.  Navigating ultrasmall worlds in ultrashort time. , 2008, Physical review letters.

[21]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[22]  Zhiming Zheng,et al.  Detecting the structure of complex networks by quantum bosonic dynamics , 2009, 0906.1915.

[23]  Dmitri V. Krioukov,et al.  Erratum: Self-Similarity of Complex Networks and Hidden Metric Spaces [Phys. Rev. Lett. 100, 078701 (2008)] , 2008 .

[24]  Timothy M. Chan.  More algorithms for all-pairs shortest paths in weighted graphs , 2007, STOC '07.