pith. sign in

arxiv: 2606.07680 · v1 · pith:Z7G6LZGTnew · submitted 2026-06-04 · 📊 stat.ME · cs.SI

A Counting Process View of Relational Event Models: Practical Asymptotics

Pith reviewed 2026-06-27 23:50 UTC · model grok-4.3

classification 📊 stat.ME cs.SI
keywords relational event modelscounting processesasymptotic normalitycox modelsmaximum likelihood estimationnetwork dynamicsdyadic interactions
0
0 comments X

The pith

Relational event models achieve asymptotic normality of maximum likelihood estimators when represented as counting processes under limits on network size or observation time.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Relational Event Models analyze continuous-time sequences of interactions between pairs of actors while incorporating history-dependent effects such as reciprocity. The paper establishes that representing these models as counting processes allows standard martingale results to deliver asymptotic normality for the estimators in three regimes: network size growing large, observation period growing long, or both. It focuses on Cox-type multiplicative intensity models and spells out the conditions under which the required regularity assumptions hold. Simulations then show how practical modeling decisions, including the choice of temporal windows and logarithmic transformations, influence coverage and convergence in finite samples. The work supplies concrete guidelines for applying the models to real data.

Core claim

By embedding relational event models in the counting process framework, the maximum likelihood estimator for Cox-type multiplicative intensity models is asymptotically normal as the network size n, the observation time T, or both tend to infinity, provided the usual regularity conditions for counting processes hold, such as predictable variation processes converging appropriately and no explosive behavior.

What carries the argument

The counting process representation of the relational event intensity, which converts the likelihood into a product-integral form and permits application of martingale central limit theorems to the score process.

If this is right

  • Asymptotic normality holds in each of the three separate limits (n to infinity, T to infinity, or joint) when the corresponding conditions on the predictable variation are met.
  • Choices such as temporal windowing and log transformations of covariates directly affect finite-sample coverage and should be tuned accordingly.
  • The same counting-process argument extends to models that include history dependence such as triadic closure or reciprocity.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • For networks of moderate size the joint n-and-T limit may offer the most robust finite-sample behavior.
  • The counting-process approach could be used to derive similar asymptotic results for other point-process formulations of social interaction data.

Load-bearing premise

The intensity processes and observation scheme satisfy the regularity conditions required for the martingale central limit theorem to apply in the chosen asymptotic regime.

What would settle it

Simulations in which the empirical coverage of asymptotic confidence intervals fails to approach the nominal level, or the estimator bias does not shrink, as n or T is increased would indicate that the regularity conditions do not hold for the data-generating processes considered.

read the original abstract

Relational Event Models (REMs) provide a rigorous framework for analyzing dyadic interactions observed in continuous time, capturing history-dependent dynamics such as triadic closure and reciprocity. Framing REMs through the lens of counting processes embeds the model in a rich theoretical foundation, facilitating its mathematical analysis. While Maximum Likelihood Estimation (MLE) is standard practice for estimating these models, the underlying statistical guarantees rely on specific asymptotic regimes, namely, whether the network size (n), the observational period (T), or both approach infinity. We review the theoretical foundations of such counting-process-based models, formalizing the core assumptions required to achieve asymptotic normality across these different limits. With a specific focus on Cox-type multiplicative models, we detail the circumstances under which these assumptions hold. Supported by simulation studies, we illustrate how structural modeling choices, including temporal windowing and logarithmic transformations, affect empirical coverage and estimator convergence. We thereby derive several guiding principles for specifying such models in realistic contexts, bridging theory and practice.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript reviews the counting-process formulation of Relational Event Models (REMs) for dyadic interaction data. It formalizes the assumptions needed for asymptotic normality of maximum-likelihood estimators in Cox-type multiplicative intensity models under three regimes (n o∞ with fixed T, T o∞ with fixed n, and joint n,T o∞). Simulation experiments examine the finite-sample consequences of modeling decisions such as temporal windowing and logarithmic transformations of covariates, from which the authors extract practical guidelines for specification.

Significance. If the review of the counting-process assumptions is accurate and the simulations reliably illustrate the regimes in which the asymptotics are useful, the paper supplies a convenient reference that links standard martingale theory to applied REM practice. The emphasis on concrete modeling choices that affect coverage is a constructive contribution for users of these models.

minor comments (3)
  1. [Simulation studies] The simulation section would benefit from an explicit statement of the data-generating intensity and the precise definition of the temporal windowing operator; without these, it is difficult to judge how representative the reported coverage probabilities are of the three asymptotic regimes.
  2. Several figures display point estimates of coverage without accompanying Monte Carlo standard errors or interval estimates; adding these would strengthen the visual comparison across regimes.
  3. [Theoretical foundations] The notation for the compensator and the predictable variation process in the counting-process setup could be cross-referenced to a standard reference (e.g., Andersen et al.) to aid readers less familiar with the martingale framework.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the constructive summary and positive assessment of the manuscript's contribution as a reference linking martingale theory to applied REM practice. The recommendation for minor revision is noted, and we will incorporate any editorial suggestions in the revised version.

Circularity Check

0 steps flagged

No significant circularity; review of standard counting-process theory

full rationale

The paper positions itself as a review that formalizes core assumptions from existing counting-process theory for asymptotic normality of Cox-type REM estimators under n→∞, T→∞, and joint limits. It draws on prior literature for the theoretical foundations rather than claiming new derivations. No load-bearing step reduces by construction to a fitted parameter, self-defined quantity, or self-citation chain; the simulation studies are presented as illustrative rather than as the source of the asymptotic claims. The work is self-contained against external benchmarks in the counting-process literature.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No concrete free parameters, axioms, or invented entities can be identified from the abstract alone; the work relies on standard counting-process assumptions whose details are not supplied here.

pith-pipeline@v0.9.1-grok · 5696 in / 1026 out tokens · 21029 ms · 2026-06-27T23:50:16.974402+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

44 extracted references · 30 canonical work pages

  1. [1]

    Science323, 721–723 (2009) https://doi.org/10.1126/science.1167742

    Lazer, D., Pentland, A., Adamic, L., Aral, S., Barab´ asi, A.L., Brewer, D., Chris- takis, N., Contractor, N., Fowler, J., Gutmann, M., Jebara, T., King, G., Macy, M., Roy, D., Van Alstyne, M.: Computational social science. Science323, 721–723 (2009) https://doi.org/10.1126/science.1167742

  2. [2]

    Nature595(7866), 197–204 (2021) https://doi.org/10.1038/s41586-021-03666-1

    Wagner, C., Strohmaier, M., Olteanu, A., Kıcıman, E., Contractor, N., Eliassi- Rad, T.: Measuring algorithmically infused societies. Nature595(7866), 197–204 (2021) https://doi.org/10.1038/s41586-021-03666-1

  3. [3]

    Asian Jour- nal of Social Psychology11, 13–41 (2008) https://doi.org/10.1111/j.1467-839X

    Butts, C.T.: Social network analysis: A methodological introduction. Asian Jour- nal of Social Psychology11, 13–41 (2008) https://doi.org/10.1111/j.1467-839X. 2007.00241.x

  4. [4]

    American Journal of Sociology123(3), 850–910 (2017) https: //doi.org/10.1086/693704

    Kitts, J.A., Lomi, A., Mascia, D., Pallotti, F., Quintane, E.: Investigating the temporal dynamics of interorganizational exchange: Patient transfers among Ital- ian hospitals. American Journal of Sociology123(3), 850–910 (2017) https: //doi.org/10.1086/693704

  5. [5]

    Network Science11(2), 295–323 (2023) https://doi.org/10.1017/nws

    Renshaw, S.L., Livas, S.M., Petrescu-Prahova, M.G., Butts, C.T.: Modeling com- plex interactions in a disrupted environment: Relational events in the WTC response. Network Science11(2), 295–323 (2023) https://doi.org/10.1017/nws. 2023.4

  6. [6]

    Fritz, C., Rastelli, R., Fop, M., Alberto, Caimo.: Scalable durational event models: Application to physical and digital interactions (2025) https://doi.org/10.48550/ arXiv.2504.00049

  7. [7]

    doi: 10.1016/j

    Espinosa-Rada, A., Lerner, J., Fritz, C.: Socio-cognitive networks between researchers: Investigating scientific dualities with the group-oriented relational hyperevent model. Social Networks83, 1–13 (2025) https://doi.org/10.1016/j. socnet.2025.04.005

  8. [8]

    Statistica Neerlandica74(3), 275–299 (2020) https://doi.org/10.1111/stan.12198

    Fritz, C., Lebacher, M., Kauermann, G.: Tempus volat, hora fugit: A survey of tie-oriented dynamic network models in discrete and continuous time. Statistica Neerlandica74(3), 275–299 (2020) https://doi.org/10.1111/stan.12198

  9. [9]

    Annual Review of Statistics and Its Application11, 297–319 (2024) https://doi

    Bianchi, F., Filippi-Mazzola, E., Lomi, A., Wit, E.C.: Relational Event Modeling. Annual Review of Statistics and Its Application11, 297–319 (2024) https://doi. org/10.1146/annurev-statistics-040722-060248

  10. [10]

    American Sociological Review69(3), 319–344 (2004) https://doi

    Uzzi, B., Lancaster, R.: Embeddedness and Price Formation in the Corporate Law Market. American Sociological Review69(3), 319–344 (2004) https://doi. org/10.1177/000312240406900301 16

  11. [11]

    American Sociological Review 61(4), 674–698 (1996) https://doi.org/10.2307/2096399

    Uzzi, B.: The Sources and Consequences of Embeddedness for the Economic Per- formance of Organizations: The Network Effect. American Sociological Review 61(4), 674–698 (1996) https://doi.org/10.2307/2096399

  12. [12]

    Cambridge University Press, Cambridge (1994)

    Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)

  13. [13]

    American Journal of Sociology77, 1205–1209 (1972)

    Holland, P.W., Leinhardt, S.: Some evidence on the transitivity of positive interpersonal sentiment. American Journal of Sociology77, 1205–1209 (1972)

  14. [14]

    Network Science11(Special Issue

    Fritz, C., Mehrl, M., Thurner, P.W., Kauermann, G.: All that glitters is not gold: Relational events models with spurious events. Network Science11(Special Issue

  15. [15]

    (2023) https://doi.org/10.1017/nws.2022.22

  16. [16]

    Computational Statistics & Data Analysis, 108428 (2026) https://doi.org/10.1016/j.csda.2026.108428

    Leifeld, P., Wong, J.S.T.: Fully bayesian estimation of temporal decay in ordinal relational event models. Computational Statistics & Data Analysis, 108428 (2026) https://doi.org/10.1016/j.csda.2026.108428

  17. [17]

    Social Networks35(4), 528–540 (2013) https://doi.org/10.1016/j.socnet.2013.07.001

    Quintane, E., Pattison, P.E., Robins, G.L., Mol, J.M.: Short- and long-term sta- bility in organizational networks: Temporal structures of project teams. Social Networks35(4), 528–540 (2013) https://doi.org/10.1016/j.socnet.2013.07.001

  18. [18]

    Animal Behaviour101, 99–105 (2015) https://doi.org/10.1016/ j.anbehav.2014.12.005

    Tranmer, M., Marcum, C.S., Morton, F.B., Croft, D.P., De Kort, S.R.: Using the relational event model (REM) to investigate the temporal dynamics of animal social networks. Animal Behaviour101, 99–105 (2015) https://doi.org/10.1016/ j.anbehav.2014.12.005

  19. [19]

    Journal of the Royal Statistical Society

    Perry, P.O., Wolfe, P.J.: Point process modelling for directed interaction networks. Journal of the Royal Statistical Society. Series B (Statistical Methodology)75(5), 821–849 (2013) https://doi.org/10.1111/rssb.12013

  20. [20]

    The Annals of Statistics10(4), 1100–1120 (1982) https://doi.org/ 10.1214/aos/1176345976

    Andersen, P.K., Gill, R.D.: Cox’s regression model for counting processes: A large sample study. The Annals of Statistics10(4), 1100–1120 (1982) https://doi.org/ 10.1214/aos/1176345976

  21. [21]

    Springer, New York (1993)

    Andersen, P.K., Borgan, Ø., Gill, R.D., Keiding, N.: Statistical Models Based on Counting Processes. Springer, New York (1993)

  22. [22]

    Springer, New York, NY (2008)

    Aalen, O.O., Borgan, Ø., Gjessing, H.K.: Survival and Event History Analysis. Springer, New York, NY (2008). https://doi.org/10.1007/978-0-387-68560-1

  23. [23]

    American Journal of Sociology110(6), 1561–1597 (2005) https: //doi.org/10.1086/428689

    Gibson, D.R.: Taking Turns and Talking Ties: Networks and Conversational Interaction1. American Journal of Sociology110(6), 1561–1597 (2005) https: //doi.org/10.1086/428689

  24. [24]

    Biometrika58(1), 83–90 (1971) https://doi.org/10.2307/2334319 17

    Hawkes, A.G.: Spectra of some self-exciting and mutually exciting point processes. Biometrika58(1), 83–90 (1971) https://doi.org/10.2307/2334319 17

  25. [25]

    Journal of Computational and Graphical Statistics , volume =

    Passino, F.S., Heard, N.A.: Mutually exciting point process graphs for modeling dynamic networks. Journal of Computational and Graphical Statistics32(1), 116– 130 (2023) https://doi.org/10.1080/10618600.2022.2096048

  26. [26]

    In: Neural Information Processing Systems (2011)

    Vu, D.Q., Asuncion, A., Hunter, D.R., Smyth, P.: Continuous-Time Regression Models for Longitudinal Networks. In: Neural Information Processing Systems (2011)

  27. [27]

    In: International Conference on Machine Learning, pp

    Soliman, H., Zhao, L., Huang, Z., Paul, S., Xu, K.S.: The Multivariate Community Hawkes Model for Dependent Relational Events in Continuous-time Networks. In: International Conference on Machine Learning, pp. 20329–20346 (2022)

  28. [28]

    Turnbull, S

    Fang, G., Xu, G., Xu, H., Zhu, X., Guan, Y.: Group Network Hawkes Pro- cess. Journal of the American Statistical Association119(547), 2328–2344 (2024) https://doi.org/10.1080/01621459.2023.2257889

  29. [29]

    Sociological Methodology3, 155–200 (2008) https://doi.org/10.1111/j.1467-9531.2008.00203

    Butts, C.T.: A Relational Event Framework for Social Action. Sociological Methodology3, 155–200 (2008) https://doi.org/10.1111/j.1467-9531.2008.00203. x

  30. [30]

    Electronic Journal of Statistics13(2), 2764–2829 (2019) https://doi.org/10.1214/19-EJS1588

    Kreiß, A., Mammen, E., Polonik, W.: Nonparametric inference for continuous- time event counting and link-based dynamic network models. Electronic Journal of Statistics13(2), 2764–2829 (2019) https://doi.org/10.1214/19-EJS1588

  31. [31]

    In: Proceedings of the 28th International Conference on Machine Learning (2011)

    Vu, D.Q., Asuncion, A., Hunter, D.R., Smyth, P.: Dynamic egocentric models for citation networks. In: Proceedings of the 28th International Conference on Machine Learning (2011)

  32. [32]

    Network Science9(3), 291–311 (2021) https://doi.org/10.1017/nws.2021.9

    Fritz, C., Thurner, P.W., Kauermann, G.: Separable and semiparametric network- based counting processes applied to the international combat aircraft trades. Network Science9(3), 291–311 (2021) https://doi.org/10.1017/nws.2021.9

  33. [33]

    McCullagh, P.: What is a statistical model? The Annals of Statistics30(5), 1225– 1310 (2002) https://doi.org/10.1214/aos/1035844977

  34. [34]

    Lifetime Data Analysis16(4), 525–546 (2010) https: //doi.org/10.1007/s10985-010-9180-y

    Gjessing, H.K., Røysland, K., Pena, E.A., Aalen, O.O.: Recurrent events and the exploding Cox model. Lifetime Data Analysis16(4), 525–546 (2010) https: //doi.org/10.1007/s10985-010-9180-y

  35. [35]

    Probability Theory and Stochastic Modelling

    Kallenberg, O.: Foundations of Modern Probability, 3rd edn. Probability Theory and Stochastic Modelling. Springer, Switzerland (2021). https://doi.org/10.1007/ 978-3-030-61871-1

  36. [36]

    Sociological Science4, 318–352 (2017) https://doi

    Stadtfeld, C., Block, P.: Interactions, actors, and time: Dynamic network actor models for relational events. Sociological Science4, 318–352 (2017) https://doi. org/10.15195/v4.a14 18

  37. [37]

    In: Advances in Social Network Analysis and Mining, pp

    Brandes, U., Lerner, J., Snijders, T.A.B.: Networks evolving step by step: Statis- tical analysis of dyadic event data. In: Advances in Social Network Analysis and Mining, pp. 200–205. IEEE, ??? (2009)

  38. [38]

    Fritz, C.: Redeem: Relational Event and Durational Event Models. (2026). R package version 1.0.0. https://corneliusfritz.github.io/redeem/

  39. [39]

    Statistical Applications in Genetics and Molecular Biology8(1), 21 (2009) https: //doi.org/10.2202/1544-6115.1438

    Tibshirani, R.J.: Univariate shrinkage in the cox model for high dimensional data. Statistical Applications in Genetics and Molecular Biology8(1), 21 (2009) https: //doi.org/10.2202/1544-6115.1438

  40. [40]

    Statistica Sinica31(1), 243–267 (2021) https://doi.org/10.5705/ss

    Yu, Y., Bradic, J., Samworth, R.J.: Confidence intervals for high-dimensional cox models. Statistica Sinica31(1), 243–267 (2021) https://doi.org/10.5705/ss. 202018.0247

  41. [41]

    Journal of the American Statistical Association95(450), 449–465 (2000)

    Murphy, S.A., Vaart, A.W.: On profile likelihood. Journal of the American Statistical Association95(450), 449–465 (2000). Accessed 2026-05-28

  42. [42]

    Journal of the American Statistical Association , volume =

    Hiabu, M., Mammen, E., Mart´ ınez-Miranda, M.D., Nielsen, J.P.: Smooth back- fitting of proportional hazards with multiplicative components. Journal of the American Statistical Association116(536), 1983–1993 (2021) https://doi.org/10. 1080/01621459.2020.1753520 https://doi.org/10.1080/01621459.2020.1753520

  43. [43]

    Bischofberger, S.M., Hiabu, M., Mammen, E., Nielsen, J.P.: Smooth backfitting for additive hazard rates. Scandinavian Journal of Statis- tics52(4), 1625–1669 (2025) https://doi.org/10.1111/sjos.70004 https://onlinelibrary.wiley.com/doi/pdf/10.1111/sjos.70004 Acknowledgements.We thank the other organizers and attendees of the workshop New Trends in Statist...

  44. [44]

    We therefore reformulate the assumptions in [20] for this special case when it shortens the formulas

    are formulated for general specifications ofλ i,j(t|θ) while we focus here on λi,j(t|θ) =g(s i,j(t)⊤θ). We therefore reformulate the assumptions in [20] for this special case when it shortens the formulas. Assumption I(Smoothness of the model).The functiongis continuously differen- tiable up to third order. Moreover,ℓ n,T (θ) may be differentiated with re...