Skip to main content

A Novel Social Network Model for Forming Relationships

  • Conference paper
  • 1588 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 194))

Abstract

Recent studies on social networks are based on a characteristic which includes assortative mixing, high clustering, short average path lengths, broad degree distributions and the existence of community structure. Here, a model has been developed in the domain of ‘formation of relationships’ which satisfies all the above characteristics, based on some existing social network models. In addition, this model facilitates interaction between various family groups. This model gives very high clustering coefficient by retaining the asymptotically scale-free degree distribution. Here the community structure is raised from a mixture of random attachment and implicit preferential attachment. In addition to earlier works which only considered Neighbor of Initial Contact (NIC) as implicit preferential contact, we have considered Neighbor of Neighbor of Initial Contact (NNIC) also. This model supports the occurrence of a contact between two initial contacts if the new vertex chooses more than one initial contacts. This ultimately will develop a complex social network rather than the one that was taken as basic reference.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bhukya, S.: A novel model for social networks. In: BCFIC, February 16-18, pp. 21–24. IEEE, Los Alamitos (2011)

    Google Scholar 

  2. Thirunarayan, K., Anantharam, P., Henson, C.A., Sheth, A.P.: Some Trust Issues in Social Networks and Sensor Networks. In: CTS-2010, pp. 573–580 (2010)

    Google Scholar 

  3. Al-Arayed, D.A., Sousa, J.P.: General Trust Management- GTM. In: SocialCom 2010, pp. 857–864 (2010)

    Google Scholar 

  4. Milgram, S.: Psychology Today, vol. 2, pp. 60–67 (1967)

    Google Scholar 

  5. Granovetter, M.: The Strength of Weak Ties. Am. J. Soc. 78, 1360–1380 (1973)

    Article  Google Scholar 

  6. Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)

    Book  MATH  Google Scholar 

  7. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small -world’ networks. Nature 393, 440 (1998)

    Article  Google Scholar 

  8. Newman, M.: The structure of scientific collaboration networks. In: PNAS, vol. 98, pp. 404–409 (January 17, 2001)

    Google Scholar 

  9. Newman, M.: Coauthorship networks and patterns of scientific collaboration. In: PNAS, vol. 101, pp. 5200–5205 (April 6, 2004)

    Google Scholar 

  10. Holme, P., Edling, C.R., Liljeros, F.: Structure and Time-Evolution of an Internet Dating Community. Soc. Networks 26, 155–174 (2004)

    Article  Google Scholar 

  11. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821–7826 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Krapivsky, P.L., Redner, S.: Organization of growing random networks. Phys. Rev. E 63, 066123 (2001)

    Article  Google Scholar 

  14. Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Newman, M.E.J.: Assortative Mixing in Networks. Phys. Rev. Lett. 89, 208701 (2002)

    Article  Google Scholar 

  16. Newman, M.E.J., Park, J.: Why social networks are different from other types of networks. Phys. Rev. E 68, 036122 (2003)

    Article  Google Scholar 

  17. Amaral, L.A.N., Scala, A., Barth, M., Stanley, H.E.: Classes of small-world networks. In: PNAS, vol. 97, pp. 11149–11152 (October 10, 2000)

    Google Scholar 

  18. Boguna, M., Pastor-Satorras, R., Díaz-Guilera, A., Arenas, A.: Models of social networks based on social distance attachment. Phys. Rev. E 70, 056122 (2004)

    Article  Google Scholar 

  19. Toivonen, R., Onnela, J.-P., Saramäki, J., Hyvönen, J., Kaski, K.: A model for social networks. Physica A 371, 851–860 (2006)

    Article  Google Scholar 

  20. Evans, T., Saramäki, J.: Scale-free networks from self-organization. Phys. Rev. E 72, 026138 (2005)

    Article  MathSciNet  Google Scholar 

  21. Szabo, G., Alava, M., Kertesz, J.: Phys. Structural transitions in scale-free networks. Phys. Rev. E 67, 056102 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bhukya, S. (2011). A Novel Social Network Model for Forming Relationships. In: Ariwa, E., El-Qawasmeh, E. (eds) Digital Enterprise and Information Systems. DEIS 2011. Communications in Computer and Information Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22603-8_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22603-8_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22602-1

  • Online ISBN: 978-3-642-22603-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics