maxnedges

Computes the number of edges a graph with <code>p</code> nodes will have if its
fully connected.

Various tools for inferring causal models from observational data. The package
includes an implementation of the temporal Peter-Clark (TPC) algorithm. Petersen, Osler
and Ekstrøm (2021) <doi:10.1093/aje/kwab087>. It also includes general tools
for evaluating differences in adjacency matrices, which can be used for evaluating
performance of causal discovery procedures.

Bjarke Hautop Kristensen

causalDisco

Tools for Causal Discovery on Observational Data

Anne Helby Petersen

Tobias Ellegaard Larsen

Claus Thorn Ekstrøm

maxnedges function

<dl><dt>p</dt>
<dd>The number of nodes in the graph</dd></dl>

Arguments

Compute maximal number of edges for graph — maxnedges

<dl>

<dt>p</dt>
<dd>The number of nodes in the graph</dd>

</dl>

maxnedges: Compute maximal number of edges for graph

Description

Usage

Value

Arguments