9 citations · 19 across the 14 of their papers we have counts for
7 papers · 1 filter
Community detection in censored hypergraph
Mingao Yuan, Bin Zhao, Xiaofeng Zhao
Community detection refers to the problem of clustering the nodes of a network (either graph or hypergrah) into groups. Various algorithms are available for community detection and…
Information Limits for Detecting a Subhypergraph
Mingao Yuan, Zuofeng Shang
We consider the problem of recovering a subhypergraph based on an observed adjacency tensor corresponding to a uniform hypergraph. The uniform hypergraph is assumed to contain a su…
Online Statistical Inference for Parameters Estimation with Linear-Equality Constraints
Ruiqi Liu, Mingao Yuan, Zuofeng Shang
Stochastic gradient descent (SGD) and projected stochastic gradient descent (PSGD) are scalable algorithms to compute model parameters in unconstrained and constrained optimization…
Heterogeneous Dense Subhypergraph Detection
Mingao Yuan, Zuofeng Shang
We study the problem of testing the existence of a heterogeneous dense subhypergraph. The null hypothesis corresponds to a heterogeneous Erdös-Rényi uniform random hypergraph and t…
A Practical Two-Sample Test for Weighted Random Graphs
Mingao Yuan, Qian Wen
Network (graph) data analysis is a popular research topic in statistics and machine learning. In application, one is frequently confronted with graph two-sample hypothesis testing…
A practical test for a planted community in heterogeneous networks
Mingao Yuan, Qian Wen
One of the fundamental task in graph data mining is to find a planted community(dense subgraph), which has wide application in biology, finance, spam detection and so on. For a rea…
Sharp detection boundaries on testing dense subhypergraph
Mingao Yuan, Zuofeng Shang
We study the problem of testing the existence of a dense subhypergraph. The null hypothesis is an Erdos-Renyi uniform random hypergraph and the alternative hypothesis is a uniform…