arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.03395stat.ME
收藏

最小生成树链的Bootstrap验证

Bootstrap validation of links of a minimum spanning tree

Federico Musciotto, Luca Marotta, Salvatore Miccichè, Rosario N. Mantegna

摘要:

我们描述了两种不同的引导方法应用到检测的最小生成树从一组多元变量。我们发现,两种不同的引导程序提供了部分不同的信息,可以是高度翔实的调查复杂的系统。我们的案例研究,在美国股票市场交易的股票投资组合的每日收益率的调查的基础上,显示的程度的鲁棒性和完整性的信息提取流行的信息过滤方法,如最小生成树和平面最大过滤图。第一种方法执行“行引导”,而第二种方法执行“对引导”。我们表明,这两种方法的并行使用,特别是对于复杂的系统,提出了一个嵌套的层次结构的组织与全球反馈通道的存在。

英文摘要:

We describe two different bootstrap methods applied to the detection of a minimum spanning tree obtained from a set of multivariate variables. We show that two different bootstrap procedures provide partly distinct information that can be highly informative about the investigated complex system. Our case study, based on the investigation of daily returns of a portfolio of stocks traded in the US equity markets, shows the degree of robustness and completeness of the information extracted with popular information filtering methods such as the minimum spanning tree and the planar maximally filtered graph. The first method performs a "row bootstrap" whereas the second method performs a "pair bootstrap". We show that the parallel use of the two methods is suggested especially for complex systems presenting both a nested hierarchical organization together with the presence of global feedback channels.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑