rarefy

Randomly removes a fixed fraction of the event list.

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 <doi:10.1371/journal.pone.0020298>.

Benjamin Blonder

timeordered

Time-Ordered and Time-Aggregated Network Analyses

rarefy function

<dl> <dt>raw</dt>
<dd>The event list to be rarefied.</dd> <dt>fraction</dt>
<dd>A fraction (between 0 and 1) of the events to be randomly deleted.</dd></dl>

Arguments

Benjamin Blonder <a href="/link/bblonder%40email.arizona.edu?package=timeordered&version=1.0.1" data-mini-rdoc="timeordered::bblonder@email.arizona.edu">bblonder@email.arizona.edu</a>.

Author

Simulates the effect of insufficient sampling by data rarefaction. — rarefy

<dl>

 <dt>raw</dt>
<dd>The event list to be rarefied.</dd>

 <dt>fraction</dt>
<dd>A fraction (between 0 and 1) of the events to be randomly deleted.</dd>

</dl>

Benjamin Blonder <a href='mailto:bblonder@email.arizona.edu'>bblonder@email.arizona.edu</a>.

rarefy: Simulates the effect of insufficient sampling by data rarefaction.

Description

Usage

Value

Arguments

Author

See Also

Examples