Learn R Programming

timeordered (version 1.0.1)

Time-Ordered and Time-Aggregated Network Analyses

Description

Approaches for incorporating time into network analysis. Methods include: construction of time-ordered networks (temporal graphs); shortest-time and shortest-path-length analyses; resource spread calculations; data resampling and rarefaction for null model construction; reduction to time-aggregated networks with variable window sizes; application of common descriptive statistics to these networks; vector clock latencies; and plotting functionalities. The package supports .

Copy Link

Version

Install

install.packages('timeordered')

Monthly Downloads

310

Version

1.0.1

License

GPL-3

Maintainer

Benjamin Blonder

Last Published

September 15th, 2024

Functions in timeordered (1.0.1)

generatetonetworkfromvel

Generates a time-ordered network from a data frame listing all directed edges. An internal function.
generatetimedeltas

Constructs matrix of sequential time windows suitable for slicing time ordered networks
plottonet

Plots a time-ordered network.
generatetimelags

Constructs matrix of increasingly large time windows suitable for assessing how window size affects time aggregated networks
randomize_edges_helper

Does all the work for edge_randomization and randomized_edges. An internal function.
plotnetworkslices

Plots a time-aggregated network
plottanet

Plots a time-aggregated network.
generatetonetwork

Generates a time-ordered network from an interaction list.
shortesthoppath

Determines a path (shortest by the least number of unique vertices) between two vertices at two times.
ants

Ant interaction data
randomizeidentities

Resamples data based on vertex identity.
shortesttimepath

Determines a path (shortest by the least time) between a vertex at a start time and another vertex at any later time.
randomizetimes

Resamples data based on event time.
applynetworkfunction

Applies a function (typically a descriptive statistic) to multiple time-aggregated networks
spreadanalysis

Simulates the perfect spread of a resource on a time-ordered network.
swap

Swaps two elements in a data frame. An internal function.
randomly_permuted_times

Randomize temporal networks
rarefy

Simulates the effect of insufficient sampling by data rarefaction.
generatevertexedgelist

Generates a data frame listing all directed edges in a time-ordered network from an observed interaction list. An internal function.
maxpoints

Determines the maximum value of each row of a matrix; used as a convenience function for plotting.
midpoints

Determines the mean value of each row of a matrix; used as a convenience function for plotting.
transformspreadbyindividual

A helper function to assess differences in spreading potential by vertex.
generatetimeaggregatednetwork

Constructs a weighted time-aggregated network from a time-ordered network by aggregating interactions occurring between a start and stop time. Weights are stored as E(g)$weight.
generatelatencies

Generates vector-clock latencies for each individual at each time.
generatenetworkslices

Generates multiple time-aggregated networks from a time-ordered network