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

潜在空间网络模型的几何模型选择:通过多维标度和重采样技术进行假设检验

Geometric Model Selection for Latent Space Network Models: Hypothesis Testing via Multidimensional Scaling and Resampling Techniques

University of Kentucky(肯塔基大学)

Jieyun Wang, Anna L. Smith

AI总结:

本文提出了一种通过多维标度和重采样技术进行假设检验的方法,用于选择潜在空间网络模型的几何结构,以提高对大规模和稀疏网络的拟合效果。

摘要:

潜在空间模型假设网络连接更可能发生在底层潜在空间中距离较近的节点之间。欧几里得空间是底层几何的一个流行选择,但双曲几何可以模仿复杂网络中连接模式的更真实表现。为了确定底层几何,过去的研究将非欧几里得扩展的多维标度(MDS)应用于观察到的测地距离:节点之间的最短路径长度。然后通过应力差异(MDS的标准拟合度量)在不同几何体之间的差异来选择具有更优模型拟合(更低应力)的潜在几何。通过在欧几里得和双曲几何中模拟潜在空间网络来评估该方法的有效性。为了更好地考虑不确定性,我们将基于排列的MDS假设检验扩展到潜在网络设置。然而,这些检验不考虑任何网络结构。我们提出了一种网络的参数Bootstrap分布,该分布基于观测到的测地距离和高斯潜在位置模型(GLPM)。我们的方法将Davidson-MacKinnon J检验扩展到具有不同潜在几何的潜在空间网络模型。我们特别关注大规模和稀疏网络,并且排列检验和重采样方法在检测底层几何方面显示出改进。

英文摘要:

Latent space models assume that network ties are more likely between nodes that are closer together in an underlying latent space. Euclidean space is a popular choice for the underlying geometry, but hyperbolic geometry can mimic more realistic patterns of ties in complex networks. To identify the underlying geometry, past research has applied non-Euclidean extensions of multidimensional scaling (MDS) to the observed geodesic distances: the shortest path lengths between nodes. The difference in stress, a standard goodness-of-fit metric for MDS, across the geometries is then used to select a latent geometry with superior model fit (lower stress). The effectiveness of this method is assessed through simulations of latent space networks in Euclidean and hyperbolic geometries. To better account for uncertainty, we extend permutation-based hypothesis tests for MDS to the latent network setting. However, these tests do not incorporate any network structure. We propose a parametric bootstrap distribution of networks, conditioned on observed geodesic distances and the Gaussian Latent Position Model (GLPM). Our method extends the Davidson-MacKinnon J-test to latent space network models with differing latent geometries. We pay particular attention to large and sparse networks, and both the permutation test and the bootstrapping methods show an improvement in detecting the underlying geometry.

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

↑