Contact prediction, routing and fast information spreading in social networks

[1]  Krishna P. Gummadi,et al.  A measurement-driven analysis of information propagation in the flickr social network , 2009, WWW '09.

[2]  Ahmed Helmy,et al.  Modeling Spatial and Temporal Dependencies of User Mobility in Wireless Mobile Networks , 2008, IEEE/ACM Transactions on Networking.

[3]  Chang Wu Yu.  Computing subgraph probability of random geometric graphs with applications in quantitative analysis of ad hoc networks , 2009, IEEE Journal on Selected Areas in Communications.

[4]  Robert E. Tarjan,et al.  A Note on Finding the Bridges of a Graph , 1974, Inf. Process. Lett..

[5]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

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

[7]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[8]  Jon Crowcroft,et al.  Human mobility models and opportunistic communications system design , 2008, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

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

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

[11]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

[12]  Jon Kleinberg,et al.  The link prediction problem for social networks , 2003, CIKM '03.

[13]  Lada A. Adamic,et al.  The role of social networks in information diffusion , 2012, WWW.

[14]  Kazem Jahanbakhsh,et al.  Predicting human contacts in mobile social networks using supervised learning , 2012, SIMPLEX '12.

[15]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[16]  Pan Hui,et al.  How Small Labels Create Big Improvements , 2007, PerCom Workshops.

[17]  Kazem Jahanbakhsh,et al.  Human Contact Prediction Using Contact Graph Inference , 2010, 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing.

[18]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[19]  Christophe Diot,et al.  Experiences from measuring human mobility using Bluetooth inquiring devices , 2007, MobiEval '07.

[20]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[21]  Péter Csermely,et al.  Weak links : stabilizers of complex systems from proteins to social networks , 2006 .

[22]  Kazem Jahanbakhsh,et al.  Predicting missing contacts in mobile social networks , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[23]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[24]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[25]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[26]  Thrasyvoulos Spyropoulos,et al.  Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing , 2010, 2010 Proceedings IEEE INFOCOM.

[27]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[28]  Rami Puzis,et al.  Link Prediction in Social Networks Using Computationally Efficient Topological Features , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[29]  A-L Barabási,et al.  Structure and tie strengths in mobile communication networks , 2006, Proceedings of the National Academy of Sciences.

[30]  Mohammad Al Hasan,et al.  Link prediction using supervised learning , 2006 .

[31]  Dan Gusfield,et al.  Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..

[32]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[33]  Katarzyna Musial,et al.  Link Prediction Based on Subgraph Evolution in Dynamic Social Networks , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[34]  Kazem Jahanbakhsh,et al.  Predicting missing contacts in mobile social networks , 2011, WOWMOM.

[35]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

[36]  Silvio Lattanzi,et al.  Rumor spreading in social networks , 2011, Theor. Comput. Sci..

[37]  Klara Nahrstedt,et al.  Jyotish: Constructive approach for context predictions of people movement from joint Wifi/Bluetooth trace , 2011, Pervasive Mob. Comput..

[38]  Klaus Herrmann,et al.  Modeling the sociological aspects of mobility in ad hoc networks , 2003, MSWIM '03.

[39]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[40]  Marcelo Dias de Amorim,et al.  The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing , 2009, IEEE INFOCOM 2009.

[41]  P. Jaccard,et al.  Etude comparative de la distribution florale dans une portion des Alpes et des Jura , 1901 .

[42]  David Lazer,et al.  Inferring friendship network structure by using mobile phone data , 2009, Proceedings of the National Academy of Sciences.

[43]  Cecilia Mascolo,et al.  A community based mobility model for ad hoc network research , 2006, REALMAN '06.

[44]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[45]  Michael T. Goodrich,et al.  Algorithm design , 2001 .

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

[47]  Mahmoud Fouz,et al.  Social Networks Spread Rumors in Sublogarithmic Time , 2011, Electron. Notes Discret. Math..

[48]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[49]  B. Eisenberg.  On the expectation of the maximum of IID geometric random variables , 2008 .

[50]  J. Crowcroft,et al.  Bubble Rap: Forwarding in small world DTNs in ever decreasing circles , 2007 .

[51]  Devavrat Shah,et al.  Computing separable functions via gossip , 2005, PODC '06.

[52]  Jasmine Novak,et al.  Geographic routing in social networks , 2005, Proc. Natl. Acad. Sci. USA.

[53]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2011 .

[54]  Dino Pedreschi,et al.  Human mobility, social ties, and link prediction , 2011, KDD.

[55]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[56]  Kazem Jahanbakhsh,et al.  Empirical Comparison of Information Spreading Algorithms in the Presence of 1-Whiskers , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[57]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[58]  E. Rogers,et al.  Diffusion of Innovations , 1964 .

[59]  Silvio Lattanzi,et al.  Almost tight bounds for rumour spreading with conductance , 2010, STOC '10.

[60]  D. Watts,et al.  An Experimental Study of Search in Global Social Networks , 2003, Science.

[61]  Srinivasan Parthasarathy,et al.  Local graph sparsification for scalable clustering , 2011, SIGMOD '11.

[62]  Marco Conti,et al.  Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution , 2008, Pervasive Mob. Comput..

[63]  Nasser M. Nasrabadi,et al.  Pattern Recognition and Machine Learning , 2006, Technometrics.

[64]  Jure Leskovec,et al.  Inferring networks of diffusion and influence , 2010, KDD.

[65]  Christophe Diot,et al.  Are you moved by your social network application? , 2008, WOSN '08.

[66]  Jiangchuan Liu,et al.  Statistics and Social Network of YouTube Videos , 2008, 2008 16th Interntional Workshop on Quality of Service.

[67]  Kazem Jahanbakhsh,et al.  Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks , 2010, MobiOpp '10.

[68]  Anders Lindgren,et al.  Opportunistic content distribution in an urban setting , 2006, CHANTS '06.

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

[70]  Jon M. Kleinberg,et al.  Tracing information flow on a global scale using Internet chain-letter data , 2008, Proceedings of the National Academy of Sciences.

[71]  Krishna P. Gummadi,et al.  Exploiting Social Interactions in Mobile Systems , 2007, UbiComp.

[72]  Pan Hui,et al.  Distributed community detection in delay tolerant networks , 2007, MobiArch '07.

[73]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[74]  D. Goldberg,et al.  Assessing experimentally derived interactions in a small world , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[75]  Vijay Sivaraman,et al.  Experimental study of mobility in the soccer field with application to real-time athlete monitoring , 2010, 2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications.

[76]  Hadas Shachnai,et al.  Fast information spreading in graphs with large weak conductance , 2011, SODA '11.