Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks
Scale-free networks naturally model wide area networks like the WWW. We consider the problem of fast exploration of huge scale-free networks using small memory space. Although there are many search algorithms for exploring an unknown graph, they require much space or time. For example, the depth first search requires some memory for all the nodes in the worst case, and the average number of steps in the random walk is O(n 3), where n is the size of the graph. Under assumptions reflecting WWW applications, we propose a new exploration paradigm called forest search particularly designed for scale-free networks, and theoretically evaluate its space complexity. We also demonstrate its superiority over random walk based search algorithms by conducting simulations.
KeywordsRandom Walk Target Node Preferential Attachment Additional Rule Span Forest
Unable to display preview. Download preview PDF.
- 8.Ebel, H., Mielsch, L.-I., Bornholdt, S.: Scale-free topology of e-mail networks. Pysical Review E 66, 1–4 (2002)Google Scholar
- 13.Ikeda, S., Kubo, I., Yamashita, M.: Reducing the Hitting and the Cover Times of Random Walks on Finite Graphs by Local Topological Information. In: Proceedings of The 2003 International Conference on VLSI, pp. 203–207 (2003)Google Scholar
- 14.Kurumida, Y., Ogata, T., Ono, H., Sadakane, K., Yamashita, M.: A Generic Search Strategy for Large Scale Real World Networks. In: Proc. of the 1st International Conference on Scalable Information Systems. ACM, Digital Library (2006)Google Scholar