图的序列局部性及其假设检验
Sequential locality of graphs and its hypothesis testing
AI总结:
本文提出一种假设检验框架,用于评估图顶点沿指定序列的局部连接程度,为包络缩减或最小线性排列优化问题提供统计基础,该方法基于组合方法和内在顶点排序的块模型,特别适用于中小型数据。
摘要:
邻接矩阵是图分析中最基本且直观的对象,不仅在数学上有用,还可用于可视化图的结构。由于邻接矩阵的外观受行和列的顺序(即顶点排序)的严重影响,因此对图及其顶点序列进行统计评估对于识别图的特征结构很重要。在本文中,我们提出了一种假设检验框架,用于评估顶点沿着指定顶点序列在局部上相互连接的程度,这为称为包络缩减或最小线性排列的优化问题提供了统计基础。所提出的检验特别适合中小型数据,并基于组合方法和具有内在顶点排序的块模型进行公式化。
英文摘要:
The adjacency matrix is the most fundamental and intuitive object in graph analysis that is useful not only mathematically but also for visualizing the structures of graphs. Because the appearance of an adjacency matrix is critically affected by the ordering of rows and columns, or vertex ordering, statistical assessment of graphs together with their vertex sequences is important in identifying the characteristic structures of graphs. In this paper, we propose a hypothesis testing framework that assesses how locally vertices are connected to each other along a specified vertex sequence, which provides a statistical foundation for an optimization problem called envelope reduction or minimum linear arrangement. The proposed tests are particularly suitable for moderately small data and formulated based on a combinatorial approach and a block model with intrinsic vertex ordering.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。