arXiv subjects

Luca Dall'Asta

Publications and source records attributed to Luca Dall'Asta.

53 records · Page 3Linked to original sources

arXiv2007

Dynamic Exploration of Networks: from general principles to the traceroute process

Dynamical processes taking place on real networks define on them evolving subnetworks whose topology is not necessarily the same of the underlying one. We investigate the problem of determining the emerging degree distribution, focusing on a class of tree-like processes, such as those used to explore the Internet's topology. A general theory based on mean-field arguments is proposed, both for single-source and multiple-source cases, and applied to the specific example of the traceroute exploration of networks. Our results provide a qualitative improvement in the understanding of dynamical sampling and of the interplay between dynamics and topology in large networks like the Internet.

physics.soc-ph↗

arXiv2007

On a class of rational matrices and interpolating polynomials related to the discrete Laplace operator

Let $\dlap$ be the discrete Laplace operator acting on functions (or rational matrices) $f:\mathbf{Q}_L\to\mathbb{Q}$, where $\mathbf{Q}_L$ is the two dimensional lattice of size $L$ embedded in $\mathbb{Z}_2$. Consider a rational $L\times L$ matrix $\mathcal{H}$, whose inner entries $\mathcal{H}_{ij}$ satisfy $\dlap\mathcal{H}_{ij}=0$. The matrix $\mathcal{H}$ is thus the classical finite difference five-points approximation of the Laplace operator in two variables. We give a constructive proof that $\mathcal{H}$ is the restriction to $\mathbf{Q}_L$ of a discrete harmonic polynomial in two variables for any $L>2$. This result proves a conjecture formulated in the context of deterministic fixed-energy sandpile models in statistical mechanics.

math-ph↗

arXiv2007

Effective surface-tension in the noise-reduced voter model

The role of memory is crucial in determining the properties of many dynamical processes in statistical physics. We show that the simple addition of memory, in the form of noise reduction, modifies the overall scaling behavior of the voter model, introducing an effective surface tension analogous to that recently observed in memory-based models of social dynamics. The numerical results for low-dimensional lattices show a scaling behavior in good agreement with usual Cahn-Allen curvature-driven coarsening, even though slower preasymptotic regimes may be observed depending on the memory properties. Simple arguments and a mean-field analysis provide an explanation for the observed behavior that clarifies the origin of surface tension and the mechanism underlying the coarsening process.

cond-mat.stat-mech↗

arXiv2006

Dynamical Phenomena on Complex Networks

The work presented in this thesis concerns different aspects of dynamical processes on networks. The first subject considered is the theoretical modeling of exploration processes of complex networks, such as the ``traceroute'' process used to map the Internet. Our mean-field analysis of the traceroute model provides a better understanding of the Internet topology. A second part of the thesis is devoted to the study of the weighted representation of networks and their relations with the functional properties of infrastructure systems (e.g. the airports network). Other results concerning spreading processes and percolation on weighted networks are presented. Finally, we turns to social networks, introducing the Naming Game, a model for the emergence of a communication system in a structured population of individuals. We show that the dynamical phenomena generated by this model depend strongly on the topology of the interactions.

physics.soc-ph↗

arXiv2006

Non-equilibrium dynamics of language games on complex networks

The Naming Game is a model of non-equilibrium dynamics for the self-organized emergence of a linguistic convention or a communication system in a population of agents with pairwise local interactions. We present an extensive study of its dynamics on complex networks, that can be considered as the most natural topological embedding for agents involved in language games and opinion dynamics. Except for some community structured networks on which metastable phases can be observed, agents playing the Naming Game always manage to reach a global consensus. This convergence is obtained after a time generically scaling with the population's size $N$ as $t\_{conv} \sim N^{1.4 \pm 0.1}$, i.e. much faster than for agents embedded on regular lattices. Moreover, the memory capacity required by the system scales only linearly with its size. Particular attention is given to heterogenous networks, in which the dynamical activity pattern of a node depends on its degree. High degree nodes have a fundamental role, but require larger memory capacity. They govern the dynamics acting as spreaders of (linguistic) conventions. The effects of other properties, such as the average degree and the clustering, are also discussed.

physics.soc-ph↗

arXiv2006

Dynamical Invariants in the Deterministic Fixed-Energy Sandpile

The non-ergodic behavior of the deterministic Fixed Energy Sandpile (DFES), with Bak-Tang-Wiesenfeld (BTW) rule, is explained by the complete characterization of a class of dynamical invariants (or toppling invariants). The link between such constants of motion and the discrete Laplacian's properties on graphs is algebraically and numerically clarified. In particular, it is possible to build up an explicit algorithm determining the complete set of independent toppling invariants. The partition of the configuration space into dynamically invariant sets, and the further refinement of such a partition into basins of attraction for orbits, are also studied. The total number of invariant sets equals the graph's complexity. In the case of two dimensional lattices, it is possible to estimate a very regular exponential growth of this number vs. the size. Looking at other features, the toppling invariants exhibit a highly irregular behavior. The usual constraint on the energy positiveness introduces a transition in the frozen phase. In correspondence to this transition, a dynamical crossover related to the halting times is observed. The analysis of the configuration space shows that the DFES has a different structure with respect to dissipative BTW and stochastic sandpiles models, supporting the conjecture that it lies in a distinct class of universality.

cond-mat.stat-mech↗

arXiv2006

Microscopic activity patterns in the Naming Game

The models of statistical physics used to study collective phenomena in some interdisciplinary contexts, such as social dynamics and opinion spreading, do not consider the effects of the memory on individual decision processes. On the contrary, in the Naming Game, a recently proposed model of Language formation, each agent chooses a particular state, or opinion, by means of a memory-based negotiation process, during which a variable number of states is collected and kept in memory. In this perspective, the statistical features of the number of states collected by the agents becomes a relevant quantity to understand the dynamics of the model, and the influence of topological properties on memory-based models. By means of a master equation approach, we analyze the internal agent dynamics of Naming Game in populations embedded on networks, finding that it strongly depends on very general topological properties of the system (e.g. average and fluctuations of the degree). However, the influence of topological properties on the microscopic individual dynamics is a general phenomenon that should characterize all those social interactions that can be modeled by memory-based negotiation processes.

cond-mat.dis-nn↗

arXiv2006

Vulnerability of weighted networks

In real networks complex topological features are often associated with a diversity of interactions as measured by the weights of the links. Moreover, spatial constraints may as well play an important role, resulting in a complex interplay between topology, weight, and geography. In order to study the vulnerability of such networks to intentional attacks, these attributes must be therefore considered along with the topological quantities. In order to tackle this issue, we consider the case of the world-wide airport network, which is a weighted heterogeneous network whose evolution and structure are influenced by traffic and geographical constraints. We first characterize relevant topological and weighted centrality measures and then use these quantities as selection criteria for the removal of vertices. We consider different attack strategies and different measures of the damage achieved in the network. The analysis of weighted properties shows that centrality driven attacks are capable to shatter the network's communication or transport properties even at very low level of damage in the connectivity pattern. The inclusion of weight and traffic therefore provides evidence for the extreme vulnerability of complex networks to any targeted strategy and need to be considered as key features in the finding and development of defensive strategies.

physics.soc-ph↗

arXiv2006

Agreement dynamics on small-world networks

In this paper we analyze the effect of a non-trivial topology on the dynamics of the so-called Naming Game, a recently introduced model which addresses the issue of how shared conventions emerge spontaneously in a population of agents. We consider in particular the small-world topology and study the convergence towards the global agreement as a function of the population size $N$ as well as of the parameter $p$ which sets the rate of rewiring leading to the small-world network. As long as $p \gg 1/N$ there exists a crossover time scaling as $N/p^2$ which separates an early one-dimensional-like dynamics from a late stage mean-field-like behavior. At the beginning of the process, the local quasi one-dimensional topology induces a coarsening dynamics which allows for a minimization of the cognitive effort (memory) required to the agents. In the late stages, on the other hand, the mean-field like topology leads to a speed up of the convergence process with respect to the one-dimensional case.

cond-mat.stat-mech↗

arXiv2006

Exact solution of the one-dimensional deterministic Fixed-Energy Sandpile

In reason of the strongly non-ergodic dynamical behavior, universality properties of deterministic Fixed-Energy Sandpiles are still an open and debated issue. We investigate the one-dimensional model, whose microscopical dynamics can be solved exactly, and provide a deeper understanding of the origin of the non-ergodicity. By means of exact arguments, we prove the occurrence of orbits of well-defined periods and their dependence on the conserved energy density. Further statistical estimates of the size of the attraction's basins of the different periodic orbits lead to a complete characterization of the activity vs. energy density phase diagram in the limit of large system's size.

cond-mat.stat-mech↗

arXiv2005

Strategies for fast convergence in semiotic dynamics

Semiotic dynamics is a novel field that studies how semiotic conventions spread and stabilize in a population of agents. This is a central issue both for theoretical and technological reasons since large system made up of communicating agents, like web communities or artificial embodied agents teams, are getting widespread. In this paper we discuss a recently introduced simple multi-agent model which is able to account for the emergence of a shared vocabulary in a population of agents. In particular we introduce a new deterministic agents' playing strategy that strongly improves the performance of the game in terms of faster convergence and reduced cognitive effort for the agents.

physics.soc-ph↗

arXiv2005

k-core decomposition: a tool for the visualization of large scale networks

We use the k-core decomposition to visualize large scale complex networks in two dimensions. This decomposition, based on a recursive pruning of the least connected vertices, allows to disentangle the hierarchical structure of networks by progressively focusing on their central cores. By using this strategy we develop a general visualization algorithm that can be used to compare the structural properties of various networks and highlight their hierarchical structure. The low computational complexity of the algorithm, O(n+e), where 'n' is the size of the network, and 'e' is the number of edges, makes it suitable for the visualization of very large sparse networks. We apply the proposed visualization tool to several real and synthetic graphs, showing its utility in finding specific structural fingerprints of computer generated and real world networks.

cs.NI↗

arXiv2005

Network Inference from TraceRoute Measurements: Internet Topology `Species'

Internet mapping projects generally consist in sampling the network from a limited set of sources by using traceroute probes. This methodology, akin to the merging of spanning trees from the different sources to a set of destinations, leads necessarily to a partial, incomplete map of the Internet. Accordingly, determination of Internet topology characteristics from such sampled maps is in part a problem of statistical inference. Our contribution begins with the observation that the inference of many of the most basic topological quantities -- including network size and degree characteristics -- from traceroute measurements is in fact a version of the so-called `species problem' in statistics. This observation has important implications, since species problems are often quite challenging. We focus here on the most fundamental example of a traceroute internet species: the number of nodes in a network. Specifically, we characterize the difficulty of estimating this quantity through a set of analytical arguments, we use statistical subsampling principles to derive two proposed estimators, and we illustrate the performance of these estimators on networks with various topological characteristics.

cs.NI↗

arXiv2005

Inhomogeneous percolation models for spreading phenomena in random graphs

Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct characterization of networks behaviour in relation with physical flows and spreading phenomena taking place on them. The functionality of real networks also depends on the ability of the nodes and the edges in bearing and handling loads of flows, energy, information and other physical quantities. We propose to study these properties introducing a process of inhomogeneous percolation, in which both the nodes and the edges spread out the flows with a given probability. Generating functions approach is exploited in order to get a generalization of the Molloy-Reed Criterion for inhomogeneous joint site bond percolation in correlated random graphs. A series of simple assumptions allows the analysis of more realistic situations, for which a number of new results are presented. In particular, for the site percolation with inhomogeneous edge transmission, we obtain the explicit expressions of the percolation threshold for many interesting cases, that are analyzed by means of simple examples and numerical simulations. Some possible applications are debated.

cond-mat.stat-mech↗

arXiv2005

Studying the Emerging Global Brain: Analyzing and Visualizing the Impact of Co-Authorship Teams

This paper introduces a suite of approaches and measures to study the impact of co-authorship teams based on the number of publications and their citations on a local and global scale. In particular, we present a novel weighted graph representation that encodes coupled author-paper networks as a weighted co-authorship graph. This weighted graph representation is applied to a dataset that captures the emergence of a new field of science and comprises 614 papers published by 1,036 unique authors between 1974 and 2004. In order to characterize the properties and evolution of this field we first use four different measures of centrality to identify the impact of authors. A global statistical analysis is performed to characterize the distribution of paper production and paper citations and its correlation with the co-authorship team size. The size of co-authorship clusters over time is examined. Finally, a novel local, author-centered measure based on entropy is applied to determine the global evolution of the field and the identification of the contribution of a single author's impact across all of its co-authorship relations. A visualization of the growth of the weighted co-author network and the results obtained from the statistical analysis indicate a drift towards a more cooperative, global collaboration process as the main drive in the production of scientific knowledge.

cond-mat.other↗

arXiv2004

Exploring networks with traceroute-like probes: theory and simulations

Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different spanning trees to a set of destination, has been argued to introduce uncontrolled sampling biases that might produce statistical properties of the sampled graph which sharply differ from the original ones. In this paper we explore these biases and provide a statistical analysis of their origin. We derive an analytical approximation for the probability of edge and vertex detection that exploits the role of the number of sources and targets and allows us to relate the global topological properties of the underlying network with the statistical accuracy of the sampled graph. In particular, we find that the edge and vertex detection probability depends on the betweenness centrality of each element. This allows us to show that shortest path routed sampling provides a better characterization of underlying graphs with broad distributions of connectivity. We complement the analytical discussion with a throughout numerical investigation of simulated mapping strategies in network models with different topologies. We show that sampled graphs provide a fair qualitative characterization of the statistical properties of the original networks in a fair range of different strategies and exploration parameters. Moreover, we characterize the level of redundancy and completeness of the exploration process as a function of the topological properties of the network. Finally, we study numerically how the fraction of vertices and edges discovered in the sampled graph depends on the particular deployements of probing sources. The results might hint the steps toward more efficient mapping strategies.

cs.NI↗

arXiv2004

A statistical approach to the traceroute-like exploration of networks: theory and simulations

Mapping the Internet generally consists in sampling the network from a limited set of sources by using "traceroute"-like probes. This methodology, akin to the merging of different spanning trees to a set of destinations, has been argued to introduce uncontrolled sampling biases that might produce statistical properties of the sampled graph which sharply differ from the original ones. Here we explore these biases and provide a statistical analysis of their origin. We derive a mean-field analytical approximation for the probability of edge and vertex detection that exploits the role of the number of sources and targets and allows us to relate the global topological properties of the underlying network with the statistical accuracy of the sampled graph. In particular we find that the edge and vertex detection probability is depending on the betweenness centrality of each element. This allows us to show that shortest path routed sampling provides a better characterization of underlying graphs with scale-free topology. We complement the analytical discussion with a throughout numerical investigation of simulated mapping strategies in different network models. We show that sampled graphs provide a fair qualitative characterization of the statistical properties of the original networks in a fair range of different strategies and exploration parameters. The numerical study also allows the identification of intervals of the exploration parameters that optimize the fraction of nodes and edges discovered in the sampled graph. This finding might hint the steps toward more efficient mapping strategies.

cond-mat.stat-mech↗