Modeling, Analysis and Validation of Friendship Paradox in Evolving Networks
文献类型:期刊论文
作者 | Xu, Jiasheng4; Fu, Luoyi3; Xu, Zhiying4; Ding, Jiaxin3; Zhou, Lei2; Wang, Xinbing4; Zhou, Chenghu1 |
刊名 | CHINA COMMUNICATIONS
![]() |
出版日期 | 2025 |
卷号 | 22期号:1页码:216-234 |
关键词 | evolving networks friendship paradox random walk social networks |
ISSN号 | 1673-5447 |
DOI | 10.23919/JCC.fa.2023-0599.202501 |
通讯作者 | Fu, Luoyi(yiluofu@sjtu.edu.cn) |
英文摘要 | Friendship paradox states that individuals are likely to have fewer friends than their friends do, on average. Despite of its wide existence and appealing applications in real social networks, the mathematical understanding of friendship paradox is very limited. Only few works provide theoretical evidence of single-step and multi-step friendship paradoxes, given that the neighbors of interest are one- hop and multi-hop away from the target node. However, they consider non-evolving networks, as opposed to the topology of real social networks that are constantly growing over time. We are thus motivated to present a first look into friendship paradox in evolving networks, where newly added nodes preferentially attach themselves to those with higher degrees. Our analytical verification of both single-step and multistep friendship paradoxes in evolving networks, along with comparison to the non-evolving counterparts, discloses that " friendship paradox is even more paradoxical in evolving networks", primarily from three aspects: 1) we demonstrate a strengthened effect of single-step friendship paradox in evolving networks, with a larger probability (more than 0.8) of a random node's neighbors having higher average degree than the random node itself; 2) we unravel higher effectiveness of multi-step friendship paradox in seeking for influential nodes in evolving networks, as the rate of reaching the max degree node can be improved by a factor of at least Theta e(t(2/3)) with t being the network size; 3) we empirically verify our findings through both synthetic and real datasets, which suggest high agreements of results and consolidate the reasonability of evolving model for real social networks. |
资助项目 | NSF China, Shanghai Pilot Program for Basic Research - Shanghai Jiao Tong University[61960206002] ; NSF China, Shanghai Pilot Program for Basic Research - Shanghai Jiao Tong University[62020106005] ; NSF China, Shanghai Pilot Program for Basic Research - Shanghai Jiao Tong University[42050105] ; NSF China, Shanghai Pilot Program for Basic Research - Shanghai Jiao Tong University[62061146002] |
WOS研究方向 | Telecommunications |
语种 | 英语 |
WOS记录号 | WOS:001399203100008 |
出版者 | CHINA INST COMMUNICATIONS |
资助机构 | NSF China, Shanghai Pilot Program for Basic Research - Shanghai Jiao Tong University |
源URL | [http://ir.igsnrr.ac.cn/handle/311030/212761] ![]() |
专题 | 中国科学院地理科学与资源研究所 |
通讯作者 | Fu, Luoyi |
作者单位 | 1.Chinese Acad Sci, Inst Geog Sci & Nat Resources Res, Beijing 100101, Peoples R China 2.Shanghai Jiao Tong Univ, Sch Oceanog, Shanghai 200240, Peoples R China 3.Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China 4.Shanghai Jiao Tong Univ, Dept Elect Engn, Shanghai 200240, Peoples R China |
推荐引用方式 GB/T 7714 | Xu, Jiasheng,Fu, Luoyi,Xu, Zhiying,et al. Modeling, Analysis and Validation of Friendship Paradox in Evolving Networks[J]. CHINA COMMUNICATIONS,2025,22(1):216-234. |
APA | Xu, Jiasheng.,Fu, Luoyi.,Xu, Zhiying.,Ding, Jiaxin.,Zhou, Lei.,...&Zhou, Chenghu.(2025).Modeling, Analysis and Validation of Friendship Paradox in Evolving Networks.CHINA COMMUNICATIONS,22(1),216-234. |
MLA | Xu, Jiasheng,et al."Modeling, Analysis and Validation of Friendship Paradox in Evolving Networks".CHINA COMMUNICATIONS 22.1(2025):216-234. |
入库方式: OAI收割
来源:地理科学与资源研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。