算法
块(置换群论)
光学(聚焦)
随机块体模型
鉴定(生物学)
计算机科学
数学
协方差
协方差矩阵
系统标识
估计理论
分拆(数论)
简单(哲学)
随机过程
统计模型
数学优化
过程(计算)
马尔可夫过程
基质(化学分析)
参数辨识问题
应用数学
噪音(视频)
马尔可夫链
随机矩阵
理论计算机科学
随机建模
期望最大化算法
人工智能
作者
Michael T. Schaub,Santiago Segarra,John N. Tsitsiklis
摘要
We consider a blind identification problem in which we aim to recover a statistical model of a network without knowledge of the network's edges but based solely on nodal observations of a certain process. More concretely, we focus on observations that consist of single snapshots taken from multiple trajectories of a diffusive process that evolves over the unknown network. We model the network as generated from an independent draw from a latent stochastic block model (SBM), and our goal is to infer both the partition of the nodes into blocks and the parameters of this SBM. We discuss some nonidentifiability issues related to this problem and present simple spectral algorithms that provably solve the partition recovery and parameter estimation problems with high accuracy. Our analysis relies on recent results in random matrix theory and covariance estimation and on associated concentration inequalities. We illustrate our results with several numerical experiments.
科研通智能强力驱动
Strongly Powered by AbleSci AI