论文检索

高阶图极限函数理论：波动、退化与推断AI 解读

Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a natural way to sample exchangeable random graphs. It is well known that network moments (motif/subgraph counts) identify a graphon (up to an isomorphism); hence, understanding the sampling distribution of subgraph counts in random graphs…

基于最优匹配的分布无关多样本检验及单细胞基因组学应用AI 解读

In this article, we propose a nonparametric graphical test based on optimal matching, for assessing the equality of multiple unknown multivariate probability distributions. Our procedure pools the data from the different classes to create a graph based on the minimum non-bipartite matching, and then utilizes the number of edges connecting data points from different classes to examine the closeness between the distributions. The proposed test is exactly distribution-free (the…

通过子图抽样估计网络模体：四阶矩现象AI 解读

Network sampling is an indispensable tool for understanding features of large complex networks where it is practically impossible to search over the entire graph. In this paper, we develop a framework for statistical inference for counting network motifs, such as edges, triangles and wedges, in the widely used subgraph sampling model, where each vertex is sampled independently, and the subgraph induced by the sampled vertices is observed. We derive necessary and sufficient…

基于几何图的两样本检验：渐近分布与检测阈值AI 解读

In this paper, we consider the problem of testing the equality of two multivariate distributions based on geometric graphs constructed using the interpoint distances between the observations. These include the tests based on the minimum spanning tree and the $K$-nearest neighbor (NN) graphs, among others. These tests are asymptotically distribution-free, universally consistent and computationally efficient, making them particularly useful in modern applications. However,…

通过百分位自助法对逆概率加权估计进行敏感性分析AI 解读

Summary To identify the estimand in missing data problems and observational studies, it is common to base the statistical estimation on the ‘missingness at random’ and ‘no unmeasured confounder’ assumptions. However, these assumptions are unverifiable by using empirical data and pose serious threats to the validity of the qualitative conclusions of statistical inference. A sensitivity analysis asks how the conclusions may change if the unverifiable assumptions are violated…

分布无关的图型两样本检验：统一渐近框架AI 解读

Summary Testing equality of two multivariate distributions is a classical problem for which many non-parametric tests have been proposed over the years. Most of the popular two-sample tests, which are asymptotically distribution free, are based either on geometric graphs constructed by using interpoint distances between the observations (multivariate generalizations of the Wald–Wolfowitz runs test) or on multivariate data depth (generalizations of the Mann–Whitney rank…