IDEAS home Printed from https://ideas.repec.org/a/spr/qualqt/v47y2013i6p3289-3302.html
   My bibliography  Save this article

Two-mode networks: the measurement of efficiency in the profiles of actors’ participation in the occasions

Author

Listed:
  • Simone Celant

Abstract

In two-mode networks, the analysis of centrality aims at identifying the actors that reach predominant roles and positions by participating in the observed occasions, without investigating how they do it. In this paper, we focus on the identification of the actors who reach a significant level of connection with the others on the basis of an unsteady, but efficient, profile of participation. The concept of efficiency will be formally introduced using an axiomatic system, and extended to the network of occasions, leading to the concept of power center. We will then propose two approaches to the measurement of efficiency and power centers, based on a confrontation, namely a ratio, between actors’ and occasions’ level of social proximity and number of occasions attended (for actors), or number of participants (for occasions). The level of actors’ and occasions’ social proximity will be measured using a centrality approach. Finally, we will present an empirical application to a real two-mode network, in order to practically analyze the features and properties of the proposed indexes, and to compare them with the main centrality measures. Copyright Springer Science+Business Media B.V. 2013

Suggested Citation

  • Simone Celant, 2013. "Two-mode networks: the measurement of efficiency in the profiles of actors’ participation in the occasions," Quality & Quantity: International Journal of Methodology, Springer, vol. 47(6), pages 3289-3302, October.
    • Handle: RePEc:spr:qualqt:v:47:y:2013:i:6:p:3289-3302
    DOI: 10.1007/s11135-012-9719-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11135-012-9719-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11135-012-9719-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. R. Luce & Albert Perry, 1949. "A method of matrix analysis of group structure," Psychometrika, Springer;The Psychometric Society, vol. 14(2), pages 95-116, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Noah E. Friedkin, 1984. "Structural Cohesion and Equivalence Explanations of Social Homogeneity," Sociological Methods & Research, , vol. 12(3), pages 235-261, February.
    2. Le Breton, Michel & Weber, Shlomo, 2009. "Existence of Pure Strategies Nash Equilibria in Social Interaction Games with Dyadic Externalities," CEPR Discussion Papers 7279, C.E.P.R. Discussion Papers.
    3. Zhu, Yongjun & Yan, Erjia, 2017. "Examining academic ranking and inequality in library and information science through faculty hiring networks," Journal of Informetrics, Elsevier, vol. 11(2), pages 641-654.
    4. Zhuqi Miao & Balabhaskar Balasundaram & Eduardo L. Pasiliao, 2014. "An exact algorithm for the maximum probabilistic clique problem," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 105-120, July.
    5. Eric van Diessen & Willemiek J E M Zweiphenning & Floor E Jansen & Cornelis J Stam & Kees P J Braun & Willem M Otte, 2014. "Brain Network Organization in Focal Epilepsy: A Systematic Review and Meta-Analysis," PLOS ONE, Public Library of Science, vol. 9(12), pages 1-21, December.
    6. Henderson, Geraldine R. & Iacobucci, Dawn & Calder, Bobby J., 1998. "Brand diagnostics: Mapping branding effects using consumer associative networks," European Journal of Operational Research, Elsevier, vol. 111(2), pages 306-327, December.
    7. Etienne Farvaque & Frédéric Gannon, 2018. "Profiling giants: the networks and influence of Buchanan and Tullock," Public Choice, Springer, vol. 175(3), pages 277-302, June.
    8. Sokolov, Denis, 2022. "Shapley value for TU-games with multiple memberships and externalities," Mathematical Social Sciences, Elsevier, vol. 119(C), pages 76-90.
    9. Giuliani, Elisa & Pietrobelli, Carlo, 2014. "Social Network Analysis Methodologies for the Evaluation of Cluster Development Programs," Papers in Innovation Studies 2014/11, Lund University, CIRCLE - Centre for Innovation Research.
    10. Oleksandra Yezerska & Sergiy Butenko & Vladimir L. Boginski, 2018. "Detecting robust cliques in graphs subject to uncertain edge failures," Annals of Operations Research, Springer, vol. 262(1), pages 109-132, March.
    11. Vanhaverbeke, W.P.M. & Beerkens, B.E. & Duysters, G.M., 2003. "Explorative and exploitative learning strategies in technology-based alliance networks," Working Papers 03.22, Eindhoven Center for Innovation Studies.
    12. Mingshuo Nie & Dongming Chen & Dongqi Wang, 2022. "Graph Embedding Method Based on Biased Walking for Link Prediction," Mathematics, MDPI, vol. 10(20), pages 1-13, October.
    13. K. Parthasarathy, 1964. "Enumeration of paths in digraphs," Psychometrika, Springer;The Psychometric Society, vol. 29(2), pages 153-165, June.
    14. Zhong, Haonan & Mahdavi Pajouh, Foad & Prokopyev, Oleg A., 2021. "Finding influential groups in networked systems: The most degree-central clique problem," Omega, Elsevier, vol. 101(C).
    15. Nasirian, Farzaneh & Mahdavi Pajouh, Foad & Balasundaram, Balabhaskar, 2020. "Detecting a most closeness-central clique in complex networks," European Journal of Operational Research, Elsevier, vol. 283(2), pages 461-475.
    16. Robert Mokken, 1979. "Cliques, clubs and clans," Quality & Quantity: International Journal of Methodology, Springer, vol. 13(2), pages 161-173, April.
    17. Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Illya V. Hicks, 2016. "On the 2-Club Polytope of Graphs," Operations Research, INFORMS, vol. 64(6), pages 1466-1481, December.
    18. William Ray Arney, 1973. "A Refined Status Index for Sociometric Data," Sociological Methods & Research, , vol. 1(3), pages 329-346, February.
    19. Lawrence Hubert, 1974. "Some applications of graph theory to clustering," Psychometrika, Springer;The Psychometric Society, vol. 39(3), pages 283-309, September.
    20. Yezerska, Oleksandra & Mahdavi Pajouh, Foad & Butenko, Sergiy, 2017. "On biconnected and fragile subgraphs of low diameter," European Journal of Operational Research, Elsevier, vol. 263(2), pages 390-400.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:qualqt:v:47:y:2013:i:6:p:3289-3302. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.