论文检索

有向网络互惠效应的最优估计与检验AI 解读

The $p_1$ model plays a fundamental role in modeling directed networks, where the reciprocal effect parameter $ρ$ is of special interest in practice. However, due to nonlinear factors in this model, how to estimate $ρ$ efficiently is a long-standing open problem. We tackle the problem by the cycle count approach. The challenge is, due to the nonlinear factors in the model, for any given type of generalized cycles, the expected count is a complicated function of many…

有向网络半参数形成模型的推断AI 解读

We propose a semiparametric model for dyadic link formations in directed networks. The model contains a set of degree parameters that measure different effects of popularity or outgoingness across nodes, a regression parameter vector that reflects the homophily effect resulting from the nodal attributes or pairwise covariates associated with edges, and a set of latent random noises with unknown distributions. Our interest lies in inferring the unknown degree parameters and…

动态网络的双重异质性模型AI 解读

Analysis of networks that evolve dynamically requires the joint modelling of individual snapshots and time dynamics. This paper proposes a new flexible two-way heterogeneity model towards this goal. The new model equips each node of the network with two heterogeneity parameters, one to characterize the propensity to form ties with other nodes statically and the other to differentiate the tendency to retain existing ties over time. With n observed networks each having p…

维度递增随机图模型中的似然比检验AI 解读

We explore the Wilks phenomena in two random graph models: the β-model and the Bradley–Terry model. For two increasing dimensional null hypotheses, including a specified null H0:βi=βi0 for i=1,…,r and a homogenous null H0:β1=⋯=βr, we reveal high dimensional Wilks’ phenomena that the normalized log-likelihood ratio statistic, [2{l(β̂)−l(β̂0)}−r]/(2r)1/2, converges in distribution to the standard normal distribution as r goes to infinity. Here, l(β) is the log-likelihood…

利用最大逐元素偏差检验随机区块模型的拟合优度AI 解读

–The stochastic block model is widely used for detecting community structures in network data. How to test the goodness of fit of the model is one of the fundamental problems and has gained growing interests in recent years. In this article, we propose a novel goodness-of-fit test based on the maximum entry of the centered and rescaled adjacency matrix for the stochastic block model. One noticeable advantage of the proposed test is that the number of communities can be…

含协变量的有向网络模型中的统计推断AI 解读

Ting Yana http://orcid.org/0000-0001-9830-6646, Binyan Jiangb, Stephen E. Fienbergc* & Chenlei Lengd*a Department of Statistics, Central China Normal University, Wuhan, Chinab Department of Applied Mathematics, Hong Kong Polytechnic University, Hong Kong, Chinac Department of Statistics, Heinz College, Machine Learning Department, Cylab, Carnegie Mellon University, Pittsburgh, PAd Department of Statistics, University of Warwick and Alan Turing Institute, Coventry, UKCONTACT…

双度序列维度增长的有向指数随机图模型渐近理论AI 解读

Although asymptotic analyses of undirected network models based on degree sequences have started to appear in recent literature, it remains an open problem to study statistical properties of directed network models. In this paper, we provide for the first time a rigorous analysis of directed exponential random graph models using the in-degrees and out-degrees as sufficient statistics with binary as well as continuous weighted edges. We establish the uniform consistency and…