Skip to main content
Log in

Exploring communication networks to understand organizational crisis using exponential random graph models

  • Published:
Computational and Mathematical Organization Theory Aims and scope Submit manuscript

Abstract

In recent social network studies, exponential random graph (ERG) models have been used comprehensively to model global social network structure as a function of their local features. In this study, we describe the ERG models and demonstrate its use in modelling the changing communication network structure at Enron Corporation during the period of its disintegration. We illustrate the modelling on communication networks, and provide a new way of classifying networks and their performance based on the occurrence of their local features. Among several micro-level structures of ERG models, we find significant variation in the appearance of A2P (Alternating k-two-paths) network structure in the communication network during crisis period and non-crisis period. We also notice that the attribute of hierarchical positions of actors (i.e., high rank versus low rank staff) have impact on the evolution process of networks during crisis. These findings could be used in analyzing communication networks of dynamic project groups and their adaptation process during crisis which could lead to an improved understanding how communications network evolve and adapt during crisis.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Adamic L, Adar E (2005) How to search a social network. Soc Netw 27(3):187–203

    Article  Google Scholar 

  • Diesner J, Carley KM (2005) Exploration of communication networks from the Enron email corpus. In: Proceedings of workshop on link analysis, counterterrorism and security, SIAM international conference on data mining 2005, pp 3–14.

    Google Scholar 

  • Diesner J, Frantz T, Carley K (2005) Communication networks from the Enron email corpus “It’s always about the people. Enron is no different”. Comput Math Organ Theory 11(3):201–228

    Article  Google Scholar 

  • Frank O, Strauss D (1986) Markov graphs, vol 81. Am Statist Assoc, Alexandria

    Google Scholar 

  • Goodreau SM (2007) Advances in exponential random graph (p ) models applied to a large social network. Soc Netw 29(2):231–248

    Article  Google Scholar 

  • Grimes AJ, Cornwall JR (1987) The disintegration of an organization: a dialectical analysis. J Manag 13(1):69

    Article  Google Scholar 

  • Hanneman R, Riddle M (2005) Introduction to social network methods. Riverside CUoC, Riverside (published in digital form at http://faculty.ucr.edu/~hanneman/)

    Google Scholar 

  • Hunter DR, Handcock MS (2006) Inference in curved exponential family models for networks. J Comput Graph Stat 15(3):565–583

    Article  Google Scholar 

  • Lubbers MJ, Snijders TAB (2007) A comparison of various approaches to the exponential random graph model: A reanalysis of 102 student networks in school classes. Soc Netw 29(4):489–507

    Article  Google Scholar 

  • Murshed T, Davis J, Hossain L (2007) Social network analysis and organizational disintegration: the case of Enron corporation. Paper presented at the international conference on information systems (ICIS 2007)

  • Pattison PE, Robins GL (2002) Neighbourhood-based models for social networks. Sociol Method 32:301–337

    Article  Google Scholar 

  • Robins G, Pattison P, Woolcock J (2004) Missing data in networks: exponential random graph (p ) models for networks with non-respondents. Soc Netw 26(3):257–283

    Article  Google Scholar 

  • Robins G, Pattison P, Kalish Y, Lusher D (2007a) An introduction to exponential random graph (p ) models for social networks. Soc Netw 29(2):173–191

    Article  Google Scholar 

  • Robins G, Snijders T, Wang P, Handcock M, Pattison P (2007b) Recent developments in exponential random graph (p ) models for social networks. Soc Netw 29(2):192–215

    Article  Google Scholar 

  • Saul ZM, Filkov V (2007) Exploring biological network structure using exponential random graph models. Bioinformatics 23(19):2604–2611

    Article  Google Scholar 

  • Shetty J, Adibi J (2004) The Enron email dataset database schema and brief statistical report. Information Sciences Institute Technical Report, University of Southern California

  • Smith H, Rogers Y, Brady M (2003) Managing one’s social network: does age make a difference. In: Human computer interaction—INTERACT’03, pp 551–558

    Google Scholar 

  • Snijders TAB (2002) Markov chain Monte Carlo estimation of exponential random graph models. J Soc Biol Struct 3(2):1–40

    Google Scholar 

  • Snijders T, Duijn MV (2002) Conditional maximum likelihood estimation under various specifications of exponential random graph models. Frank University of Stockholm, Department of Statistics, pp 117–134

  • Snijders T, Pattison P, Robins G, Handcock M (2006) New specifications for exponential random graph models. Sociol Method 36(1):99–153

    Article  Google Scholar 

  • Strauss D (1986) On a general class of models for interaction. SIAM Rev 28(4):513–527. doi:http://dx.doi.org/10.1137/1028156

    Article  Google Scholar 

  • Strauss D, Ikeda M (1990) Pseudolikelihood estimation for social networks. J Am Stat Assoc 85:204–212

    Article  Google Scholar 

  • Uddin M, Murshed STH, Hossain L (2010) Towards a scale free network approach to study organizational communication network. In: PACIS 2010 Proceedings, p 196

    Google Scholar 

  • Wasserman S, Pattison P (1996) Logit models and logistic regressions for social networks: I. An introduction to Markov graphs and P. Psychometrika 61(3):401–425. doi:10.1007/bf02294547

    Article  Google Scholar 

  • Wellman B (1996) For a social network analysis of computer networks: a sociological perspective on collaborative work and virtual community. Paper presented at the Proceedings of the 1996 ACM SIGCPR/SIGMIS conference on computer personnel research, Denver, Colorado, United States

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shahadat Uddin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Uddin, S., Hamra, J. & Hossain, L. Exploring communication networks to understand organizational crisis using exponential random graph models. Comput Math Organ Theory 19, 25–41 (2013). https://doi.org/10.1007/s10588-011-9104-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10588-011-9104-8

Keywords

Navigation