Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random-Walk Sampling

In this paper, we investigate the problem of identifying influential users in mobile social networks. Influential users are individuals with high centrality in their social-contact graphs. Traditional approaches find these users through centralized algorithms. However, the computational complexity of these algorithms is known to be very high, making them unsuitable for large-scale networks. We propose a lightweight and distributed protocol, iWander, to identify influential users through fixed-length random-walk sampling. We prove that random-walk sampling with O(logn) steps, where n is the number of nodes in a graph, comes quite close to sampling vertices approximately according to their degrees. To the best of our knowledge, we are the first to design a distributed protocol on mobile devices that leverages random walks for identifying influential users, although this technique has been used in other areas. The most attractive feature of iWander is its extremely low control-message overhead, which lends itself well to mobile applications. We evaluate the performance of iWander for two applications, targeted immunization of infectious diseases and target-set selection for information dissemination. Through extensive simulation studies using a real-world mobility trace, we demonstrate that targeted immunization using iWander achieves a comparable performance with a degree-based immunization policy that vaccinates users with a large number of contacts first, while generating only less than 1% of this policy's control messages. We also show that target-set selection based on iWander outperforms the random and degree-based selections for information dissemination in several scenarios.

[1]  Minas Gjoka,et al.  Walking in Facebook: A Case Study of Unbiased Sampling of OSNs , 2010, 2010 Proceedings IEEE INFOCOM.

[2]  Donald F. Towsley,et al.  Characterizing continuous time random walks on time varying graphs , 2012, SIGMETRICS '12.

[3]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[4]  Cecilia Mascolo,et al.  Selective Reprogramming of Mobile Sensor Networks through Social Community Detection , 2010, EWSN.

[5]  Aravind Srinivasan,et al.  Modelling disease outbreaks in realistic urban social networks , 2004, Nature.

[6]  N. Christakis,et al.  Social Network Sensors for Early Detection of Contagious Outbreaks , 2010, PloS one.

[7]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[8]  Marc Lelarge,et al.  Efficient control of epidemics over random networks , 2009, SIGMETRICS '09.

[9]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[10]  Mark E. J. Newman A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[11]  Aravind Srinivasan,et al.  Your friends have more friends than you do: identifying influential mobile users through random walks , 2012, MobiHoc '12.

[12]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Reuven Cohen,et al.  Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.

[14]  Donald F. Towsley,et al.  Estimating and sampling graphs with multidimensional random walks , 2010, IMC '10.

[15]  Stratis Ioannidis,et al.  Dissemination in opportunistic mobile ad-hoc networks: The power of the crowd , 2011, 2011 Proceedings IEEE INFOCOM.

[16]  Aravind Srinivasan,et al.  Mobile Data Offloading through Opportunistic Communications and Social Participation , 2012, IEEE Transactions on Mobile Computing.

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

[18]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[19]  Nam P. Nguyen,et al.  Overlapping communities in dynamic networks: their detection and mobile applications , 2011, MobiCom.

[20]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[21]  Rayleigh The Problem of the Random Walk , 1905, Nature.

[22]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[23]  Maria A. Kazandjieva,et al.  A high-resolution human contact network for infectious disease transmission , 2010, Proceedings of the National Academy of Sciences.

[24]  Michael Kaminsky,et al.  SybilGuard: defending against sybil attacks via social networks , 2006, SIGCOMM.

[25]  W. O. Kermack,et al.  A contribution to the mathematical theory of epidemics , 1927 .

[26]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[27]  David A. Maltz,et al.  Worm origin identification using random moonwalks , 2005, 2005 IEEE Symposium on Security and Privacy (S&P'05).

[28]  Vikram Srinivasan,et al.  PeopleNet: engineering a wireless virtual social network , 2005, MobiCom '05.

[29]  Walter Willinger,et al.  On Unbiased Sampling for Unstructured Peer-to-Peer Networks , 2006, IEEE/ACM Transactions on Networking.

[30]  Lee Humphreys,et al.  It's Time to Eat! Using Mobile Games to Promote Healthy Eating , 2010, IEEE Pervasive Computing.

[31]  Cecilia Mascolo,et al.  SociableSense: exploring the trade-offs of adaptive sampling and computation offloading for social sensing , 2011, MobiCom.

[32]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[33]  Aravind Srinivasan,et al.  eDiscovery: Energy efficient device discovery for mobile opportunistic communications , 2012, 2012 20th IEEE International Conference on Network Protocols (ICNP).

[34]  Aravind Srinivasan,et al.  Structure of Social Contact Networks and Their Impact on Epidemics , 2004, Discrete Methods in Epidemiology.

[35]  W. Marsden I and J , 2012 .

[36]  R. Christley,et al.  Infection in social networks: using network analysis to identify high-risk individuals. , 2005, American journal of epidemiology.

[37]  L. Asz Random Walks on Graphs: a Survey , 2022 .

[38]  S. Feld Why Your Friends Have More Friends Than You Do , 1991, American Journal of Sociology.