超越二元边的图子估计:带装饰图的推断及其在多重和加权网络中的应用
Graphon estimation beyond binary edges: inference for decorated graphs with applications to multiplex and weighted networks
AI总结:
提出用于带装饰图子的双重非参数估计方法,将经典图子估计技术扩展到丰富设置,推导收敛速度,经实验验证理论速度在有限样本中可实现,能同时扩展基于图子的推断到多重网络和属性图。
摘要:
我们引入了第一种用于带装饰图子的双重非参数估计方法,带装饰图子是图子的一种推广,它对大型网络中的边权重、边类型和其他边级属性进行编码。图子通过一个对称可测函数描述大型无标签网络的极限行为,该函数控制边形成的概率,但标准框架仅限于二元边信息。带装饰图子消除了这一限制,但此前尚无针对它们的推断程序。所提出的估计器将经典图子估计技术扩展到了这个丰富的设置中。我们推导了收敛速度,并表明,对于紧支集装饰,这些速度与估计实值函数的已知非参数速度一致。蒙特卡罗实验证实,理论速度在有限样本中得以实现,并且对合成网络和实证网络的应用表明,相对于二元边基线,拟合度有所提高。该方法同时将基于图子的推断扩展到多重网络和属性图。
英文摘要:
We introduce the first doubly non-parametric estimation method for decorated graphons, a generalisation of graphons that encodes edge weights, edge types, and other edge-level attributes in large networks. Graphons describe the limiting behaviour of large unlabelled networks through a symmetric measurable function governing the probability of edge formation, but the standard framework is restricted to binary edge information. Decorated graphons lift this restriction, yet no inference procedure has previously been available for them. The proposed estimator extends classical graphon estimation techniques to this enriched setting. We derive rates of convergence and show that, for compactly supported decorations, these rates agree with known non-parametric rates for estimating real-valued functions. Monte Carlo experiments confirm that the theoretical rates are attained in finite samples, and applications to synthetic and empirical networks show improved fit relative to binary-edge baselines. The method extends graphon-based inference to multiplex networks and attributed graphs simultaneously.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。