Papers › Reliability of relational event model estimates under sampling: how to fit a...
Reliability of relational event model estimates under sampling: how to fit a relational event model to 360 million dyadic events
Jürgen Lerner, Alessandro Lomi
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We assess the reliability of relational event model parameters estimated under two sampling schemes: (1) uniform sampling from the observed events and (2) case-control sampling which samples non-events, or null dyads ("controls"), from a suitably defined risk set. We experimentally determine the variability of estimated parameters as a function of the number of sampled events and controls per event, respectively. Results suggest that relational event models can be reliably fitted to networks with more than 12 million nodes connected by more than 360 million dyadic events by analyzing a sample of some tens of thousands of events and a small number of controls per event. Using data that we collected on the Wikipedia editing network, we illustrate how network effects commonly included in empirical studies based on relational event models need widely different sample sizes to be estimated reliably. For our analysis we use an open-source software which implements the two sampling schemes, allowing analysts to fit and analyze relational event models to the same or other data that may be collected in different empirical settings, varying sample parameters or model specification.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections