Cover Image

The friendship paradox for trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hazra, Rajat Subhra, Hollander, Frank den, Litvak, Nelly, Parvaneh, Azadeh
Format:	Preprint
Published:	2025
Subjects:	Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The friendship paradox for sparse random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2023)

The multi-level friendship paradox for sparse random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Large deviation principle for the norm of the Laplacian matrix of inhomogeneous Erdős-Rényi random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2023)

The voter model on random regular graphs with random rewiring
by: Avena, Luca, et al.
Published: (2025)

Optimal Structure of Signal Networks for Efficient Information Aggregation
by: Heidergott, Bernd, et al.
Published: (2025)

Discordant edges for the voter model on regular random graphs
by: Avena, Luca, et al.
Published: (2022)

Spectral properties of the Laplacian of Scale-Free Percolation models
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Extremal process of the zero-average Gaussian Free Field for $d\ge 3$
by: Das, Sayan, et al.
Published: (2018)

The Generalized Friendship Paradox for Spectral Centralities
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs
by: Dionigi, Pierfrancesco, et al.
Published: (2022)

Parameter estimation in a dynamic Chung-Lu random graph
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Outlier eigenvalues and eigenvectors of generalized Wigner matrices with finite-rank perturbations
by: Bhattacharya, Bishakh, et al.
Published: (2026)

Eigenvalues outside the bulk of inhomogeneous Erdős-Rënyi random graphs
by: Chakrabarty, Arijit, et al.
Published: (2019)

Largest eigenvalue of positive mean Gaussian matrices
by: Chakrabarty, Arijit, et al.
Published: (2024)

Functional Central Limit Theorem for the simultaneous subgraph count of dynamic Erdős-Rényi random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Voter model on heterogeneous directed networks
by: Avena, Luca, et al.
Published: (2025)

Meeting, coalescence and consensus time on random directed graphs
by: Avena, Luca, et al.
Published: (2023)

Inhomogeneous random graphs with infinite-mean fitness variables
by: Avena, Luca, et al.
Published: (2022)

The spectrum of dense kernel-based random graphs
by: Cipriani, Alessandra, et al.
Published: (2025)

Universality of the local limit of preferential attachment models
by: Garavaglia, Alessandro, et al.
Published: (2022)

Functional Central Limit Theorem for the principal eigenvalue of dynamic Erdős-Rényi random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2024)

Spectra of random graphs with discrete scale invariance
by: Catanzaro, Alessio, et al.
Published: (2025)

Functional central limit theorem for subgraph counts in a dynamic random connection model
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Computing Stationary Distribution via Dirichlet-Energy Minimization by Coordinate Descent
by: Avrachenkov, Konstantin, et al.
Published: (2026)

Linking PageRank, Time Reversal, and Policy Evaluation
by: Avrachenkov, Konstantin, et al.
Published: (2026)

Detecting hyperbolic geometry in networks: why triangles are not enough
by: Michielan, Riccardo, et al.
Published: (2022)

Degrees in Preferential Attachment Networks with an Anomaly
by: Liang, Qiu, et al.
Published: (2025)

Self-Reinforced Preferential Attachment
by: Dahiya, Yogesh, et al.
Published: (2025)

Planted clique recovery in random geometric graphs
by: Avrachenkov, Konstantin, et al.
Published: (2025)

Infection models on dense dynamic random graphs
by: Baldassarri, Simone, et al.
Published: (2026)

Mixing of fast random walks on dynamic random permutations
by: Avena, Luca, et al.
Published: (2024)

Evolution of Discordance
by: Hollander, F. den
Published: (2024)

The Triangle Friendship Paradox
by: Bhattacharya, Bishakh, et al.
Published: (2025)

On the principal eigenvectors of random Markov matrices
by: Calvert, Jacob, et al.
Published: (2025)

The Moran model with random resampling rates
by: Athreya, Siva, et al.
Published: (2024)

Sparse random graphs with many triangles
by: Chakraborty, Suman, et al.
Published: (2021)

Self-repellent branching random walk
by: Bovier, Anton, et al.
Published: (2024)

Power-law hypothesis for PageRank on undirected graphs
by: Henning, Florian, et al.
Published: (2024)

Markov additive friendships
by: Döring, Leif, et al.
Published: (2023)

Learning the mechanisms of network growth
by: Touwen, Lourens, et al.
Published: (2024)