Comparison of robustness of statistical procedures for network structure analysis
L.P. Semenov, V.A. Kalyagin, P.A. Koldanov, M.V. Batsyn, S.V., Golovanova, M.A. Voronina

TL;DR
This paper compares the robustness of various statistical procedures for network structure analysis, highlighting the superiority of threshold graphs, cliques, and independent sets in terms of robustness.
Contribution
It introduces a comparative analysis of network structures based on robustness of statistical procedures, emphasizing the advantages of specific structures like threshold graphs.
Findings
Threshold graphs are more robust for statistical identification.
Cliques and independent sets in threshold graphs show superior robustness.
Certain network structures outperform others in statistical procedures.
Abstract
Different network structures are compiared with respect to degree of robustnes of identification statistical procedures. It is shown that threshold (market) graph, cliques and independent sets in the threshold (market) graphs are preferable network structure from this point of view.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical and Computational Modeling
