IDEAS home Printed from https://ideas.repec.org/a/spr/psycho/v15y1950i2p169-190.html
   My bibliography  Save this article

Connectivity and generalized cliques in sociometric group structure

Author

Listed:
  • R. Luce

Abstract

No abstract is available for this item.

Suggested Citation

  • R. Luce, 1950. "Connectivity and generalized cliques in sociometric group structure," Psychometrika, Springer;The Psychometric Society, vol. 15(2), pages 169-190, June.
    • Handle: RePEc:spr:psycho:v:15:y:1950:i:2:p:169-190
    DOI: 10.1007/BF02289199
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02289199
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02289199?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)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Filipa D. Carvalho & Maria Teresa Almeida, 2017. "The triangle k-club problem," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 814-846, April.
    2. Dimitrios Tsiotas & Serafeim Polyzos, 2018. "The Complexity in the Study of Spatial Networks: an Epistemological Approach," Networks and Spatial Economics, Springer, vol. 18(1), pages 1-32, March.
    3. Korotaev, Andrey (Коротаев, Андрей) & Shulgin, Sergey (Шульгин, Сергей) & Zinkina, Yulia (Зинькина, Юлия), 2017. "Country Risk Analysis Based on Demographic and Socio-Economic Data [Анализ Страновых Рисков С Использованием Демографических И Социально-Экономических Данных]," Working Papers 031715, Russian Presidential Academy of National Economy and Public Administration.
    4. Veremyev, Alexander & Boginski, Vladimir, 2012. "Identifying large robust network clusters via new compact formulations of maximum k-club problems," European Journal of Operational Research, Elsevier, vol. 218(2), pages 316-326.
    5. Maciej Rysz & Foad Mahdavi Pajouh & Pavlo Krokhmal & Eduardo L. Pasiliao, 2018. "Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights," Annals of Operations Research, Springer, vol. 262(1), pages 89-108, March.
    6. Richard C. Roistacher, 1974. "A Review of Mathematical Methods in Sociometry," Sociological Methods & Research, , vol. 3(2), pages 123-171, November.
    7. Balasundaram, Balabhaskar & Borrero, Juan S. & Pan, Hao, 2022. "Graph signatures: Identification and optimization," European Journal of Operational Research, Elsevier, vol. 296(3), pages 764-775.
    8. Yi-Shan Sung & Dashun Wang & Soundar Kumara, 0. "Uncovering the effect of dominant attributes on community topology: A case of facebook networks," Information Systems Frontiers, Springer, vol. 0, pages 1-12.
    9. Foad Mahdavi Pajouh & Zhuqi Miao & Balabhaskar Balasundaram, 2014. "A branch-and-bound approach for maximum quasi-cliques," Annals of Operations Research, Springer, vol. 216(1), pages 145-161, May.
    10. Yajun Lu & Hosseinali Salemi & Balabhaskar Balasundaram & Austin Buchanan, 2022. "On Fault-Tolerant Low-Diameter Clusters in Graphs," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3181-3199, November.
    11. Noah E. Friedkin, 1984. "Structural Cohesion and Equivalence Explanations of Social Homogeneity," Sociological Methods & Research, , vol. 12(3), pages 235-261, February.
    12. Vincent Labatut & Jean-Michel Balasque, 2012. "Detection and Interpretation of Communities in Complex Networks: Methods and Practical Application," Post-Print hal-00633653, HAL.
    13. Yi-Shan Sung & Dashun Wang & Soundar Kumara, 2018. "Uncovering the effect of dominant attributes on community topology: A case of facebook networks," Information Systems Frontiers, Springer, vol. 20(5), pages 1041-1052, October.
    14. Robert Mokken, 1979. "Cliques, clubs and clans," Quality & Quantity: International Journal of Methodology, Springer, vol. 13(2), pages 161-173, April.
    15. Foad Mahdavi Pajouh & Esmaeel Moradi & Balabhaskar Balasundaram, 2017. "Detecting large risk-averse 2-clubs in graphs with random edge failures," Annals of Operations Research, Springer, vol. 249(1), pages 55-73, February.
    16. Zhuqi Miao & Balabhaskar Balasundaram, 2020. "An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 763-778, July.
    17. Vladimir Boginski & Sergiy Butenko & Oleg Shirokikh & Svyatoslav Trukhanov & Jaime Gil Lafuente, 2014. "A network-based data mining approach to portfolio selection via weighted clique relaxations," Annals of Operations Research, Springer, vol. 216(1), pages 23-34, May.
    18. Yuichi Asahiro & Tomohiro Kubo & Eiji Miyano, 2019. "Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 143-161, October.
    19. Jessop, Alan, 2003. "Blockmodels with maximum concentration," European Journal of Operational Research, Elsevier, vol. 148(1), pages 56-64, July.
    20. Stephen P. Borgatti & Daniel S. Halgin, 2011. "On Network Theory," Organization Science, INFORMS, vol. 22(5), pages 1168-1181, October.
    21. Balabhaskar Balasundaram & Sergiy Butenko & Illya V. Hicks, 2011. "Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem," Operations Research, INFORMS, vol. 59(1), pages 133-142, February.
    22. 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.
    23. Balabhaskar Balasundaram & Sergiy Butenko & Svyatoslav Trukhanov, 2005. "Novel Approaches for Analyzing Biological Networks," Journal of Combinatorial Optimization, Springer, vol. 10(1), pages 23-39, August.
    24. Richard D. Alba & Gwen Moore, 1978. "Elite Social Circles," Sociological Methods & Research, , vol. 7(2), pages 167-188, November.
    25. Pattillo, Jeffrey & Youssef, Nataly & Butenko, Sergiy, 2013. "On clique relaxation models in network analysis," European Journal of Operational Research, Elsevier, vol. 226(1), pages 9-18.

    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. 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.
    2. Noah E. Friedkin, 1984. "Structural Cohesion and Equivalence Explanations of Social Homogeneity," Sociological Methods & Research, , vol. 12(3), pages 235-261, February.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Sokolov, Denis, 2022. "Shapley value for TU-games with multiple memberships and externalities," Mathematical Social Sciences, Elsevier, vol. 119(C), pages 76-90.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. K. Parthasarathy, 1964. "Enumeration of paths in digraphs," Psychometrika, Springer;The Psychometric Society, vol. 29(2), pages 153-165, June.
    15. 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).
    16. 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.
    17. Robert Mokken, 1979. "Cliques, clubs and clans," Quality & Quantity: International Journal of Methodology, Springer, vol. 13(2), pages 161-173, April.
    18. 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.
    19. William Ray Arney, 1973. "A Refined Status Index for Sociometric Data," Sociological Methods & Research, , vol. 1(3), pages 329-346, February.
    20. Lawrence Hubert, 1974. "Some applications of graph theory to clustering," Psychometrika, Springer;The Psychometric Society, vol. 39(3), pages 283-309, September.

    More about this item

    Statistics

    Access and download statistics

    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:psycho:v:15:y:1950:i:2:p:169-190. 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.