skip to main content
research-article
Free Access

A theory on power in networks

Published:28 October 2016Publication History
Skip Abstract Section

Abstract

Actors linked to central others in networks are generally central, even as actors linked to powerful others are powerless.

References

  1. Bayati, M., Borgs, C., Chayes, J., Kanoria, Y., and Montanari, A. Bargaining dynamics in exchange networks. J. Econ. Theory 156 (2015), 417--454.Google ScholarGoogle ScholarCross RefCross Ref
  2. Bonacich, P. Power and centrality: A family of measures. Am. J. Sociol. 92, 5 (1987), 1170--1182.Google ScholarGoogle ScholarCross RefCross Ref
  3. Bozzo, E., Franceschet, M., and Rinaldi, F. Vulnerability and power on networks. Network Sci. 3, 2 (2015), 196--226.Google ScholarGoogle ScholarCross RefCross Ref
  4. Brown, J.B., Chase, P.J., and Pittenger, A.O. Order independence and factor convergence in iterative scaling. Linear Algebra Appl. 190 (1993), 1--38.Google ScholarGoogle ScholarCross RefCross Ref
  5. Brualdi, R.A. Matrices of 0s and 1s with total support. J. Combin. Theory Ser. A 28, 3 (1980), 249--256.Google ScholarGoogle ScholarCross RefCross Ref
  6. Brualdi, R.A. and Ryser, H.J. Combinatorial Matrix Theory, Vol. 39 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge, U.K., 1991.Google ScholarGoogle Scholar
  7. Cook, K.S., Emerson, R.M., Gillmore, M.R., and Yamagishi, T. The distribution of power in exchange networks: Theory and experimental results. Am. J. Sociol. 89, 2 (1983), 275--305.Google ScholarGoogle ScholarCross RefCross Ref
  8. Cook, K.S. and Yamagishi, T. Power in exchange networks: A power-dependence formulation. Social Networks 14 (1992), 245--265.Google ScholarGoogle ScholarCross RefCross Ref
  9. Csima, J. and Datta, B.N. The DAD theorem for symmetric nonnegative matrices. J. Combin. Theory 12, 1 (1972), 147--152.Google ScholarGoogle ScholarCross RefCross Ref
  10. Easley, D. and Kleinberg, J. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Emerson, R.M. Power-dependence relations. Am. Sociol. Rev. 27, 1 (1962), 31--41.Google ScholarGoogle ScholarCross RefCross Ref
  12. Franceschet, M. PageRank: Standing on the shoulders of giants. Commun. ACM 54, 6 (2011), 92--101. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Kleinberg, J. and Tardos, E. Balanced outcomes in social exchange networks. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (2008), 295--304. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Knight, P.A. and Ruiz, D. A fast algorithm for matrix balancing. IMA J. Numer. Anal. 33, 3 (2013), 1029--1047.Google ScholarGoogle ScholarCross RefCross Ref
  15. Nash, J. The bargaining problem. Econometrica 18 (1950), 155--162.Google ScholarGoogle ScholarCross RefCross Ref
  16. Rochford, S.C. Symmetrically pairwise-bargained allocations in an assignment market. J. Econ. Theory 34, 2 (1984), 262--281.Google ScholarGoogle ScholarCross RefCross Ref
  17. Sinkhorn, R. and Knopp, P. Concerning nonnegative matrices and doubly stochastic matrices. Pac. J. Math. 21 (1967), 343--348.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A theory on power in networks

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image Communications of the ACM
            Communications of the ACM  Volume 59, Issue 11
            November 2016
            118 pages
            ISSN:0001-0782
            EISSN:1557-7317
            DOI:10.1145/3013530
            • Editor:
            • Moshe Y. Vardi
            Issue’s Table of Contents

            Copyright © 2016 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 28 October 2016

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Popular
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader

          HTML Format

          View this article in HTML Format .

          View HTML Format