Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Robustness of centrality measures under uncertainty: Examining the role of network topology

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

Abstract

This study investigates the topological form of a network and its impact on the uncertainty entrenched in descriptive measures computed from observed social network data, given ubiquitous data-error. We investigate what influence a network’s topology, in conjunction with the type and amount of error, has on the ability of a measure, derived from observed data, to correctly approximate the same of the ground-truth network. By way of a controlled experiment, we reveal the differing effect that observation error has on measures of centrality and local clustering across several network topologies: uniform random, small-world, core-periphery, scale-free, and cellular. Beyond what is already known about the impact of data uncertainty, we found that the topology of a social network is, indeed, germane to the accuracy of these measures. In particular, our experiments show that the accuracy of identifying the prestigious, or key, actors in a network—according observed data—is considerably predisposed by the topology of the ground-truth network.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Airoldi EM, Carley KM (2005) Sampling algorithms for pure network topologies: Stability and separability of metric embeddings. SIGKDD Explor 7:13–22. Special Issue on Link Mining

    Article  Google Scholar 

  • Akaike H (1973) Information theory and an extension of the maximum likelihood principle. In: Petrov BN, Csàki F (eds) Second international symposium on inference theory. Akadémiaia Kaidó, Budapest, pp 267–281

    Google Scholar 

  • Albert R, Jeong H, Barabasi AL (1999) Diameter of the World Wide Web. Nature 401:130–131

    Article  Google Scholar 

  • Albert E, Jeong H, Barabasi AL (2000) Error and attack tolerance of complex networks. Nature 406:378–382

    Article  Google Scholar 

  • Alvo M, Cabilio P (1995) Rank correlation methods for missing data. Can J Stat (La Revue Canadienne de Statistique) 23:345–358

    Google Scholar 

  • Amaral LAN, Scala A, Barthelemy M, Stanley HE (2000) Classes of small-world networks. Proc Nat Acad Sci USA 97:11149–11152

    Article  Google Scholar 

  • Barabasi AL, Albert E (1999) Emergence of scaling in random networks. Science 286:509–512

    Article  Google Scholar 

  • Bollobás B (2001) Random graphs, 2nd edn. Cambridge University Press, Cambridge

    Google Scholar 

  • Bonacich P (1987) Power and centrality: A family of measures. Am J Soc 92:1170–1182

    Article  Google Scholar 

  • Borgatti SP (2006) Identifying sets of key players in a network. Comput Math Organ Theory 12:21–34

    Article  Google Scholar 

  • Borgatti SP, Everett MG (1999) Models of core/periphery structures. Soc Netw 21:375–395

    Article  Google Scholar 

  • Borgatti S, Reminga J (2005) Personal communication

  • Borgatti SP, Carley KM, Krackhardt D (2006) On the robustness of centrality measures under conditions of imperfect data. Soc Netw 28:124–136

    Article  Google Scholar 

  • Burt R (1978) Stratification and prestige among elite experts in methodological and mathematical sociology circa 1975. Soc Netw 1(1978):105–158

    Article  Google Scholar 

  • Butts CT (2003) Network inference, error, and informant (in)accuracy: a Bayesian approach. Soc Netw 25:103–140

    Article  Google Scholar 

  • Carley KM (2002) Dynamic network analysis. In: Breiger R, Carley KM, Pattison P (eds) Dynamic social network modeling and analysis: 2002 workshop summary and papers. National Academies Press, Washington

    Google Scholar 

  • Calloway M, Morrissey JP (1993) Accuracy and reliability of self-reported data in interorganizational networks. Soc Netw 15:377–398

    Article  Google Scholar 

  • Costenbader E, Valente TW (2003) The stability of centrality measures when networks are sampled. Soc Netw 25:283–307

    Article  Google Scholar 

  • Davis GF, Yoo M, Baker WE (2003) The small world of the American corporate elite, 1982–2001. Strateg Organ 1:301–326

    Article  Google Scholar 

  • Erdös P, Rényi A (1959) On random graphs. Publ Math 6:290–297

    Google Scholar 

  • Erickson BH, Nosanchuk TA (1983) Applied network sampling. Soc Netw 5(4):367–382

    Article  Google Scholar 

  • Feld SL, Carter WC (2002) Detecting measurement bias in respondent reports of personal networks. Soc Netw 24:365–383

    Article  Google Scholar 

  • Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the Internet topology, ACM SIGCOMM’99. Comput Commun Rev 29:251–262

    Article  Google Scholar 

  • Fortunato S, Flammini A, Menczer F (2006) Scale-free network growth by ranking. Phys Rev Lett 96:218701

    Article  Google Scholar 

  • Frank O (1978) Sampling and estimation in large social networks. Soc Netw 1:91–101

    Article  Google Scholar 

  • Frank O (1981) A survey of statistical methods for graph analysis. In: Leinhardt S (ed) Sociological methodology. Jossey-Bass, San Francisco

    Google Scholar 

  • Frantz TL, Carley KM (2005) A formal characterization of cellular networks. Technical report CMU-ISRI-05-109, School of Computer Science, Carnegie Mellon University

  • Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40:35–41

    Article  Google Scholar 

  • Freeman LC (1979) Centrality in social networks: I conceptual clarification. Soc Netw 1:215–239

    Article  Google Scholar 

  • Freeman LC, Rommey Kimball A, Freeman SC (1987) Cognitive structure and informant accuracy. Am Anthropol 89:310–325

    Article  Google Scholar 

  • Galaskiewicz J (1991) Estimating point centrality using different network sampling techniques. Soc Netw 13:347–386

    Article  Google Scholar 

  • Gile K, Handcock MA (2006) Model-based assessment of the impact of missing data on inference for networks. Working paper, no. 66, Center for Statistics and Social Sciences, University of Washington

  • Granovetter M (1976) Network sampling: Some first steps. Am J Soc 81:1287–1303

    Article  Google Scholar 

  • Guare J (1990) Six degrees of separation: A play. Vintage, New York

    Google Scholar 

  • Handcock MS, Gile K (2007) Modeling social networks with sampled or missing data. Working paper, no. 75, Center for Statistics and Social Sciences, University of Washington

  • Killworth PD, Bernard HR (1976) Informant accuracy in social network data. Human Organ 35:269–286

    Google Scholar 

  • Kim PJ, Jeong H (2007) Reliability of rank order in sampled networks. Eur Phys J B 55:109–114

    Article  Google Scholar 

  • Kossinets G (2006) Effect of missing data in social networks. Soc Netw 28:247–268

    Article  Google Scholar 

  • Krebs VE (2002) Mapping networks of terrorist cells. Connections 24:43–52

    Google Scholar 

  • Marsden PV (1990) Network data and measurement. Ann Rev Soc 16:435–463

    Article  Google Scholar 

  • Marsden PV (1993) The reliability of network density and composition measures. Soc Netw 15:300–421

    Article  Google Scholar 

  • Masuda N, Konno N (2006) VIP-club phenomenon: Emergence of elites and masterminds in social networks. Soc Netw 28:297–309

    Article  Google Scholar 

  • Mayntz R (2004) Organizational forms of terrorism: Hierarchy, network, or a type sui generis? MpIfG discussion paper 04.4. Max Planck Institute for the Study of Societies

  • McKnight PE, McKnight KM, Sindani S, Figueredo AJ (2007) Missing data. Guilford, New York

    Google Scholar 

  • Milgram S (1967) The small world problem. Psychol Today 2:60–67

    Google Scholar 

  • Newman ME, Watts DJ (1999) Scaling and percolation in the small-world network model. Phys Rev E 60:7332–7342

    Article  Google Scholar 

  • Newman ME, Watts DJ, Strogatz SH (2002) Random graphs models of social networks. Proc Nat Acad Sci 99:2566–2572

    Article  Google Scholar 

  • Papaioannou T, Loukas S (1984) Inequalities on rank correlation with missing data. J R Stat Soc, Ser B 46:68–71

    Google Scholar 

  • Powell WW, White DR, Koput KW, Owen-Smith J (2005) Network dynamics and field evolution: The growth of interorganizational collaboration in the life sciences. Am J Soc 110:1132–1205

    Article  Google Scholar 

  • Ravid G, Rafaeli S (2004) Asynchronous discussion groups as small world and scale free networks. First Monday 9(9), September

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

    Article  Google Scholar 

  • Ronfeldt D, Arquilla J (2001) Networks, netwars, and the fight for the future. First Monday 6

  • Rubin DB (1976) Inference and missing data. Biometrika 63:581–592

    Article  Google Scholar 

  • Simon HA (1955) On a class of skew distribution functions. Biometrika 42:425–440

    Google Scholar 

  • Stork D, Richards WD (1992) Nonrespondents in communication network studies: Problems and possibilities. Group Organ Manag 17:193–209

    Article  Google Scholar 

  • Stuart T, Robinson D (2000) The origins of inter-organizational networks. Working paper, Columbia Business School

  • Tsvetovat M, Carley KM (2005) Structural knowledge and success of anti-terrorist activity: The downside of structural equivalence. J Soc Struct 6 (2005)

  • Watts DJ (1999a) Small worlds: The dynamics of networks between order and randomness. Princeton University Press, Princeton

    Google Scholar 

  • Watts DJ (1999b) Networks, dynamics, and the small-world phenomenon. Am J Sociol 105:493–527

    Article  Google Scholar 

  • Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393:440–442

    Article  Google Scholar 

  • White S, Smyth P (2003) Algorithms for estimating relative importance in networks. ACM SIGKDD’03, August 24–27, Washington

  • Zemljic A, Hlebec V (2005) Reliability of measures of centrality and prominence. Soc Netw 27:73–88

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Computational Analysis of Social and Organizational Systems (CASOS), Institute for Software Research, School of Computer Science, Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA, 15213, USA

    Terrill L. Frantz & Kathleen M. Carley

  2. Two North Shore Center, Suite 320, Pittsburgh, PA, 15212, USA

    Marcelo Cataldo

Authors
  1. Terrill L. Frantz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcelo Cataldo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kathleen M. Carley
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Terrill L. Frantz.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Frantz, T.L., Cataldo, M. & Carley, K.M. Robustness of centrality measures under uncertainty: Examining the role of network topology. Comput Math Organ Theory 15, 303–328 (2009). https://doi.org/10.1007/s10588-009-9063-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10588-009-9063-5

Search

Navigation