scholarly journals Combinatorics and Algorithms for Quasi-chain Graphs

2021 ◽  
pp. 49-62
Author(s):  
Bogdan Alecu ◽  
Aistis Atminas ◽  
Vadim Lozin ◽  
Dmitriy Malyshev
Keyword(s):  
Chain Graphs

scholarly journals An Order-Independent Algorithm for Learning Chain Graphs

2021 ◽  
Vol 34 (1) ◽  
Author(s):  
Mohammad Ali Javidian ◽  
Marco Valtorta ◽  
Pooyan Jamshidi
Keyword(s):  
Directed Acyclic Graphs ◽  
High Dimensional ◽  
P Values ◽  
Order Dependence ◽  
Error Measures ◽  
Acyclic Graphs ◽  
Simulation Results ◽  
Improved Performance ◽  
Low Dimensional ◽  
Chain Graphs

LWF chain graphs combine directed acyclic graphs and undirected graphs. We propose a PC-like algorithm, called PC4LWF, that finds the structure of chain graphs under the faithfulness assumption to resolve the problem of scalability of the proposed algorithm by Studeny (1997). We prove that PC4LWF is order dependent, in the sense that the output can depend on the order in which the variables are given. This order dependence can be very pronounced in high-dimensional settings. We propose two modifications of the PC4LWF algorithm that remove part or all of this order dependence. Simulation results with different sample sizes, network sizes, and p-values demonstrate the competitive performance of the PC4LWF algorithms in comparison with the LCD algorithm proposed by Ma et al. (2008) in low-dimensional settings and improved performance (with regard to error measures) in high-dimensional settings.

Eigenvalue-free intervals of distance matrices of threshold and chain graphs

2019 ◽  
pp. 1-17
Author(s):  
Abdullah Alazemi ◽  
Milica Anđelić ◽  
Tamara Koledin ◽  
Zoran Stanić
Keyword(s):  
Distance Matrices ◽  
Chain Graphs

On energy and Laplacian energy of chain graphs

2020 ◽  
Vol 284 ◽  
pp. 391-400 ◽  
Author(s):  
Kinkar Chandra Das ◽  
Abdullah Alazemi ◽  
Milica Anđelić
Keyword(s):  
Laplacian Energy ◽  
Chain Graphs

scholarly journals Local Structure Recovery of Chain Graphs after Marginalization

2015 ◽  
Vol 2015 ◽  
pp. 1-5
Author(s):  
Qiang Zhao ◽  
Panpan Luo ◽  
Qing Xi
Keyword(s):  
Local Structure ◽  
Latent Variables ◽  
Chain Graphs

This paper discusses local structure recovery of chain graphs (CGs) when there exist unobserved or latent variables or after marginalization over observed variables. Under a condition presented in this paper, it is explained which edges and directions of edges in local structure can be recovered validly and which cannot after marginalization.

scholarly journals Faithfulness in chain graphs: The discrete case

2009 ◽  
Vol 50 (8) ◽  
pp. 1306-1313 ◽  
Author(s):  
Jose M. Peña
Keyword(s):  
Discrete Case ◽  
Chain Graphs
Sign in / Sign up

Export Citation Format

Share Document