Modeling commuting systems through a complex network analysis: a study of the Italian islands of Sardinia and Sicily

This study analyzes the inter-municipal commuting systems of the Italian islands of Sardinia and Sicily, employing weighted network analysis technique. Based on the results obtained for the Sardinian commuting network, the network analysis is used to identify similarities and dissimilarities between the two systems

Mining topological structure in graphs through forest representations

We consider the problem of inferring simplified topological substructures—which we term backbones—in metric and non-metric graphs. Intuitively, these are subgraphs with ‘few’ nodes, multifurcations, and cycles, that model the topology of the original graph well. We present a multistep procedure for inferring these backbones. First, we encode local (geometric) information of each vertex in the original graph by means of the boundary coefficient (BC) to identify ‘core’ nodes in the graph. Next, we construct a forest representation of the graph, termed an f-pine, that connects every node of the graph to a local ‘core’ node. The final backbone is then inferred from the f-pine through CLOF (Constrained Leaves Optimal subForest), a novel graph optimization problem we introduce in this paper. On a theoretical level, we show that CLOF is NP-hard for general graphs. However, we prove that CLOF can be efficiently solved for forest graphs, a surprising fact given that CLOF induces a nontrivial monotone submodular set function maximization problem on tree graphs. This result is the basis of our method for mining backbones in graphs through forest representation. We qualitatively and quantitatively confirm the applicability, effectiveness, and scalability of our method for discovering backbones in a variety of graph-structured data, such as social networks, earthquake locations scattered across the Earth, and high-dimensional cell trajectory dat

Spherical and Hyperbolic Toric Topology-Based Codes On Graph Embedding for Ising MRF Models: Classical and Quantum Topology Machine Learning

The paper introduces the application of information geometry to describe the ground states of Ising models by utilizing parity-check matrices of cyclic and quasi-cyclic codes on toric and spherical topologies. The approach establishes a connection between machine learning and error-correcting coding. This proposed approach has implications for the development of new embedding methods based on trapping sets. Statistical physics and number geometry applied for optimize error-correcting codes, leading to these embedding and sparse factorization methods. The paper establishes a direct connection between DNN architecture and error-correcting coding by demonstrating how state-of-the-art architectures (ChordMixer, Mega, Mega-chunk, CDIL, ...) from the long-range arena can be equivalent to of block and convolutional LDPC codes (Cage-graph, Repeat Accumulate). QC codes correspond to certain types of chemical elements, with the carbon element being represented by the mixed automorphism Shu-Lin-Fossorier QC-LDPC code. The connections between Belief Propagation and the Permanent, Bethe-Permanent, Nishimori Temperature, and Bethe-Hessian Matrix are elaborated upon in detail. The Quantum Approximate Optimization Algorithm (QAOA) used in the Sherrington-Kirkpatrick Ising model can be seen as analogous to the back-propagation loss function landscape in training DNNs. This similarity creates a comparable problem with TS pseudo-codeword, resembling the belief propagation method. Additionally, the layer depth in QAOA correlates to the number of decoding belief propagation iterations in the Wiberg decoding tree. Overall, this work has the potential to advance multiple fields, from Information Theory, DNN architecture design (sparse and structured prior graph topology), efficient hardware design for Quantum and Classical DPU/TPU (graph, quantize and shift register architect.) to Materials Science and beyond.Comment: 71 pages, 42 Figures, 1 Table, 1 Appendix. arXiv admin note: text overlap with arXiv:2109.08184 by other author

Network Analysis Methods for Modelling Tourism Inter- Organizational Systems

This chapter discusses the emerging network science approach to the study of complex adaptive systems and applies tools derived from statistical physics to the analysis of tourism destinations. The authors provide a brief history of network science and the characteristics of a network as well as different models such as small world and scale free networks, and dynamic properties such as resilience and information diffusion. The Italian resort island of Elba is used as a case study allowing comparison of the communication network of tourist organizations and the virtual network formed by the websites of these organizations. The study compares the parameters of these networks to networks from the literature and to randomly created networks. The analyses include computer simulations to assess the dynamic properties of these networks. The results indicate that the Elba tourism network has a low degree of collaboration between members. These findings provide a quantitative measure of network performance. In general, the application of network science to the study of social systems offers opportunities for better management of tourism destinations and complex social systems

Mining complex trees for hidden fruit : a graph–based computational solution to detect latent criminal networks : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Information Technology at Massey University, Albany, New Zealand.

The detection of crime is a complex and difficult endeavour. Public and private organisations – focusing on law enforcement, intelligence, and compliance – commonly apply the rational isolated actor approach premised on observability and materiality. This is manifested largely as conducting entity-level risk management sourcing ‘leads’ from reactive covert human intelligence sources and/or proactive sources by applying simple rules-based models. Focusing on discrete observable and material actors simply ignores that criminal activity exists within a complex system deriving its fundamental structural fabric from the complex interactions between actors - with those most unobservable likely to be both criminally proficient and influential. The graph-based computational solution developed to detect latent criminal networks is a response to the inadequacy of the rational isolated actor approach that ignores the connectedness and complexity of criminality. The core computational solution, written in the R language, consists of novel entity resolution, link discovery, and knowledge discovery technology. Entity resolution enables the fusion of multiple datasets with high accuracy (mean F-measure of 0.986 versus competitors 0.872), generating a graph-based expressive view of the problem. Link discovery is comprised of link prediction and link inference, enabling the high-performance detection (accuracy of ~0.8 versus relevant published models ~0.45) of unobserved relationships such as identity fraud. Knowledge discovery uses the fused graph generated and applies the “GraphExtract” algorithm to create a set of subgraphs representing latent functional criminal groups, and a mesoscopic graph representing how this set of criminal groups are interconnected. Latent knowledge is generated from a range of metrics including the “Super-broker” metric and attitude prediction. The computational solution has been evaluated on a range of datasets that mimic an applied setting, demonstrating a scalable (tested on ~18 million node graphs) and performant (~33 hours runtime on a non-distributed platform) solution that successfully detects relevant latent functional criminal groups in around 90% of cases sampled and enables the contextual understanding of the broader criminal system through the mesoscopic graph and associated metadata. The augmented data assets generated provide a multi-perspective systems view of criminal activity that enable advanced informed decision making across the microscopic mesoscopic macroscopic spectrum

Complex Systems: Nonlinearity and Structural Complexity in spatially extended and discrete systems

Resumen Esta Tesis doctoral aborda el estudio de sistemas de muchos elementos (sistemas discretos) interactuantes. La fenomenología presente en estos sistemas esta dada por la presencia de dos ingredientes fundamentales: (i) Complejidad dinámica: Las ecuaciones del movimiento que rigen la evolución de los constituyentes son no lineales de manera que raramente podremos encontrar soluciones analíticas. En el espacio de fases de estos sistemas pueden coexistir diferentes tipos de trayectorias dinámicas (multiestabilidad) y su topología puede variar enormemente dependiendo de dos parámetros usados en las ecuaciones. La conjunción de dinámica no lineal y sistemas de muchos grados de libertad (como los que aquí se estudian) da lugar a propiedades emergentes como la existencia de soluciones localizadas en el espacio, sincronización, caos espacio-temporal, formación de patrones, etc... (ii) Complejidad estructural: Se refiere a la existencia de un alto grado de aleatoriedad en el patrón de las interacciones entre los componentes. En la mayoría de los sistemas estudiados esta aleatoriedad se presenta de forma que la descripción de la influencia del entorno sobre un único elemento del sistema no puede describirse mediante una aproximación de campo medio. El estudio de estos dos ingredientes en sistemas extendidos se realizará de forma separada (Partes I y II de esta Tesis) y conjunta (Parte III). Si bien en los dos primeros casos la fenomenología introducida por cada fuente de complejidad viene siendo objeto de amplios estudios independientes a lo largo de los últimos años, la conjunción de ambas da lugar a un campo abierto y enormemente prometedor, donde la interdisciplinariedad concerniente a los campos de aplicación implica un amplio esfuerzo de diversas comunidades científicas. En particular, este es el caso del estudio de la dinámica en sistemas biológicos cuyo análisis es difícil de abordar con técnicas exclusivas de la Bioquímica, la Física Estadística o la Física Matemática. En definitiva, el objetivo marcado en esta Tesis es estudiar por separado dos fuentes de complejidad inherentes a muchos sistemas de interés para, finalmente, estar en disposición de atacar con nuevas perspectivas problemas relevantes para la Física de procesos celulares, la Neurociencia, Dinámica Evolutiva, etc..