arXiv subjects

Renaud Lambiotte

Publications and source records attributed to Renaud Lambiotte.

At least 109 records · Page 6Linked to original sources

arXiv2019

Multiscale dynamical embeddings of complex networks

Complex systems and relational data are often abstracted as dynamical processes on networks. To understand, predict and control their behavior, a crucial step is to extract reduced descriptions of such networks. Inspired by notions from Control Theory, we propose a time-dependent dynamical similarity measure between nodes, which quantifies the effect a node-input has on the network. This dynamical similarity induces an embedding that can be employed for several analysis tasks. Here we focus on (i)~dimensionality reduction, i.e., projecting nodes onto a low dimensional space that captures dynamic similarity at different time scales, and (ii)~how to exploit our embeddings to uncover functional modules. We exemplify our ideas through case studies focusing on directed networks without strong connectivity, and signed networks. We further highlight how certain ideas from community detection can be generalized and linked to Control Theory, by using the here developed dynamical perspective.

cs.SI↗

arXiv2019

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 analyze approximately $10^6$ tweets exchanged during the last Italian elections. By 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 polarization 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 by statistically validating the connections that cannot be explained by users' tweeting activity and posts' virality by 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.

physics.soc-ph↗

arXiv2018

Rock-Paper-Scissors Random Walks on Temporal Multilayer Networks

We study diffusion on a multilayer network where the contact dynamics between the nodes is governed by a random process and where the waiting time distribution differs for edges from different layers. We study the impact on a random walk of the competition that naturally emerges between the edges of the different layers. In opposition to previous studies which have imposed a priori inter-layer competition, the competition is here induced by the heterogeneity of the activity on the different layers. We first study the precedence relation between different edges and by extension between different layers, and show that it determines biased paths for the walker. We also discuss the emergence of cyclic, rock-paper-scissors random walks, when the precedence between layers is non-transitive. Finally, we numerically show the slowing-down effect due to the competition on a heterogeneous multilayer as the walker is likely to be trapped for a longer time either on a single layer, or on an oriented cycle . Keywords: random walks; multilayer networks; dynamical systems on networks; models of networks; simulations of networks; competition between layers.

physics.soc-ph↗

arXiv2018

Relating modularity maximization and stochastic block models in multilayer networks

Characterizing large-scale organization in networks, including multilayer networks, is one of the most prominent topics in network science and is important for many applications. One type of mesoscale feature is community structure, in which sets of nodes are densely connected internally but sparsely connected to other dense sets of nodes. Two of the most popular approaches for community detection are to maximize an objective function called "modularity" and to perform statistical inference using stochastic block models. Generalizing work by Newman on monolayer networks (Physical Review E 94, 052315), we show in multilayer networks that maximizing modularity is equivalent, under certain conditions, to maximizing the posterior probability of community assignments under a suitably chosen stochastic block model. We derive versions of this equivalence for various types of multilayer structure, including temporal, multiplex, and multilevel networks. We consider cases in which the key parameters are constant, as well as ones in which they vary across layers; in the latter case, this yields a novel, layer-weighted version of the modularity function. Our results also help address a longstanding difficulty of multilayer modularity-maximization algorithms, which require the specification of two sets of tuning parameters that have been difficult to choose in practice. We show how to perform this parameter selection in a statistically-grounded way, and we demonstrate the effectiveness of our approach on both synthetic and empirical networks.

cs.SI↗

arXiv2018

Structure and dynamical behaviour of non-normal networks

We analyse a collection of empirical networks in a wide spectrum of disciplines and show that strong non-normality is ubiquitous in network science. Dynamical processes evolving on non-normal networks exhibit a peculiar behaviour, as initial small disturbances may undergo a transient phase and be strongly amplified in linearly stable systems. Additionally, eigenvalues may become extremely sensible to noise, and have a diminished physical meaning. We identify structural properties of networks that are associated to non-normality and propose simple models to generate networks with a tuneable level of non-normality. We also show the potential use of a variety of metrics capturing different aspects of non-normality, and propose their potential use in the context of the stability of complex ecosystems.

nlin.AO↗

arXiv2018

Random walk on temporal networks with lasting edges

We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time of edges activation. We first propose a comprehensive analytical and numerical treatment on directed acyclic graphs. Once cycles are allowed in the network, non-Markovian trajectories may emerge, remarkably even if the walker and the evolution of the network edges are governed by memoryless Poisson processes. We then introduce a general analytical framework to characterize such non-Markovian walks and validate our findings with numerical simulations.

physics.soc-ph↗

arXiv2018

Identifying exogenous and endogenous activity in social media

The occurrence of new events in a system is typically driven by external causes and by previous events taking place inside the system. This is a general statement, applying to a range of situations including, more recently, to the activity of users in Online social networks (OSNs). Here we develop a method for extracting from a series of posting times the relative contributions of exogenous, e.g. news media, and endogenous, e.g. information cascade. The method is based on the fitting of a generalized linear model (GLM) equipped with a self-excitation mechanism. We test the method with synthetic data generated by a nonlinear Hawkes process, and apply it to a real time series of tweets with a given hashtag. In the empirical dataset, the estimated contributions of exogenous and endogenous volumes are close to the amounts of original tweets and retweets respectively. We conclude by discussing the possible applications of the method, for instance in online marketing.

physics.soc-ph↗

arXiv2018

Simplicial complexes and complex systems

We provide a short introduction to the field of topological data analysis and discuss its possible relevance for the study of complex systems. Topological data analysis provides a set of tools to characterise the shape of data, in terms of the presence of holes or cavities between the points. The methods, based on notion of simplicial complexes, generalise standard network tools by naturally allowing for many-body interactions and providing results robust under continuous deformations of the data. We present strengths and weaknesses of current methods, as well as a range of empirical studies relevant to the field of complex systems, before identifying future methodological challenges to help understand the emergence of collective phenomena.

physics.data-an↗

arXiv2018

Understanding Complex Systems: From Networks to Optimal Higher-Order Models

To better understand the structure and function of complex systems, researchers often represent direct interactions between components in complex systems with networks, assuming that indirect influence between distant components can be modelled by paths. Such network models assume that actual paths are memoryless. That is, the way a path continues as it passes through a node does not depend on where it came from. Recent studies of data on actual paths in complex systems question this assumption and instead indicate that memory in paths does have considerable impact on central methods in network science. A growing research community working with so-called higher-order network models addresses this issue, seeking to take advantage of information that conventional network representations disregard. Here we summarise the progress in this area and outline remaining challenges calling for more research.

physics.soc-ph↗

arXiv2018

Multiscale mixing patterns in networks

Assortative mixing in networks is the tendency for nodes with the same attributes, or metadata, to link to each other. It is a property often found in social networks manifesting as a higher tendency of links occurring between people with the same age, race, or political belief. Quantifying the level of assortativity or disassortativity (the preference of linking to nodes with different attributes) can shed light on the factors involved in the formation of links and contagion processes in complex networks. It is common practice to measure the level of assortativity according to the assortativity coefficient, or modularity in the case of discrete-valued metadata. This global value is the average level of assortativity across the network and may not be a representative statistic when mixing patterns are heterogeneous. For example, a social network spanning the globe may exhibit local differences in mixing patterns as a consequence of differences in cultural norms. Here, we introduce an approach to localise this global measure so that we can describe the assortativity, across multiple scales, at the node level. Consequently we are able to capture and qualitatively evaluate the distribution of mixing patterns in the network. We find that for many real-world networks the distribution of assortativity is skewed, overdispersed and multimodal. Our method provides a clearer lens through which we can more closely examine mixing patterns in networks.

cs.SI↗

arXiv2018

Structured networks and coarse-grained descriptions: a dynamical perspective

This chapter discusses the interplay between structure and dynamics in complex networks. Given a particular network with an endowed dynamics, our goal is to find partitions aligned with the dynamical process acting on top of the network. We thus aim to gain a reduced description of the system that takes into account both its structure and dynamics. In the first part, we introduce the general mathematical setup for the types of dynamics we consider throughout the chapter. We provide two guiding examples, namely consensus dynamics and diffusion processes (random walks), motivating their connection to social network analysis, and provide a brief discussion on the general dynamical framework and its possible extensions. In the second part, we focus on the influence of graph structure on the dynamics taking place on the network, focusing on three concepts that allow us to gain insight into this notion. First, we describe how time scale separation can appear in the dynamics on a network as a consequence of graph structure. Second, we discuss how the presence of particular symmetries in the network give rise to invariant dynamical subspaces that can be precisely described by graph partitions. Third, we show how this dynamical viewpoint can be extended to study dynamics on networks with signed edges, which allow us to discuss connections to concepts in social network analysis, such as structural balance. In the third part, we discuss how to use dynamical processes unfolding on the network to detect meaningful network substructures. We then show how such dynamical measures can be related to seemingly different algorithm for community detection and coarse-graining proposed in the literature. We conclude with a brief summary and highlight interesting open future directions.

cs.SI↗

arXiv2018

Co-occurrence simplicial complexes in mathematics: identifying the holes of knowledge

In the last years complex networks tools contributed to provide insights on the structure of research, through the study of collaboration, citation and co-occurrence networks. The network approach focuses on pairwise relationships, often compressing multidimensional data structures and inevitably losing information. In this paper we propose for the first time a simplicial complex approach to word co-occurrences, providing a natural framework for the study of higher-order relations in the space of scientific knowledge. Using topological methods we explore the conceptual landscape of mathematical research, focusing on homological holes, regions with low connectivity in the simplicial structure. We find that homological holes are ubiquitous, which suggests that they capture some essential feature of research practice in mathematics. Holes die when a subset of their concepts appear in the same article, hence their death may be a sign of the creation of new knowledge, as we show with some examples. We find a positive relation between the dimension of a hole and the time it takes to be closed: larger holes may represent potential for important advances in the field because they separate conceptually distant areas. We also show that authors' conceptual entropy is positively related with their contribution to homological holes, suggesting that polymaths tend to be on the frontier of research.

physics.soc-ph↗

arXiv2017

Different approaches to community detection

A precise definition of what constitutes a community in networks has remained elusive. Consequently, network scientists have compared community detection algorithms on benchmark networks with a particular form of community structure and classified them based on the mathematical techniques they employ. However, this comparison can be misleading because apparent similarities in their mathematical machinery can disguise different reasons for why we would want to employ community detection in the first place. Here we provide a focused review of these different motivations that underpin community detection. This problem-driven classification is useful in applied network science, where it is important to select an appropriate algorithm for the given purpose. Moreover, highlighting the different approaches to community detection also delineates the many lines of research and points out open directions and avenues for future research.

cs.SI↗

arXiv2017

Graph spectral characterisation of the XY model on complex networks

There is recent evidence that the $XY$ spin model on complex networks can display three different macroscopic states in response to the topology of the network underpinning the interactions of the spins. In this work, we present a novel way to characterise the macroscopic states of the $XY$ spin model based on the spectral decomposition of time series using topological information about the underlying networks. We use three different classes of networks to generate time series of the spins for the three possible macroscopic states. We then use the temporal Graph Signal Transform technique to decompose the time series of the spins on the eigenbasis of the Laplacian. From this decomposition, we produce spatial power spectra, which summarise the activation of structural modes by the non-linear dynamics, and thus coherent patterns of activity of the spins. These signatures of the macroscopic states are independent of the underlying networks and can thus be used as universal signatures for the macroscopic states. This work opens new avenues to analyse and characterise dynamics on complex networks using temporal Graph Signal Analysis.

cond-mat.stat-mech↗

arXiv2017

The many facets of community detection in complex networks

Community detection, the decomposition of a graph into essential building blocks, has been a core research topic in network science over the past years. Since a precise notion of what constitutes a community has remained evasive, community detection algorithms have often been compared on benchmark graphs with a particular form of assortative community structure and classified based on the mathematical techniques they employ. However, this comparison can be misleading because apparent similarities in their mathematical machinery can disguise different goals and reasons for why we want to employ community detection in the first place. Here we provide a focused review of these different motivations that underpin community detection. This problem-driven classification is useful in applied network science, where it is important to select an appropriate algorithm for the given purpose. Moreover, highlighting the different facets of community detection also delineates the many lines of research and points out open directions and avenues for future research.

cs.SI↗

arXiv2017

Using higher-order Markov models to reveal flow-based communities in networks

Complex systems made of interacting elements are commonly abstracted as networks, in which nodes are associated with dynamic state variables, whose evolution is driven by interactions mediated by the edges. Markov processes have been the prevailing paradigm to model such a network-based dynamics, for instance in the form of random walks or other types of diffusions. Despite the success of this modelling perspective for numerous applications, it represents an over-simplification of several real-world systems. Importantly, simple Markov models lack memory in their dynamics, an assumption often not realistic in practice. Here, we explore possibilities to enrich the system description by means of second-order Markov models, exploiting empirical pathway information. We focus on the problem of community detection and show that standard network algorithms can be generalized in order to extract novel temporal information about the system under investigation. We also apply our methodology to temporal networks, where we can uncover communities shaped by the temporal correlations in the system. Finally, we discuss relations of the framework of second order Markov processes and the recently proposed formalism of using non-backtracking matrices for community detection.

physics.soc-ph↗

arXiv2017

Developing and Deploying a Taxi Price Comparison Mobile App in the Wild: Insights and Challenges

As modern transportation systems become more complex, there is need for mobile applications that allow travelers to navigate efficiently in cities. In taxi transport the recent proliferation of Uber has introduced new norms including a flexible pricing scheme where journey costs can change rapidly depending on passenger demand and driver supply. To make informed choices on the most appropriate provider for their journeys, travelers need access to knowledge about provider pricing in real time. To this end, we developed OpenStreetcab a mobile application that offers advice on taxi transport comparing provider prices. We describe its development and deployment in two cities, London and New York, and analyse thousands of user journey queries to compare the price patterns of Uber against major local taxi providers. We have observed large heterogeneity across the taxi transport markets in the two cities. This motivated us to perform a price validation and measurement experiment on the ground comparing Uber and Black Cabs in London. The experimental results reveal interesting insights: not only they confirm feedback on pricing and service quality received by professional drivers users, but also they reveal the tradeoffs between prices and journey times between taxi providers. With respect to journey times in particular, we show how experienced taxi drivers, in the majority of the cases, are able to navigate faster to a destination compared to drivers who rely on modern navigation systems. We provide evidence that this advantage becomes stronger in the centre of a city where urban density is high.

cs.CY↗

arXiv2016

Onset of anomalous diffusion from local motion rules

Anomalous diffusion processes, in particular superdiffusive ones, are known to be efficient strategies for searching and navigation by animals and also in human mobility. One way to create such regimes are Lévy flights, where the walkers are allowed to perform jumps, the "flights", that can eventually be very long as their length distribution is asymptotically power-law distributed. In our work, we present a model in which walkers are allowed to perform, on a 1D lattice, "cascades" of $n$ unitary steps instead of one jump of a randomly generated length, as in the Lévy case, where $n$ is drawn from a cascade distribution $p_n$. We show that this local mechanism may give rise to superdiffusion or normal diffusion when $p_n$ is distributed as a power law. We also introduce waiting times that are power-law distributed as well and therefore the probability distribution scaling is steered by the two PDF's power-law exponents. As a perspective, our approach may engender a possible generalization of anomalous diffusion in context where distances are difficult to define, as in the case of complex networks, and also provide an interesting model for diffusion in temporal networks.

physics.soc-ph↗