2019
DOI: 10.1007/978-3-030-14085-4_12
|View full text |Cite
|
Sign up to set email alerts
|

A New Entropy for Hypergraphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 15 publications
0
6
0
1
Order By: Relevance
“…every genomic locus is highly connected). There are different definitions of hypergraph entropy [8,24,25]. In our analysis, we exploit the eigenvalues of the hypergraph Laplacian matrix and fit them into the Shannon entropy formula [25].…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…every genomic locus is highly connected). There are different definitions of hypergraph entropy [8,24,25]. In our analysis, we exploit the eigenvalues of the hypergraph Laplacian matrix and fit them into the Shannon entropy formula [25].…”
Section: Methodsmentioning
confidence: 99%
“…There are different definitions of hypergraph entropy [8,24,25]. In our analysis, we exploit the eigenvalues of the hypergraph Laplacian matrix and fit them into the Shannon entropy formula [25]. In mathematics, eigenvalues can quantitatively represent different features of a matrix [26].…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Hypergraph entropy has been recently explored by Hu et al [30], Wang et al [31] and Bloch et al [32]. In particular, the authors in [30] employ the probability distribution of the vertex degrees to fit into the Shannon entropy formula and establish its lower and upper bounds for special hypergraphs.…”
Section: Introductionmentioning
confidence: 99%