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 条

[21] The Multistep Friendship Paradox [J].

Kramer, Josh Brown ;

Cutler, Jonathan ;

Radcliffe, A. J. .

AMERICAN MATHEMATICAL MONTHLY, 2016, 123 (09) :900-908

[22] The "Majority Illusion" in Social Networks [J].

Lerman, Kristina ;

Yan, Xiaoran ;

Wu, Xin-Zeng .

PLOS ONE, 2016, 11 (02)

[23]

Lovasz Laszlo, 1993, Combinatorics, Paul erdos is eighty, V2, P4

[24] The Spread of Sleep Loss Influences Drug Use in Adolescent Social Networks [J].

Mednick, Sara C. ;

Christakis, Nicholas A. ;

Fowler, James H. .

PLOS ONE, 2010, 5 (03)

[25] A CRITICAL-POINT FOR RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE [J].

MOLLOY, M ;

REED, B .

RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (2-3) :161-179

[26] The size of the giant component of a random graph with a given degree sequence [J].

Molloy, M ;

Reed, B .

COMBINATORICS PROBABILITY & COMPUTING, 1998, 7 (03) :295-305

[27] Measuring the Generalized Friendship Paradox in Networks with Quality-Dependent Connectivity [J].

Momeni, Naghmeh ;

Rabbat, Michael G. .

COMPLEX NETWORKS VI, 2015, 597 :45-55

[28] Qualities and Inequalities in Online Social Networks through the Lens of the Generalized Friendship Paradox [J].

Momeni, Naghmeh ;

Rabbat, Michael .

PLOS ONE, 2016, 11 (02)

[29]

Newman M, 2004, PHYS REV E, V69, P1, DOI DOI 10.1103/PhysRevE.69.026113

[30] Node centrality in weighted networks: Generalizing degree and shortest paths [J].

Opsahl, Tore ;

Agneessens, Filip ;

Skvoretz, John .

SOCIAL NETWORKS, 2010, 32 (03) :245-251

← 1 2 3 4 →