Timezone: »
We analyze the information-theoretic limits for the recovery of node labels in several network models. This includes the Stochastic Block Model, the Exponential Random Graph Model, the Latent Space Model, the Directed Preferential Attachment Model, and the Directed Small-world Model. For the Stochastic Block Model, the non-recoverability condition depends on the probabilities of having edges inside a community, and between different communities. For the Latent Space Model, the non-recoverability condition depends on the dimension of the latent space, and how far and spread are the communities in the latent space. For the Directed Preferential Attachment Model and the Directed Small-world Model, the non-recoverability condition depends on the ratio between homophily and neighborhood size. We also consider dynamic versions of the Stochastic Block Model and the Latent Space Model.
Author Information
Chuyang Ke (Purdue University)
Jean Honorio (Purdue University)
More from the Same Authors
-
2021 Spotlight: Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem »
Adarsh Barik · Jean Honorio -
2021 Poster: Inverse Reinforcement Learning in a Continuous State Space with Formal Guarantees »
Gregory Dexter · Kevin Bello · Jean Honorio -
2021 Poster: Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem »
Adarsh Barik · Jean Honorio -
2020 Poster: Fairness constraints can help exact inference in structured prediction »
Kevin Bello · Jean Honorio -
2019 Poster: Learning Bayesian Networks with Low Rank Conditional Probability Tables »
Adarsh Barik · Jean Honorio -
2019 Poster: On the Correctness and Sample Complexity of Inverse Reinforcement Learning »
Abi Komanduru · Jean Honorio -
2019 Poster: Exact inference in structured prediction »
Kevin Bello · Jean Honorio -
2018 Poster: Learning latent variable structured prediction models with Gaussian perturbations »
Kevin Bello · Jean Honorio -
2018 Poster: Computationally and statistically efficient learning of causal Bayes nets using path queries »
Kevin Bello · Jean Honorio -
2017 Poster: Learning Identifiable Gaussian Bayesian Networks in Polynomial Time and Sample Complexity »
Asish Ghoshal · Jean Honorio