How to network in online social networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2014, Pages 819-824

  Neglia, Giovanni ^a   Ye, Xiuhui ^b   Gabielkov, Maksym ^a   Legout, Arnaud ^a  

^a INRIA   (France)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ONLINE SYSTEMS; SOCIAL NETWORKING (ONLINE);

GLOBAL KNOWLEDGE; GREEDY ALGORITHMS; NP-HARD; ON-LINE SOCIAL NETWORKS; ONLINE SOCIAL NETWORKS (OSNS); OPTIMAL ALGORITHM; SOCIAL GRAPHS; SOCIAL RELATIONSHIPS;

APPROXIMATION ALGORITHMS;

EID: 84904489219     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOMW.2014.6849336     Document Type: Conference Paper

References (11)

1. D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network," in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, ser. KDD '03. New York, NY, USA: ACM, 2003, pp. 137-146.
2. P. Domingos and M. Richardson, "Mining the network value of customers," in Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ser. KDD '01. New York, NY, USA: ACM, 2001, pp. 57-66. [Online]. Available: http://doi.acm.org/10.1145/ 502512.502525
3. D. Kempe, J. Kleinberg, and E. Tardos, "Influential nodes in a diffusion model for social networks," in Proceedings of the 32nd international conference on Automata, Languages and Programming, ser. ICALP'05. Berlin, Heidelberg: Springer-Verlag, 2005, pp. 1127-1138.
4. M. Cha, H. Haddadi, F. Benevenuto, and K. P. Gummadi, "Measuring user influence in twitter: The million follower fallacy," in Proceedings of AAAI ICWSM international Conference on Weblogs and Social, 2010.
5. M. Gabielkov, A. Rao, and A. Legout, "Studying Social Networks at Scale: Macroscopic Anatomy of the Twitter Social Graph," in ACM Sigmetrics 2014, Austin, TX, USA, Jun. 2014.
6. W. Chen, Y. Wang, and S. Yang, "Efficient influence maximization in social networks," in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ser. KDD '09. New York, NY, USA: ACM, 2009, pp. 199-208. Available: http://doi.acm.org/10.1145/1557019. 1557047
7. Habiba and T. Y. Berger-Wolf, "Working for influence: network density and influential individuals," in Proceedings of the IEEE ICDM 2011 Workshop on Data Mining in Networks (DaMNet 2011), 2011.
8. G. Nemhauser, L. Wolsey, and M. Fisher, "An analysis of approximations for maximizing submodular set functionsi," Mathematical Programming, vol. 14, no. 1, pp. 265-294, 1978. Available: http://dx.doi.org/10. 1007/BF01588971
9. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York, NY, USA: Wiley-Interscience, 1988.
10. G. Neglia, X. Ye, M. Gabielkov, and A. Legout, "How to Network in Online Social Networks," INRIA, Research Report RR-8423, Dec. 2013. [Online]. Available: http://hal.inria.fr/hal-00917974
11. A. Barrat, M. Barth́elemy, and A. Vespignani, Dynamical Processes on Complex Networks. Cambridge University Press, 2008. [Online]. Available: http://dx.doi.org/10.1017/CBO9780511791383