Nonparametric inference for balance in signed networks
符号网络平衡性的非参数推断AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确研究正负边网络、节点可交换性、稀疏 graphon 及网络平衡结构。
符号网络平衡性的非参数推断AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Abstract In many real-world networks, relationships often go beyond simple dyadic presence or absence; they can be positive, such as friendship, alliance and mutualism, or negative, characterized by enmity, disputes and competition. To understand the mechanisms of formation of such signed networks, social balance theory sheds light on the dynamics of positive and negative connections. In particular, it characterizes the proverbs ‘a friend of my friend is my friend’ and ‘an enemy of my enemy is my friend’. In this work, we propose a nonparametric inference approach to assessing empirical evidence for balance theory in real-world signed networks. We first characterize the generating process of signed networks with node exchangeability and propose a nonparametric sparse signed graphon model. Under this model, we construct confidence intervals for the population parameters associated with balance theory and establish their theoretical validity. Our inference procedure is as computationally efficient as a simple normal approximation, but yields higher-order accuracy. By applying our method, we find strong real-world evidence for balance theory in signed networks across various domains, extending its applicability beyond social psychology.