Percolation centrality via Rademacher Complexity
type: Item
instance of: scholarly article
title: Percolation centrality via Rademacher Complexity
zbMATH Open document ID: 1502.05088
author: Alane M. de Lima
author: Murilo V. G. da Silva
author: André L. Vignatti
published in: Discrete Applied Mathematics
publication date: 2022-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7610742
zbMATH Keywords: percolation centrality
zbMATH Keywords: approximation algorithm
zbMATH Keywords: pseudo-dimension
zbMATH Keywords: Rademacher averages
describes a project that uses: SNAP
describes a project that uses: NLopt
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: j.dam.2021.07.023
OpenAlex ID: W3187759259
cites work: Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
cites work: Q4875229
cites work: Emergence of Scaling in Random Networks
cites work: Theory of Classification: a Survey of Some Recent Advances
cites work: A faster algorithm for betweenness centrality*
cites work: Q3266051
cites work: Relative \((p,\varepsilon )\)-approximations in geometry
cites work: Shape Fitting on Point Sets with Probability Distributions
cites work: Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
cites work: Foundations of machine learning
cites work: An improved analysis of the Rademacher data-dependent bound using its self bounding property
cites work: Fast approximation of betweenness centrality through sampling
cites work: On the all-pairs-shortest-path problem in unweighted undirected graphs.
cites work: Understanding Machine Learning
cites work: Faster all-pairs shortest paths via circuit complexity
DOI: 10.1016/J.DAM.2021.07.023
description: scientific article; zbMATH DE number 7610742