weight_scheme_cum_temporal | R Documentation |
This weight scheme sums the deleted node adjacent edges when re-wired in the projection graph that *occur before* the temporal edge. See the in line documentation for details.
weight_scheme_cum_temporal(temporally_ordered_projected_graph)
temporally_ordered_projected_graph |
A temporally row-wise ordered table
semi-processed bipartite projection network resulting
from |
Note this function assumes the rows of 'temporally_ordered_projected_graph'
are temporally ordered. This property is only guaranteed by the
temporal_graph_projection
function if 'lag = "all_lag"'. For
'lag=one_lag', use weight_scheme_sum_edges
or
weight_scheme_count_deleted_nodes
.
Refer to this weight scheme unit tests for examples.
M. Joblin, W. Mauerer, S. Apel, J. Siegmund and D. Riehle, "From Developer Networks to Verified Communities: A Fine-Grained Approach," 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering, Florence, 2015, pp. 563-573, doi: 10.1109/ICSE.2015.73.
Other weight_scheme:
weight_scheme_count_deleted_nodes()
,
weight_scheme_pairwise_cum_temporal()
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.