A Novel Dynamic Novel Growth model for Mobile Social Networks
DOI:
https://doi.org/10.69996/jcai.2024005Keywords:
Veneta, serverless, friend of friend detection, mobile social networking, vertex degree distribution, initial contactAbstract
With the rapid advancement of mobile networking technology and the widespread availability of high-speed data connectivity, mobile phones have evolved into potent platforms for social networking. Macro von Arb et al. proposed a serverless friend-of-friend detection algorithm, successfully implemented on VENETA, a mobile social networking platform. In our analytical study, we delved into two fundamental aspects of social network analysis: vertex degree distribution and clustering coefficient. These metrics provide crucial insights into the connectivity patterns and community structures within the network. By scrutinizing these metrics in the context of the implemented algorithm, we aim to assess its effectiveness in fostering connections and facilitating social interactions among users on the platform.
References
[1] M. Arb, M. Bader, M. Kuhn and R. Wattenhofer, “VENETA: Serverless Friend-of- Friend Detection in Mobile Social Networking,” In IEEE International Conference on Wireless & Mobile Computing, Networking & Communication, Avignon, France, 2008.
[2] J. Clerk Maxwell, “A Treatise on Electricity and Magnetism,” Oxford: Clarendon, vol.2, pp.68–73,1892.
[3] T.Sun, X. Shi, Y. Shen, K. Li and W. Qu “ilife: A novel mobile social network services on mobile phone,” 2010 10th IEEE International Conference on Computer and Information Technology, Bradford, UK, 2010.
[4] R. Toivonen, J.P. Onnela, J. S.¨ki, J. Hyvonen and K. Kaski “A model for social networks,” Physica A, vol. 371, pp.851–860, 2006.
[5] F. S. Tsai, W. Han, J. Xu and H.C. Chua “Design and development of a mobile peer-to-peer social networking application” Expert Systems with Applications, vol. 36, pp.11077–11087, 2009.
[6] M. J. Freedman, K. Nissim, and B. Pinkas, “Efficient Private Matching and Set Intersection” Eurocrypt, Berlin, Heidelberg, pp.1–19, 2004.
[7] S. Hohenberger and S. A. Weis, “Honest-Verifier Private Disjointness Testing Without Random Oracles,” In Privacy Enhancing Technologies, pp. 277–294, 2006.
[8] Kiayias and A. Mitrofanova, “Testing Disjointness of Private Datasets,” In Financial Cryptography, pp. 109– 124, 2005.
[9] P. Krapivsky and S. Redner, “Organization of growing random networks,” Phys. Rev. E, vol. 63, 2001.
[10] S. Dorogovtsev, J. Mendes, A. Samukhin, “Structure of Growing Networks with Preferential Linking” Phys. Rev. Lett., vol.85, no.4633, 2000.
[11] G. Szabo´, M. Alava and J. Kerte´sz, “Structural transitions in scale-free networks,” Phys. Rev. E, vol.67, no.056102, 2000.
[12] S. Bhukya, “A novel model for social network,” 2011 Baltic Congress on Future Internet and Communications, Riga, Latvia, pp. 21-24, 2011.
[13] S. Bhukya, “Discover academic experts in novel social network model,” 2011 International Conference on Advances in Social Networks Analysis and Mining, Kaohsiung, Taiwan, 2011.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Journal of Computer Allied Intelligence(JCAI)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Fringe Global Scientific Press publishes all the papers under a Creative Commons Attribution-Non-Commercial 4.0 International (CC BY-NC 4.0) (https://creativecommons.org/licenses/by-nc/4.0/) license. Authors have the liberty to replicate and distribute their work. Authors have the ability to use either the whole or a portion of their piece in compilations or other publications that include their own work. Please see the licensing terms for more information on reusing the work.
