由不相关随机序列和多重分形二项测度映射的水平能见度图的解析度分布
Analytic degree distributions of horizontal visibility graphs mapped from unrelated random series and multifractal binomial measures
摘要:
复杂网络不仅是分析复杂系统的有力工具,而且是分析时间序列的一种很有前途的方法。水平可见图算法将时间序列映射成图,并对特定时间序列的度分布进行了数值和解析研究。我们通过一个迭代构造HVG的过程,得到了HVG的度分布。得到了随机序列的HVG和有向HVG的度分布均为指数分布,证实了其他方法的分析结果。我们还得到了由多重分形二项测度转化的HVG的度分布和有向HVG的入度和出度分布的解析表达式,与数值模拟结果吻合得很好.
英文摘要:
Complex network is not only a powerful tool for the analysis of complex system, but also a promising way to analyze time series. The algorithm of horizontal visibility graph (HVG) maps time series into graphs, whose degree distributions are numerically and analytically investigated for certain time series. We derive the degree distributions of HVGs through an iterative construction process of HVGs. The degree distributions of the HVG and the directed HVG for random series are derived to be exponential, which confirms the analytical results from other methods. We also obtained the analytical expressions of degree distributions of HVGs and in-degree and out-degree distributions of directed HVGs transformed from multifractal binomial measures, which agree excellently with numerical simulations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。