2018
DOI: 10.48550/arxiv.1803.04410
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Co-occurrence simplicial complexes in mathematics: identifying the holes of knowledge

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…Recently there has been growing interest in characterizing networked structures using geometrical and topological tools [1][2][3]. On one side an increasing number of works aim at unveiling the hidden geometry of networks using statistical mechanics [4][5][6][7][8][9][10][11], discrete geometry [12] and machine learning [13,14], on the other side topological data analysis is tailored to capture the structure of a large variety of network data [15][16][17][18][19][20][21].…”
Section: Introductionmentioning
confidence: 99%
“…Recently there has been growing interest in characterizing networked structures using geometrical and topological tools [1][2][3]. On one side an increasing number of works aim at unveiling the hidden geometry of networks using statistical mechanics [4][5][6][7][8][9][10][11], discrete geometry [12] and machine learning [13,14], on the other side topological data analysis is tailored to capture the structure of a large variety of network data [15][16][17][18][19][20][21].…”
Section: Introductionmentioning
confidence: 99%
“…they have the hyperbolicity parameter δ=0, whereas the graphs with cycles can have a finite δ parameter. In recent years, Gromov hyperbolic graphs with a small parameter δ have been the subject of intensive research both for their mathematical properties [21][22][23][24][25] and applications [26][27][28][29][30][31][32][33][34]. A small hyperbolicity parameter is often associated with improved collective dynamics in natural and technological networks.…”
Section: Introductionmentioning
confidence: 99%