arXiv subjects

Renaud Lambiotte

Publications and source records attributed to Renaud Lambiotte.

151 records · Page 9Linked to original sources

arXiv2009

Laplacian Dynamics and Multiscale Modular Structure in Networks

Most methods proposed to uncover communities in complex networks rely on their structural properties. Here we introduce the stability of a network partition, a measure of its quality defined in terms of the statistical properties of a dynamical process taking place on the graph. The time-scale of the process acts as an intrinsic parameter that uncovers community structures at different resolutions. The stability extends and unifies standard notions for community detection: modularity and spectral partitioning can be seen as limiting cases of our dynamic measure. Similarly, recently proposed multi-resolution methods correspond to linearisations of the stability at short times. The connection between community detection and Laplacian dynamics enables us to establish dynamically motivated stability measures linked to distinct null models. We apply our method to find multi-scale partitions for different networks and show that the stability can be computed efficiently for large networks with extended versions of current algorithms.

physics.soc-ph↗

arXiv2009

Coeovolutionary Threshold Dynamics

We present a generic threshold model for the co-evolution of the structure of a network and the state of its nodes. We focus on regular directed networks and derive equations for the evolution of the system toward its absorbing state. It is shown that the system displays a transition from a connected phase to a fragmented phase that depends on its initial configuration. Computer simulations are performed and confirm the theoretical predictions.

physics.soc-ph↗

arXiv2008

Dynamics of latent voters

We study the effect of latency on binary-choice opinion formation models. Latency is introduced into the models as an additional dynamic rule: after a voter changes its opinion, it enters a waiting period of stochastic length where no further changes take place. We first focus on the voter model and show that as a result of introducing latency, the average magnetization is not conserved, and the system is driven toward zero magnetization, independently of initial conditions. The model is studied analytically in the mean-field case and by simulations in one dimension. We also address the behavior of the Majority Rule model with added latency, and show that the competition between imitation and latency leads to a rich phenomenology.

physics.soc-ph↗

arXiv2008

Fast unfolding of communities in large networks

We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection method in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2.6 million customers and by analyzing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad-hoc modular networks. .

physics.soc-ph↗

arXiv2008

Geographical dispersal of mobile communication networks

In this paper, we analyze statistical properties of a communication network constructed from the records of a mobile phone company. The network consists of 2.5 million customers that have placed 810 millions of communications (phone calls and text messages) over a period of 6 months and for whom we have geographical home localization information. It is shown that the degree distribution in this network has a power-law degree distribution $k^{-5}$ and that the probability that two customers are connected by a link follows a gravity model, i.e. decreases like $d^{-2}$, where $d$ is the distance between the customers. We also consider the geographical extension of communication triangles and we show that communication triangles are not only composed of geographically adjacent nodes but that they may extend over large distances. This last property is not captured by the existing models of geographical networks and in a last section we propose a new model that reproduces the observed property. Our model, which is based on the migration and on the local adaptation of agents, is then studied analytically and the resulting predictions are confirmed by computer simulations.

physics.soc-ph↗

arXiv2007

Opinion Formation in Laggard Societies

We introduce a statistical physics model for opinion dynamics on random networks where agents adopt the opinion held by the majority of their direct neighbors only if the fraction of these neighbors exceeds a certain threshold, p_u. We find a transition from total final consensus to a mixed phase where opinions coexist amongst the agents. The relevant parameters are the relative sizes in the initial opinion distribution within the population and the connectivity of the underlying network. As the order parameter we define the asymptotic state of opinions. In the phase diagram we find regions of total consensus and a mixed phase. As the 'laggard parameter' p_u increases the regions of consensus shrink. In addition we introduce rewiring of the underlying network during the opinion formation process and discuss the resulting consequences in the phase diagram.

physics.soc-ph↗

arXiv2006

Unanimity Rule on networks

We introduce a model for innovation-, evolution- and opinion dynamics whose spreading is dictated by unanimity rules, i.e. a node will change its (binary) state only if all of its neighbours have the same corresponding state. It is shown that a transition takes place depending on the initial condition of the problem. In particular, a critical number of initially activated nodes is needed so that the whole system gets activated in the long-time limit. The influence of the degree distribution of the nodes is naturally taken into account. For simple network topologies we solve the model analytically, the cases of random, small-world and scale-free are studied in detail.

physics.soc-ph↗