count_possible_edges

Across all cascades, count the edges that are possible. An edge from node
<code>u</code> to node <code>v</code>
is only possible if in at least one cascade <code>u</code> experienced an event 
before <code>v</code>.

This is an R implementation of the netinf algorithm (Gomez Rodriguez, Leskovec, and Krause, 2010)<doi:10.1145/1835804.1835933>. Given a set of events that spread between a set of nodes the algorithm infers the most likely stable diffusion network that is underlying the diffusion process.

Fridolin Linder

NetworkInference

Inferring Latent Diffusion Networks

Bruce Desmarais

count_possible_edges function

<dl><dt>cascades</dt>
<dd>Object of class cascade containing the data.</dd></dl>

Arguments

Count the number of possible edges in the dataset — count_possible_edges

<dl>

<dt>cascades</dt>
<dd>Object of class cascade containing the data.</dd>

</dl>

count_possible_edges: Count the number of possible edges in the dataset

Description

Usage

Value

Arguments

Examples