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 application has been developed in the domain of ‘Business collaboration’ which satisfies all the above characteristics, based on some existing social network models. In addition, this model facilitates interaction between various communities (Academic/Research/Business groups). This application gives very high clustering coefficient by retaining the asymptotically scale-free degree distribution. Here the business network community 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 application 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bhukya, S.: A novel model for social networks. BCFIC IEEE, 21–24 (February 16-18, 2011)
Toivonen, R., Onnela, J.-P., Saramäki, J., Hyvönen, J., Kaski, K.: A model for social networks. Physica A 371, 851–860 (2006)
Milgram, S.: Psychology Today 2, 60–67 (1967)
Granovetter, M.: The Strength of Weak Ties. Am. J. Soc. 78, 1360–1380 (1973)
Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small -world’ networks. Nature 393, 440 (1998)
Newman, M.: The structure of scientific collaboration networks. PNAS 98, 404–409 (2001)
Newman, M.: Coauthorship networks and patterns of scientific collaboration. PNAS 101, 5200–5205 (2004)
Holme, P., Edling, C.R., Liljeros, F.: Structure and Time-Evolution of an Internet Dating Community. Soc. Networks 26, 155–174 (2004)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci.  99, 7821–7826 (2002)
Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)
BarabĂ¡si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Newman, M.E.J.: Assortative Mixing in Networks. Phys. Rev. Lett. 89, 208701 (2002)
Newman, M.E.J., Park, J.: Why social networks are different from other types of networks. Phys. Rev. EÂ 68, 036122 (2003)
Amaral, L.A.N., Scala, A., Barth, M., Stanley, H.E.: Classes of small-world networks. PNAS 97, 11149–11152 (2000)
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)
Evans, T., Saramäki, J.: Scale-free networks from self-organization. Phys. Rev. E 72, 026138 (2005)
Szabo, G., Alava, M., Kertesz, J.: Phys. Structural transitions in scale-free networks. Phys. Rev. EÂ 67, 056102 (2003)
Krapivsky, P.L., Redner, S.: Organization of growing random networks. phys. Rev. EÂ 63, 066123 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhukya, S. (2011). A Novel Social Network Model for Business Collaboration. In: Wyld, D.C., Wozniak, M., Chaki, N., Meghanathan, N., Nagamalai, D. (eds) Advances in Network Security and Applications. CNSA 2011. Communications in Computer and Information Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22540-6_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-22540-6_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22539-0
Online ISBN: 978-3-642-22540-6
eBook Packages: Computer ScienceComputer Science (R0)