Skip to main content

Two-Dimensional Centrality of a Social Network

  • Conference paper
Data Analysis, Machine Learning and Applications

Abstract

A procedure of deriving the centrality in a social network is presented. The procedure uses the characteristic values and the vectors of a matrix of friendship relationships among actors. While the centrality of an actor has been usually derived by the characteristic vector corresponding to the largest characteristic value, the present study uses not only the characteristic vector corresponding to the largest characteristic value but also that corresponding to the second largest characteristic value. Each actor has two centralities. The interpretation of two centralities, and the comparison with the additive clustering are presented.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • ARABIE, P. and CARROLL, J.D. (1980): MAPCLUS: A Mathematical Programming Ap-proach to Fitting the ADCLUS Model. Psychometrika, 45, 211-235.

    Article  MATH  Google Scholar 

  • ARABIE, P., CARROLL, J.D., and DeSARBO, W.S. (1987): Three-Way Scaling and Cluster-ing. Sage Publications, Newbury Park.

    Google Scholar 

  • BONACICH, P. (1972): Factoring and Weighting Approaches to Status Scores and Clique Identification. Journal of Mathematical Sociology, 2, 113-120.

    Google Scholar 

  • BONACICH, P. (1991): Simultaneous Group and Individual Centralities. Social Networks, 13, 155-168.

    Article  Google Scholar 

  • BONACICH, P. and LLOYD, P. (2001): Eigenvector-Like Measures of Centrality for Asym-metric Relations. Social Networks, 23, 191-201.

    Article  Google Scholar 

  • HUBBELL, C.H. (1965): An Input-Output Approach to Clique Identification. Socimetry, 28, 277-299.

    Google Scholar 

  • OKADA, A. (2003): Using Additive Conjoint Measurement in Analysis of Social Network Data. In: M. Schwaiger, and O. Opitz (Eds.): Exploratory Data Analysis in Empirical Research. Springer, Berlin, 149-156.

    Google Scholar 

  • SCOTT, J. (1991): Social Network Analysis: A Handbook. Sage Publications, London.

    Google Scholar 

  • SHEPARD, R.N. and ARABIE, P. (1979): Additive Clustering: Representation of Similarities as a Combinations of Discrete Overlapping Properties. Psychological Review, 86, 87-123.

    Article  Google Scholar 

  • WASSERMAN, S. and FAUST, K. (1994): Social Network Analysis: Methods and Applica-tions. Cambridge University Press, Cambridge.

    Google Scholar 

  • WRIGHT, B. and EVITTS, M.S. (1961): Direct Factor Analysis in Sociometry. Sociometry, 24,82-98.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Okada, A. (2008). Two-Dimensional Centrality of a Social Network. In: Preisach, C., Burkhardt, H., Schmidt-Thieme, L., Decker, R. (eds) Data Analysis, Machine Learning and Applications. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78246-9_45

Download citation

Publish with us

Policies and ethics