THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS

被引：4

作者：

Berenhaut, Kenneth S. ^{[1
]}

Jiang, Hongyi ^{[1
]}

机构：

[1] Wake Forest Univ, Dept Math & Stat, 1834 Wake Forest Rd, Winston Salem, NC 27109 USA

来源：

PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES | 2019年 / 33卷 / 01期

关键词：

configuration model; detailed balance; directed networks; friendship paradox; random walks; weighted networks; CENTRALITY; GRAPHS;

D O I：

10.1017/S0269964818000050

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper studies the friendship paradox for weighted and directed networks, from a probabilistic perspective. We consolidate and extend recent results of Cao and Ross and Kramer, Cutler and Radcliffe, to weighted networks. Friendship paradox results for directed networks are given; connections to detailed balance are considered.

引用

页码：136 / 145

页数：10

共 38 条

[1]

Aldous D., 1995, Unfinished Monograph

[2]

[Anonymous], 2003, CONDMAT0312028 ARXIV

[3]

[Anonymous], ABS13043480 CORR

[4]

[Anonymous], 1994, SOCIAL NETWORK ANAL

[5] The architecture of complex weighted networks [J].

Barrat, A ;

Barthélemy, M ;

Pastor-Satorras, R ;

Vespignani, A .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2004, 101 (11) :3747-3752

[6] Characterization and modeling of weighted networks [J].

Barthélemy, M ;

Barrat, A ;

Pastor-Satorras, R ;

Vespignani, A .

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2005, 346 (1-2) :34-43

[7] ASYMPTOTIC NUMBER OF LABELED GRAPHS WITH GIVEN DEGREE SEQUENCES [J].

BENDER, EA ;

CANFIELD, ER .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1978, 24 (03) :296-307

[8]

Cao Y., 2016, Mathematical Scientist, V41, P61

[9]

Chen N., 2013, STOCHASTIC SYSTEMS, V3, P147, DOI DOI 10.1214/12-SSY076

[10] Efficient immunization strategies for computer networks and populations [J].

Cohen, R ;

Havlin, S ;

ben-Avraham, D .

PHYSICAL REVIEW LETTERS, 2003, 91 (24)

← 1 2 3 4 →