Efficient Search in Networks Using Conductance

Decentralized search in networks is an important algorithmic problem in the study of complex networks and social networks analysis. It has a large number of practical applications, from shortest paths search in social network relationship, web pages search in WWW to querying files in peer-to-peer file sharing networks and so on. In this paper, we explore this problem from a perspective of community structure. We first find that through maximizing sample conductance, we can get high coverage sample. Based on this result, then, we propose a new decentralized search strategy named Conductance Search which tries to efficiently find the nodes belonging to different communities. We compare the strategy with other common strategies. And the results show that the conductance search outperforms others in number of steps to find the target and time complexity. Finally, we find some previous conclusions fail in many real-world networks and discuss network search-ability from the perspective of various structural properties.

[1]  George Giakkoupis,et al.  On the searchability of small-world networks with arbitrary underlying structure , 2010, STOC '10.

[2]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[3]  Tanya Y. Berger-Wolf,et al.  Expansion and search in networks , 2010, CIKM '10.

[4]  Yiming Yang,et al.  Introducing the Enron Corpus , 2004, CEAS.

[5]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[6]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Santosh S. Vempala,et al.  On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[8]  David D. Jensen,et al.  Navigating networks by using homophily and degree , 2008, Proceedings of the National Academy of Sciences.

[9]  Paul Erdös,et al.  On random graphs, I , 1959 .

[10]  Lada A. Adamic,et al.  How to search a social network , 2005, Soc. Networks.

[11]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[12]  Arindam Banerjee,et al.  A Social Query Model for Decentralized Search , 2008 .

[13]  Jon M. Kleinberg,et al.  Overview of the 2003 KDD Cup , 2003, SKDD.

[14]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[15]  M. Lam,et al.  All Friends are Not Equal : Using Weights in Social Graphs to Improve Search , 2010 .

[16]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[17]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[18]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[19]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[20]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[21]  Inderjit S. Dhillon,et al.  Weighted Graph Cuts without Eigenvectors A Multilevel Approach , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[23]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.