arXiv subjects

Luca Dall'Asta

Publications and source records attributed to Luca Dall'Asta.

At least 37 records · Page 2Linked to original sources

arXiv2016

Control of Multilayer Networks

The controllability of a network is a theoretical problem of relevance in a variety of contexts ranging from financial markets to the brain. Until now, network controllability has been characterized only on isolated networks, while the vast majority of complex systems are formed by multilayer networks. Here we build a theoretical framework for the linear controllability of multilayer networks by mapping the problem into a combinatorial matching problem. We found that correlating the external signals in the different layers can significantly reduce the multiplex network robustness to node removal, as it can be seen in conjunction with a hybrid phase transition occurring in interacting Poisson networks. Moreover we observe that multilayer networks can stabilize the fully controllable multiplex network configuration that can be stable also when the full controllability of the single network is not stable.

physics.soc-ph↗

arXiv2015

Fixation properties of subdivided populations with balancing selection

In subdivided populations, migration acts together with selection and genetic drift and determines their evolution. Building up on a recently proposed method, which hinges on the emergence of a time scale separation between local and global dynamics, we study the fixation properties of subdivided populations in the presence of balancing selection. The approximation implied by the method is accurate when the effective selection strength is small and the number of subpopulations is large. In particular, it predicts a phase transition between species coexistence and biodiversity loss in the infinite-size limit and, in finite populations, a nonmonotonic dependence of the mean fixation time on the migration rate. In order to investigate the fixation properties of the subdivided population for stronger selection, we introduce an effective coarser description of the dynamics in terms of a voter model with intermediate states, which highlights the basic mechanisms driving the evolutionary process.

q-bio.PE↗

arXiv2015

The edge-disjoint path problem on random graphs by message-passing

We present a message-passing algorithm to solve the edge disjoint path problem (EDP) on graphs incorporating under a unique framework both traffic optimization and path length minimization. The min-sum equations for this problem present an exponential computational cost in the number of paths. To overcome this obstacle we propose an efficient implementation by mapping the equations onto a weighted combinatorial matching problem over an auxiliary graph. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behaviour of both the number of paths to be accommodated and their minimum total length.

cond-mat.dis-nn↗

arXiv2014

Network Controllability Is Determined by the Density of Low In-Degree and Out-Degree Nodes

The problem of controllability of the dynamical state of a network is central in network theory and has wide applications ranging from network medicine to financial markets. The driver nodes of the network are the nodes that can bring the network to the desired dynamical state if an external signal is applied to them. Using the framework of structural controllability, here we show that the density of nodes with in-degree and out-degree equal to $0$, $1$ and $2$ determines the number of driver nodes of random networks. Moreover we show that networks with minimum in-degree and out-degree greater than 2, are always fully controllable by an infinitesimal fraction of driver nodes, regardless on the other properties of the degree distribution. Finally, based on these results, we propose an algorithm to improve the controllability of networks.

cond-mat.stat-mech↗

arXiv2014

The zero-patient problem with noisy observations

A Belief Propagation approach has been recently proposed for the zero-patient problem in a SIR epidemics. The zero-patient problem consists in finding the initial source of an epidemic outbreak given observations at a later time. In this work, we study a harder but related inference problem, in which observations are noisy and there is confusion between observed states. In addition to studying the zero-patient problem, we also tackle the problem of completing and correcting the observations possibly finding undiscovered infected individuals and false test results. Moreover, we devise a set of equations, based on the variational expression of the Bethe free energy, to find the zero patient along with maximum-likelihood epidemic parameters. We show, by means of simulated epidemics, how this method is able to infer details on the past history of an epidemic outbreak based solely on the topology of the contact network and a single snapshot of partial and noisy observations.

q-bio.PE↗

arXiv2014

Nonmonotonic Effects of Migration in Subdivided Populations

The influence of migration on the stochastic dynamics of subdivided populations is still an open issue in various evolutionary models. We develop here a self-consistent mean-field-like method in order to determine the effects of migration on relevant nonequilibrium properties, such as the mean fixation time. If evolution strongly favors coexistence of species (e.g., balancing selection), the mean fixation time develops an unexpected minimum as a function of the migration rate. Our analysis hinges only on the presence of a separation of time scales between local and global dynamics and therefore it carries over to other nonequilibrium processes in physics, biology, ecology, and social sciences.

cond-mat.stat-mech↗

arXiv2014

Bayesian inference of epidemics on networks via Belief Propagation

We study several bayesian inference problems for irreversible stochastic epidemic models on networks from a statistical physics viewpoint. We derive equations which allow to accurately compute the posterior distribution of the time evolution of the state of each node given some observations. At difference with most existing methods, we allow very general observation models, including unobserved nodes, state observations made at different or unknown times, and observations of infection times, possibly mixed together. Our method, which is based on the Belief Propagation algorithm, is efficient, naturally distributed, and exact on trees. As a particular case, we consider the problem of finding the "zero patient" of a SIR or SI epidemic given a snapshot of the state of the network at a later unknown time. Numerical simulations show that our method outperforms previous ones on both synthetic and real networks, often by a very large margin.

q-bio.QM↗

arXiv2013

Optimizing spread dynamics on graphs by message passing

Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been successfully applied to describe cascades in a large variety of contexts. Over the last decades, many efforts have been devoted to understand the typical behaviour of the cascades arising from initial conditions extracted at random from some given ensemble. However, the problem of optimizing the trajectory of the system, i.e. of identifying appropriate initial conditions to maximize (or minimize) the final number of active nodes, is still considered to be practically intractable, with the only exception of models that satisfy a sort of diminishing returns property called submodularity. Submodular models can be approximately solved by means of greedy strategies, but by definition they lack cooperative characteristics which are fundamental in many real systems. Here we introduce an efficient algorithm based on statistical physics for the optimization of trajectories in cascade processes on graphs. We show that for a wide class of irreversible dynamics, even in the absence of submodularity, the spread optimization problem can be solved efficiently on large networks. Analytic and algorithmic results on random graphs are complemented by the solution of the spread maximization problem on a real-world network (the Epinions consumer reviews network).

cond-mat.dis-nn↗

arXiv2012

Voter models with conserved dynamics

We propose a modified voter model with locally conserved magnetization and investigate its phase ordering dynamics in two dimensions in numerical simulations. Imposing a local constraint on the dynamics has the surprising effect of speeding up the phase ordering process. The system is shown to exhibit a scaling regime characterized by algebraic domain growth, at odds with the logarithmic coarsening of the standard voter model. A phenomenological approach based on cluster diffusion and similar to Smoluchowski ripening correctly predicts the observed scaling regime. Our analysis exposes unexpected complexity in the phase ordering dynamics without thermodynamic potential.

cond-mat.stat-mech↗

arXiv2011

Collaboration in Social Networks

The very notion of social network implies that linked individuals interact repeatedly with each other. This allows them not only to learn successful strategies and adapt to them, but also to condition their own behavior on the behavior of others, in a strategic forward looking manner. Game theory of repeated games shows that these circumstances are conducive to the emergence of collaboration in simple games of two players. We investigate the extension of this concept to the case where players are engaged in a local contribution game and show that rationality and credibility of threats identify a class of Nash equilibria -- that we call "collaborative equilibria" -- that have a precise interpretation in terms of sub-graphs of the social network. For large network games, the number of such equilibria is exponentially large in the number of players. When incentives to defect are small, equilibria are supported by local structures whereas when incentives exceed a threshold they acquire a non-local nature, which requires a "critical mass" of more than a given fraction of the players to collaborate. Therefore, when incentives are high, an individual deviation typically causes the collapse of collaboration across the whole system. At the same time, higher incentives to defect typically support equilibria with a higher density of collaborators. The resulting picture conforms with several results in sociology and in the experimental literature on game theory, such as the prevalence of collaboration in denser groups and in the structural hubs of sparse networks.

physics.soc-ph↗

arXiv2011

Fixation and escape times in stochastic game learning

Evolutionary dynamics in finite populations is known to fixate eventually in the absence of mutation. We here show that a similar phenomenon can be found in stochastic game dynamical batch learning, and investigate fixation in learning processes in a simple 2x2 game, for two-player games with cyclic interaction, and in the context of the best-shot network game. The analogues of finite populations in evolution are here finite batches of observations between strategy updates. We study when and how such fixation can occur, and present results on the average time-to-fixation from numerical simulations. Simple cases are also amenable to analytical approaches and we provide estimates of the behaviour of so-called escape times as a function of the batch size. The differences and similarities with escape and fixation in evolutionary dynamics are discussed.

physics.soc-ph↗

arXiv2010

Strong Noise Effects in one-dimensional Neutral Populations

The dynamics of well-mixed biological populations is usually studied by mean-field methods and weak-noise expansions. Similar methods have been applied also in spatially extended problems, relying on the fact that these populations are organized in colonies with a large local density of individuals. We provide a counterexample discussing a one-dimensional neutral population with negative frequency-dependent selection. The system exhibits a continuous phase transition between genetic fixation and coexistence unexpected from weak-noise arguments. We show that the behavior is a non-perturbative effect of the internal noise that is amplified by presence of spatial correlations (strong-noise regime).

cond-mat.stat-mech↗

arXiv2010

Critical fluctuations in spatial complex networks

An anomalous mean-field solution is known to capture the non trivial phase diagram of the Ising model in annealed complex networks. Nevertheless the critical fluctuations in random complex networks remain mean-field. Here we show that a break-down of this scenario can be obtained when complex networks are embedded in geometrical spaces. Through the analysis of the Ising model on annealed spatial networks, we reveal in particular the spectral properties of networks responsible for critical fluctuations and we generalize the Ginsburg criterion to complex topologies.

cond-mat.stat-mech↗

arXiv2009

A minimal model for congestion phenomena on complex networks

We study a minimal model of traffic flows in complex networks, simple enough to get analytical results, but with a very rich phenomenology, presenting continuous, discontinuous as well as hybrid phase transitions between a free-flow phase and a congested phase, critical points and different scaling behaviors in the system size. It consists of random walkers on a queueing network with one-range repulsion, where particles can be destroyed only if they can move. We focus on the dependence on the topology as well as on the level of traffic control. We are able to obtain transition curves and phase diagrams at analytical level for the ensemble of uncorrelated networks and numerically for single instances. We find that traffic control improves global performance, enlarging the free-flow region in parameter space only in heterogeneous networks. Traffic control introduces non-linear effects and, beyond a critical strength, may trigger the appearance of a congested phase in a discontinuous manner. The model also reproduces the cross-over in the scaling of traffic fluctuations empirically observed in the Internet, and moreover, a conserved version can reproduce qualitatively some stylized facts of traffic in transportation networks.

cond-mat.stat-mech↗

arXiv2008

Congestion phenomena on complex networks

We define a minimal model of traffic flows in complex networks containing the most relevant features of real routing schemes, i.e. a trade--off strategy between topological-based and traffic-based routing. The resulting collective behavior, obtained analytically for the ensemble of uncorrelated networks, is physically very rich and reproduces results recently observed in traffic simulations on scale-free networks. We find that traffic control is useless in homogeneous graphs but may improves global performance in inhomogeneous networks, enlarging the free-flow region in parameter space. Traffic control also introduces non-linear effects and, beyond a critical strength, may trigger the appearance of a congested phase in a discontinuous manner.

physics.soc-ph↗

arXiv2008

Algebraic coarsening in voter models with intermediate states

The introduction of intermediate states in the dynamics of the voter model modifies the ordering process and restores an effective surface tension. The logarithmic coarsening of the conventional voter model in two dimensions is eliminated in favour of an algebraic decay of the density of interfaces with time, compatible with Model A dynamics at low temperatures. This phenomenon is addressed by deriving Langevin equations for the dynamics of appropriately defined continuous fields. These equations are analyzed using field theoretical arguments and by means of a recently proposed numerical technique for the integration of stochastic equations with multiplicative noise. We find good agreement with lattice simulations of the microscopic model.

cond-mat.stat-mech↗

arXiv2008

K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases

We consider the $k$-core decomposition of network models and Internet graphs at the autonomous system (AS) level. The $k$-core analysis allows to characterize networks beyond the degree distribution and uncover structural properties and hierarchies due to the specific architecture of the system. We compare the $k$-core structure obtained for AS graphs with those of several network models and discuss the differences and similarities with the real Internet architecture. The presence of biases and the incompleteness of the real maps are discussed and their effect on the $k$-core analysis is assessed with numerical experiments simulating biased exploration on a wide range of network models. We find that the $k$-core analysis provides an interesting characterization of the fluctuations and incompleteness of maps as well as information helping to discriminate the original underlying structure.

cs.NI↗

arXiv2007

Statistical physics of the Schelling model of segregation

We investigate the static and dynamic properties of a celebrated model of social segregation, providing a complete explanation of the mechanisms leading to segregation both in one- and two-dimensional systems. Standard statistical physics methods shed light on the rich phenomenology of this simple model, exhibiting static phase transitions typical of kinetic constrained models, nontrivial coarsening like in driven-particle systems and percolation-related phenomena.

physics.soc-ph↗