Edge sampling using local network information

MaRDI QIDQ4999016zbMATH OpenFDO

Authors Can M. Le

Publication date 9 July 2021

Full work available at URL https://arxiv.org/abs/1710.04772, https://jmlr.csail.mit.edu/papers/v22/18-240.html

zbMATH Keywords

network analysisedge samplingclustering coefficientlocal informationnetwork curvature

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Graph sampling
• Sampling from complex networks with high community structures
• scientific article; zbMATH DE number 5524713
• Sampling online social networks by random walk with indirect jumps
• Scalable Uniform Graph Sampling by Local Computation

Cites work

• scientific article; zbMATH DE number 1256718 (Why is no real title available?)
• A survey of statistical network models
• Collective dynamics of `small-world' networks
• Estimating a smooth function on a large graph by Bayesian Laplacian regularisation
• Exact and asymptotic results on coarse Ricci curvature of graphs
• Graph sparsification by effective resistances
• Kernels and regularization on graphs.
• Learning Theory
• Machine Learning: ECML 2004
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Mean-field conditions for percolation on finite graphs
• Minimizing Effective Resistance of a Graph
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• Network cross-validation by edge sampling
• Networks. An introduction.
• Ollivier's Ricci curvature, local clustering and curvature-dimension inequalities on graphs
• Ollivier-Ricci curvature and the spectrum of the normalized graph Laplace operator
• On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
• Percolation on dense graph sequences
• Percolation on finite graphs and isoperimetric inequalities.
• Ricci curvature of Markov chains on metric spaces
• Ricci-flat graphs with girth at least five
• Sampling geometric inhomogeneous random graphs in linear time
• Single pass spectral sparsification in dynamic streams
• Spectral sparsification in the semi-streaming setting
• The phase transition in inhomogeneous random graphs
• The sparse Laplacian shrinkage estimator for high-dimensional regression
• Untangling hairballs. From 3 to 14 degrees of separation
• Upper tails for arithmetic progressions in random subsets

Cited in

(6)

• Estimating network edge probabilities by neighbourhood smoothing
• Generic network sparsification via degree- and subgraph-based edge sampling
• Sampling Multiple Edges Efficiently
• Network Estimation by Mixing: Adaptivity and More
• Generic network sparsification via hybrid edge sampling
• Edge sampling using network local information

This page was built for publication: Edge sampling using local network information

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