A fair-cost analysis of the random neighbor sampling method

DOI10.1007/978-3-030-93409-5_1OpenAlexW4206617864MaRDI QIDQ2086576FDOQ2086576

Authors: Yitzchak Novick, Amotz Bar-Noy 

Publication date: 25 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93409-5_1

Recommendations

• Sampling online social networks by random walk with indirect jumps
• Uniform sampling of directed and undirected graphs conditional on vertex connectivity
• Sampling from complex networks with high community structures
• Scalable Uniform Graph Sampling by Local Computation
• On the Complexity of Sampling Vertices Uniformly from a Graph

zbMATH Keywords

fair cost comparisonhigh-degree vertex samplingrandom neighbor sampling

Mathematics Subject Classification ID

Neural networks for/in biological studies, artificial life and related topics (92B20) Statistical sampling theory and related topics (62D99) Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02)

Cites Work

• The Bass diffusion model on finite Barabasi-Albert networks
• Emergence of Scaling in Random Networks
• Title not available (Why is that?)
• A Dynamic Programming Approach to Sequencing Problems
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension

This page was built for publication: A fair-cost analysis of the random neighbor sampling method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2086576)