Domenico De Stefano
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
Domenico De Stefano has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Susanna Zaccarin
University of Trieste
8 shared publications - Francesco Santelli
University of Trieste
4 shared publications - Maria Rosaria D'ESposito
University of Salerno
4 shared publications - Fabio Morea
Area Science Park, Trieste, Friuli-Venezia Giulia, Italy
3 shared publications - Giancarlo Ragozini
Department of Political Sciences, University of Naples Federico II, Naples, Italy
3 shared publications - Maria Prosperina Vitale
Department of Political and Social Studies, University of Salerno, Fisciano, Italy
3 shared publications
Latest Publications
- Open Access
- 25 July 2026
- Published by Springer Nature in Scientometrics
- Vol. 131 (9) , 6157-6181
Categorizing authors in co-authorship networks through textual information analysis: a comparative study of two scientific communities
Scientific collaboration is a key driver of research productivity and innovation, enabling researchers to share knowledge, leverage expertise, and improve research outcomes. While co-authorship is commonly used to represent collaborative behaviour, most studies focus on specific single scientific fields or national networks. A significant limitation of these studies is the lack of comprehensive methods to classify all authors within co-authorship networks, particularly in relation to their field or macro-disciplinary affiliations. This study addresses these limitations by analysing co-authorship networks within two distinct Italian scientific target groups—Statistics and Management. Using a dataset of publications from 2012 to 2022, we develop a novel methodology that combines bibliographic and textual data, such as keywords and subject areas, to classify all authors in these communities. By constructing a two-mode network and applying a clustering algorithm, we categorize authors into distinct thematic areas, offering a more nuanced analysis of collaboration. Additionally, we compare the collaborative structures of the two target groups, revealing important similarities and differences in their research dynamics. This approach provides new insights into the evolution of scientific collaboration and offers a deeper understanding of how researchers from different fields engage in knowledge production.
- 25 July 2026
- Published by Springer Nature in Scientometrics
- Vol. 131 (9) , 6157-6181
Open AccessCategorizing authors in co-authorship networks through textual information analysis: a comparative study of two scientific communities
Scientific collaboration is a key driver of research productivity and innovation, enabling researchers to share knowledge, leverage expertise, and improve research outcomes. While co-authorship is commonly used to represent collaborative behaviour, most studies focus on specific single scientific fields or national networks. A significant limitation of these studies is the lack of comprehensive methods to classify all authors within co-authorship networks, particularly in relation to their field or macro-disciplinary affiliations. This study addresses these limitations by analysing co-authorship networks within two distinct Italian scientific target groups—Statistics and Management. Using a dataset of publications from 2012 to 2022, we develop a novel methodology that combines bibliographic and textual data, such as keywords and subject areas, to classify all authors in these communities. By constructing a two-mode network and applying a clustering algorithm, we categorize authors into distinct thematic areas, offering a more nuanced analysis of collaboration. Additionally, we compare the collaborative structures of the two target groups, revealing important similarities and differences in their research dynamics. This approach provides new insights into the evolution of scientific collaboration and offers a deeper understanding of how researchers from different fields engage in knowledge production.
- 11 February 2026
- Published by Springer Nature
- p. 379-394
Methods and Models for Co-Authorship Networks
- Open Access
- 31 October 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-11
A comprehensive framework for solution space exploration in community detection
Community detection algorithms are essential tools for understanding complex networks, yet their results often vary between runs and are affected by node input order and the presence of outliers, undermining reproducibility and interpretation. This paper addresses these issues by introducing a framework for systematic exploration of the solution space, obtained through repeated runs of a given algorithm with permuted node orders. A Bayesian model assesses convergence, estimates solution probabilities, and provides a defensible stopping rule that balances accuracy and computational cost. Building on this process, we propose a taxonomy of solution spaces that offers clear diagnostics of partition reliability across algorithms and a shared vocabulary for interpretation. Applied to a real-world network, the approach shows that different algorithms produce various types of solution space, highlighting the importance of systematic exploration of the solutions before drawing scientific conclusions.
- 31 October 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-11
Open AccessA comprehensive framework for solution space exploration in community detection
Community detection algorithms are essential tools for understanding complex networks, yet their results often vary between runs and are affected by node input order and the presence of outliers, undermining reproducibility and interpretation. This paper addresses these issues by introducing a framework for systematic exploration of the solution space, obtained through repeated runs of a given algorithm with permuted node orders. A Bayesian model assesses convergence, estimates solution probabilities, and provides a defensible stopping rule that balances accuracy and computational cost. Building on this process, we propose a taxonomy of solution spaces that offers clear diagnostics of partition reliability across algorithms and a shared vocabulary for interpretation. Applied to a real-world network, the approach shows that different algorithms produce various types of solution space, highlighting the importance of systematic exploration of the solutions before drawing scientific conclusions.
- Open Access
- 10 September 2025
- Published by Springer Nature in Statistical Methods & Applications
- Vol. 34 (5) , 1149-1167
Unveiling collaboration persistence and interactions among Italian academic statisticians through relational hyperevent models
In the last years, there has been a growing interest in the significance of scientific collaboration. Several studies have analyzed co-authorship networks as a convenient tool to investigate collaboration among scientists across different disciplines and over time. Co-authorship networks among scientists can be represented by hypergraphs, where each scientific paper is the corresponding hyperevent. To account for this scenario and evaluate the evolution of the co-authorship network over time, Relational Hyperevent Models (RHEM) have been recently proposed. Such models can handle time-varying data and events that occur in hyperedges (a set of subsets of vertices in a hypergraph that can connect more than two variables), allowing modeling events composed of any authors, analyze polyadic settings, and consider subgroup persistence over time. This paper aims to apply such models to analyze the evolution of collaboration among the Italian academic statisticians, affiliated to five scientific sub-sectors, observed from 2012 to 2022, including their external co-authors. Bibliographic information has been retrieved from the Scopus database. Different model specifications are proposed to evaluate the tendency to maintain collaboration between authors over time (familiarity effects) and/or the tendency to create new collaborations with authors who co-authored with common groups of authors (closure effects).
- 10 September 2025
- Published by Springer Nature in Statistical Methods & Applications
- Vol. 34 (5) , 1149-1167
Open AccessUnveiling collaboration persistence and interactions among Italian academic statisticians through relational hyperevent models
In the last years, there has been a growing interest in the significance of scientific collaboration. Several studies have analyzed co-authorship networks as a convenient tool to investigate collaboration among scientists across different disciplines and over time. Co-authorship networks among scientists can be represented by hypergraphs, where each scientific paper is the corresponding hyperevent. To account for this scenario and evaluate the evolution of the co-authorship network over time, Relational Hyperevent Models (RHEM) have been recently proposed. Such models can handle time-varying data and events that occur in hyperedges (a set of subsets of vertices in a hypergraph that can connect more than two variables), allowing modeling events composed of any authors, analyze polyadic settings, and consider subgroup persistence over time. This paper aims to apply such models to analyze the evolution of collaboration among the Italian academic statisticians, affiliated to five scientific sub-sectors, observed from 2012 to 2022, including their external co-authors. Bibliographic information has been retrieved from the Scopus database. Different model specifications are proposed to evaluate the tendency to maintain collaboration between authors over time (familiarity effects) and/or the tendency to create new collaborations with authors who co-authored with common groups of authors (closure effects).
- 8 September 2025
- Published by Springer Nature
- p. 192-201
Density-based community detection combining structure and attribute information
- 8 September 2025
- Published by Springer Nature
- p. 192-201
Density-based community detection combining structure and attribute information
- 26 May 2025
- Published by Springer Nature
- p. 113-121
Visualization of Proximity and Role-Based Embeddings in a Regional Labor Flow Network
- 26 May 2025
- Published by Springer Nature
- p. 113-121
Visualization of Proximity and Role-Based Embeddings in a Regional Labor Flow Network
- Open Access
- 22 May 2025
- Published by Springer Nature in Research Square
Beyond One Solution: a Comprehensive Exploration of Solution Space in Community Detection for Social Networks
This paper investigates the relevance of systematically exploring the solution space produced by commonly used community detection algorithms, emphasizing its role in enhancing the robustness and reliability of results, particularly in complex real-world social networks. Three core challenges are addressed: the multiplicity of solutions, input ordering bias, and the handling of outliers. Input ordering bias—where the outcome of an algorithm is influenced by the sequence in which nodes and edges are processed—can undermine the interpretability of results by introducing artifacts unrelated to the network topol-ogy. Similarly, the presence of outliers-nodes that do not clearly belong to any community—is often overlooked, with many algorithms either ignoring them or forcing them into existing clusters, thereby affecting the resulting partition. To address these limitations, we propose a methodological framework for systematically exploring the solution space across multiple algorithm runs, incorporating a Bayesian model to assess its stability and a taxonomy to classify its structure. This approach enables a deeper understanding of the variability and uncertainty inherent in community detection, paving the way for more accurate, consistent, and interpretable results.
- 22 May 2025
- Published by Springer Nature in Research Square
Open AccessBeyond One Solution: a Comprehensive Exploration of Solution Space in Community Detection for Social Networks
This paper investigates the relevance of systematically exploring the solution space produced by commonly used community detection algorithms, emphasizing its role in enhancing the robustness and reliability of results, particularly in complex real-world social networks. Three core challenges are addressed: the multiplicity of solutions, input ordering bias, and the handling of outliers. Input ordering bias—where the outcome of an algorithm is influenced by the sequence in which nodes and edges are processed—can undermine the interpretability of results by introducing artifacts unrelated to the network topol-ogy. Similarly, the presence of outliers-nodes that do not clearly belong to any community—is often overlooked, with many algorithms either ignoring them or forcing them into existing clusters, thereby affecting the resulting partition. To address these limitations, we propose a methodological framework for systematically exploring the solution space across multiple algorithm runs, incorporating a Bayesian model to assess its stability and a taxonomy to classify its structure. This approach enables a deeper understanding of the variability and uncertainty inherent in community detection, paving the way for more accurate, consistent, and interpretable results.
- 30 January 2025
- Published by Springer Nature
- p. 549-554
Relational Hypervents Models for Co-authorship Networks: The Case of the Italian Academic Statisticians
- 30 January 2025
- Published by Springer Nature
- p. 549-554
Relational Hypervents Models for Co-authorship Networks: The Case of the Italian Academic Statisticians
- Open Access
Beyond One Solution: The Case for a Comprehensive Exploration of Solution Space in Community Detection
This article explores the importance of examining the solution space in community detection, highlighting its role in achieving reliable results when dealing with real-world problems. A Bayesian framework is used to estimate the stability of the solution space and classify it into categories Single, Dominant, Multiple, Sparse or Empty. By applying this approach to real-world networks, the study highlights the importance of considering multiple solutions rather than relying on a single partition. This ensures more reliable results and efficient use of computational resources in community detection analysis.
Open AccessBeyond One Solution: The Case for a Comprehensive Exploration of Solution Space in Community Detection
This article explores the importance of examining the solution space in community detection, highlighting its role in achieving reliable results when dealing with real-world problems. A Bayesian framework is used to estimate the stability of the solution space and classify it into categories Single, Dominant, Multiple, Sparse or Empty. By applying this approach to real-world networks, the study highlights the importance of considering multiple solutions rather than relying on a single partition. This ensures more reliable results and efficient use of computational resources in community detection analysis.
- 24 September 2024
- Published by Springer Nature
- p. 41-52
Community Detection and Semantic Analysis on Twitter. The Case of “No Green Pass” and “No Vax” Movement in Italy
- 24 September 2024
- Published by Springer Nature
- p. 41-52
Community Detection and Semantic Analysis on Twitter. The Case of “No Green Pass” and “No Vax” Movement in Italy