The maximum number of 3- and 4-cliques within a planar maximally filtered graph

DOI10.1016/J.PHYSA.2014.09.011zbMATH Open1395.05123arXiv1507.02929OpenAlexW2032318061MaRDI QIDQ1783249FDOQ1783249

Authors: Jenna Birch, Athanasios A. Pantelous, Konstantin M. Zuev 

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1507.02929

Recommendations

• Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
• On the maximum number of cliques in a graph
• The maximum number of cliques in dense graphs
• Maximizing the number of cliques in graphs with given matching number
• The maximum number of cliques in graphs with prescribed order, circumference and minimum degree
• Note on 3-choosability of planar graphs with maximum degree 4
• Maximal \(K_3\)'s and hamiltonicity of 4-connected claw-free graphs
• The minimum number of 4-cycles in a maximal planar graph with small number of vertices
• Maxima of the \(Q\)-index: graphs with bounded clique number
• scientific article; zbMATH DE number 2090010

zbMATH Keywords

3- and 4-cliquescorrelation based networksEberhard's operationplanar maximally filtered graphsstandard spherical triangulation

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• The Structure and Function of Complex Networks
• Introduction to Econophysics
• Title not available (Why is that?)
• Asset Trees and Asset Graphs in Financial Markets
• Correlation based networks of equity returns sampled at different time horizons
• Diagonal flips in triangulations of surfaces
• High-frequency cross-correlation in a set of stocks
• Title not available (Why is that?)

Cited In (1)

• Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)

This page was built for publication: The maximum number of 3- and 4-cliques within a planar maximally filtered graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1783249)