No article text was recorded for this version.
friendship paradox sampling
Version 1 of 166 papers122 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Random walks on the Apollonian network with a single trap
- Blog: Trapping in scale-free networks with hierarchical organization of modularity
- Blog: Optimal scale-free network with a minimum scaling of transport efficiency for random walks with a perfect trap
- Blog: Exact solution for mean first-passage time on a pseudofractal scale-free web
- Blog: Random walks in modular scale-free networks with multiple traps
- Blog: Maximal entropy random walk improves efficiency of trapping in dendrimers
- Blog: Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
- Blog: Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees
- Blog: Path finding strategies in scale-free networks
- Blog: Finding (Short) Paths in Social Networks
- Blog: Determining mean first-passage time on a class of treelike regular fractals
- Blog: Distributed Creation and Adaptation of Random Scale-Free Overlay Networks
- Blog: An Immunization Strategy for Hidden Populations
- Blog: Multiple Random Walks to Uncover Short Paths in Power Law Networks
- Blog: Efficient detection of contagious outbreaks in massive metropolitan encounter networks
- Blog: Performance of Social Network Sensors during Hurricane Sandy
- Blog: End to end influence maximization for HIV prevention
- Blog: The Power of Local Information in Social Networks
- Blog: LLM-WikiRace Benchmark: How Far Can LLMs Plan over Real-World Knowledge Graphs?
- Blog: Mean first-passage time for random walks in general graphs with a deep trap
- Blog: Human wayfinding in information networks
- Blog: Strategic Latency Reduction in Blockchain Peer-to-Peer Networks
- Blog: CFM: A Fitness-Model-Based Topology Control Algorithm for Wireless Sensor Networks
- Blog: Counterexample: scale-free networked graphs with invariable diameter and density feature
- Blog: Fog computing based cost optimization for university governance
- Blog: Mean first-passage time for random walks on undirected networks
- Blog: Impact of degree heterogeneity on the behavior of trapping in Koch networks
- Blog: The Social Amplifier—Reaction of Human Communities to Emergencies
- Blog: Towards Scalable Network Delay Minimization
- Blog: Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications
- Blog: Spanning Tree or Gossip for Aggregation: A Comparative Study
- Blog: Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence
- Blog: Collaborative Spam Filtering Using E-Mail Networks
- Blog: Network Analysis of Academic Medical Center Websites in the United States
- Blog: Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
- Blog: Local Neighbourhoods for First-Passage Percolation on the Configuration Model
- Blog: Decentralized Search in Networks Using Homophily and Degree Disparity
- Blog: Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
- Blog: Spectra of weighted scale-free networks
- Blog: Exact calculations of first-passage properties on the pseudofractal scale-free web
- Blog: Improving the betweenness centrality of a node by adding links
- Blog: Expansion and Search in Networks
- Blog: Mean first-passage time for random walks on the T-graph
- Blog: Non-Backtracking Centrality Based Random Walk on Networks
- Blog: Scalable Betweenness Centrality Maximization via Sampling
- Blog: Socially aware D2D cooperative communications for enhancing Internet of Things application
- Blog: Incentive-Compatible Diffusion
- Blog: Beyond Vector Spaces: Compact Data Representation as Differentiable Weighted Graphs
- Blog: The effect of network topologies on fully decentralized learning: a preliminary investigation
- Blog: Coarse-Grained Topology Estimation via Graph Sampling
- Blog: The Space Complexity of Personalized PageRank and Shortest Path Labeling Schemes.
- Blog: Random walks on weighted networks
- Blog: Structural properties and average tapping time on scale-free graphs with smallest diameter
- Blog: Discovering Options That Minimize Average Planning Time
- Blog: Scalable Percolation Search in Power Law Networks
- Blog: Quick Detection of High-degree Entities in Large Directed Networks
- Blog: Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices
- Blog: Information Gathering in Networks via Active Exploration
- Blog: Extended corona product as an exactly tractable model for weighted heterogeneous networks
- Blog: Effects of reciprocity on random walks in weighted networks
Showing 60 of 66 papers.
History & citation
Current · Permanent link
- Scaling Laws for Random Walk Navigation Efficiency merged into this direction (55% overlap)
- Hub-Centric Trapping in Hierarchical Scale-Free Networks merged into this direction (83% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_friendship_paradox_sampling_e3be965e,
title = {friendship paradox sampling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/friendship-paradox-sampling/rdr_e3be965edd5142ae9b5b4caa733af05c},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_friendship_paradox_sampling_e3be965e_v1,
title = {friendship paradox sampling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/friendship-paradox-sampling/rdr_e3be965edd5142ae9b5b4caa733af05c/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}