Connectivity and generalized cliques in sociometric group structure
Author
Abstract
Suggested Citation
DOI: 10.1007/BF02289199
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Filipa D. Carvalho & Maria Teresa Almeida, 2017. "The triangle k-club problem," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 814-846, April.
- 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.
- Noah E. Friedkin, 1984. "Structural Cohesion and Equivalence Explanations of Social Homogeneity," Sociological Methods & Research, , vol. 12(3), pages 235-261, February.
- 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.
- Robert Mokken, 1979. "Cliques, clubs and clans," Quality & Quantity: International Journal of Methodology, Springer, vol. 13(2), pages 161-173, April.
- 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.
- 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.
- Richard D. Alba & Gwen Moore, 1978. "Elite Social Circles," Sociological Methods & Research, , vol. 7(2), pages 167-188, November.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- Vincent Labatut & Jean-Michel Balasque, 2012. "Detection and Interpretation of Communities in Complex Networks: Methods and Practical Application," Post-Print hal-00633653, HAL.
- 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.
- 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.
- 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.
- Richard C. Roistacher, 1974. "A Review of Mathematical Methods in Sociometry," Sociological Methods & Research, , vol. 3(2), pages 123-171, November.
- 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.
- 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.
- 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.
- Jessop, Alan, 2003. "Blockmodels with maximum concentration," European Journal of Operational Research, Elsevier, vol. 148(1), pages 56-64, July.
- Stephen P. Borgatti & Daniel S. Halgin, 2011. "On Network Theory," Organization Science, INFORMS, vol. 22(5), pages 1168-1181, October.
- 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.- Noah E. Friedkin, 1984. "Structural Cohesion and Equivalence Explanations of Social Homogeneity," Sociological Methods & Research, , vol. 12(3), pages 235-261, February.
- 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.
- 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.
- Etienne Farvaque & Frédéric Gannon, 2020. "Profiling giants: The networks and influence of Buchanan and Tullock," Working Papers halshs-02474745, HAL.
- 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.
- Wim Vanhaverbeke & Bonnie Beerkens & Geert Duysters & Victor Gilsing, 2006. "Explorative and exploitative learning strategies in technology-based alliance networks," Working Papers 06-03, Eindhoven Center for Innovation Studies, revised Jan 2006.
- K. Parthasarathy, 1964. "Enumeration of paths in digraphs," Psychometrika, Springer;The Psychometric Society, vol. 29(2), pages 153-165, June.
- 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.
- William Ray Arney, 1973. "A Refined Status Index for Sociometric Data," Sociological Methods & Research, , vol. 1(3), pages 329-346, February.
- Lawrence Hubert, 1974. "Some applications of graph theory to clustering," Psychometrika, Springer;The Psychometric Society, vol. 39(3), pages 283-309, September.
- Chitra Balasubramaniam & Sergiy Butenko, 2017. "On robust clusters of minimum cardinality in networks," Annals of Operations Research, Springer, vol. 249(1), pages 17-37, February.
- Gouvêa, Alessandra M.M.M. & Rubido, Nicolás & Macau, Elbert E.N. & Quiles, Marcos G., 2022. "Importance of Numerical Implementation and Clustering Analysis in Force-Directed Algorithms for Accurate Community Detection," Applied Mathematics and Computation, Elsevier, vol. 431(C).
- Fetta, Angelico & Harper, Paul & Knight, Vincent & Williams, Janet, 2018. "Predicting adolescent social networks to stop smoking in secondary schools," European Journal of Operational Research, Elsevier, vol. 265(1), pages 263-276.
- 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.
- Theodore Tsekeris, 2017. "Network analysis of inter-sectoral relationships and key sectors in the Greek economy," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 12(2), pages 413-435, July.
- Santella, Paolo & Drago, Carlo & Polo, Andrea, 2007. "The Italian Chamber of Lords Sits on Listed Company Boards: An Empirical Analysis of Italian Listed Company Boards from 1998 to 2006," MPRA Paper 2265, University Library of Munich, Germany.
- Belik, Ivan, 2014. "The Analysis of Split Graphs in Social Networks Based on the K-Cardinality Assignment Problem," Discussion Papers 2014/8, Norwegian School of Economics, Department of Business and Management Science.
- Verbeke, W.J.M.I. & Wuyts, S.H.K., 2006. "Moving in Social Circles – Social Circle Membership and Performance Implications," ERIM Report Series Research in Management ERS-2006-041-MKT, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Idan Menashe & Pascal Grange & Eric C Larsen & Sharmila Banerjee-Basu & Partha P Mitra, 2013. "Co-expression Profiling of Autism Genes in the Mouse Brain," PLOS Computational Biology, Public Library of Science, vol. 9(7), pages 1-10, July.
- Nadine V. Kegen, 2015. "Cohesive subgroups in academic networks: unveiling clique integration of top-level female and male researchers," Scientometrics, Springer;Akadémiai Kiadó, vol. 103(3), pages 897-922, June.
- 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.
- Ozman, Müge, 2003. "Self-Organizing Inter-Firm Networks," Research Memorandum 022, Maastricht University, Maastricht Economic Research Institute on Innovation and Technology (MERIT).
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.