arXiv subjects

Matteo Bruno

Publications and source records attributed to Matteo Bruno.

29 records · Page 2Linked to original sources

arXiv2024

A universal framework for inclusive 15-minute cities

Proximity-based cities have attracted much attention in recent years. The 15-minute city, in particular, heralded a new vision for cities where essential services must be easily accessible. Despite its undoubted merit in stimulating discussion on new organisations of cities, the 15-minute city cannot be applicable everywhere, and its very definition raises a few concerns. Here, we tackle the feasibility and practicability of the '15-minute city' model in many cities worldwide. We provide a worldwide quantification of how close cities are to the ideal of the 15-minute city. To this end, we measure the accessibility times to resources and services, and we reveal strong heterogeneity of accessibility within and across cities, with a significant role played by local population densities. We provide an online platform (\href{whatif.sonycsl.it/15mincity}{whatif.sonycsl.it/15mincity}) to access and visualise accessibility scores for virtually all cities worldwide. The heterogeneity of accessibility within cities is one of the sources of inequality. We thus simulate how much a better redistribution of resources and services could heal inequity by keeping the same resources and services or by allowing for virtually infinite resources. We highlight pronounced discrepancies among cities in the minimum number of additional services needed to comply with the 15-minute city concept. We conclude that the proximity-based paradigm must be generalised to work on a wide range of local population densities. Finally, socio-economic and cultural factors should be included to shift from time-based to value-based cities.

physics.soc-ph↗

arXiv2023

Is the diagonal case a general picture for Loop Quantum Cosmology?

The correct implementation of the Loop Quantum Gravity to the early homogeneous Universe has been the subject of a long debate in the literature because the SU(2) symmetry cannot be properly retained. The role of this symmetry is expressed by the Gauss constraint. Here, a non-vanishing Gauss constraint is found. However, we show that using suitable variables, it can be recast into three Abelian constraints, justifying the absence of such a symmetry in Loop Quantum Cosmology.

gr-qc↗

arXiv2023

Inferring comparative advantage via entropy maximization

We revise the procedure proposed by Balassa to infer comparative advantage, which is a standard tool, in Economics, to analyze specialization (of countries, regions, etc.). Balassa's approach compares the export of a product for each country with what would be expected from a benchmark based on the total volumes of countries and products flows. Based on results in the literature, we show that the implementation of Balassa's idea generates a bias: the prescription of the maximum likelihood used to calculate the parameters of the benchmark model conflicts with the model's definition. Moreover, Balassa's approach does not implement any statistical validation. Hence, we propose an alternative procedure to overcome such a limitation, based upon the framework of entropy maximisation and implementing a proper test of hypothesis: the `key products' of a country are, now, the ones whose production is significantly larger than expected, under a null-model constraining the same amount of information employed by Balassa's approach. What we found is that countries diversification is always observed, regardless of the strictness of the validation procedure. Besides, the ranking of countries' fitness is only partially affected by the details of the validation scheme employed for the analysis while large differences are found to affect the rankings of products Complexities. The routine for implementing the entropy-based filtering procedures employed here is freely available through the official Python Package Index PyPI.

cs.SI↗

arXiv2023

Loop Quantum Cosmology of non-diagonal Bianchi models

The non-diagonal Bianchi models are studied in the loop framework for their classical and quantum formulation. The expressions of the Ashtekar-Barbero-Immirzi variables and their properties are found to provide a loop quantization of these models. In the special case of Bianchi I Universe, it is shown that the geometrical operators result invariant from the diagonal description. Hence, the kinematical Hilbert space of the non-diagonal Bianchi I model has similar features to the diagonal one.

gr-qc↗

arXiv2023

Urban Economic Fitness and Complexity from Patent Data

Over the years, the growing availability of extensive datasets about registered patents allowed researchers to better understand technological innovation drivers. In this work, we investigate how the technological contents of patents characterise the development of metropolitan areas and how innovation is related to GDP per capita. Exploiting worldwide data from 1980 to 2014, and through network-based techniques that only use information about patents, we identify coherent distinguished groups of metropolitan areas, either clustered in the same geographical area or similar from an economic point of view. We also extend the concept of coherent diversification to patent production by showing how it represents a decisive factor in the economic growth of metropolitan areas. These results confirm a picture in which technological innovation can lead and steer the economic development of cities, opening, in this way, the possibility of adopting the tools introduced here to investigate the interplay between urban development and technological innovation.

physics.soc-ph↗

arXiv2021

Design of adaptive optics by interference fitting: theoretical background

Interference-fit joints are typically adopted to produce permanent assemblies among mechanical parts. The resulting contact pressure is generally used for element fixing or to allow load transmission. Nevertheless, some special designs take advantage of the contact pressure to induce desiderata deformation or to mitigate the stress field inside the structure. Biased interference fitting between a planar mirror and an external ring could be used to induce the required curvature to realize new adaptive lens for optical aberration correction. Recently, thermally-actuated deformable mirror on this principle based, was proposed and prototyped. Although the feasibility and utility of such innovative lens was demonstrated, no comprehensive theory was developed to describe mirror behaviour and predict their curvature. Nowadays, the use of approximated numerical approach, such as the finite element method, is the only way to study the interaction between biased and interference fitted bodies. The paper aims to give the theoretical background for the correct design of adaptive lens actuated by interference fitting. A new formulation for the curvature prediction is proposed and compared with finite element analysis and available experimental measurements.

physics.optics↗

arXiv2021

Brexit and bots: characterizing the behaviour of automated accounts on Twitter during the UK election

Online Social Networks represent a novel opportunity for political campaigns, revolutionising the paradigm of political communication. Nevertheless, many studies uncovered the presence of d/misinformation campaigns or of malicious activities by genuine or automated users, putting at severe risk the credibility of online platforms. This phenomenon is particularly evident during crucial political events, as political elections. In the present paper, we provide a comprehensive description of the structure of the networks of interactions among users and bots during the UK elections of 2019. In particular, we focus on the polarised discussion about Brexit on Twitter analysing a data set made of more than 10 million tweets posted for over a month. We found that the presence of automated accounts fostered the debate particularly in the days before the UK national elections, in which we find a steep increase of bots in the discussion; in the days after the election day, their incidence returned to values similar to the ones observed few weeks before the elections. On the other hand, we found that the number of suspended users (i.e. accounts that were removed by the platform for some violation of the Twitter policy) remained constant until the election day, after which it reached significantly higher values. Remarkably, after the TV debate between Boris Johnson and Jeremy Corbyn, we observed the injection of a large number of novel bots whose behaviour is markedly different from that of pre-existing ones. Finally, we explored the bots' stance, finding that their activity is spread across the whole political spectrum, although in different proportions, and we studied the different usage of hashtags by automated accounts and suspended users, thus targeting the formation of common narratives in different sides of the debate.

cs.SI↗

arXiv2021

Fast and scalable likelihood maximization for Exponential Random Graph Models with local constraints

Exponential Random Graph Models (ERGMs) have gained increasing popularity over the years. Rooted into statistical physics, the ERGMs framework has been successfully employed for reconstructing networks, detecting statistically significant patterns in graphs, counting networked configurations with given properties. From a technical point of view, the ERGMs workflow is defined by two subsequent optimization steps: the first one concerns the maximization of Shannon entropy and leads to identify the functional form of the ensemble probability distribution that is maximally non-committal with respect to the missing information; the second one concerns the maximization of the likelihood function induced by this probability distribution and leads to its numerical determination. This second step translates into the resolution of a system of $O(N)$ non-linear, coupled equations (with $N$ being the total number of nodes of the network under analysis), a problem that is affected by three main issues, i.e. accuracy, speed and scalability. The present paper aims at addressing these problems by comparing the performance of three algorithms (i.e. Newton's method, a quasi-Newton method and a recently-proposed fixed-point recipe) in solving several ERGMs, defined by binary and weighted constraints in both a directed and an undirected fashion. While Newton's method performs best for relatively little networks, the fixed-point recipe is to be preferred when large configurations are considered, as it ensures convergence to the solution within seconds for networks with hundreds of thousands of nodes (e.g. the Internet, Bitcoin). We attach to the paper a Python code implementing the three aforementioned algorithms on all the ERGMs considered in the present work.

physics.data-an↗

arXiv2020

The ambiguity of nestedness under soft and hard constraints

Many real networks feature the property of nestedness, i.e. the neighbours of nodes with a few connections are hierarchically nested within the neighbours of nodes with more connections. Despite the abstract simplicity of this notion, different mathematical definitions of nestedness have been proposed, sometimes giving contrasting results. Moreover, there is an ongoing debate on the statistical significance of nestedness, since even random networks where the number of connections (degree) of each node is fixed to its empirical value are typically as nested as real-world ones. Here we propose a clarification that exploits the recent finding that random networks where the degrees are enforced as hard constraints (microcanonical ensembles) are thermodynamically different from random networks where the degrees are enforced as soft constraints (canonical ensembles). We show that if the real network is perfectly nested, then the two ensembles are trivially equivalent and the observed nestedness, independently of its definition, is indeed an unavoidable consequence of the empirical degrees. On the other hand, if the real network is not perfectly nested, then the two ensembles are not equivalent and alternative definitions of nestedness can be even positively correlated in the canonical ensemble and negatively correlated in the microcanonical one. This result disentangles distinct notions of nestedness captured by different metrics and highlights the importance of making a principled choice between hard and soft constraints in null models of ecological networks.

physics.soc-ph↗

arXiv2019

Community Detection in the Hyperbolic Space

Embedding a network in hyperbolic space can reveal interesting features for the network structure, especially in terms of self-similar characteristics. The hidden metric space, which can be thought of as the underlying structure of the network, is able to preserve some interesting features generally observed in real-world networks such as heterogeneity in the degree distribution, high clustering coefficient, and small-world effect. Moreover, the angular distribution of the nodes in the hyperbolic plane reveals a community structure of the embedded network. It is worth noting that, while a large body of literature compares well-known community detection algorithms, there is still no consensus on what defines an ideal community partition on a network. Moreover, heuristics for communities found on networks embedded in the hyperbolic space have been investigated here for the first time. We compare the partitions found on embedded networks to the partitions obtained before the embedding step, both for a synthetic network and for two real-world networks. The second part of this paper presents the application of our pipeline to a network of retweets in the context of the Italian elections. Our results uncover a community structure reflective of the political spectrum, encouraging further research on the application of community detection heuristics to graphs mapped onto hyperbolic planes.

physics.soc-ph↗

arXiv2018

Colombian export capabilities: building the firms-products network

In this paper we analyse the bipartite Colombian firms-products network, throughout a period of five years, from 2010 to 2014. Our analysis depicts a strongly modular system, with several groups of firms specializing in the export of specific categories of products. These clusters have been detected by running the bipartite variant of the traditional modularity maximization, revealing a bi-modular structure. Interestingly, this finding is refined by applying a recently-proposed algorithm for projecting bipartite networks on the layer of interest and, then, running the Louvain algorithm on the resulting monopartite representations. Important structural differences emerge upon comparing the Colombian firms-products network with the World Trade Web, in particular, the bipartite representation of the latter is not characterized by a similar block-structure, as the modularity maximization fails in revealing (bipartite) nodes clusters. This points out that economic systems behave differently at different scales: while countries tend to diversify their production --potentially exporting a large number of different products-- firms specialize in exporting (substantially very limited) baskets of basically homogeneous products.

physics.soc-ph↗