Name
Abstract | ||
|---|---|---|
Planar Maximally Filtered Graphs (PMFG) are an important tool for filtering the most relevant information from correlation based networks such as stock market networks. One of the main characteristics of a PMFG is the number of its 3- and 4-cliques. Recently in a few high impact papers it was stated that, based on heuristic evidence, the maximum number of 3- and 4-cliques that can exist in a PMFG with n vertices is 3n−8 and n−4 respectively. In this paper, we prove that this is indeed the case. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.physa.2014.09.011 | Physica A: Statistical Mechanics and its Applications |
Keywords | Field | DocType |
Planar Maximally Filtered Graphs,Correlation based Networks,3- and 4-cliques,Eberhard’s operation,Standard spherical triangulation | Discrete mathematics,Graph,Combinatorics,Heuristic,Vertex (geometry),Filter (signal processing),Planar,Stock market,Mathematics | Journal |
Volume | ISSN | Citations |
417 | 0378-4371 | 1 |
PageRank | References | Authors |
0.36 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| jenna birch | 1 | 1 | 0.36 |
| Athanasios A. Pantelous | 2 | 39 | 17.25 |
| Konstantin Zuev | 3 | 13 | 2.09 |