A biclique-centric exponential random graph model for common-knowledge networks

Abstract Common knowledge (CK) is a social phenomenon where individuals in a group share the same information and each knows that the others share it as well, recursively. This mutual awareness enables coordinated action and gives rise to contagion dynamics that differ from standard models such as threshold and susceptible-infectious-recovered processes. In Facebook networks, bicliques are key graph substructures for generating CK because all nodes in a biclique can share information through their walls. Motivated by the need to systematically study biclique structure and CK-based contagion, we develop a biclique-centric exponential random graph model (BC-ERGM). By incorporating a qualitative biclique term, the model is designed to generate new networks with biclique-related features similar to those of an original network, providing a framework for studying CK-based contagion on the generated networks. We also introduce a structural reduction approach to make model estimation more computationally feasible for large networks. We evaluate the framework using Erdős–Rényi (ER) graphs across multiple network sizes and average-degree settings and a stochastic block model (SBM) with pronounced community structure. In the ER experiments, BC-ERGM generally reproduces the structural properties and CK-based contagion dynamics of the original networks, while structural reduction lowers computational cost. In the SBM experiment, the edge-only, edge-plus-biclique, and edge-plus-2-star models reproduce network density similarly, but BC-ERGM more closely reproduces the biclique count, biclique-size distribution, and node-participation distribution.

Authors

Institutions

Publication Details

Journal
Social Network Analysis and Mining
Published
2026-11-13
DOI
https://doi.org/10.1007/s13278-026-01658-5
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A biclique-centric exponential random graph model for common-knowledge networks

Xinwei Deng, Chris J. Kuhlman, Zhihao Hu, Xueying Liu
Social Network Analysis and Mining
Complex Network Analysis Techniques
article

A biclique-centric exponential random graph model for common-knowledge networks

Xinwei Deng, Chris J. Kuhlman, Zhihao Hu, Xueying Liu
article en

Abstract

Abstract Common knowledge (CK) is a social phenomenon where individuals in a group share the same information and each knows that the others share it as well, recursively. This mutual awareness enables coordinated action and gives rise to contagion dynamics that differ from standard models such as threshold and susceptible-infectious-recovered processes. In Facebook networks, bicliques are key graph substructures for generating CK because all nodes in a biclique can share information through their walls. Motivated by the need to systematically study biclique structure and CK-based contagion, we develop a biclique-centric exponential random graph model (BC-ERGM). By incorporating a qualitative biclique term, the model is designed to generate new networks with biclique-related features similar to those of an original network, providing a framework for studying CK-based contagion on the generated networks. We also introduce a structural reduction approach to make model estimation more computationally feasible for large networks. We evaluate the framework using Erdős–Rényi (ER) graphs across multiple network sizes and average-degree settings and a stochastic block model (SBM) with pronounced community structure. In the ER experiments, BC-ERGM generally reproduces the structural properties and CK-based contagion dynamics of the original networks, while structural reduction lowers computational cost. In the SBM experiment, the edge-only, edge-plus-biclique, and edge-plus-2-star models reproduce network density similarly, but BC-ERGM more closely reproduces the biclique count, biclique-size distribution, and node-participation distribution.

Social Network Analysis and Mining
Baylor University (US), Virginia Tech (US)
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon