Juan-Juan Wang

Juan-Juan Wang


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 June 2022 in Entropy
Verified
Journal Article
Open access
PDF file
QNQi Nie
Qi Nie
HJHao Jiang
Hao Jiang
SZSidong Zhong
Sidong Zhong
QWQiang Wang
Qiang Wang
JWJuan-Juan Wang
Juan-Juan Wang
LWLi-Hua Wu
Li-Hua Wu
Community detection and structural hole spanner (the node bridging different communities) identification, revealing the mesoscopic and microscopic structural properties of complex networks, have drawn much attention in recent years. As the determinant of mesoscopic structure, communities and structural hole spanners discover the clustering and hierarchy of networks, which has a key impact on transmission phenomena such as epidemic transmission, information diffusion, etc. However, most existing studies address the two tasks independently, which ignores the structural correlation between mesoscale and microscale and suffers from high computational costs. In this article, we propose an algorithm for simultaneously detecting communities and structural hole spanners via hyperbolic embedding (SDHE). Specifically, we first embed networks into a hyperbolic plane, in which, the angular distribution of the nodes reveals community structures of the embedded network. Then, we analyze the critical gap to detect communities and the angular region where structural hole spanners may exist. Finally, we identify structural hole spanners via two-step connectivity. Experimental results on synthetic networks and real networks demonstrate the effectiveness of our proposed algorithm compared with several state-of-the-art methods.

15 March 2022
Verified
Book Chapter
Closed access
PDF file
DKDeyi Kong
Deyi Kong
ZYZehua You
Zehua You
Qimei ChenQimei Chen
Qimei Chen
JWJuan-Juan Wang
Juan-Juan Wang
JHJiwei Hu
Jiwei Hu
JWJing Wu
Jing Wu

9 November 2025 in arXiv
Verified
Preprint
Open access
PDF file
HLHao Li
Hao Li
HCHaotian Chen
Haotian Chen
RGRuoyuan Gong
Ruoyuan Gong
JWJuan-Juan Wang
Juan-Juan Wang
HJHao Jiang
Hao Jiang
Redistricting plays a central role in shaping how votes are translated into political power. While existing computational methods primarily aim to generate large ensembles of legally valid districting plans, they often neglect the strategic dynamics involved in the selection process. This oversight creates opportunities for partisan actors to cherry-pick maps that, while technically compliant, are politically advantageous. Simply satisfying formal constraints does not ensure fairness when the selection process itself can be manipulated. We propose \textbf{Agentmandering}, a framework that reimagines redistricting as a turn-based negotiation between two agents representing opposing political interests. Drawing inspiration from game-theoretic ideas, particularly the \textit{Choose-and-Freeze} protocol, our method embeds strategic interaction into the redistricting process via large language model (LLM) agents. Agents alternate between selecting and freezing districts from a small set of candidate maps, gradually partitioning the state through constrained and interpretable choices. Evaluation on post-2020 U.S. Census data across all states shows that Agentmandering significantly reduces partisan bias and unfairness, while achieving 2 to 3 orders of magnitude lower variance than standard baselines. These results demonstrate both fairness and stability, especially in swing-state scenarios. Our code is available at https://github.com/Lihaogx/AgentMandering.