Pair Formation within Multi-Agent Populations

We present a simple model for the formation of pairs in multi-agent populations of type A and B which move freely on a spatial network. Each agent of population A (and B) is labeled as Ai (and Bj) with i=1,.. NA (and j=1,..NB) and carries its own individual list of characteristics or 'phenotype'. When agents from opposite populations encounter one another on the network, they can form a relationship if not already engaged in one. The length of time for which any given pair stays together depends on the compatibility of the two constituent agents. Possible applications include the human dating scenario, and the commercial domain where two types of businesses A and B have members of each type looking for a business partner, i.e. Ai+Bj-->Rij. The pair Rij then survives for some finite time before dissociating Rij-->Ai+Bj. There are many possible generalizations of this basic setup. Here we content ourselves with some initial numerical results for the simplest of network topologies, together with some accompanying analytic analysis.Comment: Special Issue on Complex Networks, edited by Dirk Helbin

Taxonomy and clustering in collaborative systems: the case of the on-line encyclopedia Wikipedia

In this paper we investigate the nature and structure of the relation between imposed classifications and real clustering in a particular case of a scale-free network given by the on-line encyclopedia Wikipedia. We find a statistical similarity in the distributions of community sizes both by using the top-down approach of the categories division present in the archive and in the bottom-up procedure of community detection given by an algorithm based on the spectral properties of the graph. Regardless the statistically similar behaviour the two methods provide a rather different division of the articles, thereby signaling that the nature and presence of power laws is a general feature for these systems and cannot be used as a benchmark to evaluate the suitability of a clustering method.Comment: 5 pages, 3 figures, epl2 styl

Networks of equities in financial markets

We review the recent approach of correlation based networks of financial equities. We investigate portfolio of stocks at different time horizons, financial indices and volatility time series and we show that meaningful economic information can be extracted from noise dressed correlation matrices. We show that the method can be used to falsify widespread market models by directly comparing the topological properties of networks of real and artificial markets.Comment: 9 pages, 8 figures. Accepted for publication in EPJ

Random graph model with power-law distributed triangle subgraphs

Clustering is well-known to play a prominent role in the description and understanding of complex networks, and a large spectrum of tools and ideas have been introduced to this end. In particular, it has been recognized that the abundance of small subgraphs is important. Here, we study the arrangement of triangles in a model for scale-free random graphs and determine the asymptotic behavior of the clustering coefficient, the average number of triangles, as well as the number of triangles attached to the vertex of maximum degree. We prove that triangles are power-law distributed among vertices and characterized by both vertex and edge coagulation when the degree exponent satisfies $2<\beta<2.5$; furthermore, a finite density of triangles appears as $\beta=2+1/3$.Comment: 4 pages, 2 figure; v2: major conceptual change

Entropy-based approach to missing-links prediction

Link-prediction is an active research field within network theory, aiming at uncovering missing connections or predicting the emergence of future relationships from the observed network structure. This paper represents our contribution to the stream of research concerning missing links prediction. Here, we propose an entropy-based method to predict a given percentage of missing links, by identifying them with the most probable non-observed ones. The probability coefficients are computed by solving opportunely defined null-models over the accessible network structure. Upon comparing our likelihood-based, local method with the most popular algorithms over a set of economic, financial and food networks, we find ours to perform best, as pointed out by a number of statistical indicators (e.g. the precision, the area under the ROC curve, etc.). Moreover, the entropy-based formalism adopted in the present paper allows us to straightforwardly extend the link-prediction exercise to directed networks as well, thus overcoming one of the main limitations of current algorithms. The higher accuracy achievable by employing these methods - together with their larger flexibility - makes them strong competitors of available link-prediction algorithms

Black Hole Thermodynamics in Carath\'eodory's Approach

We show that, in the framework of Carath\'eodory's approach to thermodynamics, one can implement black hole thermodynamics by realizing that there exixts a quasi-homogeneity symmetry of the Pfaffian form \deq representing the infinitesimal heat exchanged reversibly by a Kerr-Newman black hole; this allow us to calculate readily an integrating factor, and, as a consequence, a foliation of the thermodynamic manifold can be recovered.Comment: 10 pages; elsart styl

Extracting significant signal of news consumption from social networks: the case of Twitter in Italian political elections

According to the Eurobarometer report about EU media use of May 2018, the number of European citizens who consult on-line social networks for accessing information is considerably increasing. In this work we analyse approximately 106 tweets exchanged during the last Italian elections held on March 4, 2018. Using an entropy-based null model discounting the activity of the users, we first identify potential political alliances within the group of verified accounts: if two verified users are retweeted more than expected by the non-verified ones, they are likely to be related. Then, we derive the users’ affiliation to a coalition measuring the polarisation of unverified accounts. Finally, we study the bipartite directed representation of the tweets and retweets network, in which tweets and users are collected on the two layers. Users with the highest out-degree identify the most popular ones, whereas highest out-degree posts are the most “viral”. We identify significant content spreaders with a procedure that allows to statistically validate the connections that cannot be explained by users’ tweeting activity and posts’ virality, using an entropy-based null model as benchmark. The analysis of the directed network of validated retweets reveals signals of the alliances formed after the elections, highlighting commonalities of interests before the event of the national elections

DebtRank: A microscopic foundation for shock propagation

The DebtRank algorithm has been increasingly investigated as a method to estimate the impact of shocks in financial networks, as it overcomes the limitations of the traditional default-cascade approaches. Here we formulate a dynamical "microscopic" theory of instability for financial networks by iterating balance sheet identities of individual banks and by assuming a simple rule for the transfer of shocks from borrowers to lenders. By doing so, we generalise the DebtRank formulation, both providing an interpretation of the effective dynamics in terms of basic accounting principles and preventing the underestimation of losses on certain network topologies. Depending on the structure of the interbank leverage matrix the dynamics is either stable, in which case the asymptotic state can be computed analytically, or unstable, meaning that at least one bank will default. We apply this framework to a dataset of the top listed European banks in the period 2008-2013. We find that network effects can generate an amplification of exogenous shocks of a factor ranging between three (in normal periods) and six (during the crisis) when we stress the system with a 0.5% shock on external (i.e. non-interbank) assets for all banks

Italian Twitter semantic network during the Covid-19 epidemic

The Covid-19 pandemic has had a deep impact on the lives of the entire world population, inducing a participated societal debate. As in other contexts, the debate has been the subject of several d/misinformation campaigns; in a quite unprecedented fashion, however, the presence of false information has seriously put at risk the public health. In this sense, detecting the presence of malicious narratives and identifying the kinds of users that are more prone to spread them represent the first step to limit the persistence of the former ones. In the present paper we analyse the semantic network observed on Twitter during the first Italian lockdown (induced by the hashtags contained in approximately 1.5 millions tweets published between the 23rd of March 2020 and the 23rd of April 2020) and study the extent to which various discursive communities are exposed to d/misinformation arguments. As observed in other studies, the recovered discursive communities largely overlap with traditional political parties, even if the debated topics concern different facets of the management of the pandemic. Although the themes directly related to d/misinformation are a minority of those discussed within our semantic networks, their popularity is unevenly distributed among the various discursive communities