Expansion and search in networks

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2010, Pages 239-248

  Maiya, Arun S ^a   Berger Wolf, Tanya Y ^a  

^a 1120 Science and Engineering Offices   (United States)

Author keywords

Complex networks; Decentralized search; Expander graphs; Expansion; Focused web crawling; Graph mining; MANET; P2P; Peer to peer networks; Social network analysis

Indexed keywords

COMPLEX NETWORKS; DECENTRALIZED SEARCHES; EXPANDER GRAPHS; FOCUSED WEB CRAWLING; GRAPH MINING; MANET; P2P; SOCIAL NETWORK ANALYSIS;

AD HOC NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC NETWORK ANALYSIS; EXPANSION; GRAPH THEORY; INFORMATION DISSEMINATION; KNOWLEDGE MANAGEMENT;

PEER TO PEER NETWORKS;

EID: 78651287903     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1871437.1871471     Document Type: Conference Paper

References (34)

1. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman. Search in power-law networks. Physical Review E, 64(4):046135+, Sep 2001.
2. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, October 1999.
3. C. L. Barret, S. G. Eubank, and J. P. Smith. Fighting Infectious Diseases (Sci. American). Rosen Publishing Group, 2007.
4. M. Boguna, D. Krioukov, and K. C. Claffy. Navigability of complex networks. Nature Physics, 5(1):74-80, November 2008.
5. F. Chierichetti, S. Lattanzi, and A. Panconesi. Rumour spreading and graph conductance. In SODA 2010.
6. P. Erdös and A. Rényi. On random graphs, I. Publicationes Mathematicae (Debrecen), 6:290-297, 1959.
7. U. Feige. A threshold of In n for approximating set cover. J. ACM, 45(4):634-652, July 1998.
8. J. Gehrke, P. Ginsparg, and J. Kleinberg. Overview of the 2003 kdd cup. SIGKDD Explor. Newsl., 5(2):149-151, December 2003.
9. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. PNAS, 99(12):7821-7826, June 2002.
10. D. S. Hochbaum, editor. Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, MA, USA, 1997.
11. D. S. Hochbaum and A. Pathria. Analysis of the greedy approach in problems of maximum k-coverage. Naval Research Logistics (NRL), 45(6):615-627, September 1998.
12. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bull. Amer. Math. Soc, 43, 2006.
13. K. Y. K. Hui, J. C. S. Lui, and D. K. Y. Yau. Small-world overlay p2p networks: construction, management and handling of dynamic flash crowds. Comput. Netw., 50(15):2727-2746, 2006.
14. S. Jiang, L. Guo, X. Zhang, and H. Wang. Lightflood: Minimizing redundant messages and maximizing scope of peer-to-peer search. IEEE TPDS, 19(5):601-614, 2008.
15. S. Jin and H. Jiang. Novel approaches to efficient flooding search in peer-to-peer networks. Computer Networks, 51(10):2818-2832, July 2007.
16. J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In STOC 2000.
17. J. Kleinberg. Complex networks and decentralized search algorithms. In ICM, 2006.
18. J. Kleinfeld. Could it be a big world after all? the 'six degrees of separation' myth. Society, April 2002.
19. B. Klimt and Y. Yang. The enron corpus: A new dataset for email classification research. In ECML 2004.
20. J. Leskovec. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD '05.
21. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In WWW '08.
22. X. Li and J. Wu. Searching techniques in peer-to-peer networks. In Handbook of Theoretical and Algorithmic Aspects of Ad Hoc, Sensor, and Peer-to-Peer Networks, pages 613-642, 2006.
23. D. Liben-Nowell, J. Novak, R. Kumar, P. Raghavan, and A. Tomkins. Geographic routing in social networks. PNAS, 102(33):11623-11628, August 2005.
24. A. S. Maiya and T. Y. Berger-Wolf. Sampling community structure. In WWW '10.
25. S. Milgram. The small world problem. Psychology Today, 2:60-67, 1967.
26. B. Mitra. Technological networks. In N. Ganguly, A. Deutsch, and A. Mukherjee, editors, Dynamics On and Of Complex Networks, chapter 15, pages 253-274. Birkhäuser Boston, Boston, 2009.
27. M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3):036104+, 2006.
28. M. Richardson, R. Agrawal, and P. Domingos. Trust Management for the Semantic Web, volume 2870. January 2003.
29. M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. Sep 2002.
30. S. Schmid and R. Wattenhofer. Structuring unstructured peer-to-peer networks. In S. Aluru, M. Parashar, R. Badrinath, and V. K. Prasanna, editors, HiPC 2007, volume 4873 of Lecture Notes in Computer Science, chapter 40, pages 432-442. Springer Berlin Heidelberg, Berlin, Heidelberg, 2007.
31. D. Tsoumakos and N. Roussopoulos. Analysis and comparison of p2p search methods. In InfoScale '06.
32. S. Wasserman and K. Faust. Models and Methods in Social Network Analysis (Structural Analysis in the Social Sciences). Cambridge University Press, February 2005.
33. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):440-442, June 1998.
34. B. Yang and H. G. Molina. Improving search in peer-to-peer networks. In ICDCS '02.