6 citations · 7 across the 2 of their papers we have counts for
8 papers
An Effective Bernstein-type Bound on Shannon Entropy over Countably Infinite Alphabets
Yunpeng Zhao
We prove a Bernstein-type bound for the difference between the average of negative log-likelihoods of independent discrete random variables and the Shannon entropy, both defined on…
Identifiability and consistency of network inference using the hub model and variants
Yunpeng Zhao, Peter Bickel, Charles Weko
Statistical network analysis primarily focuses on inferring the parameters of an observed network. In many applications, especially in the social sciences, the observed data is the…
A Note on New Bernstein-type Inequalities for the Log-likelihood Function of Bernoulli Variables
Yunpeng Zhao
We prove a new Bernstein-type inequality for the log-likelihood function of Bernoulli variables. In contrast to classical Bernstein's inequality and Hoeffding's inequality when app…
Logistic Regression Augmented Community Detection for Network Data with Application in Identifying Autism-Related Gene Pathways
Yunpeng Zhao, Qing Pan, Chengan Du
When searching for gene pathways leading to specific disease outcomes, additional information on gene characteristics is often available that may facilitate to differentiate genes…
Penalized Component Hub Models
Charles Weko, Yunpeng Zhao
Social network analysis presupposes that observed social behavior is influenced by an unobserved network. Traditional approaches to inferring the latent network use pairwise descri…
A Survey on Theoretical Advances of Community Detection in Networks
Yunpeng Zhao
Real-world networks usually have community structure, that is, nodes are grouped into densely connected communities. Community detection is one of the most popular and best-studied…