Abstract
Actors linked to central others in networks are generally central, even as actors linked to powerful others are powerless.
- Bayati, M., Borgs, C., Chayes, J., Kanoria, Y., and Montanari, A. Bargaining dynamics in exchange networks. J. Econ. Theory 156 (2015), 417--454.Google ScholarCross Ref
- Bonacich, P. Power and centrality: A family of measures. Am. J. Sociol. 92, 5 (1987), 1170--1182.Google ScholarCross Ref
- Bozzo, E., Franceschet, M., and Rinaldi, F. Vulnerability and power on networks. Network Sci. 3, 2 (2015), 196--226.Google ScholarCross Ref
- 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 ScholarCross Ref
- Brualdi, R.A. Matrices of 0s and 1s with total support. J. Combin. Theory Ser. A 28, 3 (1980), 249--256.Google ScholarCross Ref
- 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 Scholar
- 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 ScholarCross Ref
- Cook, K.S. and Yamagishi, T. Power in exchange networks: A power-dependence formulation. Social Networks 14 (1992), 245--265.Google ScholarCross Ref
- Csima, J. and Datta, B.N. The DAD theorem for symmetric nonnegative matrices. J. Combin. Theory 12, 1 (1972), 147--152.Google ScholarCross Ref
- Easley, D. and Kleinberg, J. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York, 2010. Google ScholarDigital Library
- Emerson, R.M. Power-dependence relations. Am. Sociol. Rev. 27, 1 (1962), 31--41.Google ScholarCross Ref
- Franceschet, M. PageRank: Standing on the shoulders of giants. Commun. ACM 54, 6 (2011), 92--101. Google ScholarDigital Library
- 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 ScholarDigital Library
- Knight, P.A. and Ruiz, D. A fast algorithm for matrix balancing. IMA J. Numer. Anal. 33, 3 (2013), 1029--1047.Google ScholarCross Ref
- Nash, J. The bargaining problem. Econometrica 18 (1950), 155--162.Google ScholarCross Ref
- Rochford, S.C. Symmetrically pairwise-bargained allocations in an assignment market. J. Econ. Theory 34, 2 (1984), 262--281.Google ScholarCross Ref
- Sinkhorn, R. and Knopp, P. Concerning nonnegative matrices and doubly stochastic matrices. Pac. J. Math. 21 (1967), 343--348.Google ScholarCross Ref
Index Terms
- A theory on power in networks
Recommendations
Dynamic Lightpath Establishment Considering Four-Wave Mixing for Achieving Low-Power All-Optical Networks
This paper proposes a method for dynamically establishing a lightpath that takes into consideration power consumption and four-wave mixing FWM in an all-optical network. In an all-optical network, an optical fiber amplifier is used to amplify a group of ...
Survivable power efficiency oriented integrated grooming in green networks
The wide interests in the power savings of IP over wavelength-division-multiplexing (WDM) optical networks have recently risen in both academic and industrial communities. In an effort to tackle this problem, the hybrid grooming (traffic grooming along ...
Evaluating power saving techniques in passive optical access networks
AbstractPassive optical networks (PONs) are a preferred technology for implementing fiber-to-the-home networks. Though PONs minimize power consumption compared to digital subscriber loops (DSL), they still constitute a significant portion of the power ...
Comments