基于熵测度的二分网络极端同步性推断
Inference of Extreme Synchrony with an Entropy Measure on a Bipartite Network
摘要:
本文提出了一种使用每条链路的网络熵来量化二分图的结构的方法。本文从理论上和数值上计算了具有随机连接的二部图的网络熵。作为所提出的方法分析集体行为的应用,参与者在外汇市场上报价和交易的事件被量化。每个链接的网络熵被发现对应于宏观经济形势。一个有限的混合Gumbel分布被用来拟合经验分布的最小值的网络熵每个链接在每个星期。用Kolmogorov-Smirnov检验验证了Gumbel分布与分段参数估计的混合。Gumbel分布的有限混合外推极端事件的经验概率具有统计显著性水平的解释力。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。