Isabella Gollini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Isabella Gollini has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Alberto Caimo
School of Mathematics and Statistics University College Dublin Ireland
3 shared publications Martin Charlton
National Centre for Geocomputation, Maynooth University, Ireland
2 shared publications- Paul Harris
Rothamsted Research, Okehampton, United Kingdom
2 shared publications - Thomas Brendan Murphy
School of Mathematics and Statistics, University College Dublin, Belfield, Dublin, Ireland
2 shared publications Alberto Caimo
Dublin Institute of Technology, School of Mathematical Sciences, Ireland
1 shared publication- Arthur White
Trinity College Dublin
1 shared publication
Latest Publications
- Open Access
- 13 April 2026
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series A: Statistics in Society
Separable models for dynamic signed networks
Signed networks capture the polarity of relationships between nodes, providing valuable insights into complex systems where both supportive and antagonistic interactions play a critical role in shaping the network dynamics. We propose a separable temporal generative framework based on multilayer exponential random graph models, characterized by the assumption of conditional independence between the sign and interaction effects. This structure preserves the flexibly and explanatory power inherent in the binary network specification while adhering to consistent balance theory assumptions. Using a fully probabilistic Bayesian paradigm, we infer the doubly intractable posterior distribution of model parameters via an adaptive Metropolis–Hastings approximate exchange algorithm. We illustrate the interpretability of our model by analysing signed relations among US Senators during Ronald Reagan’s second term (1985–1989). Specifically, we aim to understand whether these relations are consistent and balanced or reflect patterns of supportive or antagonistic alliances.
- 13 April 2026
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series A: Statistics in Society
Open AccessSeparable models for dynamic signed networks
Signed networks capture the polarity of relationships between nodes, providing valuable insights into complex systems where both supportive and antagonistic interactions play a critical role in shaping the network dynamics. We propose a separable temporal generative framework based on multilayer exponential random graph models, characterized by the assumption of conditional independence between the sign and interaction effects. This structure preserves the flexibly and explanatory power inherent in the binary network specification while adhering to consistent balance theory assumptions. Using a fully probabilistic Bayesian paradigm, we infer the doubly intractable posterior distribution of model parameters via an adaptive Metropolis–Hastings approximate exchange algorithm. We illustrate the interpretability of our model by analysing signed relations among US Senators during Ronald Reagan’s second term (1985–1989). Specifically, we aim to understand whether these relations are consistent and balanced or reflect patterns of supportive or antagonistic alliances.
- 1 February 2020
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 142
A multilayer exponential random graph modelling approach for weighted networks
- 1 February 2020
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 142
A multilayer exponential random graph modelling approach for weighted networks
- 7 December 2019
- Published by Springer Nature
- p. 79-91
A Mixture Model Approach for Clustering Bipartite Networks
- 7 December 2019
- Published by Springer Nature
- p. 79-91
A Mixture Model Approach for Clustering Bipartite Networks
- Open Access
A multilayer exponential random graph modelling approach for weighted networks
A new modelling approach for the analysis of weighted networks with ordinal/polytomous dyadic values is introduced. Specifically, it is proposed to model the weighted network connectivity structure using a hierarchical multilayer exponential random graph model (ERGM) generative process where each network layer represents a different ordinal dyadic category. The network layers are assumed to be generated by an ERGM process conditional on their closest lower network layers. A crucial advantage of the proposed method is the possibility of adopting the binary network statistics specification to describe both the between-layer and across-layer network processes and thus facilitating the interpretation of the parameter estimates associated to the network effects included in the model. The Bayesian approach provides a natural way to quantify the uncertainty associated to the model parameters. From a computational point of view, an extension of the approximate exchange algorithm is proposed to sample from the doubly-intractable parameter posterior distribution. A simulation study is carried out on artificial data and applications of the methodology are illustrated on well-known datasets. Finally, a goodness-of-fit diagnostic procedure for model assessment is proposed.
Open AccessA multilayer exponential random graph modelling approach for weighted networks
A new modelling approach for the analysis of weighted networks with ordinal/polytomous dyadic values is introduced. Specifically, it is proposed to model the weighted network connectivity structure using a hierarchical multilayer exponential random graph model (ERGM) generative process where each network layer represents a different ordinal dyadic category. The network layers are assumed to be generated by an ERGM process conditional on their closest lower network layers. A crucial advantage of the proposed method is the possibility of adopting the binary network statistics specification to describe both the between-layer and across-layer network processes and thus facilitating the interpretation of the parameter estimates associated to the network effects included in the model. The Bayesian approach provides a natural way to quantify the uncertainty associated to the model parameters. From a computational point of view, an extension of the approximate exchange algorithm is proposed to sample from the doubly-intractable parameter posterior distribution. A simulation study is carried out on artificial data and applications of the methodology are illustrated on well-known datasets. Finally, a goodness-of-fit diagnostic procedure for model assessment is proposed.
- Open Access
A mixture model approach for clustering bipartite networks
This chapter investigates the latent structure of bipartite networks via a model-based clustering approach which is able to capture both latent groups of sending nodes and latent variability of the propensity of sending nodes to create links with receiving nodes within each group. This modelling approach is very flexible and can be estimated by using fast inferential approaches such as variational inference. We apply this model to the analysis of a terrorist network in order to identify the main latent groups of terrorists and their latent trait scores based on their attendance to some events.
Open AccessA mixture model approach for clustering bipartite networks
This chapter investigates the latent structure of bipartite networks via a model-based clustering approach which is able to capture both latent groups of sending nodes and latent variability of the propensity of sending nodes to create links with receiving nodes within each group. This modelling approach is very flexible and can be estimated by using fast inferential approaches such as variational inference. We apply this model to the analysis of a terrorist network in order to identify the main latent groups of terrorists and their latent trait scores based on their attendance to some events.
- 12 June 2018
- Published by Springer Nature
- p. 3092-3100
Theory of Statistics: Basics and Fundamentals
- Top Cited Papers
- 2 January 2016
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 25 (1) , 246-265
Joint Modeling of Multiple Network Views
Latent space models (LSM) for network data rely on the basic assumption that each node of the network has an unknown position in a D-dimensional Euclidean latent space: generally the smaller the distance between two nodes in the latent space, the greater their probability of being connected. In this article, we propose a variational inference approach to estimate the intractable posterior of the LSM. In many cases, different network views on the same set of nodes are available. It can therefore be useful to build a model able to jointly summarize the information given by all the network views. For this purpose, we introduce the latent space joint model (LSJM) that merges the information given by multiple network views assuming that the probability of a node being connected with other nodes in each network view is explained by a unique latent variable. This model is demonstrated on the analysis of two datasets: an excerpt of 50 girls from “Teenage Friends and Lifestyle Study” data at three time points and the Saccharomyces cerevisiae genetic and physical protein–protein interactions. Supplementary materials for this article are available online.
- 2 January 2016
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 25 (1) , 246-265
Top Cited PapersJoint Modeling of Multiple Network Views
Latent space models (LSM) for network data rely on the basic assumption that each node of the network has an unknown position in a D-dimensional Euclidean latent space: generally the smaller the distance between two nodes in the latent space, the greater their probability of being connected. In this article, we propose a variational inference approach to estimate the intractable posterior of the LSM. In many cases, different network views on the same set of nodes are available. It can therefore be useful to build a model able to jointly summarize the information given by all the network views. For this purpose, we introduce the latent space joint model (LSJM) that merges the information given by multiple network views assuming that the probability of a node being connected with other nodes in each network view is explained by a unique latent variable. This model is demonstrated on the analysis of two datasets: an excerpt of 50 girls from “Teenage Friends and Lifestyle Study” data at three time points and the Saccharomyces cerevisiae genetic and physical protein–protein interactions. Supplementary materials for this article are available online.
- 1 January 2016
- Published by Springer Nature
- p. 1-9
Theory of Statistics, Basics, and Fundamentals