Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework (Q2321275): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q128616644, #quickstatements; #temporary_batch_1723800143925
 
(8 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: pcalg / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: causaleffect / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TETRAD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: R / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2790098524 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1803.00116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Inference on Population Indirect Causal Effects: The Generalized Front Door Criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ancestral graph Markov models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Graphical Characterization and Construction of Adjustment Sets in Markov Equivalence Classes of Ancestral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized back-door criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causal diagrams for empirical research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causation, prediction, and search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128616644 / rank
 
Normal rank

Latest revision as of 10:39, 16 August 2024

scientific article
Language Label Description Also known as
English
Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework
scientific article

    Statements

    Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2019
    0 references
    causal inference
    0 references
    covariate adjustment
    0 references
    ancestral graphs
    0 references
    d-separation
    0 references
    m-separation
    0 references
    complexity
    0 references
    Bayesian network
    0 references
    knowledge representation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references