Miguel A. Muñoz

Detecting network communities: a new systematic and efficient algorithm

An efficient and relatively fast algorithm for the detection of communities in complex networks is introduced. The method exploits spectral properties of the graph Laplacian matrix combined with hierarchical clustering techniques, and includes a procedure for maximizing the modularity of the output. Its performance is compared with that of other existing methods, as applied to different well-known instances of complex networks with a community structure, both computer generated and from the real world. Our results are, in all the cases tested, at least as good as the best ones obtained with any other methods, and faster in most of the cases than methods providing similar quality results. This converts the algorithm into a valuable computational tool for detecting and analysing communities and modular structures in complex networks.

Entangled Networks, Synchronization, and Optimal Network Topology

A new family of graphs, entangled networks, with optimal properties in many respects, is introduced. By definition, their topology is such that it optimizes synchronizability for many dynamical processes. These networks are shown to have an extremely homogeneous structure: degree, node distance, betweenness, and loop distributions are all very narrow. Also, they are characterized by a very interwoven (entangled) structure with short average distances, large loops, and no well-defined community structure. This family of nets exhibits an excellent performance with respect to other flow properties such as robustness against errors and attacks, minimal first-passage time of random walks, efficient communication, etc. These remarkable features convert entangled networks in a useful concept, optimal or almost optimal in many senses, and with plenty of potential applications in computer science or neuroscience.

Griffiths phases and the stretching of criticality in brain networks

Hallmarks of criticality, such as power-laws and scale invariance, have been empirically found in cortical-network dynamics and it has been conjectured that operating at criticality entails functional advantages, such as optimal computational capabilities, memory and large dynamical ranges. As critical behaviour requires a high degree of fine tuning to emerge, some type of self-tuning mechanism needs to be invoked. Here we show that, taking into account the complex hierarchical-modular architecture of cortical networks, the singular critical point is replaced by an extended critical-like region that corresponds--in the jargon of statistical mechanics--to a Griffiths phase. Using computational and analytical approaches, we find Griffiths phases in synthetic hierarchical networks and also in empirical brain networks such as the human connectome and that of Caenorhabditis elegans. Stretched critical regions, stemming from structural disorder, yield enhanced functionality in a generic way, facilitating the task of self-organizing, adaptive and evolutionary mechanisms selecting for criticality.

Absorbing-state phase transitions in fixed-energy sandpiles

We study sandpile models as closed systems, with the conserved energy density zeta playing the role of an external parameter. The critical energy density zeta(c) marks a nonequilibrium phase transition between active and absorbing states. Several fixed-energy sandpiles are studied in extensive simulations of stationary and transient properties, as well as the dynamics of roughening in an interface-height representation. Our primary goal is to identify the universality classes of such models, in hopes of assessing the validity of two recently proposed approaches to sandpiles: a phenomenological continuum Langevin description with absorbing states, and a mapping to driven interface dynamics in random media.

Self-organization without conservation: Are neuronal avalanches generically critical?

Recent experiments on cortical neural networks have revealed the existence of well-defined avalanches of electrical activity. Such avalanches have been claimed to be generically scale-invariant -- i.e. power-law distributed -- with many exciting implications in Neuroscience. Recently, a self-organized model has been proposed by Levina, Herrmann and Geisel to justify such an empirical finding. Given that (i) neural dynamics is dissipative and (ii) there is a loading mechanism charging progressively the background synaptic strength, this model/dynamics is very similar in spirit to forest-fire and earthquake models, archetypical examples of non-conserving self-organization, which have been recently shown to lack true criticality. Here we show that cortical neural networks obeying (i) and (ii) are not generically critical; unless parameters are fine tuned, their dynamics is either sub- or super-critical, even if the pseudo-critical region is relatively broad. This conclusion seems to be in agreement with the most recent experimental observations. The main implication of our work is that, if future experimental research on cortical networks were to support that truly critical avalanches are the norm and not the exception, then one should look for more elaborate (adaptive/evolutionary) explanations, beyond simple self-organization, to account for this.

Altered associative learning and emotional decision making in fibromyalgia

OBJECTIVEnThe present study examines the possibility that a chronic pain condition, such as fibromyalgia, was associated with deficits in decision making and associative learning.nnnMETHODSnFifteen patients with fibromyalgia (aged 42-59 years) and 15 healthy controls (aged 39-61 years) participated in the experiment. Subjects completed anxiety (STAI) and depression (BDI) questionnaires, as well as standardized neuropsychological tests (Stroop and WAIS subscales). In addition, an emotional decision-making task (Iowa Gambling Task) and a conditional associative learning task (CALT) were administered to all participants.nnnRESULTSnResults indicated that fibromyalgia had a poorer performance than healthy controls in both tasks, showing more perseveration errors in the learning task, and more disadvantageous decisions, as well as a more random behavior in the gambling task. Moreover, we observed that poor performance on the associative learning task was mediated by depression, whereas performance on the gambling task was not influenced by depression. No group differences were found on the standardized neuropsychological tests.nnnCONCLUSIONnThese findings indicate that pain and depressive symptoms in fibromyalgia might lead to significant deficits in emotionally charged cognitive tasks. Furthermore, it suggests that chronic pain might impose a high cost on executive control, undermining mainly affective processes involved in learning, memory, attention, and decision-making.

Information-based fitness and the emergence of criticality in living systems

Significance Recently, evidence has been mounting that biological systems might operate at the borderline between order and disorder, i.e., near a critical point. A general mathematical framework for understanding this common pattern, explaining the possible origin and role of criticality in living adaptive and evolutionary systems, is still missing. We rationalize this apparently ubiquitous criticality in terms of adaptive and evolutionary functional advantages. We provide an analytical framework, which demonstrates that the optimal response to broadly different changing environments occurs in systems organizing spontaneously—through adaptation or evolution—to the vicinity of a critical point. Furthermore, criticality turns out to be the evolutionary stable outcome of a community of individuals aimed at communicating with each other to create a collective entity. Empirical evidence suggesting that living systems might operate in the vicinity of critical points, at the borderline between order and disorder, has proliferated in recent years, with examples ranging from spontaneous brain activity to flock dynamics. However, a well-founded theory for understanding how and why interacting living systems could dynamically tune themselves to be poised in the vicinity of a critical point is lacking. Here we use tools from statistical mechanics and information theory to show that complex adaptive or evolutionary systems can be much more efficient in coping with diverse heterogeneous environmental conditions when operating at criticality. Analytical as well as computational evolutionary and adaptive models vividly illustrate that a community of such systems dynamically self-tunes close to a critical state as the complexity of the environment increases while they remain noncritical for simple and predictable environments. A more robust convergence to criticality emerges in coevolutionary and coadaptive setups in which individuals aim to represent other agents in the community with fidelity, thereby creating a collective critical ensemble and providing the best possible tradeoff between accuracy and flexibility. Our approach provides a parsimonious and general mechanism for the emergence of critical-like behavior in living systems needing to cope with complex environments or trying to efficiently coordinate themselves as an ensemble.

Factors determining nestedness in complex networks.

Understanding the causes and effects of network structural features is a key task in deciphering complex systems. In this context, the property of network nestedness has aroused a fair amount of interest as regards ecological networks. Indeed, Bastolla et al. introduced a simple measure of network nestedness which opened the door to analytical understanding, allowing them to conclude that biodiversity is strongly enhanced in highly nested mutualistic networks. Here, we suggest a slightly refined version of such a measure of nestedness and study how it is influenced by the most basic structural properties of networks, such as degree distribution and degree-degree correlations (i.e. assortativity). We find that most of the empirically found nestedness stems from heterogeneity in the degree distribution. Once such an influence has been discounted – as a second factor – we find that nestedness is strongly correlated with disassortativity and hence – as random networks have been recently found to be naturally disassortative – they also tend to be naturally nested just as the result of chance.

Griffiths Phases on Complex Networks

Quenched disorder is known to play a relevant role in dynamical processes and phase transitions. Its effects on the dynamics of complex networks have hardly been studied. Aimed at filling this gap, we analyze the contact process, i.e., the simplest propagation model, with quenched disorder on complex networks. We find Griffiths phases and other rare-region effects, leading rather generically to anomalously slow (algebraic, logarithmic, …) relaxation, on Erdos-Rényi networks. Similar effects are predicted to exist for other topologies with a finite percolation threshold. More surprisingly, we find that Griffiths phases can also emerge in the absence of quenched disorder, as a consequence of topological heterogeneity in networks with finite topological dimension. These results have a broad spectrum of implications for propagation phenomena and other dynamical processes on networks.

Improved spectral algorithm for the detection of network communities

We review and improve a recently introduced method for the detection of communities in complex networks. This method combines spectral properties of some matrices encoding the network topology, with well known hierarchical clustering techniques, and the use of the modularity parameter to quantify the goodness of any possible community subdivision. This provides one of the best available methods for the detection of community structures in complex systems.