2020
DOI: 10.1016/j.amc.2020.125331
|View full text |Cite
|
Sign up to set email alerts
|

Centrality measures in simplicial complexes: Applications of topological data analysis to network science

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0
2

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
3
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(9 citation statements)
references
References 25 publications
0
7
0
2
Order By: Relevance
“…We follow a procedure to encode the resulting k-uniform hypergraph as an “hyper-adjacency matrix.” Among the multiple alternatives [33], the one used in this work inherits the lower adjacency matrix representation of simplicial complexes into uniform hypergraphs, which was also recently adapted to develop vector centralities on hypergraphs [41]. Put simply, two hyperedges of dimension k are connected if they share an hyperedge of dimension k – 1 [33, 34, 42]. For example, two triangles are connected if they have an edge in common.…”
Section: Methodsmentioning
confidence: 99%
“…We follow a procedure to encode the resulting k-uniform hypergraph as an “hyper-adjacency matrix.” Among the multiple alternatives [33], the one used in this work inherits the lower adjacency matrix representation of simplicial complexes into uniform hypergraphs, which was also recently adapted to develop vector centralities on hypergraphs [41]. Put simply, two hyperedges of dimension k are connected if they share an hyperedge of dimension k – 1 [33, 34, 42]. For example, two triangles are connected if they have an edge in common.…”
Section: Methodsmentioning
confidence: 99%
“…However, it is already possible to use these metrics to differentiate groups [26,64], and plausible to assume that the interpretation of some classical metrics could be extrapolated to higher orders interactions. For example, the concept of the centralities using pair-wise interactions is used to understand node importance and hubs, the same, in theory, could be applied to the relationships between 3 or more vertices by extending the definition of centrality from networks to simplicial complexes, as done in [88,89].…”
Section: Discussionmentioning
confidence: 99%
“…Hypergraphs have attracted considerable interest from the research community as a generalization of networks due to their capability of encoding higher-order interactions between more than two agents [25][26][27][28]. The recently introduced s-SIS model [39] was introduced as a complex contagion model in simplicial complexes and hypergraphs and has attracted extensive interest due to its simplicity, analytic tractability, and novel critical phenomena [40][41][42].…”
Section: Modelmentioning
confidence: 99%
“…A hypergraph is a generalization of network that can describe higher-order interactions between more than two agents, which widely appear in both natural and social systems, that networks cannot [25][26][27][28]. A hypergraph consists of nodes and hyperedges, and a hyperedge of size d connects d nodes simultaneously.…”
Section: Introductionmentioning
confidence: 99%