arXiv subjects

Giacomo Fiumara

Publications and source records attributed to Giacomo Fiumara.

At least 19 recordsLinked to original sources

arXiv2023

Human and social capital strategies for Mafia network disruption

Social Network Analysis (SNA) is an interdisciplinary science that focuses on discovering the patterns of individuals interactions. In particular, practitioners have used SNA to describe and analyze criminal networks to highlight subgroups, key actors, strengths and weaknesses in order to generate disruption interventions and crime prevention systems. In this paper, the effectiveness of a total of seven disruption strategies for two real Mafia networks is investigated adopting SNA tools. Three interventions targeting actors with a high level of social capital and three interventions targeting those with a high human capital are put to the test and compared between each other and with random node removal. Human and social capital approaches were also applied on the Barabási-Albert models which are the one which better represent criminal networks. Simulations showed that actor removal based on social capital proved to be the most effective strategy, by leading to the total disruption of the criminal network in the least number of steps. The removal of a specific figure of a Mafia family such as the Caporegime seemed also promising in the network disruption.

cs.SI↗

arXiv2022

Classical and Quantum Random Walks to Identify Leaders in Criminal Networks

Random walks simulate the randomness of objects, and are key instruments in various fields such as computer science, biology and physics. The counter part of classical random walks in quantum mechanics are the quantum walks. Quantum walk algorithms provide an exponential speedup over classical algorithms. Classical and quantum random walks can be applied in social network analysis, and can be used to define specific centrality metrics in terms of node occupation on single-layer and multilayer networks. In this paper, we applied these new centrality measures to three real criminal networks derived from an anti-mafia operation named Montagna and a multilayer network derived from them. Our aim is to (i) identify leaders in our criminal networks, (ii) study the dependence between these centralities and the degree, (iii) compare the results obtained for the real multilayer criminal network with those of a synthetic multilayer network which replicates its structure.

cs.SI↗

arXiv2021

Correlation analysis of node and edge centrality measures in artificial complex networks

The importance of a node in a social network is identified through a set of measures called centrality. Degree centrality, closeness centrality, betweenness centrality and clustering coefficient are the most frequently used metrics to compute node centrality. Their computational complexity in some cases makes unfeasible, when not practically impossible, their computations. For this reason we focused on two alternative measures, WERW-Kpath and Game of Thieves, which are at the same time highly descriptive and computationally affordable. Our experiments show that a strong correlation exists between WERW-Kpath and Game of Thieves and the classical centrality measures. This may suggest the possibility of using them as useful and more economic replacements of the classical centrality measures.

cs.SI↗

arXiv2021

Multilayer Network Analysis: The Identification of Key Actors in a Sicilian Mafia Operation

Recently, Social Network Analysis studies have led to an improvement and to a generalization of existing tools to networks with multiple subsystems and layers of connectivity. These kind of networks are usually called multilayer networks. Multilayer networks in which each layer shares at least one node with some other layer in the network are called multiplex networks. Being a multiplex network does not require all nodes to exist on every layer. In this paper, we built a criminal multiplex network which concerns an anti-mafia operation called "Montagna" and it is based on the examination of a pre-trial detention order issued on March 14, 2007 by the judge for preliminary investigations of the Court of Messina (Sicily). "Montagna" focus on two Mafia families called "Mistretta" and "Batanesi" who infiltrated several economic activities including the public works in the north-eastern part of Sicily, through a cartel of entrepreneurs close to the Sicilian Mafia. Originally we derived two single-layer networks, the former capturing meetings between suspected individuals and the latter recording phone calls. But some networked systems can be better modeled by multilayer structures where the individual nodes develop relationships in multiple layers. For this reason we built a two-layer network from the single-layer ones. These two layers share 47 nodes. We followed three different approaches to measure the importance of nodes in multilayer networks using degree as descriptor. Our analysis can aid in the identification of key players in criminal networks.

cs.SI↗

arXiv2021

Graph and Network Theory for the analysis of Criminal Networks

Social Network Analysis is the use of Network and Graph Theory to study social phenomena, which was found to be highly relevant in areas like Criminology. This chapter provides an overview of key methods and tools that may be used for the analysis of criminal networks, which are presented in a real-world case study. Starting from available juridical acts, we have extracted data on the interactions among suspects within two Sicilian Mafia clans, obtaining two weighted undirected graphs. Then, we have investigated the roles of these weights on the criminal network's properties, focusing on two key features: weight distribution and shortest path length. We also present an experiment that aims to construct an artificial network that mirrors criminal behaviours. To this end, we have conducted a comparative degree distribution analysis between the real criminal networks, using some of the most popular artificial network models: Watts-Strogatz, Erdős-Rényi, and Barabási-Albert, with some topology variations. This chapter will be a valuable tool for researchers who wish to employ social network analysis within their own area of interest.

cs.SI↗

arXiv2021

Criminal Networks Analysis in Missing Data scenarios through Graph Distances

Data collected in criminal investigations may suffer from: (i) incompleteness, due to the covert nature of criminal organisations; (ii) incorrectness, caused by either unintentional data collection errors and intentional deception by criminals; (iii) inconsistency, when the same information is collected into law enforcement databases multiple times, or in different formats. In this paper we analyse nine real criminal networks of different nature (i.e., Mafia networks, criminal street gangs and terrorist organizations) in order to quantify the impact of incomplete data and to determine which network type is most affected by it. The networks are firstly pruned following two specific methods: (i) random edges removal, simulating the scenario in which the Law Enforcement Agencies (LEAs) fail to intercept some calls, or to spot sporadic meetings among suspects; (ii) nodes removal, that catches the hypothesis in which some suspects cannot be intercepted or investigated. Finally we compute spectral (i.e., Adjacency, Laplacian and Normalised Laplacian Spectral Distances) and matrix (i.e., Root Euclidean Distance) distances between the complete and pruned networks, which we compare using statistical analysis. Our investigation identified two main features: first, the overall understanding of the criminal networks remains high even with incomplete data on criminal interactions (i.e., 10% removed edges); second, removing even a small fraction of suspects not investigated (i.e., 2% removed nodes) may lead to significant misinterpretation of the overall network.

cs.SI↗

arXiv2020

Correlations among Game of Thieves and other centrality measures in complex networks

Social Network Analysis (SNA) is used to study the exchange of resources among individuals, groups, or organizations. The role of individuals or connections in a network is described by a set of centrality metrics which represent one of the most important results of SNA. Degree, closeness, betweenness and clustering coefficient are the most used centrality measures. Their use is, however, severely hampered by their computation cost. This issue can be overcome by an algorithm called Game of Thieves (GoT). Thanks to this new algorithm, we can compute the importance of all elements in a network (i.e. vertices and edges), compared to the total number of vertices. This calculation is done not in a quadratic time, as when we use the classical methods, but in polylogarithmic time. Starting from this we present our results on the correlation existing between GoT and the most widely used centrality measures. From our experiments emerge that a strong correlation exists, which makes GoT eligible as a centrality measure for large scale complex networks.

cs.SI↗

arXiv2020

Disrupting Resilient Criminal Networks through Data Analysis: The case of Sicilian Mafia

Compared to other types of social networks, criminal networks present hard challenges, due to their strong resilience to disruption, which poses severe hurdles to law-enforcement agencies. Herein, we borrow methods and tools from Social Network Analysis to (i) unveil the structure of Sicilian Mafia gangs, based on two real-world datasets, and (ii) gain insights as to how to efficiently disrupt them. Mafia networks have peculiar features, due to the links distribution and strength, which makes them very different from other social networks, and extremely robust to exogenous perturbations. Analysts are also faced with the difficulty in collecting reliable datasets that accurately describe the gangs' internal structure and their relationships with the external world, which is why earlier studies are largely qualitative, elusive and incomplete. An added value of our work is the generation of two real-world datasets, based on raw data derived from juridical acts, relating to a Mafia organization that operated in Sicily during the first decade of 2000s. We created two different networks, capturing phone calls and physical meetings, respectively. Our network disruption analysis simulated different intervention procedures: (i) arresting one criminal at a time (sequential node removal); and (ii) police raids (node block removal). We measured the effectiveness of each approach through a number of network centrality metrics. We found Betweeness Centrality to be the most effective metric, showing how, by neutralizing only the 5% of the affiliates, network connectivity dropped by 70%. We also identified that, due the peculiar type of interactions in criminal networks (namely, the distribution of the interactions frequency) no significant differences exist between weighted and unweighted network analysis. Our work has significant practical applications for tackling criminal and terrorist networks.

cs.SI↗

arXiv2017

Virial coefficients, equation of state, and demixing of binary asymmetric nonadditive hard-disk mixtures

Values of the fifth virial coefficient, compressibility factors, and fluid-fluid coexistence curves of binary asymmetric nonadditive mixtures of hard disks are reported. The former correspond to a wide range of size ratios and positive nonadditivities and have been obtained through a standard Monte Carlo method for the computation of the corresponding cluster integrals. The compressibility factors as functions of density, derived from canonical Monte Carlo simulations, have been obtained for two values of the size ratio ($q=0.4$ and $q=0.5$), a value of the nonadditivity parameter $Δ=0.3$), and five values of the mole fraction of the species with the biggest diameter ($x_1=0.1$, $0.3$, $0.5$, $0.7$, and $0.9$). Some points of the coexistence line relative to the fluid-fluid phase transition for the same values of the size ratios and nonadditivity parameter have been obtained from Gibbs Ensemble Monte Carlo simulations. A comparison is made between the numerical results and those that follow from some theoretical equations of state.

cond-mat.soft↗

arXiv2015

Network Structure and Resilience of Mafia Syndicates

In this paper we present the results of the study of Sicilian Mafia organization by using Social Network Analysis. The study investigates the network structure of a Mafia organization, describing its evolution and highlighting its plasticity to interventions targeting membership and its resilience to disruption caused by police operations. We analyze two different datasets about Mafia gangs built by examining different digital trails and judicial documents spanning a period of ten years: the former dataset includes the phone contacts among suspected individuals, the latter is constituted by the relationships among individuals actively involved in various criminal offenses. Our report illustrates the limits of traditional investigation methods like tapping: criminals high up in the organization hierarchy do not occupy the most central positions in the criminal network, and oftentimes do not appear in the reconstructed criminal network at all. However, we also suggest possible strategies of intervention, as we show that although criminal networks (i.e., the network encoding mobsters and crime relationships) are extremely resilient to different kind of attacks, contact networks (i.e., the network reporting suspects and reciprocated phone calls) are much more vulnerable and their analysis can yield extremely valuable insights.

cs.SI↗

arXiv2015

Virial coefficients and demixing in the Asakura-Oosawa model

The problem of demixing in the Asakura-Oosawa colloid-polymer model is considered. The critical constants are computed using truncated virial expansions up to fifth order. While the exact analytical results for the second and third virial coefficients are known for any size ratio, analytical results for the fourth virial coefficient are provided here, and fifth virial coefficients are obtained numerically for particular size ratios using standard Monte Carlo techniques. We have computed the critical constants by successively considering the truncated virial series up to the second, third, fourth, and fifth virial coefficients. The results for the critical colloid and (reservoir) polymer packing fractions are compared with those that follow from available Monte Carlo simulations in the grand canonical ensemble. Limitations and perspectives of this approach are pointed out.

cond-mat.soft↗

arXiv2015

The effective colloid interaction in the Asakura-Oosawa model. Assessment of non-pairwise terms from the virial expansion

The relevance of neglecting three- and four-body interactions in the coarse-grained version of the Asakura-Oosawa model is examined. A mapping between the first few virial coefficients of the binary nonadditive hard-sphere mixture representative of this model and those arising from the coarse-grained (pairwise) depletion potential approximation allows for a quantitative evaluation of the effect of such interactions. This turns out to be especially important for large size ratios and large reservoir polymer packing fractions.

cond-mat.soft↗

arXiv2015

RDF annotation of Second Life objects: Knowledge Representation meets Social Virtual reality

We have designed and implemented an application running inside Second Life that supports user annotation of graphical objects and graphical visualization of concept ontologies, thus providing a formal, machine-accessible description of objects. As a result, we offer a platform that combines the graphical knowledge representation that is expected from a MUVE artifact with the semantic structure given by the Resource Framework Description (RDF) representation of information.

cs.AI↗

arXiv2015

Adaptive Search over Sorted Sets

We revisit the classical algorithms for searching over sorted sets to introduce an algorithm refinement, called Adaptive Search, that combines the good features of Interpolation search and those of Binary search. W.r.t. Interpolation search, only a constant number of extra comparisons is introduced. Yet, under diverse input data distributions our algorithm shows costs comparable to that of Interpolation search, i.e., O(log log n) while the worst-case cost is always in O(log n), as with Binary search. On benchmarks drawn from large datasets, both synthetic and real-life, Adaptive search scores better times and lesser memory accesses even than Santoro and Sidney's Interpolation-Binary search.

cs.DS↗

arXiv2014

On Facebook, most ties are weak

Pervasive socio-technical networks bring new conceptual and technological challenges to developers and users alike. A central research theme is evaluation of the intensity of relations linking users and how they facilitate communication and the spread of information. These aspects of human relationships have been studied extensively in the social sciences under the framework of the "strength of weak ties" theory proposed by Mark Granovetter.13 Some research has considered whether that theory can be extended to online social networks like Facebook, suggesting interaction data can be used to predict the strength of ties. The approaches being used require handling user-generated data that is often not publicly available due to privacy concerns. Here, we propose an alternative definition of weak and strong ties that requires knowledge of only the topology of the social network (such as who is a friend of whom on Facebook), relying on the fact that online social networks, or OSNs, tend to fragment into communities. We thus suggest classifying as weak ties those edges linking individuals belonging to different communities and strong ties as those connecting users in the same community. We tested this definition on a large network representing part of the Facebook social graph and studied how weak and strong ties affect the information-diffusion process. Our findings suggest individuals in OSNs self-organize to create well-connected communities, while weak ties yield cohesion and optimize the coverage of information spread.

cs.SI↗

arXiv2014

Visualizing criminal networks reconstructed from mobile phone records

In the fight against the racketeering and terrorism, knowledge about the structure and the organization of criminal networks is of fundamental importance for both the investigations and the development of efficient strategies to prevent and restrain crimes. Intelligence agencies exploit information obtained from the analysis of large amounts of heterogeneous data deriving from various informative sources including the records of phone traffic, the social networks, surveillance data, interview data, experiential police data, and police intelligence files, to acquire knowledge about criminal networks and initiate accurate and destabilizing actions. In this context, visual representation techniques coordinate the exploration of the structure of the network together with the metrics of social network analysis. Nevertheless, the utility of visualization tools may become limited when the dimension and the complexity of the system under analysis grow beyond certain terms. In this paper we show how we employ some interactive visualization techniques to represent criminal and terrorist networks reconstructed from phone traffic data, namely foci, fisheye and geo-mapping network layouts. These methods allow the exploration of the network through animated transitions among visualization models and local enlargement techniques in order to improve the comprehension of interesting areas. By combining the features of the various visualization models it is possible to gain substantial enhancements with respect to classic visualization models, often unreadable in those cases of great complexity of the network.

cs.SI↗

arXiv2014

Web Data Extraction, Applications and Techniques: A Survey

Web Data Extraction is an important problem that has been studied by means of different scientific tools and in a broad range of applications. Many approaches to extracting data from the Web have been designed to solve specific problems and operate in ad-hoc domains. Other approaches, instead, heavily reuse techniques and algorithms developed in the field of Information Extraction. This survey aims at providing a structured and comprehensive overview of the literature in the field of Web Data Extraction. We provided a simple classification framework in which existing Web Data Extraction applications are grouped into two main classes, namely applications at the Enterprise level and at the Social Web level. At the Enterprise level, Web Data Extraction techniques emerge as a key tool to perform data analysis in Business and Competitive Intelligence systems as well as for business process re-engineering. At the Social Web level, Web Data Extraction techniques allow to gather a large amount of structured data continuously generated and disseminated by Web 2.0, Social Media and Online Social Network users and this offers unprecedented opportunities to analyze human behavior at a very large scale. We discuss also the potential of cross-fertilization, i.e., on the possibility of re-using Web Data Extraction techniques originally designed to work in a given domain, in other domains.

cs.IR↗

arXiv2014

Detecting criminal organizations in mobile phone networks

The study of criminal networks using traces from heterogeneous communication media is acquiring increasing importance in nowadays society. The usage of communication media such as phone calls and online social networks leaves digital traces in the form of metadata that can be used for this type of analysis. The goal of this work is twofold: first we provide a theoretical framework for the problem of detecting and characterizing criminal organizations in networks reconstructed from phone call records. Then, we introduce an expert system to support law enforcement agencies in the task of unveiling the underlying structure of criminal networks hidden in communication data. This platform allows for statistical network analysis, community detection and visual exploration of mobile phone network data. It allows forensic investigators to deeply understand hierarchies within criminal organizations, discovering members who play central role and provide connection among sub-groups. Our work concludes illustrating the adoption of our computational framework for a real-word criminal investigation.

cs.SI↗