The Maximum Number of 3- and 4-Cliques within a Planar Maximally Filtered Graph
arXiv:1507.02929 · doi:10.1016/j.physa.2014.09.011
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.
arXiv comment12 pages, 11 figures
References in corpus (11)
- The structure and function of complex networks
- Hierarchical Structure in Financial Markets
- A tool for filtering information in complex systems
- Networks of equities in financial markets
- A Model for Social Networks
- Correlation based networks of equity returns sampled at different time horizons
- Dynamic asset trees and portfolio analysis
- Asset trees and asset graphs in financial markets
- Hierarchical information clustering by means of topologically embedded graphs
- Adaptive financial networks with static and dynamic thresholds
- A History of Flips in Combinatorial Triangulations