Edmilson Roque

This paper is concerned with distributed computation of several commonly used centrality measures in complex networks. In particular, we propose deterministic algorithms, which converge in finite time, for the distributed computation of the degree, closeness and betweenness centrality measures in directed graphs. Regarding eigenvector centrality, we consider the PageRank problem as its typical variant, and design distributed randomized algorithms to compute PageRank for both fixed and time-varying graphs. A key feature of the proposed algorithms is that they do not require to know the network size, which can be simultaneously estimated at every node, and that they are clock-free. To address the PageRank problem of time-varying graphs, we introduce the novel concept of persistent graph, which eliminates the effect of spamming nodes. Moreover, we prove that these algorithms converge almost surely and in the sense of $L^p$. Finally, the effectiveness of the proposed algorithms is illustrated via extensive simulations using a classical benchmark.

The Kuramoto-Sakaguchi system of coupled phase oscillators, where interaction between oscillators is determined by a single harmonic of phase differences of pairs of oscillators, has very simple emergent dynamics in the case of identical oscillators that are globally coupled: there is a variational structure that means the only attractors are full synchrony (in-phase) or splay phase (rotating wave/full asynchrony) oscillations and the bifurcation between these states is highly degenerate. Here we show that nonpairwise coupling - including three and four-way interactions of the oscillator phases - that appears generically at the next order in normal-form based calculations, can give rise to complex emergent dynamics in symmetric phase oscillator networks. In particular, we show that chaos can appear in the smallest possible dimension of four coupled phase oscillators for a range of parameter values.

We study the long time behavior of solutions to a nonlinear partial differential equation arising in the description of trapped rotating Bose-Einstein condensates. The equation can be seen as a hybrid between the well-known nonlinear Schr\"odinger/Gross-Pitaevskii equation and the Ginzburg-Landau equation. We prove existence and uniqueness of global in-time solutions in the physical energy space and establish the existence of a global attractor within the associated dynamics. We also obtain basic structural properties of the attractor and an estimate on its Hausdorff and fractal dimensions.

The system of nonlinear Langevin equations was obtained by using Hamiltonian's operator of two coupling quantum oscillators which are interacting with heat bath. By using the analytical solution of these equations, the analytical expressions for transport coefficients was found. Generalized Langevin equations and fluctuation-dissipation relations are derived for the case of a nonlinear non-Markovian noise. The explicit expressions for the time-dependent friction and diffusion coefficients are presented for the case of linear couplings in the coordinate between the collective two coupled harmonic oscillators and heat bath.

The collection of all the strongly connected components in a directed graph, among each cluster of which any node has a path to another node, is a typical example of the intertwining structure and dynamics in complex networks, as its relative size indicates network cohesion and it also composes of all the feedback cycles in the network. Here we consider finding an optimal strategy with minimal effort in removal arcs (for example, deactivation of directed interactions) to fragment all the strongly connected components into tree structure with no effect from feedback mechanism. We map the optimal network disruption problem to the minimal feedback arc set problem, a non-deterministically polynomial hard combinatorial optimization problem in graph theory. We solve the problem with statistical physical methods from spin glass theory, resulting in a simple numerical method to extract sub-optimal disruption arc sets with significantly better results than a local heuristic method and a simulated annealing method both in random and real networks. Our results has various implications in controlling and manipulation of real interacted systems.

What can we learn about controlling a system solely from its underlying network structure? Here we adapt a recently developed framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This feedback-based framework provides realizable node overrides that steer a system towards any of its natural long term dynamic behaviors, regardless of the specific functional forms and system parameters. We use this framework on several real networks, identify the topological characteristics that underlie the predicted node overrides, and compare its predictions to those of structural controllability in control theory. Finally, we demonstrate this framework's applicability in dynamic models of gene regulatory networks and identify nodes whose override is necessary for control in the general case, but not in specific model instances.

We propose evolution rules of the multiagent network and determine statistical patterns in life cycle of agents - information messages. The main discussed statistical pattern is connected with the number of likes and reposts for a message. This distribution corresponds to Weibull distribution according to modeling results. We examine proposed model using the data from Twitter, an online social networking service.

In the light of contemporary discussions of inter and transdisciplinarity, this paper approaches econophysics and sociophysics to seek a response to the question -- whether these interdisciplinary fields could contribute to physics and economics. Drawing upon the literature on history and philosophy of science, the paper argues that the two way traffic between physics and economics has a long history and this is likely to continue in the future.

Author(s): Jie Zhang and Remus Osan

In contrast to other large-scale network models for propagation of electrical activity in neural tissue that have no analytical solutions for their dynamics, we show that for a specific class of integrate and fire neural networks the acceleration depends quadratically on the instantaneous speed of t…

[Phys. Rev. E 93, 052228] Published Fri May 27, 2016

Author(s): Filippo Radicchi and Claudio Castellano

Among the consequences of the disordered interaction topology underlying many social, technological and biological systems, a particularly important one is that some nodes, just because of their position in the network, may have a disproportionate effect on dynamical processes mediated by the comple…

[Phys. Rev. E] Published Thu May 26, 2016

Author(s): Hiroaki Daido and Kazuho Nishio

Following a previous paper [Phys. Rev. E 88, 052907 (2013)], we study in detail the mechanism of aging transition in globally and diffusively coupled excitable and oscillatory units. Here two of the three models taken up in the earlier work are used, each composed of a large number of units with the…

[Phys. Rev. E 93, 052226] Published Thu May 26, 2016

Publication date: 3 June 2016
Source:Physics Reports, Volume 637
Author(s): Dawid Dudkowski, Sajad Jafari, Tomasz Kapitaniak, Nikolay V. Kuznetsov, Gennady A. Leonov, Awadhesh Prasad
Complex dynamical systems, ranging from the climate, ecosystems to financial markets and engineering applications typically have many coexisting attractors. This property of the system is called multistability. The final state, i.e., the attractor on which the multistable system evolves strongly depends on the initial conditions. Additionally, such systems are very sensitive towards noise and system parameters so a sudden shift to a contrasting regime may occur. To understand the dynamics of these systems one has to identify all possible attractors and their basins of attraction. Recently, it has been shown that multistability is connected with the occurrence of unpredictable attractors which have been called hidden attractors. The basins of attraction of the hidden attractors do not touch unstable fixed points (if exists) and are located far away from such points. Numerical localization of the hidden attractors is not straightforward since there are no transient processes leading to them from the neighborhoods of unstable fixed points and one has to use the special analytical–numerical procedures. From the viewpoint of applications, the identification of hidden attractors is the major issue. The knowledge about the emergence and properties of hidden attractors can increase the likelihood that the system will remain on the most desirable attractor and reduce the risk of the sudden jump to undesired behavior. We review the most representative examples of hidden attractors, discuss their theoretical properties and experimental observations. We also describe numerical methods which allow identification of the hidden attractors.

Given the network of interactions underlying a complex system, what can we learn about controlling such a system solely from its structure? Over a century of research in control theory has given us tools to answer this question, which were widely applied in science and engineering. Yet the current tools do not always consider the inherently nonlinear dynamics of real systems and the naturally occurring system states in their definition of "control", a term whose interpretation varies across disciplines. Here we use a new mathematical framework for structure-based control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This framework provides realizable node overrides that steer a system towards any of its natural long term dynamic behaviors and which are guaranteed to be effective regardless of the dynamic details and parameters of the underlying system. We use this framework on several real networks, compare its predictions to those of classical control theory, and identify the topological characteristics that underlie the commonalities and differences between these frameworks. Finally, we illustrate the applicability of this new framework in the field of dynamic models by demonstrating its success in two models of a gene regulatory network and identifying the nodes whose override is necessary for control in the general case, but not in specific model instances.

We consider a mean-field model of coupled phase oscillators with quenched disorder in the natural frequencies and coupling strengths. A fraction $p$ of oscillators are positively coupled, attracting all others, while the remaining fraction $1-p$ are negatively coupled, repelling all others. The frequencies and couplings are deterministically chosen in a manner which correlates them, thereby correlating the two types of disorder in the model. We first explore the effect of this correlation on the system's phase coherence. We find that there is a a critical width $\gamma_c$ in the frequency distribution below which the system spontaneously synchronizes. Moreover, this $\gamma_c$ is independent of $p$. Hence, our model and the traditional Kuramoto model (recovered when $p=1$) have the same critical width $\gamma_c$. We next explore the critical behavior of the system by examining the finite-size scaling and the dynamic fluctuation of the traditional order parameter. We find that the model belongs to the same universality class as the Kuramoto model with deterministically (not randomly) chosen natural frequencies for the case of $p<1$.

Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages is the resource of entanglement, which can be shared between two or more parties. The distribution of entanglement over large distances constitutes a key challenge for current research and development. Due to losses of the transmitted quantum particles, which typically scale exponentially with the distance, intermediate quantum repeater stations are needed. Here we show how to generalise the quantum repeater concept to the multipartite case, by describing large-scale quantum networks, i.e. network nodes and their long-distance links, consistently in the language of graphs and graph states. This unifying approach comprises both the distribution of multipartite entanglement across the network, and the protection against errors via encoding. The...

Synchronized mitochondrial and cytosolic translation programs

Nature 533, 7604 (2016). doi:10.1038/nature18015

Authors: Mary T. Couvillion, Iliana C. Soto, Gergana Shipkovenska & L. Stirling Churchman

Oxidative phosphorylation (OXPHOS) is a vital process for energy generation, and is carried out by complexes within the mitochondria. OXPHOS complexes pose a unique challenge for cells because their subunits are encoded on both the nuclear and the mitochondrial genomes. Genomic approaches designed to study

Author(s): Kevin P. O’Keeffe and Steven H. Strogatz

We analyze a variant of a model proposed by Kuramoto, Shinomoto, and Sakaguchi for a large population of coupled oscillatory and excitable elements. Using the Ott-Antonsen ansatz, we reduce the behavior of the population to a two-dimensional dynamical system with three parameters. We present the sta…

[Phys. Rev. E] Published Mon May 23, 2016

Author(s): Steffen Karalus and Joachim Krug

We study the importance of local structural properties in networks which have been evolved for a power-law scaling in their Laplacian spectrum. To this end, the degree distribution, two-point degree correlations, and degree-dependent clustering are extracted from the evolved networks and used to con…

[Phys. Rev. E] Published Tue May 24, 2016

Author(s): Somwrita Sarkar, Sanjay Chawla, P. A. Robinson, and Santo Fortunato

Rotation dynamics of eigenvectors of modular network adjacency matrices under random perturbations are presented. In the presence of q communities, the number of eigenvectors corresponding to the q largest eigenvalues form a "community" eigenspace and rotate together, but separately from that of the…

[Phys. Rev. E] Published Tue May 24, 2016

Many natural, complex systems are remarkably stable thanks to an absence of feedback acting on their elements. When described as networks, these exhibit few or no cycles, and associated matrices have small leading eigenvalues. It has been suggested that this architecture can confer advantages to the system as a whole, such as `qualitative stability', but this observation does not in itself explain how a loopless structure might arise. We show here that the number of feedback loops in a network, as well as the eigenvalues of associated matrices, are determined by a structural property called trophic coherence, a measure of how neatly nodes fall into distinct levels. Our theory correctly classifies a variety of networks -- including those derived from genes, metabolites, species, neurons, words, computers and trading nations -- into two distinct regimes of high and low feedback, and provides a null model to gauge the significance of related magnitudes. Since trophic coherence suppresses feedback, whereas an absence of feedback alone does not lead to coherence, our work suggests that the reasons for `looplessness' in nature should be sought in coherence-inducing mechanisms.

Random walks constitute a fundamental mechanism for many dynamics taking place on complex networks. Besides, as a more realistic description of our society, multiplex networks have been receiving a growing interest, as well as the dynamical processes that occur on top of them. Here, inspired by one specific model of random walks that seems to be ubiquitous across many scientific fields, the Levy flight, we study a new navigation strategy on top of multiplex networks. Capitalizing on spectral graph and stochastic matrix theories, we derive analytical expressions for the mean first passage time and the average time to reach a node on these networks. Moreover, we also explore the efficiency of Levy random walks, which we found to be very different as compared to the single layer scenario, accounting for the structure and dynamics inherent to the multiplex network. Finally, by comparing with some other important random walk processes defined on multiplex networks, we find that in some region of the parameters, a Levy random walk is the most efficient strategy. Our results give us a deeper understanding of Levy random walks and show the importance of considering the topological structure of multiplex networks when trying to find efficient navigation strategies.

We investigate how textual properties of scientific papers relate to the number of citations they receive. Our main finding is that correlations are non-linear and affect differently most-cited and typical papers. For instance, we find that in most journals short titles correlate positively with citations only for the most cited papers, for typical papers the correlation is in most cases negative. Our analysis of 6 different factors, calculated both at the title and abstract level of 4.3 million papers in over 1500 journals, reveals the number of authors, and the length and complexity of the abstract, as having the strongest (positive) influence on the number of citations.

We consider a mean-field model of coupled phase oscillators with quenched disorder in the natural frequencies and coupling strengths. A fraction $p$ of oscillators are positively coupled, attracting all others, while the remaining fraction $1-p$ are negatively coupled, repelling all others. The frequencies and couplings are deterministically chosen in a manner which correlates them, thereby correlating the two types of disorder in the model. We first explore the effect of this correlation on the system's phase coherence. We find that there is a a critical width $\gamma_c$ in the frequency distribution below which the system spontaneously synchronizes. Moreover, this $\gamma_c$ is independent of $p$. Hence, our model and the traditional Kuramoto model (recovered when $p=1$) have the same critical width $\gamma_c$. We next explore the critical behavior of the system by examining the finite-size scaling and the dynamic fluctuation of the traditional order parameter. We find that the model belongs to the same universality class as the Kuramoto model with deterministically (not randomly) chosen natural frequencies for the case of $p<1$.

Network science investigates methodologies that summarise relational data to obtain better interpretability. Identifying modular structures is a fundamental task, and assessment of the coarse-grain level is its crucial step. Here, we propose principled, scalable, and widely applicable assessment criteria to determine the number of clusters in modular networks based on the leave-one-out cross-validation estimate of the edge prediction error.

Author(s): Bidesh K. Bera and Dibakar Ghosh

We study the existence of chimera states in a network of locally coupled chaotic and limit-cycle oscillators. The necessary condition for chimera state in purely local coupled oscillators is discussed. At first, we numerically observe the existence of chimera or multichimera states in the locally co…

[Phys. Rev. E 93, 052223] Published Tue May 24, 2016

Random walks constitute a fundamental mechanism for many dynamics taking place on complex networks. Besides, as a more realistic description of our society, multiplex networks have been receiving a growing interest, as well as the dynamical processes that occur on top of them. Here, inspired by one specific model of random walks that seems to be ubiquitous across many scientific fields, the Levy flight, we study a new navigation strategy on top of multiplex networks. Capitalizing on spectral graph and stochastic matrix theories, we derive analytical expressions for the mean first passage time and the average time to reach a node on these networks. Moreover, we also explore the efficiency of Levy random walks, which we found to be very different as compared to the single layer scenario, accounting for the structure and dynamics inherent to the multiplex network. Finally, by comparing with some other important random walk processes defined on multiplex networks, we find that in some region of the parameters, a Levy random walk is the most efficient strategy. Our results give us a deeper understanding of Levy random walks and show the importance of considering the topological structure of multiplex networks when trying to find efficient navigation strategies.

This book provides a comprehensive introduction for the study of extreme events in the context of dynamical systems. The introduction provides a broad overview of the interdisciplinary research area of extreme events, underlining its relevance for mathematics, natural sciences, engineering, and social sciences. After exploring the basics of the classical theory of extreme events, the book presents a careful examination of how a dynamical system can serve as a generator of stochastic processes, and explores in detail the relationship between the hitting and return time statistics of a dynamical system and the possibility of constructing extreme value laws for given observables. Explicit derivation of extreme value laws are then provided for selected dynamical systems. The book then discusses how extreme events can be used as probes for inferring fundamental dynamical and geometrical properties of a dynamical system and for providing a novel point of view in problems of physical and geophysical relevance. A final summary of the main results is then presented along with a discussion of open research questions. Finally, an appendix with software in Matlab programming language allows the readers to develop further understanding of the presented concepts.

We propose a novel measure of degree heterogeneity, for unweighted and undirected complex networks, which requires only the degree distribution of the network for its computation. We show that the proposed measure can be applied to all types of network topology with ease and increases with the diversity of node degrees in the network. The measure is applied to compute the heterogeneity of synthetic (both random and scale free) and real world networks with its value normalized in the interval [0, 1]. To define the measure, we introduce a limiting network whose heterogeneity can be expressed analytically with the value tending to 1 as the size of the network N tends to infinity. We numerically study the variation of heterogeneity for random graphs (as a function of p and N) and for scale free networks with and N as variables. Finally, as a specific application, we show that the proposed measure can be used to compare the heterogeneity of recurrence networks constructed from the time series of several low dimensional chaotic attractors9thereby providing a single index to compare the structural complexity of chaotic attractors.

This book provides a comprehensive introduction for the study of extreme events in the context of dynamical systems. The introduction provides a broad overview of the interdisciplinary research area of extreme events, underlining its relevance for mathematics, natural sciences, engineering, and social sciences. After exploring the basics of the classical theory of extreme events, the book presents a careful examination of how a dynamical system can serve as a generator of stochastic processes, and explores in detail the relationship between the hitting and return time statistics of a dynamical system and the possibility of constructing extreme value laws for given observables. Explicit derivation of extreme value laws are then provided for selected dynamical systems. The book then discusses how extreme events can be used as probes for inferring fundamental dynamical and geometrical properties of a dynamical system and for providing a novel point of view in problems of physical and geophysical relevance. A final summary of the main results is then presented along with a discussion of open research questions. Finally, an appendix with software in Matlab programming language allows the readers to develop further understanding of the presented concepts.

Article

Circadian rhythms synchronize important biological processes, and are thought to primarily be entrained by environmental cycles in light and temperature, with little or no role for social interactions. Here, Fuchikawa et al . show that social cues among honeybees can entrain these rhythms even in the presence of conflicting light-dark cycles.

Nature Communications doi: 10.1038/ncomms11662

Authors: Taro Fuchikawa, Ada Eban-Rothschild, Moshe Nagari, Yair Shemesh, Guy Bloch