This article has an unclear citation style.(August 2013) |
Cascades in financial networks are situations in which the failure of one financial institution causes a cascading failure in another member of the financial network. In an extreme this can cause failure of the whole network in what is known as systemic failure. It can be defined as the discontinuous value loss (e.g. default) of the organization caused by the discontinuous value loss of another organization in the network. There are three conditions required for a cascade, there are; a failure, contagion and interconnection. [1]
Diversification and integration in the financial network determine whether and how failures will spread. Using the data on cross-holdings of organizations and on the value of organizations, it is possible to construct the dependency matrix to simulate cascades in the financial network.
Elliot, Golub and Jackson (2013) characterize the financial network by diversification and integration. Diversification means to which extent assets of the one organization are spread out among the other members of the network, given the fraction of the assets of the organization cross-held by other organizations is fixed. Integration refers to the fraction of the assets of the organization cross-held by other organizations given the number of the organizations cross-holding is fixed.
Using random network, the authors [2] show that high integration decreases the percentage of first failures; and as the network approaches complete integration the percentage of the first failures approaches zero. However, the integration increases the percentage of organizations that fail due to higher interconnection. In addition, up to some threshold, diversification does increase the percentage of discontinuous drops in value. Yet after the threshold level, the diversification decreases the percentage of failures: the authors say the following with respect to diversification: “it gets worse before it gets better”. [3]
Intuitively, the higher the threshold value for the discontinuous drop in the organization’s value the higher the percentage of failures is.
The authors [4] conclude that the financial network is most susceptible to cascades if it has medium diversification and medium integration.
Eliot, Golub and Jackson (2013) provide an empirical method how to model cascades in financial networks. They assume that organizations in the network can cross hold assets of other organizations in the network. Also, they assume that players outside of the network can hold assets of the organizations in the network. They call the letter outside shareholders. Their model starts with the following assumptions (all notations are borrowed from Elliot, Golub and Jackson (2013)):
The authors find the equity value of an organization using the works by Brioschi, Buzzachi and Colombo (1989) [5] and Fedina, Hodder and Trianitis (1994): [6]
The equity value is defined as the value of primitive assets and the value of claims on the primitive assets in other organizations in the network.
The counterpart of the equation above in terms of matrix algebra is given by
The letter implies
The market value is defined by
Market value of i is the equity value of i less the claims of other organizations in the network on i.
The letter implies
where A is the dependence matrix.
The element represents the fraction of j's primitive assets that i holds directly and indirectly.
The equity value and the market value equations are extended by introducing threshold value . If the value of the organization i goes below this value, then a discontinuous drop in value happens and the organization fails. The cap on failure costs is .
Further, let be an indicator function that is equal to 1 if the value of i is below the threshold and 0 if the value of i is above the threshold.
Then the equity value becomes
Using matrix algebra, the expression above is equivalent to
where is a vector whose element .
The market value including failure costs is given then by
The element represents the fraction of failure costs of that i incurs if j fails.
In linear algebra, the trace of a square matrix A, denoted tr(A), is defined to be the sum of elements on the main diagonal of A.
In mathematics, a Hermitian matrix is a complex square matrix that is equal to its own conjugate transpose—that is, the element in the i-th row and j-th column is equal to the complex conjugate of the element in the j-th row and i-th column, for all indices i and j:
High-dimensional data, meaning data that requires more than two or three dimensions to represent, can be difficult to interpret. One approach to simplification is to assume that the data of interest lies within lower-dimensional space. If the data of interest is of low enough dimension, the data can be visualised in the low-dimensional space.
In mathematics and theoretical physics, the term quantum group denotes one of a few different kinds of noncommutative algebras with additional structure. These include Drinfeld–Jimbo type quantum groups, compact matrix quantum groups, and bicrossproduct quantum groups.
Modern portfolio theory (MPT), or mean-variance analysis, is a mathematical framework for assembling a portfolio of assets such that the expected return is maximized for a given level of risk. It is a formalization and extension of diversification in investing, the idea that owning different kinds of financial assets is less risky than owning only one type. Its key insight is that an asset's risk and return should not be assessed by itself, but by how it contributes to a portfolio's overall risk and return. It uses the variance of asset prices as a proxy for risk.
In linear algebra, the Gram matrix of a set of vectors in an inner product space is the Hermitian matrix of inner products, whose entries are given by . If the vectors are the columns of matrix then the Gram matrix is in the general case that the vector coordinates are complex numbers, which simplifies to for the case that the vector coordinates are real numbers.
Trip distribution is the second component in the traditional four-step transportation forecasting model. This step matches tripmakers’ origins and destinations to develop a “trip table”, a matrix that displays the number of trips going from each origin to each destination. Historically, this component has been the least developed component of the transportation planning model.
A Hopfield network is a form of recurrent artificial neural network and a type of spin glass system popularised by John Hopfield in 1982 as described earlier by Little in 1974 based on Ernst Ising's work with Wilhelm Lenz on the Ising model. Hopfield networks serve as content-addressable ("associative") memory systems with binary threshold nodes, or with continuous variables. Hopfield networks also provide a model for understanding human memory.
In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position. Applications include identifying the most influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, super-spreaders of disease, and brain networks. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin.
In mathematics, a matrix norm is a vector norm in a vector space whose elements (vectors) are matrices.
Financial contagion refers to "the spread of market disturbances – mostly on the downside – from one country to the other, a process observed through co-movements in exchange rates, stock prices, sovereign spreads, and capital flows". Financial contagion can be a potential risk for countries who are trying to integrate their financial system with international financial markets and institutions. It helps explain an economic crisis extending across neighboring countries, or even regions.
In computer vision and image processing, Otsu's method, named after Nobuyuki Otsu, is used to perform automatic image thresholding. In the simplest form, the algorithm returns a single intensity threshold that separate pixels into two classes, foreground and background. This threshold is determined by minimizing intra-class intensity variance, or equivalently, by maximizing inter-class variance. Otsu's method is a one-dimensional discrete analog of Fisher's Discriminant Analysis, is related to Jenks optimization method, and is equivalent to a globally optimal k-means performed on the intensity histogram. The extension to multi-level thresholding was described in the original paper, and computationally efficient implementations have since been proposed.
In mathematics, the Gershgorin circle theorem may be used to bound the spectrum of a square matrix. It was first published by the Soviet mathematician Semyon Aronovich Gershgorin in 1931. Gershgorin's name has been transliterated in several different ways, including Geršgorin, Gerschgorin, Gershgorin, Hershhorn, and Hirschhorn.
In finance, diversification is the process of allocating capital in a way that reduces the exposure to any one particular asset or risk. A common path towards diversification is to reduce risk or volatility by investing in a variety of assets. If asset prices do not change in perfect synchrony, a diversified portfolio will have less variance than the weighted average variance of its constituent assets, and often less volatility than the least volatile of its constituents.
In mathematics, a square matrix is said to be diagonally dominant if, for every row of the matrix, the magnitude of the diagonal entry in a row is larger than or equal to the sum of the magnitudes of all the other (non-diagonal) entries in that row. More precisely, the matrix A is diagonally dominant if
In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions. The output of the network is a linear combination of radial basis functions of the inputs and neuron parameters. Radial basis function networks have many uses, including function approximation, time series prediction, classification, and system control. They were first formulated in a 1988 paper by Broomhead and Lowe, both researchers at the Royal Signals and Radar Establishment.
In the context of a continuous-time Markov process, the Kolmogorov equations, including Kolmogorov forward equations and Kolmogorov backward equations, are a pair of systems of differential equations that describe the time-evolution of the probability , where and are the final and initial time respectively.
The dependency network approach provides a system level analysis of the activity and topology of directed networks. The approach extracts causal topological relations between the network's nodes, and provides an important step towards inference of causal activity relations between the network nodes. This methodology has originally been introduced for the study of financial data, it has been extended and applied to other systems, such as the immune system, and semantic networks.
Weighted correlation network analysis, also known as weighted gene co-expression network analysis (WGCNA), is a widely used data mining method especially for studying biological networks based on pairwise correlations between variables. While it can be applied to most high-dimensional data sets, it has been most widely used in genomic applications. It allows one to define modules (clusters), intramodular hubs, and network nodes with regard to module membership, to study the relationships between co-expression modules, and to compare the network topology of different networks. WGCNA can be used as a data reduction technique, as a clustering method, as a feature selection method, as a framework for integrating complementary (genomic) data, and as a data exploratory technique. Although WGCNA incorporates traditional data exploratory techniques, its intuitive network language and analysis framework transcend any standard analysis technique. Since it uses network methodology and is well suited for integrating complementary genomic data sets, it can be interpreted as systems biologic or systems genetic data analysis method. By selecting intramodular hubs in consensus modules, WGCNA also gives rise to network based meta analysis techniques.
Global cascades models are a class of models aiming to model large and rare cascades that are triggered by exogenous perturbations which are relatively small compared with the size of the system. The phenomenon occurs ubiquitously in various systems, like information cascades in social systems, stock market crashes in economic systems, and cascading failure in physics infrastructure networks. The models capture some essential properties of such phenomenon.