arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.07066math.STmath.PRstat.TH
收藏

高维二元图模型的依赖图密度推断

Inferring the dependence graph density of binary graphical models in high dimension

Julien Chevallier, Eva Löcherbach, Guilherme Ost

AI总结:

针对由二元交互链构成的系统,提出基于T时间单位观测推断其底层有向Erdös-Rényi随机图连接参数p的方法,证明该参数可通过易计算估计器以特定速率估计,还通过反向再生表示实现系统完美采样。

摘要:

我们考虑一个由N个组件组成的二元交互链系统,描述其动态:每个时间单位内,组件要么向其他组件发送信号,要么保持沉默。链之间的交互由参数未知的有向Erdös-Rényi随机图编码,参数p∈(0,1)。此外,系统分为两个群体(兴奋性链与抑制性链),它们通过底层Erdös-Rényi图上的平均场相互作用耦合。本文研究仅基于T个时间单位内交互链的观测来推断连接参数p的问题。在主要结果中,我们证明连接参数p可通过易于计算的估计器以N^(-1/2)+N^(1/2)/T+(log(T)/T)^(1/2)的速率估计。我们的分析依赖于对交互链相关性的时空衰减的精确研究,这通过研究定义系统反向再生表示的聚合随机游走来实现。有趣的是,我们还证明这种反向再生表示允许我们从平稳分布中完美采样(基于底层Erdös-Rényi图的每个实现的条件下)交互链系统。这些概率结果本身具有研究价值。

英文摘要:

We consider a system of binary interacting chains describing the dynamics of a group of $N$ components that, at each time unit, either send some signal to the others or remain silent otherwise. The interactions among the chains are encoded by a directed Erdös-Rényi random graph with unknown parameter $ p \in (0, 1) .$ Moreover, the system is structured within two populations (excitatory chains versus inhibitory ones) which are coupled via a mean field interaction on the underlying Erdös-Rényi graph. In this paper, we address the question of inferring the connectivity parameter $p$ based only on the observation of the interacting chains over $T$ time units. In our main result, we show that the connectivity parameter $p$ can be estimated with rate $N^{-1/2}+N^{1/2}/T+(\log(T)/T)^{1/2}$ through an easy-to-compute estimator. Our analysis relies on a precise study of the spatio-temporal decay of correlations of the interacting chains. This is done through the study of coalescing random walks defining a backward regeneration representation of the system. Interestingly, we also show that this backward regeneration representation allows us to perfectly sample the system of interacting chains (conditionally on each realization of the underlying Erdös-Rényi graph) from its stationary distribution. These probabilistic results have an interest in its own.

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

↑