Searcharxiv⌕ Search

arXiv subjects

Domenico De Stefano

Publications and source records attributed to Domenico De Stefano.

7 recordsLinked to original sources

Modeling Tripartite Hyperevents in Scientific Collaboration Networks

Sociological research has framed collective action in science, innovation, and culture as tripartite networks connecting teams of actors, lists of prior works, and sets of labels (e.g., keywords, topics). While methods for multipartite social networks were proposed decades ago, and have received a recent surge in interest, none of the suggested solutions scale to the size and granularity of contemporary data sets (scientific publications, patents, filmmaking) and at the same time allow for testing multiple competing hypotheses about the drivers of collective production. In this paper, we address this gap by applying Relational Hyperevent Models (RHEM) to dynamic tripartite hypergraphs. Using scientific networks as a case study, we model events linking any number of actors, references, and keywords, testing and controlling for inter-dependencies within and between each set.

stat.AP↗

A density-based framework for community detection in attributed networks

Community structure in social and collaborative networks often emerges from a complex interplay between structural mechanisms, such as degree heterogeneity and leader-driven attraction, and homophily on node attributes. Existing community detection methods typically focus on these dimensions in isolation, limiting their ability to recover interpretable communities in presence of such mechanisms. In this paper, we propose AttDeCoDe, an attribute-driven extension of a density-based community detection framework, developed to analyse networks where node characteristics play a central role in group formation. Instead of defining density purely from network topology, AttDeCoDe estimates node-wise density in the attribute space, allowing communities to form around attribute-based community representatives while preserving structural connectivity constraints. This approach naturally captures homophily-driven aggregation while remaining sensitive to leader influence. We evaluate the proposed method through a simulation study based on a novel generative model that extends the degree-corrected stochastic block model by incorporating attribute-driven leader attraction, reflecting key features of collaborative research networks. We perform an empirical application to research collaboration data from the Horizon programmes, where organisations are characterised by project-level thematic descriptors. Both results show that AttDeCoDe offers a flexible and interpretable framework for community detection in attributed networks achieving competitive performance relative to topology-based and attribute-assisted benchmarks.

cs.SI↗

Community-level core-periphery structures in collaboration networks

Uncovering structural patterns in collaboration networks is key for understanding how knowledge flows and innovation emerges. These networks often exhibit a rich interplay of meso-scale structures, such as communities, core-periphery organization, and influential hubs, which shape the complexity of scientific collaboration. The coexistence of such structures challenges traditional approaches, which typically isolate specific network patterns at the node level. We introduce a novel framework for detecting core-periphery structures at the community level. Given a reference grouping of the nodes, the method optimizes an objective function that assigns core or peripheral roles to communities by accounting for the density and strength of their inter-community connections. The node-level partition may correspond to either inferred communities or to a node-attribute classification, such as discipline or location, enabling direct interpretation of how different social or organizational groups occupy central positions in the network. The method is motivated by an application to a co-authorship network of Italian academics in three different disciplines, where it reveals a hierarchical core-periphery structure associated with institutional role, regional location, and research topics.

stat.ME↗

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.

cs.SI↗

Mapping leadership and communities in EU-funded research through network analysis

Horizon 2020 and Horizon Europe the EU programs supporting research and innovation through collaboration between companies, academic institutions, and research organisations. This paper introduces a novel methodology using open data on Horizon programs to analyse collaborations, leadership roles, and their evolution, with a focus on the North Adriatic Hydrogen Valley project in the hydrogen energy sector. The methodology employs network analysis, transforming tabular data into weighted networks that represent collaborations between organisations. Centrality measures and community detection algorithms identify influential organisations and stable partnerships over time. To ensure robust and reliable results, the methodology addresses challenges such as input-ordering bias and result variability, while the exploration of the solution space enhances the accuracy of identified collaboration patterns. The case study reveals key leaders and stable communities within the hydrogen energy sector, providing valuable insights for policymakers and organisations fostering innovation through sustained collaborations. The proposed methodology effectively identifies influential organisations and tracks the stability of research collaborations. The insights gained are valuable for policymakers and organisations seeking to foster innovation through sustained partnerships. This approach can be extended to other sectors, offering a framework for understanding the impact of EU research funding on collaboration and leadership dynamics.

cs.SI↗

Enhancing Stability and Assessing Uncertainty in Community Detection through a Consensus-based Approach

Complex data in social and natural sciences find effective representation through networks, wherein quantitative and categorical information can be associated with nodes and connecting edges. The internal structure of networks can be explored using unsupervised machine learning methods known as community detection algorithms. The process of community detection is inherently subject to uncertainty as algorithms utilize heuristic approaches and randomised procedures to explore vast solution spaces, resulting in non-deterministic outcomes and variability in detected communities across multiple runs. Moreover, many algorithms are not designed to identify outliers and may fail to take into account that a network is an unordered mathematical entity. The main aim of our work is to address these issues through a consensus-based approach by introducing a new framework called Consensus Community Detection (CCD). Our method can be applied to different community detection algorithms, allowing the quantification of uncertainty for the whole network as well as for each node, and providing three strategies for dealing with outliers: incorporate, highlight, or group. The effectiveness of our approach is evaluated on artificial benchmark networks.

cs.SI↗

Density-based clustering of social networks

The idea underlying the modal formulation of density-based clustering is to associate groups with the regions around the modes of the probability density function underlying the data. This correspondence between clusters and dense regions in the sample space is here exploited to discuss an extension of this approach to the analysis of social networks. Such extension seems particularly appealing: conceptually, the notion of high-density cluster fits well the one of community in a network, regarded to as a collection of individuals with dense local ties in its neighbourhood. The lack of a probabilistic notion of density in networks is turned into a major strength of the proposed method, where node-wise measures that quantify the role and position of actors may be used to derive different community configurations. The approach allows for the identification of a hierarchical structure of clusters, which may catch different degrees of resolution of the clustering structure. This feature well fits the nature of social networks, disentangling a different involvement of individuals in social aggregations.

cs.SI↗