THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS
From MaRDI portal
Vertex degrees (05C07) Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Social networks; opinion dynamics (91D30)
Recommendations
Cites work
- A critical point for random graphs with a given degree sequence
- Directed random graphs with given degree distributions
- Random walk centrality in interconnected multilayer networks
- The asymptotic number of labeled graphs with given degree sequences
- The friendship paradox
- The multistep friendship paradox
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Cited in
(10)- Friendship destroys orderability via clustering pseudogaps
- The multistep friendship paradox
- The degree-wise effect of a second step for a random walk on a graph
- Centrality-friendship paradoxes: when our friends are more important than us
- The friendship paradox in real and model networks
- A PROBABILISTIC FRIENDSHIP NETWORK MODEL
- Distributional aspects of some statistics in weighted social networks
- Weighted averages and the friendship paradox
- Asymptotic distribution of the friendship paradox of a random geometric graph
- Disparity-persistence and the multistep friendship paradox
This page was built for publication: THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056607)