Testing for Equivalence of Network Distribution Using Subgraph Counts
نویسندگان
چکیده
منابع مشابه
Statistical inference for network samples using subgraph counts
We consider that a network is an observation, and a collection of observed networks forms a sample. In this setting, we provide methods to test whether all observations in a network sample are drawn from a specified model. We achieve this by deriving, under the null of the graphon model, the joint asymptotic properties of average subgraph counts as the number of observed networks increases but ...
متن کاملTesting for Global Network Structure Using Small Subgraph Statistics
We study the problem of testing for community structure in networks using relations between the observed frequencies of small subgraphs. We propose a simple test for the existence of communities based only on the frequencies of three-node subgraphs. The test statistic is shown to be asymptotically normal under a null assumption of no community structure, and to have power approaching one under ...
متن کاملassessment of the efficiency of s.p.g.c refineries using network dea
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
Testing Network Structure Using Relations Between Small Subgraph Probabilities
We study the problem of testing for structure in networks using relations between the observed frequencies of small subgraphs. We consider the statistics T3 = (edge frequency) − triangle frequency T2 = 3(edge frequency)(1− edge frequency)− V-shape frequency and prove a central limit theorem for (T2, T3) under an Erdős-Rényi null model. We then analyze the power of the associated χ test statisti...
متن کاملLocal Structure: Subgraph Counts II
Proof. This theorem is a corollary of the (much more general) Kruskal-Katona theorem. The Kruskal-Katona theorem has a very hands-on proof, based on iteratively modifying the graph. We will see a linear-algebraic proof. Let A be the n×n adjacency matrix of G (Auv = 1 if vertex u is adjacent to vertex v, and Auv = 0 otherwise). Note that A is symmetric. It turns out that e and t are both fundame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2020
ISSN: 1061-8600,1537-2715
DOI: 10.1080/10618600.2020.1736085