paper-with-me

Papers

Sparse Popularity Adjusted Stochastic Block Model

2019-10-03 · Majid Noroozi, Marianna Pensky, Ramchandra Rimal

In the present paper we study a sparse stochastic network enabled with a block structure. The popular Stochastic Block Model (SBM) and the Degree Corrected Block Model (DCBM) address sparsity by placing an upper bound on the maximum probability of connections between any pair of nodes. As a result, sparsity describes only the behavior of network as a whole, without distinguishing between the block-dependent sparsity patterns. To the best of our knowledge, the recently introduced Popularity Adjusted Block Model (PABM) is the only block model that allows to introduce a {\it structural sparsity} where some probabilities of connections are identically equal to zero while the rest of them remain above a certain threshold. The latter presents a more nuanced view of the network.

📄 PDF Abstract BibTeX arXiv:1910.01931

Code (0)

등록된 구현이 없습니다.

Tasks

modelStochastic Block Model

Similar Papers 제목 키워드 기반

Popularity Adjusted Block Models are Generalized Random Dot Product Graphs

2021-09-09 · John Koo, Minh Tang, Michael W. Trosset

We connect two random graph models, the Popularity Adjusted Block Model (PABM) and the Generalized Random Dot Product Graph (GRDPG), by demonstrating that the PABM is a special case of the GRDPG in which communities corr…

ClusteringCommunity Detectionparameter estimation

The Hierarchy of Block Models

2020-02-07 · Majid Noroozi, Marianna Pensky

There exist various types of network block models such as the Stochastic Block Model (SBM), the Degree Corrected Block Model (DCBM), and the Popularity Adjusted Block Model (PABM). While this leads to a variety of choice…

ClusteringStochastic Block Model

Hypothesis Testing for Equality of Latent Positions in Random Graphs

2021-05-23 · Xinjie Du, Minh Tang

We consider the hypothesis testing problem that two vertices $i$ and $j$ of a generalized random dot product graph have the same latent positions, possibly up to scaling. Special cases of this hypothesis test include tes…

Model SelectionStochastic Block Model

Optimal Graph Clustering without Edge Density Signals

2025-10-24 · Maximilien Dreveton, Elaine Siyu Liu, Matthias Grossglauser, Patrick Thiran arxiv

This paper establishes the theoretical limits of graph clustering under the Popularity-Adjusted Block Model (PABM), addressing limitations of existing models. In contrast to the Stochastic Block Model (SBM), which assume…

Graph Clustering

Strongly Consistent Community Detection in Popularity Adjusted Block Models

2025-06-08 · Quan Yuan, Binghui Liu, Danning Li, Lingzhou Xue

The Popularity Adjusted Block Model (PABM) provides a flexible framework for community detection in network data by allowing heterogeneous node popularity across communities. However, this flexibility increases model com…

ClusteringCommunity Detection