Inference of Extreme Synchrony with an Entropy Measure on a Bipartite Network
This article proposes a method to quantify the structure of a bipartite graph using a network entropy per link. The network entropy of a bipartite graph with random links is calculated both numerically and theoretically. As an application of the proposed method to analyze collective behavior, the affairs in which participants quote and trade in the foreign exchange market are quantified. The network entropy per link is found to correspond to the macroeconomic situation. A finite mixture of Gumbel distributions is used to fit the empirical distribution for the minimum values of network entropy per link in each week. The mixture of Gumbel distributions with parameter estimates by segmentation procedure is verified by the Kolmogorov--Smirnov test. The finite mixture of Gumbel distributions that extrapolate the empirical probability of extreme events has explanatory power at a statistically significant level.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Milaković, Mishael & Alfarano, Simone & Lux, Thomas, 2008.
"The small core of the German corporate board network,"
Kiel Working Papers
1446, Kiel Institute for the World Economy (IfW).
- Simone Alfarano & Thomas Lux & Mishael Milakovic, 2008. "The Small Core of the German Corporate Board Network," Kiel Working Papers 1446, .
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1207.4860. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators)
If references are entirely missing, you can add them using this form.