Identification of Strong Edges in AMP Chain Graphs
The essential graph is a distinguished member of a Markov equivalence class of AMP chain graphs. However, the directed edges in the essential graph are not necessarily strong or invariant, i.e. they may not be shared by every member of the equivalence class. Likewise for the undirected edges. In this paper, we develop a procedure for identifying which edges in an essential graph are strong. We also show how this makes it possible to bound some causal effects when the true chain graph is unknown.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Higher-Order Label Homogeneity and Spreading in Graphs
Do higher-order network structures aid graph semi-supervised learning? Given a graph and a few labeled vertices, labeling the remaining vertices is a high-impact problem with applications in several tasks, such as recomm…
Fraud DetectionRecommendation SystemsOn the Properties of MVR Chain Graphs
Depending on the interpretation of the type of edges, a chain graph can represent different relations between variables and thereby independence models. Three interpretations, known by the acronyms LWF, MVR, and AMP, are…
Brain Chains as Topological Signatures for Alzheimer's Disease
We propose a topological framework to study the evolution of Alzheimer's disease, the most common neurodegenerative disease. The modeling of this disease starts with the representation of the brain connectivity as a grap…
Marginal AMP Chain Graphs
We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to so…
Selection biasIdentifying Money Laundering Subgraphs on the Blockchain
Anti-Money Laundering (AML) involves the identification of money laundering crimes in financial activities, such as cryptocurrency transactions. Recent studies advanced AML through the lens of graph-based machine learnin…
Benchmarking