{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-family-of-centrality-measures-for-graph","title":"A Family of Centrality Measures for Graph Data Based on Subgraphs","arxiv_id":null,"date":"2020-05-31","proceeding":"ICDT 2020 5","authors":["Cristian Riveros","Jorge Salas"],"abstract":"We present the theoretical foundations of a new approach in centrality measures for graph data. The\r\nmain principle of our approach is very simple: the more relevant subgraphs around a vertex, the more\r\ncentral it is in the network. We formalize the notion of “relevant subgraphs” by choosing a family of\r\nsubgraphs that, give a graph G and a vertex v in G, it assigns a subset of connected subgraphs of\r\nG that contains v. Any of such families defines a measure of centrality by counting the number of\r\nsubgraphs assigned to the vertex, i.e., a vertex will be more important for the network if it belongs\r\nto more subgraphs in the family. We show many examples of this approach and, in particular, we\r\npropose the all-subgraphs centrality, a centrality measure that takes every subgraph into account.\r\nWe study fundamental properties over families of subgraphs that guarantee desirable properties\r\nover the corresponding centrality measure. Interestingly, all-subgraphs centrality satisfies all these\r\nproperties, showing its robustness as a notion for centrality. Finally, we study the computational\r\ncomplexity of counting certain families of subgraphs and show a polynomial time algorithm to\r\ncompute the all-subgraphs centrality for graphs with bounded tree width.","url_abs":"https://drops.dagstuhl.de/opus/volltexte/2020/11947/pdf/LIPIcs-ICDT-2020-23.pdf","url_pdf":"https://drops.dagstuhl.de/opus/volltexte/2020/11947/pdf/LIPIcs-ICDT-2020-23.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-family-of-centrality-measures-for-graph","repo_url":"https://github.com/zahraDehghanian97/Subgraph_Centrality_Measure","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"all","task_name":"All"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}