IDEAS home Printed from https://ideas.repec.org/a/inm/ororsc/v22y2011i5p1168-1181.html
   My bibliography  Save this article

On Network Theory

Author

Listed:
  • Stephen P. Borgatti

    (LINKS Center for Social Network Analysis, Gatton College of Business and Economics, University of Kentucky, Lexington, Kentucky 40508)

  • Daniel S. Halgin

    (LINKS Center for Social Network Analysis, Gatton College of Business and Economics, University of Kentucky, Lexington, Kentucky 40508)

Abstract

Research on social networks has grown considerably in the last decade. However, there is a certain amount of confusion about network theory---for example, what it is, what is distinctive about it, and how to generate new theory. This paper attempts to remedy the situation by clarifying the fundamental concepts of the field (such as the network) and characterizing how network reasoning works. We start by considering the definition of network, noting some confusion caused by two different perspectives, which we refer to as realist and nominalist. We then analyze two well-known network theories, Granovetter's strength of weak ties theory [Granovetter, M. S. 1973. The strength of weak ties. Amer. J. Sociol. 78 (6) 1360--1380] and Burt's structural holes theory [Burt, R. S. 1992. Structural Holes: The Social Structure of Competition . Havard University Press, Cambridge, MA], to identify characteristic elements of network theorizing. We argue that both theories share an underlying theoretical model, which we label the network flow model, from which we derive additional implications. We also discuss network phenomena that do not appear to fit the flow model and discuss the possibility of a second fundamental model, which we call the bond model. We close with a discussion of the merits of model-based network theorizing for facilitating the generation of new theory, as well as a discussion of endogeneity in network theorizing.

Suggested Citation

  • Stephen P. Borgatti & Daniel S. Halgin, 2011. "On Network Theory," Organization Science, INFORMS, vol. 22(5), pages 1168-1181, October.
  • Handle: RePEc:inm:ororsc:v:22:y:2011:i:5:p:1168-1181
    DOI: 10.1287/orsc.1100.0641
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/orsc.1100.0641
    Download Restriction: no

    File URL: https://libkey.io/10.1287/orsc.1100.0641?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
    ---><---

    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.
    2. Jeongsik “Jay” Lee, 2010. "Heterogeneity, Brokerage, and Innovative Performance: Endogenous Formation of Collaborative Inventor Networks," Organization Science, INFORMS, vol. 21(4), pages 804-822, August.
    3. R. Luce, 1950. "Connectivity and generalized cliques in sociometric group structure," Psychometrika, Springer;The Psychometric Society, vol. 15(2), pages 169-190, 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. Robert Mokken, 1979. "Cliques, clubs and clans," Quality & Quantity: International Journal of Methodology, Springer, vol. 13(2), pages 161-173, April.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Richard D. Alba & Gwen Moore, 1978. "Elite Social Circles," Sociological Methods & Research, , vol. 7(2), pages 167-188, November.
    16. Yi Zhang & Kaihua Chen & Guilong Zhu & Richard C. M. Yam & Jiancheng Guan, 2016. "Inter-organizational scientific collaborations and policy effects: an ego-network evolutionary perspective of the Chinese Academy of Sciences," Scientometrics, Springer;Akadémiai Kiadó, vol. 108(3), pages 1383-1415, September.
    17. 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.
    18. Gallo, Julie Le & Plunket, Anne, 2020. "Regional gatekeepers, inventor networks and inventive performance: Spatial and organizational channels," Research Policy, Elsevier, vol. 49(5).
    19. Carayol, Nicolas & Bergé, Laurent & Cassi, Lorenzo & Roux, Pascale, 2019. "Unintended triadic closure in social networks: The strategic formation of research collaborations between French inventors," Journal of Economic Behavior & Organization, Elsevier, vol. 163(C), pages 218-238.
    20. 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.

    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:inm:ororsc:v:22:y:2011:i:5:p:1168-1181. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.