GAGiuseppe Arena

Giuseppe Arena

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Giuseppe Arena has a total of 60 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The Prevalence of Bayesian Inference, Preregistration, and Open Data in Psychology, 2004-2024

    by Julius M. Pfadt, František Bartoš, Henrik R. Godmann, Meike Waaijers, Laura Groot, Ihnwhi Heo, Lotte Mensink, Jason Nak, Jan Peter De Ruiter, Alexandra Sarafoglou, et al.

    Psychology has undergone substantial methodological changes in the past two decades. We tracked the adoption of Bayesian inference and two open science practices across 28,738 articles from six ‘top-tier’ (15,634 articles) and six ‘mid-tier’ (13,104 articles) psychology journals in 2004–2024. In ‘top-tier’ journals, human (50%) and LLM-assisted (50%) full-text coding revealed that in 2024, 26% of articles reported a Bayesian analysis, 41% included a preregistration, and 73% provided open data. In ‘mid-tier’ journals, LLM coding showed corresponding rates of 16%, 18%, and 40%. From 2004 to 2012, these practices were virtually nonexistent. Bayesian logistic growth modeling suggests further increases, although their extent remains uncertain. Mixed-effects models became more prevalent, software reporting improved, with greater use of R and less reliance on SPSS, but estimation-focused (vs. hypothesis-testing-focused) reporting showed only modest gains. Despite heterogeneity across journals, psychology articles published in 2024 differ markedly from those published only a decade earlier.

  • dmrfit: Scalable Bayesian Inference for Discrete Markov Random Fields

    by Giuseppe Arena

    Estimation of discrete Markov random fields through the pseudo-likelihood, for both Ising models (Ising (1925) ) and ordinal Markov random fields (Marsman et al. (2025) ). Point estimates, either maximum pseudo-likelihood or maximum a posteriori, are obtained through a trust region optimization algorithm, with robust standard errors from the Godambe-Huber-White (GHW, or sandwich) estimator, for both full and constrained network structures. Bayesian inference corrects the pseudo-posterior through coordinate rescaling (Arena and Marsman (2026) ), which matches its covariance to the GHW covariance, and samples from it with the Fisher adaptive Metropolis-adjusted Langevin algorithm (Titsias (2024) ). For comparison, the posterior based on the full likelihood can also be sampled, exactly for small networks or with the double Metropolis-Hastings algorithm (Liang (2010) ). Savage-Dickey Bayes factors test each pairwise interaction, computed either by sampling importance resampling (Skare et al. (2003) ) or from the posterior draws.

  • Open Access

    A Stochastic Block Prior for Clustering in Graphical Models

    by Nikola Sekulovski, Giuseppe Arena, Jonas M B Haslbeck, Karoline Huth, Nial Friel, Maarten Marsman

    Graphical models facilitate the representation of psychological variables as complex systems of interacting variables structured as a network. However, their current statistical estimation procedures overlook the assumption of clustering, which refers to the grouping of subsets of variables that are more densely connected within the network, despite this assumption playing a central role in many psychological theories. We address this gap by proposing the use of the Stochastic Block Model (SBM) as a prior distribution on the network structure of a graphical model for binary and ordinal data. The SBM assumes that variables belong to latent clusters, where the probability of an edge depends on the cluster membership of the nodes. Embedding this prior in a Bayesian graphical modeling framework allows researchers to formally incorporate theoretical expectations about clustering, test hypotheses about the number of clusters, and estimate cluster assignments from cross-sectional data. We demonstrate the benefits of this approach in a simulation study and reanalyze 30 openly available empirical datasets to test for clustering. This work highlights how the Bayesian framework can embed theoretical assumptions into network models via priors and introduces a new tool for latent cluster inference in psychological network analysis.

  • Open Access

    LLM-Based Prior Elicitation for Bayesian Graphical Modeling

    by Nikola Sekulovski, Meike Waaijers, Giuseppe Arena

    In the Bayesian Graphical Modeling framework, priors on network structureencode theoretical assumptions and uncertainty about the topology of psychologicalconstructs under study. For instance, the Bernoulli prior specifiesthe probability of each pairwise interaction, the Beta–Bernoulli prior governsexpected network density, and the Stochastic Block prior models clustering.In practice, however, specifying informed hyperparameters is challenging:theoretical guidance is limited, and default choices can be overly simplisticor restrictive. To address this, we introduce an LLM-based prior elicitationframework in which a large language model provides inclusion judgments foreach variable pair. These judgments are converted into edge-specific priorprobabilities for the Bernoulli prior and used to derive hyperparameters forthe Beta–Bernoulli and Stochastic Block priors. To make the approach accessible,we provide an R package, bgmElicit, with a Shiny app implementingthe methodology. We illustrate the framework in two examples. First, avalidation on a subset of a PTSD network from a meta-analysis comparesOpenAI GPT models across several conditions. Second, an empirical analysisof 17 PTSD symptoms shows that elicited priors can modestly strengthenevidence regarding edge presence and absence. Taken together, this work isa proof of concept, complementary to expert judgment and prior sensitivitychecks.

  • Open Access

    Weighting the past: an extended relational event model for negative and positive events

    by Giuseppe Arena, Joris Mulder, Roger T A J Leenders

    In relational event networks, the sentiment of each social interaction describes a qualitative characteristic of the relational event. The additional information about the sentiment of an event allows the researcher to better understand social interaction in temporal social networks. To achieve this, this paper introduces a modelling framework called SentiREM, which extends the standard relational event model by (i) including a logistic regression model for the type (or sentiment) of the next event given the observed dyad, (ii) including typed endogenous statistics which summarize the past event history including their type, and (iii) including memory parameters, which capture the decay of the weight of past events as a function of their transpired time and their type/sentiment, which are estimated from the data. We discuss how to estimate the model parameters, test hypotheses on the memory parameters and model coefficients of different event types, and learn how long past events are ‘remembered’ depending on their type/sentiment and transpired time. The proposed SentiREM is applied to an empirical case study to analyse social interactions between players in an online strategy game where positive and negative relational events (i.e. trades and attacks, respectively) were observed among players.


  • remstats: Computes Statistics for Relational Event History Data

    by Giuseppe Arena, Marlyne Meijerink-Bosman, Joris Mulder

  • Open Access

    How fast do we forget our past social interactions? Understanding memory retention with parametric decays in relational event models

    by Giuseppe Arena, Joris Mulder, Roger Th. A.J. Leenders

    In relational event networks, endogenous statistics are used to summarize the past activity between actors. Typically, it is assumed that past events have equal weight on the social interaction rate in the (near) future regardless of the time that has transpired since observing them. Generally, it is unrealistic to assume that recently past events affect the current event rate to an equal degree as long-past events. Alternatively one may consider using a prespecified decay function with a prespecified rate of decay. A problem then is that the chosen decay function could be misspecified yielding biased results and incorrect conclusions. In this paper, we introduce three parametric weight decay functions (exponential, linear, and one-step) that can be embedded in a relational event model. A statistical method is presented to decide which memory decay function and memory parameter best fit the observed sequence of events. We present simulation studies that show the presence of bias in the estimates of effects of the statistics whenever the decay, as well as the memory parameter, are not properly estimated, and the ability to test different memory models against each other using the Bayes factor. Finally, we apply the methodology to two empirical case studies.


  • Data Analytics in Action

    by Gerard Schouten, Giuseppe Arena, Frederique van Leeuwen, Petra Heck, Joris Mulder, Rick Aalbers, Roger Leenders, Florian Böing-Messing