|
[1] L. C. Freeman, “A set of measures of centrality based on betweenness,” Sociometry, pp. 35–41, 1977. [2] M. Newman, Networks: an introduction. Oxford university press, 2010. [3] L. C. Freeman, “Centrality in social networks conceptual clarification,” Social networks, vol. 1, no. 3, pp. 215–239, 1978. [4] P. J. Mucha, T. Richardson, K. Macon, M. A. Porter, and J.-P. Onnela, “Community structure in time-dependent, multiscale, and multiplex networks,” science, vol. 328, no. 5980, pp. 876–878, 2010. [5] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “Gossip algorithms: Design, analysis and applications,” in INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 3. IEEE, 2005, pp. 1653–1664. [6] C.-S. Chang, C.-Y. Hsu, J. Cheng, and D.-S. Lee, “A general probabilistic framework for detecting community structure in networks,” in INFOCOM, 2011 Proceedings IEEE. IEEE, 2011, pp. 730–738. [7] L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: Bringing order to the web.” Stanford InfoLab, Tech. Rep., 1999. [8] V. Latora and M. Marchiori, “A measure of centrality based on network efficiency,” New Journal of Physics, vol. 9, no. 6, p. 188, 2007. [9] E. Estrada and J. A. Rodriguez-Velazquez, “Subgraph centrality in complex networks,” Physical Review E, vol. 71, no. 5, p. 056103, 2005. [10] A. Mohammadinejad, R. Farahbakhsh, and N. Crespi, “Employing personality feature to rank the influential users in signed networks,” in Big Data and Cloud Computing (BDCloud), Social Computing and Networking (SocialCom), Sustainable Computing and Communications (SustainCom)(BDCloud-SocialCom-SustainCom), 2016 IEEE International Conferences on. IEEE, 2016, pp. 346–353. [11] H. Kim and R. Anderson, “Temporal node centrality in complex networks,” Physical Review E, vol. 85, no. 2, p. 026107, 2012. [12] D. Taylor, S. A. Myers, A. Clauset, M. A. Porter, and P. J. Mucha, “Eigenvectorbased centrality measures for temporal networks,” Multiscale Modeling & Simulation, vol. 15, no. 1, pp. 537–574, 2017. [13] J. Jung, W. Jin, L. Sael, and U. Kang, “Personalized ranking in signed networks using signed random walk with restart,” in Data Mining (ICDM), 2016 IEEE 16th International Conference on. IEEE, 2016, pp. 973–978. [14] J. Weng, E.-P. Lim, J. Jiang, and Q. He, “Twitterrank: finding topic-sensitive influential twitterers,” in Proceedings of the third ACM international conference on Web search and data mining. ACM, 2010, pp. 261–270. [15] C.-S. Chang, C.-J. Chang, W.-T. Hsieh, D.-S. Lee, L.-H. Liou, and W. Liao, “Relative centrality and local community detection,” Network Science, vol. 3, no. 4, pp. 445–479, 2015. [16] C.-S. Chang, D.-S. Lee, L.-H. Liou, S.-M. Lu, and M.-H. Wu, “A probabilistic framework for structural analysis in directed networks,” in Communications (ICC), 2016 IEEE International Conference on. IEEE, 2016, pp. 1–6. [17] S. Brin and L. Page, “Reprint of: The anatomy of a large-scale hypertextual web search engine,” Computer networks, vol. 56, no. 18, pp. 3825–3833, 2012. [18] M. Rosvall and C. Bergstrom, “Maps of information flow reveal community structure in complex networks,” arXiv preprint physics.soc-ph/0707.0609, 2007. [19] R. Lambiotte, J.-C. Delvenne, and M. Barahona, “Random walks, markov processes and the multiscale modular organization of complex networks,” IEEE Transactions on Network Science and Engineering, vol. 1, no. 2, pp. 76–90, 2014. [20] T. M. Cover and J. A. Thomas, Elements of information theory. John Wiley & Sons, 2012. [21] C.-S. Chang, Performance guarantees in communication networks. Springer Science & Business Media, 2012. [22] S. Juneja and P. Shahabuddin, “Rare-event simulation techniques: an introduction and recent advances,” Handbooks in operations research and management science, vol. 13, pp. 291–350, 2006. [23] L. A. Adamic and N. Glance, “The political blogosphere and the 2004 us election: divided they blog,” in Proceedings of the 3rd international workshop on Link discovery. ACM, 2005, pp. 36–43. [24] J. Leskovec, L. Backstrom, and J. Kleinberg, “Memetracker data,” 2008. [25] S. Osiński and D. Weiss, “Carrot2: Design of a flexible and efficient web information retrieval framework,” in International atlantic web intelligence conference. Springer, 2005, pp. 439–444. |