Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-27T14:49:05.123Z Has data issue: false hasContentIssue false

All that glitters is not gold: Relational events models with spurious events

Published online by Cambridge University Press:  16 September 2022

Cornelius Fritz*
Affiliation:
Department of Statistics, LMU Munich, Munich, Germany
Marius Mehrl
Affiliation:
Geschwister Scholl Institute of Political Science, LMU Munich, Munich, Germany
Paul W. Thurner
Affiliation:
Geschwister Scholl Institute of Political Science, LMU Munich, Munich, Germany
Göran Kauermann
Affiliation:
Department of Statistics, LMU Munich, Munich, Germany
*
*Corresponding author. E-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

As relational event models are an increasingly popular model for studying relational structures, the reliability of large-scale event data collection becomes more and more important. Automated or human-coded events often suffer from non-negligible false-discovery rates in event identification. And most sensor data are primarily based on actors’ spatial proximity for predefined time windows; hence, the observed events could relate either to a social relationship or random co-location. Both examples imply spurious events that may bias estimates and inference. We propose the Relational Event Model for Spurious Events (REMSE), an extension to existing approaches for interaction data. The model provides a flexible solution for modeling data while controlling for spurious events. Estimation of our model is carried out in an empirical Bayesian approach via data augmentation. Based on a simulation study, we investigate the properties of the estimation procedure. To demonstrate its usefulness in two distinct applications, we employ this model to combat events from the Syrian civil war and student co-location data. Results from the simulation and the applications identify the REMSE as a suitable approach to modeling relational event data in the presence of spurious events.

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives licence (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted re-use, distribution and reproduction in any medium, provided that no alterations are made and the original article is properly cited. The written permission of Cambridge University Press must be obtained prior to any commercial use and/or adaptation of the article.
Copyright
© The Author(s), 2022. Published by Cambridge University Press

1. Introduction

In recent years, event data have become ubiquitous in the social sciences. For instance, interpersonal structures are examined using face-to-face interactions (Elmer & Stadtfeld, Reference Elmer and Stadtfeld2020). At the same time, political event data are employed to study and predict the occurrence and intensity of armed conflict (Fjelde & Hultman, Reference Fjelde and Hultman2014; Blair & Sambanis, Reference Blair and Sambanis2020; Dorff et al., Reference Dorff, Gallop and Minhas2020). Butts (Reference Butts2008a) introduced the Relational Event Model (REM) to study such relational event data. In comparison to standard network data of durable relations observed at specific time points, relational events describe instantaneous actions or, put differently, interactions at a fine-grained temporal resolution (Borgatti et al., Reference Borgatti, Mehra, Brass and Labianca2009).

However, in some contexts there arise problems regarding the reliability of event data. While data gathered from, for example, direct observations (Tranmer et al., Reference Tranmer, Marcum, Morton, Croft and de Kort2015) or parliamentary records (Malang et al., Reference Malang, Brandenberger and Leifeld2019) should prove unproblematic in this regard, other data collection methods may be prone to spurious events, that is events that are recorded but did not actually occur as such. For instance, data collection on face-to-face interactions relies on different types of sociometric badges (Eagle & Pentland, Reference Eagle and Pentland2006) for which a recent study reports a false-discovery rate of the event identification of around 20 $\%$ when compared to video-coded data (Elmer et al., Reference Elmer, Chaitanya, Purwar and Stadtfeld2019). Political event data on armed conflict, in contrast, are generally collected via automated or human coding of news and social media reporting (Kauffmann, Reference Kauffmann and Deschaux-Dutard2020). Spurious events may arise in this context if reports of fighting are wrong, as may be the case for propaganda reasons or due to reporters’ reliance on rumors, or when fighting took place between different belligerents than those named. Such issues are especially prevalent in machine-coded conflict data where both false-positive and false-discovery rates of over 60 $\%$ have been reported (King & Lowe, Reference King and Lowe2003; Jäger, Reference Jäger2018). However, even human-coded data suffer from this problem (Dawkins, Reference Dawkins2020; Weidmann, Reference Weidmann2015).

This discussion suggests that specific types of event data can include unknown quantities of spurious events, which may influence the substantive results obtained from models such as the REM (Butts, Reference Butts2008a) or the Dynamic Actor-Oriented Model (Stadtfeld et al., Reference Stadtfeld, Hollway and Block2017; Stadtfeld, Reference Stadtfeld2012). We thus propose a Relational Events Model with Spurious Events (REMSE) as a method that allows researchers to study relational events from potentially error-prone contexts or data collections methods. Moreover, this tool can assess whether spurious events are observed under a particular model specification and, more importantly, whether they influence the substantive results. The REMSE can thus serve as a straightforward robustness check in situations where the researcher, due to their substantive knowledge, suspects that there are spurious observations and wants to investigate whether they distort their empirical results.

We take a counting process point of view where some increments of the dyadic counting processes are true events, while others may be attributed to spurious events, that is, exist due to measurement error. This decomposition results in two different intensities governing the two respective types of events. The spurious events are described by a spurious-event intensity that we specify independently of the true-event intensity of true events. We present the model under the assumption that the spurious events are purely random. Therefore, we can model the respective intensity solely as a constant term. However, more complex scenarios involving the specification of exogenous and endogenous covariates for the spurious-event intensity are also possible. In general, we are however primarily interested in studying what factors drive the intensity of true events. We model this intensity following Butts (Reference Butts2008a), but the methodology is extendable to other model types such as Stadtfeld et al. (Reference Stadtfeld, Hollway and Block2017); Vu et al. (Reference Vu, Pattison and Robins2015); DuBois et al. (Reference DuBois, Butts, McFarland and Smyth2013); Perry & Wolfe (Reference Perry and Wolfe2013) or Lerner et al. (Reference Lerner, Lomi, Mowbray, Rollings and Tranmer2021).

This article is structured as follows: We begin in Section 2 by introducing our methodology. In particular, we lay out the general framework to study relational event data proposed by Butts (Reference Butts2008a) in Section 2.1 and introduce an extension to this framework, the REMSE, to correct for the presence of spurious events in the remainder of Section 2. Through a simulation study in Section 3, we investigate the performance of our proposed estimator when spurious events are correctly specified and when they are nonexistent. We then apply the proposed model in Section 4 to analyze fighting incidents in the Syrian civil war as well as social interaction data from a college campus. A discussion of possible implications and extensions for the analysis of events concludes the article in Section 5.

2. A Relational Event Model with Spurious Events

2.1 Modeling framework for relational events

We denote observed events in an event stream $\mathcal{E} = \left \{e_1, \ldots, e_M \right \}$ of $M$ elements. Each object $e \in \mathcal{E}$ consists of a tuple encoding the information of an event. In particular, we denote the two actors of an event by $a(e)$ and $b(e)$ and the time of the event with $t(e)$ . For simplicity of notation, we omit the argument $e$ for $a()$ and $b()$ when no ambiguity exists and write $a_m$ for $a(e_m)$ , $b_m$ for $b(e_m)$ , and $t_m$ for $t(e_m) \;\forall \; m \in \{1, \ldots, M\}$ . Stemming from our application cases, we mainly focus on undirected events in this article; hence, the events $e = (a,b,t)$ and $\tilde{e} = (b,a,t)$ are equivalent in our framework. Note however that the proposed method also generalizes to the directed case. We denote the set of actor-tuples between which events can possibly occur by $\mathcal{R}$ , where, for simplicity, we assume that $\mathcal{R}$ is time-constant.

Following Perry & Wolfe (Reference Perry and Wolfe2013) and Vu et al. (Reference Vu, Asuncion, Hunter and Smyth2011a), we assume that the events in $\mathcal{E}$ are generated by an inhomogeneous matrix-valued counting process

(1) \begin{align} \textbf{N}(t) = (N_{ab}(t)| (a,b) \in \mathcal{R}), \end{align}

which, in our case, is assumed to be a matrix-valued Poisson process (see Daley & Vere-Jones Reference Daley and Vere-Jones2008 for an introduction to stochastic processes). Without loss of generality, we assume that $\textbf{N}(t)$ is observed during the temporal interval $\mathcal{T}$ , starting at $t = 0$ . The cells of (1) count how often all possible dyadic events have occurred between time $0$ and $t$ ; hence, $\textbf{N}(t)$ can be conceived as a standard social network adjacency matrix with integer-valued cell entries (Butts, Reference Butts2008b). For instance, $N_{ab}(t)$ indicates how often actors $a$ and $b$ have interacted in the time interval $[0,t]$ . Therefore, observing event $e = (a,b,t)$ constitutes an increase in $N_{ab}(t)$ at time point $t$ , that is $N_{ab}(t - h) + 1 =N_{ab}(t)$ for $h \rightarrow 0$ . We denote with $\boldsymbol{\lambda } (t)$ the matrix-valued intensity of process $\mathbf{N}(t)$ . Based on this intensity function, we can characterize the instantaneous probability of a unit increase in a specific dimension of $\textbf{N}(t)$ at time point $t$ (Daley & Vere-Jones, Reference Daley and Vere-Jones2008). We parameterize $\boldsymbol{\lambda } (t)$ conditional on the history of the processes, $\mathcal{H}(t)$ , which may also include additional exogenous covariates. Hence, $\mathcal{H}(t) = (\textbf{N}(u),X(u)| u \lt t )$ , where $X(t)$ is some covariate process to be specified later. Note that we opt for a rather general characterization of Poisson processes, including stochastic intensities that explicitly depend on previous events. We define the intensity function at the tie-level:

(2) \begin{align} \lambda _{ab}(t| \mathcal{H}(t), \vartheta ) = \begin{cases} \lambda _0(t, \alpha ) \exp \{\theta ^\top s_{ab}(\mathcal{H}(t))\}, & \text{if } (a,b) \in \mathcal{R} \\[5pt] 0, & \text{else} \end{cases} \end{align}

where $\vartheta = (\alpha ^\top, \theta ^\top )^\top = \text{vec}(\alpha,\theta )$ is defined with the help of a dyadic operator $\text{vec}(\cdot, \cdot )$ that stacks two vectors and $\lambda _0(t,\alpha )$ is the baseline intensity characterized by coefficients $\alpha$ , while the parameters $\theta$ weight the statistics computed by $s_{ab}(\mathcal{H}(t))$ , which is the function of sufficient statistics. Based on $s_{ab}(\mathcal{H}(t))$ , we can formulate endogenous effects, which are calculated from $(N(u)| u \lt t)$ , exogenous variables calculated from $(X(u) | u\lt t)$ , or a combination of the two which results in complex dependencies between the observed events. Examples of endogenous effects for undirected events include degree-related statistics like the absolute difference of the degrees of actors $a$ and $b$ or hyperdyadic effects, for example, investigating how triadic closure influences the observed events. In our first application case, exogenous factors include a dummy variable whether group $a$ and $b$ share an ethno-religious identity. Alternatively, one may incorporate continuous covariates, for example, the absolute geographic distance between group $a$ and $b$ .

We give graphical representations of possible endogenous effects in Figure 1 and provide their mathematical formulations together with a general summary in Appendix A. When comparing the structures in the first row with the ones in the second row in Figure 1, the respective sufficient statistic of the event indicated by the dotted line differs by one unit. Its intensity thus changes by the multiplicative factor $\exp \{\theta _{endo}\}$ , where $\theta _{endo}$ is the respective parameter of the statistic if all other covariates are fixed. The interpretation of the coefficients is, therefore, closely related to the interpretation of relative risk models (Kalbfleisch & Prentice, Reference Kalbfleisch and Prentice2002).

Figure 1. Graphical illustrations of endogenous and exogenous covariates. Solid lines represent past interactions, while dotted lines are possible but unrealized events. Node coloring indicates the node’s value on a categorical covariate. The relative risk of the events in the second row compared to the events in the first row is $\exp \{\theta _{end}\}$ if all other covariates are fixed, where $\theta _{end}$ is the coefficient of the respective statistic of each row.

Previous studies propose multiple options to model the baseline intensity $\lambda _0(t)$ . Vu et al. (Reference Vu, Asuncion, Hunter and Smyth2011a, Reference Vu, Asuncion, Hunter and Smyth2011b) follow a semiparametric approach akin to the proportional hazard model by Cox (Reference Cox1972), while Butts (Reference Butts2008a) assumes a constant baseline intensity. We follow Etezadi-Amoli & Ciampi (Reference Etezadi-Amoli and Ciampi1987) by setting $\lambda _0(t, \alpha ) = \exp \{f(t, \alpha )\}$ , with $f(t, \alpha )$ being a smooth function in time parameterized by B-splines (de Boor, Reference de Boor2001):

(3) \begin{align} f(t, \alpha ) = \sum _{k=1}^K \alpha _k B_{k}(t) = \alpha ^\top B(t), \end{align}

where $B_{k}(t)$ denotes the $k$ th B-spline basis function weighted by coefficient $\alpha _k$ . To ensure a smooth fit of $f(t, \alpha )$ , we impose a penalty (or regularization) on $\alpha$ which is formulated through the a priori structure

(4) \begin{align} p(\alpha ) \propto \exp \{- \gamma \alpha ^\top \mathbf{S} \alpha \}, \end{align}

where $\gamma$ is a hyperparameter controlling the level of smoothing and $\mathbf{S}$ is a penalty matrix that penalizes the differences of coefficients corresponding to adjacent basis functions as proposed by Eilers & Marx (Reference Eilers and Marx1996). We ensure identifiability of the smooth baseline intensity by incorporating a sum-to-zero constraint and refer to Ruppert et al. (Reference Ruppert, Wand and Carroll2003) and Wood (Reference Wood2017) for further details on penalized spline smoothing. Given this notation, we can simplify (2):

(5) \begin{align} \lambda _{ab}(t| \mathcal{H}(t), \vartheta ) = \begin{cases} \exp \{\vartheta ^\top \mathcal{X}_{ab}(\mathcal{H}(t), t)\}, & \text{if } (a,b) \in \mathcal{R} \\[5pt] 0, & \text{else,} \end{cases} \end{align}

with $\mathcal{X}_{ab}(\mathcal{H}(t),t) = \text{vec}(B(t), s_{ab}(\mathcal{H}(t)))$ .

2.2 Accounting for spurious relational events

Given the discussion in the introduction, we may conclude that some increments of $\mathbf{N}(t)$ are true events, while others stem from spurious events. Spurious events can occur because of coding errors during machine- or human-based data collection. To account for such erroneous data points, we introduce the REMSE.

First, we decompose the observed Poisson process into two separate matrix-valued Poisson processes, that is $\mathbf{N}(t) = \mathbf{N}_{0}(t) + \mathbf{N}_1(t) \; \forall \; t \in \mathcal{T}$ . On the dyadic level, $N_{ab,1}(t)$ denotes the number of true events between actors $a$ and $b$ until $t$ , and $N_{ab,0}(t)$ the number of events that are spurious. Assuming that $N_{ab}(t)$ is a Poisson process, we can apply the so-called thinning property, stating that two separate processes that sum up to a Poisson process are also Poisson processes (Daley & Vere-Jones Reference Daley and Vere-Jones2008). A graphical illustration of the three introduced counting processes, $N_{ab,0}(t), \;N_{ab,1}(t),$ and $N_{ab}(t)$ , is given in Figure 2. In this illustrative example, we observe four events at times $t_1, \;t_2, \;t_3,$ and $t_4$ , although only the first and third constitute true events, while the second and fourth are spurious. Therefore, the counting process $N_{ab}(t)$ jumps at all times of an event, yet $N_{ab,1}(t)$ does so only at $t_1$ and $t_3$ . Conversely, $N_{ab,0}(t)$ increases at $t_2$ and $t_4.$

Figure 2. Graphical illustration of a possible path of the counting process of observed events ( $N_{ab}(t)$ ) between actors $a$ and $b$ that encompasses spurious ( $N_{ab,0}(t)$ ) and true events ( $N_{ab,1}(t)$ ).

The counting processes $ \mathbf{N}_{0}(t)$ and $\mathbf{N}_1(t)$ are characterized by the dyadic intensities $\lambda _{ab,0}(t|\mathcal{H}_{0}(t), \vartheta _0)$ and $\lambda _{ab,1}(t|\mathcal{H}_{1}(t), \vartheta _1)$ , where we respectively denote the history of all spurious and true processes by $\mathcal{H}_{0}(t)$ and $\mathcal{H}_{1}(t)$ . This can also be perceived as a competing risks setting, where events can either be caused by the true-event or spurious-event intensity (Gelfand et al., Reference Gelfand, Ghosh, Christiansen, Soumerai and McLaughlin2000). To make the estimation of $\theta _0$ and $\theta _1$ feasible and identifiable (Heckman & Honoré, Reference Heckman and Honoré1989), we assume that both intensities are independent of one another, which means that their correlation is fully accounted for by the covariates. Building on the superpositioning property of Poisson processes, the specification of those two intensity functions also defines the intensity of the observed counting process $N_{ab}(t)$ . In particular, $\lambda _{ab}(t|\mathcal{H}(t), \vartheta )= \lambda _{ab,0}(t|\mathcal{H}_0(t), \vartheta _0) + \lambda _{ab,1}(t|\mathcal{H}_1(t), \vartheta _1)$ holds (Daley & Vere-Jones, Reference Daley and Vere-Jones2008).

The true-event intensity $\lambda _{ab,1}(t|\mathcal{H}_{1}(t), \vartheta _1)$ drives the counting process of true events $\mathbf{N}_{1}(t)$ and only depends on the history of true events. This assumption is reasonable since if erroneous events are mixed together with true events, the covariates computed for actors $a$ and $b$ at time $t$ through $s_{ab}(\mathcal{H}(t))$ would be confounded and could not anymore be interpreted in any consistent manner. We specify $\lambda _{ab,1}(t|\mathcal{H}_1(t), \vartheta _1)$ in line with (2) at the dyadic level by:

(6) \begin{align} \lambda _{ab,1}(t| \mathcal{H}_1(t), \vartheta ) = \begin{cases} \exp \{\vartheta _1^\top \mathcal{X}_{ab,1}(\mathcal{H}_1(t),t)\}, & \text{if } (a,b) \in \mathcal{R} \\[5pt] 0, & \text{else.} \end{cases} \end{align}

At the same time, the spurious-event intensity $\lambda _{ab,0}(t|\mathcal{H}_{0}(t), \vartheta _0)$ determines the type of measurement error generating spurious events. One may consider the spurious-event process as an overall noise level with a constant intensity. This leads to the following setting:

(7) \begin{align} \lambda _{ab,0}(t|\mathcal{H}_{0}(t), \vartheta _0) = \begin{cases} \exp \{\alpha _0\}, & \text{if } (a,b) \in \mathcal{R} \\[5pt] 0, & \text{else.} \end{cases} \end{align}

The error structure, that is, the intensity of the spurious-event process, can be made more complex, but to ensure identifiability, $\lambda _{ab,0}(t|\mathcal{H}_{0}(t), \vartheta _0)$ cannot depend on the same covariates as $\lambda _{ab,1}(t| \mathcal{H}_1(t), \vartheta )$ . We return to the discussion of this point below and focus on model (7) for the moment.

2.3 Posterior inference via data augmentation

To draw inference on $\vartheta = \text{vec}(\vartheta _0, \vartheta _1)$ , we employ an empirical Bayes approach. Specifically, we will sample from the posterior of $\vartheta$ given the observed data. Our approach is thereby comparable to the estimation of standard mixture (Diebolt & Robert, Reference Diebolt and Robert1994) and latent competing risk models (Gelfand et al., Reference Gelfand, Ghosh, Christiansen, Soumerai and McLaughlin2000).

For our proposed method, the observed data are the event stream of all events $\mathcal{E}$ regardless of being a real or a spurious event. To adequately estimate the model formulated in Section 2, we lack information on whether a given event is spurious or not. We denote this formally as a latent indicator variable $z(e)$ for event $e \in \mathcal{E}$ :

\begin{align*} z(e) = \begin{cases} 1,& \text{if event $e$ is a true event} \\[5pt] 0,& \text{if event $e$ is a spurious event} \end{cases} \end{align*}

We write $z = (z(e_1), \ldots, z(e_M))$ to refer to the latent indicators of all events and use $z_m$ to shorten $z(e_m)$ . Given this notation, we can apply the data augmentation algorithm developed in Tanner & Wong (Reference Tanner and Wong1987) to sample from the joint posterior distribution of $(Z,\vartheta )$ by iterating between the I Step (Imputation) and P Step (Posterior) defined as:

\begin{align*} &\text{I Step: Draw $Z^{(d)}$ from the posterior $p(z| \vartheta ^{(d-1)}, \mathcal{E})$; } \\[5pt] &\text{P Step: Draw $\vartheta ^{(d)}$ from the augmented $p(\vartheta | z^{(d)}, \mathcal{E})$.} \end{align*}

This iterative scheme generates a sequence that (under mild conditions) converges to draws from the joint posterior of $(\vartheta,Z)$ and is a particular case of a Gibbs’ sampler. Each iteration consists of an Imputation and a Posterior step, resembling the Expectation and Maximization step from the EM algorithm (Dempster et al., Reference Dempster, Laird and Rubin1977). Note, however, that Tanner & Wong (Reference Tanner and Wong1987) proposed this method with multiple imputations in each I Step and a mixture of all imputed complete-data posteriors in the P Step. We follow Little & Rubin (Reference Little and Rubin2002) and Diebolt & Robert (Reference Diebolt and Robert1994) by performing one draw of $Z$ and $\vartheta$ in every iteration, which is a specific case of data augmentation. As Noghrehchi et al. (Reference Noghrehchi, Stoklosa, Penev and Warton2021) argue, this approach is closely related to the stochastic EM algorithm (Celeux et al., Reference Celeux, Chauveau and Diebolt1996). The main difference between the two approaches is that in our P Step, the current parameters are sampled from the complete-data posterior in the data augmentation algorithm and not fixed at its mean as in Celeux et al. (Reference Celeux, Chauveau and Diebolt1996). Consequently, the data augmentation algorithm is a proper multiple imputation procedure (MI, Rubin, Reference Rubin1987), while the stochastic EM algorithm is improper MI (see Noghrehchi et al., Reference Noghrehchi, Stoklosa, Penev and Warton2021). We choose the data augmentation algorithm over the stochastic EM algorithm because Rubin’s combination rule to get approximate standard errors can only be applied to proper MI procedures (Noghrehchi et al., Reference Noghrehchi, Stoklosa, Penev and Warton2021).

In what follows, we give details and derivations on the I and P Steps and then exploit MI to combine a relatively small number of draws from the posterior to obtain point and interval estimates for $\vartheta$ .

Imputation-step: To acquire samples from $Z= (Z_1, \ldots, Z_M)$ conditional on $\mathcal{E}$ and $\vartheta$ , we first decompose the joint density by repeatedly applying the Bayes theorem:

(8) \begin{align} p(z | \vartheta, \mathcal{E}) &= p(z_M, \ldots, z_1 | \vartheta, \mathcal{E}) \nonumber \\[5pt] &= \prod _{m= 1}^M p(z_m | z_1, \ldots, z_{m-1},\vartheta, \mathcal{E}). \end{align}

The distribution of $z_m$ conditional on $ z_1, \ldots, z_{m-1},\vartheta$ and $\mathcal{E}$ is:

(9) \begin{align} Z_m | z_1, \ldots, z_{m-1},\vartheta, \mathcal{E} \sim \text{Bin}\left (1, \frac{\lambda _{a_m b_m,1}(t_{m}|\mathcal{H}_1(t_{m}), \vartheta _1)}{\lambda _{a_m b_m,0}(t_m|\mathcal{H}_0(t_m), \vartheta _0) + \lambda _{a_m b_m,1}(t_m|\mathcal{H}_1(t_m), \vartheta _1)}\right ). \end{align}

Note that the information of $z_1, \ldots z_{m-1}$ and $\mathcal{E}$ allows us to calculate $ \mathcal{H}_1(t_m)$ as well as $\mathcal{H}_0(t_m)$ . By iteratively applying (9) and plugging in $\vartheta ^{(d)}$ for $\vartheta$ , we can draw samples in the I Step of $Z= (Z_1, \ldots, Z_M)$ through a sequential design that sweeps once from $Z_1$ to $Z_M$ . The mathematical derivation of (9) is provided in Appendix B.

Posterior step: As already stated, we assume that the true-event and spurious-event intensities are independent. Hence, the sampling from the complete-data posteriors of $\vartheta _0$ and $\vartheta _1$ can be carried out independently. In the ensuing section, we therefore only show how to sample from $\vartheta _1| z, \mathcal{E}$ , but sampling from $\vartheta _0| z, \mathcal{E}$ is possible in the same manner. To derive this posterior, we begin by showing that the likelihood of $\mathcal{E}$ and $z$ with parameter $\vartheta _1$ is the likelihood of the counting process $\mathbf{N}_1(t)$ , which resembles a Poisson regression. Consecutively, we state all priors to derive the desired complete-data posterior.

Given a general $z$ sampled in the previous I Step and $\mathcal{E}$ , we reconstruct a unique complete path of $\mathbf{N}_1(t)$ by setting

(10) \begin{align} N_{ab,1}(t) = \sum _{\substack{ e \in \mathcal{E}; \\[5pt] z(e) = 1, \; t(e)\leq t} } \mathbb{I}(a(e) =a, b(e) = b) \; \forall \; (a,b) \in \mathcal{R},\; t\in \mathcal{T}, \end{align}

where $\mathbb{I}(\cdot )$ is an indicator function. The corresponding likelihood of $\mathbf{N}_1(t)$ results from the property that any element-wise increments of the counting process between any times $s$ and $t$ with $t\gt s$ and arbitrary actors $a$ and $b$ with $(a,b) \in \mathcal{R}$ are Poisson distributed:

(11) \begin{align} N_{ab,1}(t) - N_{ab,1}(s) \sim \text{Pois}\left (\int _s^t \lambda _{ab,1}\left ( u|\mathcal{H}_1(u),\vartheta _1\right ) du\right ). \end{align}

The integral in (11) is approximated through simple rectangular approximation between the observed event times to keep the numerical effort feasible, so that the distributional assumption simplifies to:

(12) \begin{align} Y_{ab,1}(t_m) = N_{ab,1}(t_m) - N_{ab,1}(t_{m-1}) \sim & \text{Pois}\left (\left (t_m - t_{m-1}\right ) \lambda _{ab,1}\left (t_m|\mathcal{H}_1\left (t_m\right ),\vartheta _1\right )\right ) \\[5pt] \;\forall \; m \in \{1, \ldots, M\} &\text{ with }z_m = 1\text{ and }(a,b) \in \mathcal{R}. \nonumber \end{align}

We specify the priors for $\alpha _1$ and $\theta _1$ separately and independent of one another. The prior for $\alpha _1$ was already stated in (4). Through a restricted maximum likelihood approach, we estimate the corresponding hyperparameter $\gamma _1$ such that it maximizes the marginal likelihood of $z$ and $\mathcal{E}$ given $\gamma _1$ (for additional information on this estimation procedure and general empirical Bayes theory for penalized splines see Wood Reference Wood2011, Reference Wood2020). Regarding the linear coefficients $\theta _1$ , we assume flat priors, that is $p(\theta _1) \propto k$ , indicating no prior knowledge.

In the last step, we apply Wood’s (Reference Wood2006) result that for large samples, the posterior distribution of $\vartheta _1$ under likelihoods resulting from distributions belonging to the exponential family, such as the Poisson distribution in (12), can be approximated through:

(13) \begin{align} \vartheta _1 | z, \mathcal{E} \sim N\left (\hat{\vartheta }_1, \mathbf{V}_1\right ). \end{align}

Here, $\hat{\vartheta }_1$ denotes the penalized maximum likelihood estimator resulting from (12) with the extended penalty matrix $\tilde{ \mathbf{S}}_1$ defined by

\begin{align*} \tilde{ \mathbf{S}}_1 = \begin{bmatrix} \mathbf{S}_1\;\;\;\; & \mathbf{O}_{p \times q} \\[5pt] \mathbf{O}_{p \times q}\;\;\;\; & \mathbf{O}_{q \times q} \end{bmatrix} \end{align*}

with $\mathbf{O}_{p \times q} \in \mathbb{R}^{p\times q}$ for $p,q \in \mathbb{N}$ being a matrix filled with zeroes and $\mathbf{S}_1$ defined in accordance with (4). For $\vartheta _1 = \text{vec}(\alpha _1, \theta _1),$ let $p$ be the length of $\alpha _1$ and $q$ of $\theta _1$ . The penalized likelihood is then given by:

(14) \begin{align} \ell _p(\vartheta _1;\; z,\mathcal{E}) = \ell (\vartheta _1;\; z,\mathcal{E}) - \gamma _1\vartheta _1^\top \tilde{ \mathbf{S}}_1 \vartheta _1, \end{align}

which is equivalent to a generalized additive model; hence, we refer to Wood (Reference Wood2017) for a thorough treatment of the computational methods needed to find $\hat{\vartheta }_1$ . The variance matrix in (13) has the following structure:

\begin{align*} \mathbf{V}_1 = \left (\mathcal{X}_1^\top \mathbf{W}_1 \mathcal{X}_1 + \gamma _1 \tilde{ \mathbf{S}}_1 \right )^{-1}. \end{align*}

Values for $\gamma _1$ and $\hat{\vartheta }_1$ can be extracted from the estimation procedure to maximize (14) with respect to $\vartheta _1$ , while $\mathcal{X}_1 \in \mathbb{R}^{(M |\mathcal{R}|)\times (p + q)}$ is a matrix whose rows are given by $\mathcal{X}_{ab,1}(\mathcal{H}_1(t_m),t_{m-1})$ as defined in (6) for $m \in \{ 1, \ldots, M\}$ and $(a,b) \in \mathcal{R}$ . Similarly, $\mathbf{W}_1 = \text{diag}\big (\lambda _{ab,1}(t| \mathcal{H}_1(t), \vartheta _1);$ $t \in \{ t_1, \ldots, t_M\}, (a,b) \in \mathcal{R}\big )$ is a diagonal matrix.

For the P Step, we now plug in $z^{(d)}$ for $z$ in (13) to obtain $\hat{\vartheta }_1$ and $\mathbf{V}_1$ by carrying out the corresponding complete-case analysis. In the case where no spurious events exist, the complete estimation can be carried out in a single P Step. In Algorithm 1, we summarize how to generate a sequence of random variables according to the data augmentation algorithm.

Multiple imputation: One could use the data augmentation algorithm to get a large amount of samples from the joint posterior of $(\vartheta, Z)$ to calculate empirical percentiles for obtaining any types of interval estimates. However, in our case this endeavor would be very time-consuming and even infeasible. To circumvent this, Rubin (Reference Rubin1976) proposed multiple imputation as a method to approximate the posterior mean and variance. Coincidentally, the method is especially successful when the complete-data posterior is multivariate normal as is the case in (13); thus, only a small number of draws is needed to obtain good approximations (Little & Rubin, Reference Little and Rubin2002). To be specific, we apply the law of iterative expectation and variance:

(15) \begin{align} \mathbb{E}(\vartheta |\mathcal{E}) = \mathbb{E}(\mathbb{E}(\vartheta |\mathcal{E}, z)|z) \end{align}
(16) \begin{align} \text{Var}(\vartheta |\mathcal{E}) = \mathbb{E}(\text{Var}(\vartheta |\mathcal{E}, z)|z) +\text{Var}(\mathbb{E}(\vartheta |\mathcal{E},z)|z). \end{align}

Next, we approximate (15) and (16) using a Monte Carlo quadrature with $K$ samples from the posterior obtained via the data augmentation scheme summarized in Algorithm 1 after a burn-in period of $D$ iterations:

(17) \begin{align} \mathbb{E}(\vartheta |\mathcal{E}_{\text{obs}}) \approx \frac{1}{K} \sum _{k = D + 1}^{D+K} \hat{\vartheta }^{(k)} = \bar{\vartheta } \end{align}
(18) \begin{align} \text{Var}(\vartheta |\mathcal{E}_{\text{obs}}) &\approx \frac{1}{K} \sum _{k = D + 1}^{D+K} \mathbf{V}^{(k)} + \frac{K+1}{K(K-1)}\sum _{k = D + 1}^{D+K} \left (\hat{\vartheta }^{(k)} - \bar{\vartheta }\right ) \left (\hat{\vartheta }^{(k)} - \bar{\vartheta }\right )^\top \nonumber \\[5pt] &= \bar{\mathbf{V}} + \bar{\mathbf{B}}, \end{align}

where $\hat{\vartheta }^{(k)} = \text{vec}\left (\hat{\vartheta }^{(k)}_0, \hat{\vartheta }^{(k)}_1\right )$ encompasses the complete-data posterior means from the $k$ th sample and $\mathbf{V}^{(k)} = \text{diag} \big ( \mathbf{V}^{(k)}_0, \mathbf{V}^{(k)}_1\big )$ is composed of the corresponding variances defined in (13). We can thus construct point and interval estimates from relatively few draws of the posterior based on a multivariate normal reference distribution (Little & Rubin, Reference Little and Rubin2002).

3. Simulation study

We conduct a simulation study to explore the performance of the REMSE compared to a REM, which assumes no spurious events, in two different scenarios, including a regime where measurement error is correctly specified in the REMSE and one where spurious events are instead nonexistent.

Simulation design: In S=1,000 runs, we simulate event data between $n = 40$ actors under known true and spurious intensity functions in each example. For exogenous covariates, we generate categorical and continuous actor-specific covariates, transformed to the dyad level by checking for equivalence in the categorical case and computing the absolute difference for the continuous information. Generally, we simulate both counting processes $\mathbf{N_1(t)}$ and $\mathbf{N_0(t)}$ separately and stop once $|\mathcal{E}_1| = 500$ .

The data-generating processes for true events is identical in each case and given by:

(DG 1-2) \begin{align} \lambda _{ab,1}(t|\mathcal{H}_1(t), \vartheta _1) &= \exp \{-5 + 0.2\cdot s_{ab,\;Degree\;Abs.}(\mathcal{H}_1(t)) \\[2pt] & \quad + 0.1\cdot s_{ab,\;Triangle}(\mathcal{H}_1(t)) - 0.5\cdot s_{ab,\;Repetition \; Count}(\mathcal{H}_1(t)) \nonumber \\[2pt] & \quad + 2\cdot s_{ab,\;Sum \; cont.}(\mathcal{H}_1(t)) - 2\cdot s_{ab,\;Match \; cat.}(\mathcal{H}_1(t)) \}, \nonumber \end{align}

where we draw the continuous exogenous covariate (cont.) from a standard Gaussian distribution and the categorical exogenous covariates (cat.) from a categorical random variable with seven possible outcomes, all with the same probability. Mathematical definition of the endogenous and exogenous statistics are given in Appendix A. In contrast, the spurious-event intensity differs across regimes to result in correctly specified (DG 1) and nonexistent (DG 2) measurement errors:

(DG 1) \begin{align} \lambda _{ab,\;0}(t| \mathcal{H}_0(t),\vartheta _0) = \exp \{-2.5 \} \end{align}
(DG 2) \begin{align} \lambda _{ab,\;0}(t| \mathcal{H}_0(t),\vartheta _0) = 0 \end{align}

Given these intensities, we follow DuBois et al. (Reference DuBois, Butts, McFarland and Smyth2013) to sample the events.

Table 1. Result of the simulation study for the REMSE and REM with the two data-generating processes (DG 1, DG 2). For each DG and covariate, we note the AVE (AVerage Estimate), RMSE (Root-Mean-Squared Error), and CP (Coverage Probability). We report the average Percentage of False Events (PFE) for each DG in the last row

Although the method is estimated in a Bayesian framework, we can still assess the frequentist properties of the estimates of the REMSE and REM. In particular, the average point estimate (AVE), the root-mean-squared error (RMSE) and the coverage probabilities (CP) are presented in Table 1. The AVE of a specific coefficient is the average over the posterior modes in each run:

\begin{align*} \text{AVE} = \frac{1}{S} \sum _{s = 1}^S \bar{\vartheta }_s, \end{align*}

where $\bar{\vartheta }_t$ is the posterior mean (17) of the $t$ th simulation run. To check for the average variance of the error in each run, we further report the RMSEs of estimating the coefficient vector $\vartheta$ :

\begin{align*} \text{RMSE} = \sqrt{\frac{1}{S} \sum _{s = 1}^S\left (\bar{\vartheta }_s - \vartheta \right )^\top \left (\bar{\vartheta }_s - \vartheta \right )}, \end{align*}

where $\vartheta$ is the ground truth coefficient vector defined above. Finally, we assess the adequacy of the uncertainty quantification by computing the percentage of runs in which the real parameter lies within the confidence intervals based on a multivariate normal posterior with mean and variance given in (17) and (18). According to standard statistical theory for interval estimates, this coverage probability should be around $95\%$ (Casella & Berger, Reference Casella and Berger2001).

Results: DG 1 shows how the estimators behave if the true and false intensities are correctly specified. The results in Table 1 suggest that the REMSE can recover the coefficients from the simulation. On the other hand, strongly biased estimates are obtained in the REM, where not only the average estimates are biased, but we also observe high RMSEs and violated CP.

In the second simulation, we assess the performance of the spurious event model when it is superfluous. In particular, we investigate what happens when there are no spurious events in the data, that is, all events are real, and the intensity of $N_{ab,\;2}(t)$ is zero in DG 2. Unsurprisingly, the REM allows for valid and unbiased inference under this regime. But our stochastic estimation algorithm proves to be robust as for most runs, the simulated events were at some point only consisting of true events. In other words, the REMSE can detect the spurious events correctly and is unbiased if none occur in the observed data.

For both DG 1 and DG 2, the PFE estimated by the REMSE closely matches the observed one whereas the REM, by constraining it to zero, severely underestimates the PFE in DG 1. In sum, the simulation study thus offers evidence that the REMSE increases our ability to model relational event data in the presence of measurement error while being equivalent to a standard REM when spurious events do not exist in the data.

4. Application

Next, we apply the REMSE on two real-world data sets motivated by the types of event data discussed in the introduction, namely human-coded conflict events in the Syrian civil war and co-location event data generated from the Bluetooth devices of students in a university dormFootnote 3 . Information on the data sources, observational periods, and numbers of actors and events is summarized in Table 2. Following the above presentation, we focus on modeling the true-event intensity of the REMSE and limit the spurious-event intensity to the constant term. Covariates are thus only specified for the true-event intensity. In our applications, the samples drawn according to Algorithm 1 converged to a stationary distribution within the first 30 iterations. To obtain the reported point and interval estimates via MI, we sampled 30 additional draws. Due to space restrictions, we keep our discussions of the substantive background and results of both applications comparatively short.

Table 2. Descriptive information on the two analyzed data sets

4.1 Conflict events in the Syrian civil war

In the first example, we model conflict events between different belligerents as driven by both exogenous covariates and endogenous network mechanisms. The exogenous covariates are selected based on the literature on inter-rebel conflict. We thus include dummy variables indicating whether two actors share a common ethno-religious identity or receive material support by the same external sponsor as these factors have previously been found to reduce the risk of conflict (Popovic, Reference Popovic2018; Gade et al., Reference Gade, Hafez and Gabbay2019). Additionally, we include binary indicators of two actors being both state forces or both rebel groups as conflict may be less likely in the former but more likely in the latter case (Dorff et al., Reference Dorff, Gallop and Minhas2020).

Furthermore, we model endogenous processes in the formation of the conflict event network and consider four statistics for this purpose. First, we account for repeated fighting between two actors by including both the count of their previous interactions as well as a binary indicator of repetition, which takes the value 1 if that count is at least 1. We use this additional endogenous covariate as a conflict onset arguably comprises much more information than subsequent fighting. Second, we include the absolute difference in a and b’s degree to capture whether actors with a high extent of previous activity are prone to engage each other or, instead, tend to fight less established groups to pre-empt their rise to power. Finally, we model hyperdyadic dependencies by including a triangle statistic that captures the combat network’s tendency towards triadic closure.

Given that fighting should be a relatively obvious event, one may wonder why conflict event data may include spurious observations. This is because all common data collection efforts on armed conflict cannot rely on direct observation but instead use news and social media reporting. Spurious events thus occur when these sources report fighting which did not actually take place as such. In armed conflict, this can happen for multiple reasons. For instance, pro-government media may falsely report that state security forces engaged with and defeated rebel combatants to boost morale and convince audiences that the government is winning. Social media channels aligned with a specific rebel faction may similarly claim victories by its own forces or, less obviously, battles where a rival faction fought and suffered defeat against another group. In war-time settings, journalists may also be unable or unwilling to enter conflict areas and thus base their reporting on local contacts, rumors, or hear-say. Finally, spurious observations may arise here when reported fighting occurred but was attributed to the wrong belligerent faction at some point in the data collection process. From a substantive perspective, it is thus advisable to check for the influence of spurious events when analyzing these data.

Table 3 accordingly presents the results of an REM and the REMSE. Beginning with the exogenous covariates, belligerents are found to be less likely to fight each other when they share an ethno-religious identity or receive resources from the same external sponsor. In contrast, there is no support for the idea that state forces exhibit less fighting among each other than against rebels in this type of internationalized civil war, whereas different rebel groups are more likely to engage in combat against one another. Furthermore, we find evidence that endogenous processes affect conflict event incidence. The binary repetition indicator exhibits the strongest effect across all covariates, implying that two actors are more likely to fight each other if they have done so in the past. As indicated by the positive coefficient of the repetition count, the dyadic intensity further increases the more they have previously fought with one another. The absolute degree difference also exhibits a positive effect, meaning that fighting is more likely between groups with different levels of previous activity. And finally, the triangle statistic’s positive coefficient suggests that even in a fighting network, triadic closure exists. This may suggest that belligerents engage in multilateral conflict, attacking the enemy of their enemy, in order to preserve the existing balance of capabilities or change it in their favor (Pischedda, Reference Pischedda2018).

Table 3. Combat events in the Syrian civil war: Estimated coefficients with confidence intervals noted in brackets in the first column, while the Z values are given in the second column. The results of the REMSE are given in the first two columns, while the coefficients of the REM are depicted in the last two columns. The last row reports the estimated average Percentage of False Events (PFE)

This discussion holds for both the results of REM and REMSE. Their point estimates are generally quite similar in this application, suggesting that spurious events do not substantively affect empirical results in this case. That being said, there are two noticeable differences between the two models. First, the coefficient estimates for the binary indicator of belligerents having fought before differs between the two models. In the REM, it implies a multiplicative change of $\exp \{4.911\}=135.775$ while for the REMSE, it is estimated at $\exp \{5.059\}=157.433$ . While both models thus identify this effect to be positive and significant, it is found to be stronger when spurious events are accounted for. Second, the two models differ in how precise they deem estimates to be. This difference is clearest in their respective Z values, which are always farther away from zero for the REM than the REMSE. As a whole, these results nonetheless show that spurious events have an overall small influence on substantive results in this application. The samples from the latent indicators $z$ also indicate that only approximately 1 $\%$ of the observations, about 50 events, are on average classified as spurious events. These findings offer reassurance for the increasing use of event data to study armed conflict.

4.2 Co-location events in university housing

In our second application, we use a subset of the co-location data collected by Madan et al. (Reference Madan, Cebrian, Moturu, Farrahi and Pentland2012) to model when students within an American university dorm interact with each other. These interactions are deduced from continuous (every 6 minutes) scans of proximity via the Bluetooth signals of students’ mobile phones. Madan et al. (Reference Madan, Cebrian, Moturu, Farrahi and Pentland2012) used questionnaires to collect a host of information from the participating students. This information allows us to account for both structural and more personal exogenous predictors of social interaction. We thus include binary indicators of whether two students are in the same year of college or live on the same floor of the dorm to account for the expected homophily of social interactions (McPherson et al., Reference McPherson, Smith-Lovin and Cook2001). In addition, we incorporate whether two actors consider each other close friendsFootnote 4 . Given that the data were collected around a highly salient political event, the 2008 US presidential election, we also incorporate a dummy variable to measure whether they share the same presidential preference and a variable measuring their similarity in terms of interest in politics (Butters & Hare, Reference Butters and Hare2020). In addition, we include the same endogenous network statistics here as in section 4.1. These covariates allow us to capture the intuitions that individuals tend to socialize with people that they have interacted with before, are not equally popular as they are, and they share more common friends with (Rivera et al., Reference Rivera, Soderstrom and Uzzi2010). Compared to the first application, sources of spurious events here are more evident as students may not actually interact with but be physically close to and even face each other, for example, riding an elevator, queuing in a store, or studying in a common space.

We present the results in Table 4. Beginning with the exogenous covariates, we find that the observed interactions tend to be homophilous in that students have social encounters with people they live together with, consider their friends, and share a political opinion with. In contrast, neither a common year of college nor a similar level of political interest are found to have a statistically significant effect on student interactions. At the same time, these results indicate that the social encounters are affected by endogenous processes. Having already had a previous true event is found to be the main driver of the corresponding intensity, hence having a very strong and positive effect. Individuals who have socialized before are thus more likely to socialize again, an effect that, as indicated by the repetition count, increases with the number of previous interactions. Turning to the other endogenous covariates, the result for absolute degree difference suggests that students $a$ and $b$ are more likely to engage with each other if they have more different levels of previous activity, suggesting that, for example, popular individuals attract attention from less popular ones. As is usual for most social networks (Newman and Park Reference Newman and Park2003), the triangle statistic is positive, meaning that students “socialize” with the friends of their friends.

Table 4. Co-location Events in University Housing: Estimated coefficients with confidence intervals noted in brackets in the first column, while the Z values are given in the second column. The results of the REMSE are given in the first two columns, while the coefficients of the REM are depicted in the last two columns. The last row reports the estimated average Percentage of False Events (PFE)

As in the first application, the REM and REMSE results presented in Table 4 are closely comparable but also show some differences. Again, the effect estimate for binary repetition, at $\exp \{2.715\}=15.105$ , is higher in the REMSE than in the REM ( $\exp \{2.615\}=13.667$ ) while Z values and confidence intervals obtained in the REM are substantially smaller in the REM than in the REMSE. In the co-location data too, the results are thus not driven by the presence of spurious events but accounting for these observations does affect results to some, albeit rather negligible, extent. This is the case even though the average percentage of spurious events here is comparatively high at 3 $\%$ . That leaving out the corresponding 81 events yielded similar estimates may indicate that spurious events were mainly observed at the periphery of the interaction network and hardly affected the behavior in the network’s core. More generally, these results may assuage concerns over sensor data reliability (see Elmer et al., Reference Elmer, Chaitanya, Purwar and Stadtfeld2019).

5. Discussion

In summary, this paper extends the relational event framework to handle spurious events. In doing so, it offers applied researchers analyzing instantaneous interaction data a useful tool to explicitly account for measurement errors induced by spurious events or to investigate the robustness of their results against this type of error. Our proposed method controls for one explicit measurement error, namely that induced by spurious events. The simulation study showed that our approach can detect such false events and even yield correct results if they are not present. Still, we want to accentuate that numerous other types of measurement error may be present when one analyses relational events, which we disregard in this article. For instance, true events may be missing. These false negatives, for example, unreported conflict events between different belligerents, are difficult to tackle because of a lack of information.

We explicitly recommend the use of the REMSE as a method for checking robustness. When substantive knowledge suggests the presence of spurious events, the REMSE can be used to assess whether REM results hold when accounting for them. Spurious events may be common in datasets which come from sensors or are coded from journalistic sources, as discussed above, and more generally seem credibly present in data that are based on secondary sources instead of direct observation. Spurious events also occur and may possibly be more influential, in data where relations are directed, the model we introduce accordingly also generalizes to directed event data. Especially for politically contentious data, where some events may be openly claimed to be false, the REMSE offers a possibility to adjudicate whether overall findings depend on such contested observations. But also where the data content is non-political, it is recommendable to check how common and influential false observations are. We provide replication code implementing the REMSE for this purpose.

When specifying the REMSE, two aspects require caution so that identifiability is ensured. First, given we know which events are spurious, our model simplifies to a competing risk model; thus, the identifiability issues discussed in Heckman & Honoré (Reference Heckman and Honoré1989) or Tsiatis (Reference Tsiatis1975) apply. For this reason, we presented our model under the assumption of independence between the true-event and spurious-event intensities. Second, the particular specification of the covariates might also affect the identifiability of the model. This may occur when one assumes complex dependencies of spurious events and exogenous covariates are unavailable, or the prior information about the coefficients is too weak. For the model specification employed in this article, this is not an issue due to the simple form of the spurious-event intensity as long as at least one exogenous or endogenous term has a nonzero effect on the true-event intensity. For more complex models, one may use multiple starting values of the data augmentation algorithm or formulate more informative priors for $\theta _1$ and possibly $\theta _0$ .

Our latent variable methodology can also be extended beyond the approach presented here. A straightforward refinement along the lines of Stadtfeld & Block (Reference Stadtfeld and Block2017) would be to include windowed effects, that is, endogenous statistics that are only using history ranging into the past for a specific duration, or exogenous covariates calculated from additional networks to the one modeled. The first modification could also be extended to separable models as proposed in Fritz et al. (Reference Fritz, Thurner and Kauermann2021). A relatively simplistic version of the latter type of covariate was incorporated in Section 4.2 to account for common friendships but more complex covariates are possible. This might be helpful, for instance, when we observe proximity and e-mail events between the same group of actors. Moreover, with minor adaptions, the proposed estimation methodology could handle some of the exogenous or endogenous covariates having nonlinear effects on the intensities.

Finally, the framing of the simultaneous counting processes may be modified and their number extended. To better understand the opportunities our model framework entails, it is instructive to perceive the proposed model as an extension to the latent competing risk model of Gelfand et al. (Reference Gelfand, Ghosh, Christiansen, Soumerai and McLaughlin2000) with two competing risks. For time-to-event data, one could thus employ an egocentric versionFootnote 5 of our model for model-based clustering of general duration times, which could prove to be a valuable tool for medical applications. Or our proposed methodology could be conceived as a general tool to correct for additive measurement errors in count data and extend it to spatial data analysis to be used in settings described in Raleigh et al. (Reference Raleigh, Linke, Hegre and Karlsen2010).

Acknowledgments

We thank the anonymous reviewers and Carter Butts for their careful reading and constructive comments. The authors gratefully acknowledge support from the German Federal Ministry of Education and Research (BMBF) under Grant No. 01IS18036A and the German Research Foundation (DFG) for the project TH 697/11-1: Arms Races in the Interwar Period 1919-1939. Global Structures of Weapons Transfers and Destabilization.

Competing interests

None.

A. Definition of undirected network statistics

As REMs for undirected events are so far sparse in the literature, there are no standard statistics that are commonly used (one exception being Bauer et al., Reference Bauer, Harhoff and Kauermann2021). Thus we define all statistics based on prior substantive research (Rivera et al., Reference Rivera, Soderstrom and Uzzi2010; Wasserman & Faust, Reference Wasserman and Faust1994) and undirected statistics used for modeling static networks (Robins et al., Reference Robins, Snijders, Wang, Handcock and Pattison2007). Generally, nondirected statistics have to be invariant to swapping the positions of actor $a$ and $b$ . For the following mathematical definitions, we denote the set of all actors by $\mathcal{A}$ .

For degree-related statistics, we include the absolute difference of the degrees of actors $a$ and $b$ :

\begin{align*} s_{ab,\;Degree\;Abs.}(\mathcal{H}(t)) &= |\sum _{h \in \mathcal{A}} (\mathbb{I}(N_{ah}(t^-)\gt 0) + \mathbb{I}(N_{ha}\gt 0)(t^-)) \\[5pt] & - \sum _{h \in \mathcal{A}} (\mathbb{I}(N_{bh}(t^-)\gt 0) + \mathbb{I}(N_{hb}(t^-)\gt 0))|, \end{align*}

where $t^-$ is the point-in-time just before $t$ . Alternatively, one might also employ other bivariate functions of the degrees as long as they are invariant to swapping $a$ and $b$ , such as the sum of degrees. When simultaneously using different forms of degree-related statistics, collinearities between the respective covariates might severely impede the interpretation.

To capture past dyadic behavior, one can include $N_{ah}(t^-)$ directly as a covariate. Since the first event often constitutes a more meaningful action than any further observed events between the actors $a$ and $b$ , we additionally include a binary covariate to indicate whether the respective actors ever interacted before, leading to the following endogenous statistics:

\begin{align*} s_{ab,\;Repition\;Count}(\mathcal{H}(t)) &= N_{ah}(t^-) \\[5pt] s_{ab,\;First\;Repition}(\mathcal{H}(t)) &= \mathbb{I}(N_{ab}(t^-)\gt 0). \end{align*}

Hyperdyadic statistics in the undirected regime are defined as any type of triadic closure, where actor $a$ is connected to an entity that is also connected to actor $b$ :

\begin{align*} s_{ab,\;Triangle} &=\sum _{h \in \mathcal{A}} \mathbb{I}(N_{ah}(t^-)\gt 0) \mathbb{I}(N_{bh}(t^-)\gt 0) + \\[5pt] & \mathbb{I}(N_{ha}(t^-)\gt 0) \mathbb{I}(N_{bh}(t^-)\gt 0) + \\[5pt] & \mathbb{I}(N_{ah}(t^-)\gt 0) \mathbb{I}(N_{hb}(t^-)\gt 0) + \\[5pt] & \mathbb{I}(N_{ha}(t^-)\gt 0) \mathbb{I}(N_{hb}(t^-)\gt 0) \\[5pt] \end{align*}

Finally, actor-specific exogenous statistics can also be used to model the intensities introduced in this article. We denote arbitrary continuous covariates by $x_{a,\;cont} \; \forall \; a \in \mathcal{A}$ . On the one hand, we may include a measure for the similarity or dissimilarity for the covariate through:

\begin{align*} s_{ab,\;Sim. \; cont} &= |x_{a,\;cont}-x_{b,cont}| \\[5pt] s_{ab,\;Dissim. \; cont } &= \frac{1}{|x_{a,\;cont}-x_{b,\;cont}|}. \end{align*}

For multivariate covariates, such as location, we only need to substitute the absolute value for any given metric, for example, Euclidean distance. In other cases, it might be expected that high levels of a continuous covariable result in higher or lower intensities of an event:

\begin{align*} s_{ab,\;Sum\; cont} &= x_{a,\;cont} + x_{b,\;cont}. \end{align*}

Which type of statistic should be used depends on the application case and the hypotheses to be tested. Categorical covariates, that we denote by $x_{a,cat} \; \forall \; a \in \mathcal{A}$ , can also be used to parameterize the intensity by checking for equivalence of two actor-specific observations of the variable:

\begin{align*} s_{ab,\;Match\; cat} &= \mathbb{I}(x_{a,\;cat} = x_{b,\;cat}). \end{align*}

Besides actor-specific covariates also exogenous networks or matrices, such as $x_{Network} \in \mathbb{R}^{|\mathcal{A}|\times |\mathcal{A}|}$ , can also be incorporated as dyadic covariates in our framework:

\begin{align*} s_{ab,\;Dyad.\; Network} &= \frac{x_{Network,\;ab} + x_{Network,\;ba}}{2}, \end{align*}

where $x_{Network, ab}$ is the entry of the $a$ th row and $b$ th column of the matrix $x_{Network}$ . Extensions to time-varying networks are straightforward when perceiving changes to them as exogenous to the modeled events (Stadtfeld & Block, Reference Stadtfeld and Block2017).

B. Mathematical Derivation of (9)

For $m\in \{1, \ldots, M\}$ , let $Y_{a_{m}b_{m},1}(t_{m}) = N_{a_{m}b_{m},1} (t_{m}) - N_{a_{m}b_{m},1}(t_{m-1})$ be the increments of the latent counting process of true events between the time points $t_{m}$ and $t_{m-1}$ , where we additionally define $t_0 = 0$ without the loss of generality. We observe $\mathcal{E}$ ; hence, we can reconstruct the respective increment $Y_{a_{m}b_{m}}(t_{m}) = N_{a_{m}b_{m}}(t_{m}) - N_{a_{m}b_{m}}(t_{m-1}) = Y_{a_{m}b_{m},0}(t_{m}) + Y_{a_{m}b_{m},1}(t_{m})$ , where $ Y_{a_{m}b_{m},0}(t_{m})$ is the increment of the spurious-event counting process. The second equality holds since by design the sum of increments of the processes counting the true and false events is the increment of the observed counting process, that is $N_{ab}(t) = N_{ab,0}(t)+N_{ab,1}(t)$ . To sample from $Z_{m} | z_1, \ldots, z_{m-1},\mathcal{E}$ , note that $Z_{m} = Y_{a_{m}b_{m},1}(t_{m}) | Y_{a_{m}b_{m}}(t_{m})$ holds. Heuristically, this means that if we know that one of the two thinned counting processes jumps at time $t_{m}$ , the probability of the jump being attributed to $N_{a_{m}b_{m},1} (t)$ is the probability that the $m$ th event is a true event. For the increments of the involved counting processes, we can then use the properties of the Poisson processes and the fact that the intensities are piecewise constant between event times to derive the following distributional assumptions $\forall \; m = 1, \ldots, M$ :

(B1) \begin{align} Y_{a_{m}b_{m},0}(t_{m}) | z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta &\sim \text{Pois}\left (\delta _m\lambda _{a_{m}b_{m},0}(t_{m}| \mathcal{H}_0(t_{m}), \vartheta _0)\right ) \end{align}
(B2) \begin{align} Y_{a_{m}b_{m},1}(t_{m}) | z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta &\sim \text{Pois}\left (\delta _m\lambda _{a_{m}b_{m},1}(t_{m}, \mathcal{H}_1(t_{m}), \vartheta _1)\right ) \end{align}
(B3) \begin{align} Y_{a_{m}b_{m}}(t_{m}) | z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta &\sim \text{Pois}\bigg (\delta _m\big (\lambda _{a_{m}b_{m},0}(t_{m}|\mathcal{H}_0(t_{m}), \vartheta _0) \nonumber \\[5pt] & + \lambda _{a_{m}b_{m},1}(t_{m}|\mathcal{H}_1(t_{m}), \vartheta _1)\big )\bigg ), \end{align}

where we set $\delta _m = t_{m}- t_{m-1}$ . We can now directly compute the probability of $Z_{m} = 1| z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta$ :

\begin{align*} p(z_{m} = 1| z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta ) &= p(Y_{a_{m}b_{m},1}(t_{m})= 1 | Y_{a_{m}b_{m}}(t_{m}) = 1, z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta ) \\[5pt] &= \frac{p(Y_{a_{m}b_{m},1}(t_{m})= 1, Y_{a_{m}b_{m}}(t_{m})= 1| z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta )}{p(Y_{a_{m}b_{m}}(t_{m})= 1 | z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta )} \\[5pt] &= \frac{p(Y_{a_{m}b_{m},1}(t_{m})= 1, Y_{a_{m}b_{m},2}(t_{m})= 0| z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta )}{p(Y_{a_{m}b_{m}}(t_{m})= 1 | z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta )} \\ &= \frac{p(Y_{a_{m}b_{m},1}(t_{m})= 1| z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta )}{p(Y_{a_{m}b_{m}}(t_{m})= 1 | z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta )} \end{align*}
\begin{align*} & \quad \times \frac{p(Y_{a_{m}b_{m},2}(t_{m})=0| z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta )}{p(Y_{a_{m}b_{m}}(t_{m})= 1 | z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta )} \\[5pt] &= \frac{\lambda _{a_{m}b_{m},1}(t_{m}|\mathcal{H}_1(t_{m}, \vartheta _1))}{\lambda _{a_{m}b_{m},0}(t_{m}| \mathcal{H}_0(t_{m}), \vartheta _0)+ \lambda _{a_{m}b_{m},1}(t_{m}|\mathcal{H}_1(t_{m}), \vartheta _1 )} \end{align*}

In the last row we plug in (B1) and (B2) for the probabilities in the numerators and (B3) in the denominator to prove claim (9). The calculation for $p(z_{m} = 0| z_1, \ldots, z_{m-1},\mathcal{E}, \vartheta )$ is almost identical to the one shown here.

Footnotes

Guest Editors (Special Issue on Relational Event Models): Carter Butts, Alessandro Lomi, Tom Snijders, Christoph Stadtfeld

1 We include all actors that, within the two-year period, participated in at least five events. To verify their existence and obtain relevant covariates, we compared them first to data collected by Gade et al. (Reference Gade, Hafez and Gabbay2019) and then to various sources including news media reporting. We omitted two actors on which we could not find any information as well as actor aggregations such as “rioters” or “syrian rebels.”

2 To capture new events instead of repeated observations of the same event, we omit events where the most recent previous interaction between a and b occurred less than 20 min before.

3 The full replication code is provided under the following repository: https://github.com/corneliusfritz/Replication-Code-All-that-Glitters.

4 We symmetrized the friendship network, that is, if student $a$ nominated student $b$ as a close friend, we assume that the relationship is reciprocated.

5 See Vu et al. (Reference Vu, Asuncion, Hunter and Smyth2011b) for further information on egocentric models.

References

Bauer, V., Harhoff, D., & Kauermann, G. (2021). A smooth dynamic network model for patent collaboration data. In AStA advances in statistical analysis. Google Scholar
Blair, R. A., & Sambanis, N. (2020). Forecasting civil wars: Theory and structure in an age of “big data". Journal of Conflict Resolution, 64(10), 18851915.CrossRefGoogle Scholar
Borgatti, S. P., Mehra, A., Brass, D. J., & Labianca, G. (2009). Network analysis in the social sciences. Science, 323(5916), 892895.CrossRefGoogle ScholarPubMed
Butters, R., & Hare, C. (2020). Polarized networks? New evidence on American voters’ political discussion networks. Political Behavior.Google Scholar
Butts, C. T. (2008a). A relational event framework for social action. Sociological Methodology, 38(1), 155200.CrossRefGoogle Scholar
Butts, C. T. (2008b). Social network analysis: a methodological introduction. Asian Journal of Social Psychology, 11(1), 1341.CrossRefGoogle Scholar
Casella, G., & Berger, R. (2001). Statistical inference. Belmont: Brookls/Cole.Google Scholar
Celeux, G., Chauveau, D., & Diebolt, J. (1996). Stochastic versions of the EM algorithm: An experimental study in the mixture case. Journal of Statistical Computation and Simulation, 55(4), 287314.CrossRefGoogle Scholar
Cox, D. R. (1972). Regression models and life-tables. Journal of the Royal Statistical Society. Series B (Methodological), 34(2), 187202.CrossRefGoogle Scholar
Daley, D. J., & Vere-Jones, D. (2008). An introduction to the theory of point processes: Volume I: Elementary Theory and Methods. New York: Springer.Google Scholar
Dawkins, S. (2020). The problem of the missing dead. Journal of Peace Research (OnlineFirst). Google Scholar
de Boor, C. (2001). A practical guide to splines. New York: Springer.Google Scholar
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B (Methodological), 39(1), 122.Google Scholar
Diebolt, J., & Robert, C. P. (1994). Estimation of finite mixture distributions through bayesian sampling. Journal of the Royal Statistical Society: Series B (Methodological), 56(2), 363375.Google Scholar
Dorff, C., Gallop, M., & Minhas, S. (2020). Networks of violence: Predicting conflict in nigeria. The Journal of Politics, 82(2), 476493.CrossRefGoogle Scholar
DuBois, C., Butts, C. T., McFarland, D., & Smyth, P. (2013). Hierarchical models for relational event sequences. Journal of Mathematical Psychology, 57(6), 297309.CrossRefGoogle Scholar
Eagle, N., & Pentland, A. (2006). Reality mining: Sensing complex social systems. Personal and Ubiquitous Computing, 10(4), 255268.CrossRefGoogle Scholar
Eilers, P. H., & Marx, B. D. (1996). Flexible smoothing with B-splines and penalties. Statistical Science, 11(2), 89102.CrossRefGoogle Scholar
Elmer, T., Chaitanya, K., Purwar, P., & Stadtfeld, C. (2019). The validity of RFID badges measuring face-to-face interactions. Behavior Research Methods, 51(5), 21202138.CrossRefGoogle ScholarPubMed
Elmer, T., & Stadtfeld, C. (2020). Depressive symptoms are associated with social isolation in face-to-face interaction networks. Scientific Reports, 10(1), 1009.CrossRefGoogle ScholarPubMed
Etezadi-Amoli, J., & Ciampi, A. (1987). Extended hazard regression for censored survival data with covariates: A spline approximation for the baseline hazard function. Biometrics, 43(1), 181192.CrossRefGoogle Scholar
Fjelde, H., & Hultman, L. (2014). Weakening the enemy: A disaggregated study of violence against civilians in Africa. Journal of Conflict Resolution, 58(7), 12301257.CrossRefGoogle Scholar
Fritz, C., Thurner, P. W., & Kauermann, G. (2021). Separable and semiparametric network-based counting processes applied to the international combat aircraft trades. Network Science (OnlineFirst). Google Scholar
Gade, E. K., Hafez, M. M., & Gabbay, M. (2019). Fratricide in rebel movements: A network analysis of syrian militant infighting. Journal of Peace Research, 56(3), 321335.CrossRefGoogle Scholar
Gelfand, A. E., Ghosh, S. K., Christiansen, C., Soumerai, S. B., McLaughlin, T., & J (2000). Proportional hazards models: A latent competing risk approach. Journal of the Royal Statistical Society: Series C (Applied Statistics), 49(3), 385397.Google Scholar
Heckman, J. J., & Honoré, B. E. (1989). The identifiability of the competing risks model. Biometrika, 76(2), 325330.CrossRefGoogle Scholar
Jäger, K. (2018). The limits of studying networks via event data: Evidence from the ICEWS dataset. Journal of Global Security Studies, 3(4), 498511.CrossRefGoogle Scholar
Kalbfleisch, J. D., & Prentice, R. L. (2002). The statistical analysis of failure time data, Wiley Series in Probability and Statistics, Hoboken: Wiley.CrossRefGoogle Scholar
Kauffmann, M. (2020). Databases for defence studies. In: D. Deschaux-Dutard, (Ed.), Research methods in defence studies (pp. 129150). London: Routledge.CrossRefGoogle Scholar
King, G., & Lowe, W. (2003). An automated information extraction tool for international conflict data with performance as good as human coders: A rare events evaluation design. International Organization, 57(3), 617642.CrossRefGoogle Scholar
Lerner, J., Lomi, A., Mowbray, J., Rollings, N., & Tranmer, M. (2021). Dynamic network analysis of contact diaries. Social Networks, 66, 224236.CrossRefGoogle Scholar
Little, R. J. A., & Rubin, D. B. (2002). Statistical analysis with missing data. Hoboken: John Wiley & Sons, Inc.CrossRefGoogle Scholar
Madan, A., Cebrian, M., Moturu, S., Farrahi, K., & Pentland, A. S. (2012). Sensing the health state of a community. IEEE Pervasive Computing, 11(4), 3645.CrossRefGoogle Scholar
Malang, T., Brandenberger, L., & Leifeld, P. (2019). Networks and social influence in European legislative politics. British Journal of Political Science, 49(4), 14751498.CrossRefGoogle Scholar
McPherson, M., Smith-Lovin, L., & Cook, J. M. (2001). Birds of a feather: Homophily in social networks. Annual Review of Sociology, 27(1), 415444.CrossRefGoogle Scholar
Newman, M. E., & Park, J. (2003). Why social networks are different from other types of networks. Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, 68(3), 8.Google ScholarPubMed
Noghrehchi, F., Stoklosa, J., Penev, S., & Warton, D. I. (2021). Selecting the model for multiple imputation of missing data: just use an IC!. Statistics in Medicine, 40(10), 24672497.CrossRefGoogle ScholarPubMed
Perry, P. O., & Wolfe, P. J. (2013). Point process modelling for directed interaction networks. Journal of the Royal Statistical Society. Series B (Methodological), 75(5), 821849.CrossRefGoogle Scholar
Pischedda, C. (2018). Wars within wars: Why windows of opportunity and vulnerability cause inter-rebel fighting in internal conflicts. International Security, 43(1), 138176.CrossRefGoogle Scholar
Popovic, M. (2018). Inter-rebel alliances in the shadow of foreign sponsors. International Interactions, 44(4), 749776.CrossRefGoogle Scholar
Raleigh, C., Linke, A., Hegre, H., & Karlsen, J. (2010). Introducing ACLED: An armed conflict location and event dataset. Journal of Peace Research, 47(5), 651660.CrossRefGoogle Scholar
Rivera, M. T., Soderstrom, S. B., & Uzzi, B. (2010). Dynamics of dyads in social networks: Assortative, relational, and proximity mechanisms. Annual Review of Sociology, 36(1), 91115.CrossRefGoogle Scholar
Robins, G., Snijders, T., Wang, P., Handcock, M., & Pattison, P. (2007). Recent developments in exponential random graph (p*) models for social networks. Social Networks, 29(2), 192215.CrossRefGoogle Scholar
Rubin, D. B. (1976). Inference and missing data. Biometrika, 63(3), 581592.CrossRefGoogle Scholar
Rubin, D. B. (1987). Multiple imputation for nonresponse in surveys. New York: Wiley.CrossRefGoogle Scholar
Ruppert, D., Wand, M., & Carroll, R. J. (2003). Semiparametric regression. Cambridge: Cambridge University Press.CrossRefGoogle Scholar
Stadtfeld, C. (2012). Events in social networks: A stochastic actor-oriented framework for dynamic event processes in social networks, Ph. D. thesis. KIT.Google Scholar
Stadtfeld, C., & Block, P. (2017). Interactions, actors, and time: Dynamic network actor models for relational events. Sociological Science, 4(14), 318352.CrossRefGoogle Scholar
Stadtfeld, C., Hollway, J., & Block, P. (2017). Dynamic network actor models: Investigating coordination ties through time. Sociological Methodology, 47(1), 140.CrossRefGoogle Scholar
Tanner, M. A., & Wong, W. H. (1987). The calculation of posterior distributions by data augmentation. Journal of the American Statistical Association, 82(398), 528540.CrossRefGoogle Scholar
Tranmer, M., Marcum, C. S., Morton, F. B., Croft, D. P., & de Kort, S. R. (2015). Using the relational event model (rem) to investigate the temporal dynamics of animal social networks. Animal Behaviour, 101(6), 99105.CrossRefGoogle ScholarPubMed
Tsiatis, A. (1975). A nonidentifiability aspect of the problem of competing risks. Proceedings of the National Academy of Sciences of the United States of America, 72(1), 2022.CrossRefGoogle ScholarPubMed
Vu, D., Pattison, P., & Robins, G. (2015). Relational event models for social learning in MOOCs. Social Networks, 43, 121135.CrossRefGoogle Scholar
Vu, D. Q., Asuncion, A. U., Hunter, D. R., & Smyth, P. (2011a). Continuous-time regression models for longitudinal networks. In Proceedings of the 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011 (pp. 24922500).Google Scholar
Vu, D. Q., Asuncion, A. U., Hunter, D. R., & Smyth, P. (2011b). Dynamic egocentric models for citation networks. In Proceedings of the 28th International Conference on Machine Learning. In ICML (pp. 857864).Google Scholar
Wasserman, S., & Faust, K. (1994). Social network analysis: Methods and applications. Cambridge: Cambridge University Press.CrossRefGoogle Scholar
Weidmann, N. B. (2015). On the accuracy of media-based conflict event data. Journal of Conflict Resolution, 59(6), 11291149.CrossRefGoogle Scholar
Wood, S. N. (2006). On confidence intervals for generalized additive models based on penalized regression splines. Australian and New Zealand Journal of Statistics, 48(4), 445464.CrossRefGoogle Scholar
Wood, S. N. (2011). Fast stable restricted maximum likelihood and marginal likelihood estimation of semiparametric generalized linear models. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 73(1), 336.CrossRefGoogle Scholar
Wood, S. N. (2017). Generalized additive models: An introduction with R. Boca Raton: CRC Press.CrossRefGoogle Scholar
Wood, S. N. (2020). Inference and computation with generalized additive models and their extensions. Test, 29(2), 307339.CrossRefGoogle Scholar
Figure 0

Figure 1. Graphical illustrations of endogenous and exogenous covariates. Solid lines represent past interactions, while dotted lines are possible but unrealized events. Node coloring indicates the node’s value on a categorical covariate. The relative risk of the events in the second row compared to the events in the first row is $\exp \{\theta _{end}\}$ if all other covariates are fixed, where $\theta _{end}$ is the coefficient of the respective statistic of each row.

Figure 1

Figure 2. Graphical illustration of a possible path of the counting process of observed events ($N_{ab}(t)$) between actors $a$ and $b$ that encompasses spurious ($N_{ab,0}(t)$) and true events ($N_{ab,1}(t)$).

Figure 2

Table 1. Result of the simulation study for the REMSE and REM with the two data-generating processes (DG 1, DG 2). For each DG and covariate, we note the AVE (AVerage Estimate), RMSE (Root-Mean-Squared Error), and CP (Coverage Probability). We report the average Percentage of False Events (PFE) for each DG in the last row

Figure 3

Table 2. Descriptive information on the two analyzed data sets

Figure 4

Table 3. Combat events in the Syrian civil war: Estimated coefficients with confidence intervals noted in brackets in the first column, while the Z values are given in the second column. The results of the REMSE are given in the first two columns, while the coefficients of the REM are depicted in the last two columns. The last row reports the estimated average Percentage of False Events (PFE)

Figure 5

Table 4. Co-location Events in University Housing: Estimated coefficients with confidence intervals noted in brackets in the first column, while the Z values are given in the second column. The results of the REMSE are given in the first two columns, while the coefficients of the REM are depicted in the last two columns. The last row reports the estimated average Percentage of False Events (PFE)