×

Shareholding networks and centrality: An application to the Italian financial market. (English) Zbl 1154.91590

Naimzada, Ahmad K. (ed.) et al., Networks, topology and dynamics. Theory and applications to economics and social systems. Papers based on the presentations at the NET 2006, Verbania, Italy and Net 2007, Urbino, Italy. Berlin: Springer (ISBN 978-3-540-68407-7/hbk; 978-3-540-68409-1/ebook). Lecture Notes in Economics and Mathematical Systems 613, 215-228 (2009).
Summary: We study the Shareholding Network (SN) embedded in the Italian Stock Market (MIB). We identify the central companies both in the role of transferring information flows and controlling companies. To this end we use betweenness and flow betweenness centrality measures, together with in and out degree. We test the scale-free property on in and out degree, betweenness and flow betweenness centrality. The effect of external shocks to SN and the different extent on which companies react to them are measured relating asset volatility and betweenness.
For the entire collection see [Zbl 1155.91009].

MSC:

91B74 Economic models of real-world systems (e.g., electricity markets, etc.)
91B28 Finance etc. (MSC2000)
05C90 Applications of graph theory

References:

[1] Battiston, S., Inner structure of capital control networks, Physica A, 338, 107-112 (2004) · doi:10.1016/j.physa.2004.02.031
[2] Battiston S, Garlaschelli D, Caldarelli G (2003) The hidden topology of market investment networks — draft. http://www.lps.ens.fr
[3] Boginsky, V.; Butenko, S.; Pardalos, P.; Nagurney, A., On structural properties of the market graph, Innovations in financial and economic networks (2003), Cheltenham: Edward Elgar, Cheltenham
[4] Boginsky, V.; Butenko, S.; Pardalos, P., Statistical analysis of financial networks, Comput Stat Data Anal, 48, 2, 431-443 (2005) · Zbl 1429.62460 · doi:10.1016/j.csda.2004.02.004
[5] Bonacich, P., Power and centrality: a family of measures, Am J Sociol, 92, 5, 1170-1182 (1987) · doi:10.1086/228631
[6] Bonacich, P.; Lloyd, P., Eigenvector-like measures of centrality for asymmetric relations, Soc Networks, 23, 191-201 (2001) · doi:10.1016/S0378-8733(01)00038-7
[7] Bonanno, G.; Caldarelli, G.; Lillo, F.; Micciché, S.; Vandewalle, N.; Mantegna, RN, Network of equities in financial markets, Eur Phys J, B38, 363-371 (2004)
[8] Borgatti, SP, Centrality and network flow, Soc Networks (2005), 27, 1, 55-71 (2002) · doi:10.1016/j.socnet.2004.11.008
[9] Borsa Italiana. http://www.borsaitalia.it, April 2005
[10] Buckley, F.; Harary, F., Distance in graphs (1990), Reading, MA: Addison—Wesley, Reading, MA · Zbl 0688.05017
[11] Barabàsi, AL; Albert, R., Emergence of scaling in random networks, Science, 286, 509-512 (1999) · Zbl 1226.05223 · doi:10.1126/science.286.5439.509
[12] Barrat A, Barthélemy M, Vespignani A (2005) The effects of spatial constraints on the evolution of weighted networks. J Stat Mech P05003 · Zbl 1459.05294
[13] Barthélemy, M., Betweenness centrality in large complex networks, Eur Phys J, B38, 163-168 (2004)
[14] Barthélemy, M.; Barrat, A.; Pastor-Satorras, A.; Vespignani, A., Characterization and modeling of weighted networks, Physica A, 346, 34-43 (2005) · doi:10.1016/j.physa.2004.08.047
[15] Bollobás, B., Random graphs (2001), Cambridge: Cambridge University Press, Cambridge · Zbl 0997.05049
[16] Harary, F., Graph theory (1969), Cambridge, MA: Perseus, Cambridge, MA · Zbl 0182.57702
[17] Wasserman, S.; Faust, K., Social Network Analysis. Methods and Applications (1994), Cambridge: Cambridge University Press, Cambridge
[18] White, DR; Borgatti, SP, Betwenness centrality measures for directed graphs, Soc Networks, 16, 335-346 (1994) · doi:10.1016/0378-8733(94)90015-9
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.