Estimating the clustering coefficient using sample complexity analysis

DOI10.1007/978-3-031-20624-5_20OpenAlexW4312684024MaRDI QIDQ6109016

Alane M. de Lima, Murilo V. G. da Silva, André L. Vignatti

Publication date: 26 July 2023

Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20624-5_20

zbMATH Keywords

samplingapproximation algorithmVC dimensionclustering coefficient

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Community detection in networks via a spectral heuristic based on the clustering coefficient
• Fast approximation of betweenness centrality through sampling
• Degree and clustering coefficient in sparse random intersection graphs
• Percolation centrality via Rademacher Complexity
• Counting Triangles in Massive Graphs with MapReduce
• Neural Network Learning
• Wedge sampling for computing clustering coefficients and triangle counts on large graphs^†
• Local clustering coefficient of spatial preferential attachment model
• Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
• Collective dynamics of ‘small-world’ networks
• Understanding Machine Learning
• Local Clustering Coefficient in Generalized Preferential Attachment Models
• Networks
• Improved bounds on the sample complexity of learning

This page was built for publication: Estimating the clustering coefficient using sample complexity analysis