Comparison of robustness of statistical procedures for network structure analysis

01/30/2018
by   L. P. Semenov, et al.
0

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.

READ FULL TEXT
research
09/15/2022

Clustering Network Vertices in Sparse Contextual Multilayer Networks

We consider the problem of learning the latent community structure in a ...
research
10/29/2022

Monitoring the Dynamic Networks of Stock Returns

In this paper, we study the connection between the companies in the Swed...
research
05/19/2015

An Experimental Comparison of Hybrid Algorithms for Bayesian Network Structure Learning

We present a novel hybrid algorithm for Bayesian network structure learn...
research
10/19/2012

Learning Module Networks

Methods for learning Bayesian network structure can discover dependency ...
research
06/14/2021

Federated Myopic Community Detection with One-shot Communication

In this paper, we study the problem of recovering the community structur...
research
02/26/2018

A graph-theoretic framework for algorithmic design of experiments

In this paper, we demonstrate that considering experiments in a graph-th...
research
02/27/2017

Semi-parametric Network Structure Discovery Models

We propose a network structure discovery model for continuous observatio...

Please sign up or login with your details

Forgot password? Click here to reset