What makes a species central in a cleaning mutualism network?

Mutualisms often form networks of interacting species, characterized by the existence of a central core of species that potentially drive the ecology and the evolution of the whole community. Centrality measures allow quantification of how central or peripheral a species is within a network, thus informing about the role of each species in network organization, dynamics, and stability. In the present study we addressed the question whether the structural position of species in the network (i.e. their topological importance) relates to their ecological traits. We studied interactions between cleaner and client reef fishes to identify central and peripheral species within a mutualistic network, and investigated five ecological correlates. We used three measures to estimate the level of centrality of a species for distinct structural patterns, such as the number of interactions and the structural proximity to other species. Through the use of a principal component analysis (PCA) we observed that the centrality measures were highly correlated (92.5%) in the studied network, which indicates that the same species plays a similar role for the different structural patterns. Three cleaner and ten client species had positive values of centrality, which suggests that these species are modulating ecological and evolutionary dynamics within the network. Higher centralities were related to higher abundances and feeding habits for client fishes, but not for cleaners. The high correlation between centrality measures in the present study is likely related to the nested structure of the cleaning network. The cleaner species` set, by having central species that are not necessarily the most abundant ones, bears potentially more vulnerable points for network cohesiveness. Additionally, the present study generalizes previous findings for plant-animal mutualisms, as it shows that the structure of marine mutualisms is also related to a complex interplay between abundance and niche-related features.

Analysis of a hyper-diverse seed dispersal network: modularity and underlying mechanisms

Mutualistic interactions involving pollination and ant-plant mutualistic networks typically feature tightly linked species grouped in modules. However, such modularity is infrequent in seed dispersal networks, presumably because research on those networks predominantly includes a single taxonomic animal group (e.g. birds). Herein, for the first time, we examine the pattern of interaction in a network that includes multiple taxonomic groups of seed dispersers, and the mechanisms underlying modularity. We found that the network was nested and modular, with five distinguishable modules. Our examination of the mechanisms underlying such modularity showed that plant and animal trait values were associated with specific modules but phylogenetic effect was limited. Thus, the pattern of interaction in this network is only partially explained by shared evolutionary history. We conclude that the observed modularity emerged by a combination of phylogenetic history and trait convergence of phylogenetically unrelated species, shaped by interactions with particular types of dispersal agents.

SZNAJD MODEL AND PROPORTIONAL ELECTIONS: THE ROLE OF THE TOPOLOGY OF THE NETWORK

The Sznajd model (SM) has been employed with success in the last years to describe opinion propagation in a community. In particular, it has been claimed that its transient is able to reproduce some scale properties observed in data of proportional elections, in different countries, if the community structure (the network) is scale-free. In this work, we investigate the properties of the transient of a particular version of the SM, introduced by Bernardes and co-authors in 2002. We studied the behavior of the model in networks of different topologies through the time evolution of an order parameter known as interface density, and concluded that regular lattices with high dimensionality also leads to a power-law distribution of the number of candidates with v votes. Also, we show that the particular absorbing state achieved in the stationary state (or else, the winner candidate), is related to a particular feature of the model, that may not be realistic in all situations.

Texture analysis using graphs generated by deterministic partially self-avoiding walks

Texture is one of the most important visual attributes for image analysis. It has been widely used in image analysis and pattern recognition. A partially self-avoiding deterministic walk has recently been proposed as an approach for texture analysis with promising results. This approach uses walkers (called tourists) to exploit the gray scale image contexts in several levels. Here, we present an approach to generate graphs out of the trajectories produced by the tourist walks. The generated graphs embody important characteristics related to tourist transitivity in the image. Computed from these graphs, the statistical position (degree mean) and dispersion (entropy of two vertices with the same degree) measures are used as texture descriptors. A comparison with traditional texture analysis methods is performed to illustrate the high performance of this novel approach. (C) 2011 Elsevier Ltd. All rights reserved.

The web of connections between tourism companies: Structure and dynamics

Tourism destination networks are amongst the most complex dynamical systems, involving a myriad of human-made and natural resources. In this work we report a complex network-based systematic analysis of the Elba (Italy) tourism destination network, including the characterization of its structure in terms of several traditional measurements, the investigation of its modularity, as well as its comprehensive study in terms of the recently reported superedges approach. In particular, structural (the number of paths of distinct lengths between pairs of nodes, as well as the number of reachable companies) and dynamical features (transition probabilities and the inward/outward activations and accessibilities) are measured and analyzed, leading to a series of important findings related to the interactions between tourism companies. Among the several reported results, it is shown that the type and size of the Companies influence strongly their respective activations and accessibilities, while their geographical position does not seem to matter. It is also shown that the Elba tourism network is largely fragmented and heterogeneous, so that it could benefit from increased integration. (C) 2009 Elsevier B.V. All rights reserved.

A structure-dynamic approach to cortical organization: Number of paths and accessibility

A structure-dynamic approach to cortical systems is reported which is based on the number of paths and the accessibility of each node. The latter measurement is obtained by performing self-avoiding random walks in the respective networks, so as to simulate dynamics, and then calculating the entropies of the transition probabilities for walks starting from each node. Cortical networks of three species, namely cat, macaque and humans, are studied considering structural and dynamical aspects. It is verified that the human cortical network presents the highest accessibility and number of paths (in terms of z-scores). The correlation between the number of paths and accessibility is also investigated as a mean to quantify the level of independence between paths connecting pairs of nodes in cortical networks. By comparing the cortical networks of cat, macaque and humans, it is verified that the human cortical network tends to present the largest number of independent paths of length larger than four. These results suggest that the human cortical network is potentially the most resilient to brain injures. (C) 2009 Elsevier B.V. All rights reserved.

Modeling connectivity in terms of network activity

A new complex network model is proposed which is founded on growth, with new connections being established proportionally to the current dynamical activity of each node, which can be understood as a generalization of the Barabasi-Albert static model. By using several topological measurements, as well as optimal multivariate methods (canonical analysis and maximum likelihood decision), we show that this new model provides, among several other theoretical kinds of networks including Watts-Strogatz small-world networks, the greatest compatibility with three real-world cortical networks.

Protein lethality investigated in terms of long range dynamical interactions

The relationship between network structure/dynamics and biological function constitutes a fundamental issue in systems biology. However, despite many related investigations, the correspondence between structure and biological functions is not yet fully understood. A related subject that has deserved particular attention recently concerns how essentiality is related to the structure and dynamics of protein interactions. In the current work, protein essentiality is investigated in terms of long range influences in protein-protein interaction networks by considering simulated dynamical aspects. This analysis is performed with respect to outward activations, an approach which models the propagation of interactions between proteins by considering self-avoiding random walks. The obtained results are compared to protein local connectivity. Both the connectivity and the outward activations were found to be strongly related to protein essentiality.

Identifying the borders of mathematical knowledge

Based on a divide and conquer approach, knowledge about nature has been organized into a set of interrelated facts, allowing a natural representation in terms of graphs: each `chunk` of knowledge corresponds to a node, while relationships between such chunks are expressed as edges. This organization becomes particularly clear in the case of mathematical theorems, with their intense cross-implications and relationships. We have derived a web of mathematical theorems from Wikipedia and, thanks to the powerful concept of entropy, identified its more central and frontier elements. Our results also suggest that the central nodes are the oldest theorems, while the frontier nodes are those recently added to the network. The network communities have also been identified, allowing further insights about the organization of this network, such as its highly modular structure.

On the efficiency of transportation systems in large cities

We report an analysis of the accessibility between different locations in big cities, which is illustrated with respect to London and Paris. The effects of the respective underground systems in facilitating more uniform access to diverse places are also quantified and investigated. It is shown that London and Paris have markedly different patterns of accessibility, as a consequence of the number of bridges and large parks of London, and that in both cases the respective underground systems imply in general, thought in distinct manners, an increase of accessibility. Copyright (C) EPLA, 2010

THE EFFECT OF CORTICO-THALAMIC CONNECTIONS ON THE DIVERSITY OF CORTICAL ACTIVATIONS AS MODELED BY THE ISING MODEL

The influence of the thalamus on the diversity of cortical activations is investigated in terms of the Ising model with respect to progressive levels of cortico-thalamic connectivity. The results show that better diversity is achieved at lower modulation levels, being higher than those obtained with counterpart network models.

How does data quality in a network affect heuristic solutions?

To have good data quality with high complexity is often seen to be important. Intuition says that the higher accuracy and complexity the data have the better the analytic solutions becomes if it is possible to handle the increasing computing time. However, for most of the practical computational problems, high complexity data means that computational times become too long or that heuristics used to solve the problem have difficulties to reach good solutions. This is even further stressed when the size of the combinatorial problem increases. Consequently, we often need a simplified data to deal with complex combinatorial problems. In this study we stress the question of how the complexity and accuracy in a network affect the quality of the heuristic solutions for different sizes of the combinatorial problem. We evaluate this question by applying the commonly used p-median model, which is used to find optimal locations in a network of p supply points that serve n demand points. To evaluate this, we vary both the accuracy (the number of nodes) of the network and the size of the combinatorial problem (p). The investigation is conducted by the means of a case study in a region in Sweden with an asymmetrically distributed population (15,000 weighted demand points), Dalecarlia. To locate 5 to 50 supply points we use the national transport administrations official road network (NVDB). The road network consists of 1.5 million nodes. To find the optimal location we start with 500 candidate nodes in the network and increase the number of candidate nodes in steps up to 67,000 (which is aggregated from the 1.5 million nodes). To find the optimal solution we use a simulated annealing algorithm with adaptive tuning of the temperature. The results show that there is a limited improvement in the optimal solutions when the accuracy in the road network increase and the combinatorial problem (low p) is simple. When the combinatorial problem is complex (large p) the improvements of increasing the accuracy in the road network are much larger. The results also show that choice of the best accuracy of the network depends on the complexity of the combinatorial (varying p) problem.

Conexão entre as redes complexas e estatística de Kaniadakis e busca eficiente das propriedades críticas do processo epidêmico difusivo 1D

In this work we study a connection between a non-Gaussian statistics, the Kaniadakis statistics, and Complex Networks. We show that the degree distribution P(k)of a scale free-network, can be calculated using a maximization of information entropy in the context of non-gaussian statistics. As an example, a numerical analysis based on the preferential attachment growth model is discussed, as well as a numerical behavior of the Kaniadakis and Tsallis degree distribution is compared. We also analyze the diffusive epidemic process (DEP) on a regular lattice one-dimensional. The model is composed of A (healthy) and B (sick) species that independently diffusive on lattice with diffusion rates DA and DB for which the probabilistic dynamical rule A + B → 2B and B → A. This model belongs to the category of non-equilibrium systems with an absorbing state and a phase transition between active an inactive states. We investigate the critical behavior of the DEP using an auto-adaptive algorithm to find critical points: the method of automatic searching for critical points (MASCP). We compare our results with the literature and we find that the MASCP successfully finds the critical exponents 1/ѵ and 1/zѵ in all the cases DA =DB, DA DB. The simulations show that the DEP has the same critical exponents as are expected from field-theoretical arguments. Moreover, we find that, contrary to a renormalization group prediction, the system does not show a discontinuous phase transition in the regime o DA >DB.

Estudo de sistemas complexos com interações de longo alcance : percolação, redes e tráfego

In this thesis we investigate physical problems which present a high degree of complexity using tools and models of Statistical Mechanics. We give a special attention to systems with long-range interactions, such as one-dimensional long-range bondpercolation, complex networks without metric and vehicular traffic. The flux in linear chain (percolation) with bond between first neighbor only happens if pc = 1, but when we consider long-range interactions , the situation is completely different, i.e., the transitions between the percolating phase and non-percolating phase happens for pc < 1. This kind of transition happens even when the system is diluted ( dilution of sites ). Some of these effects are investigated in this work, for example, the extensivity of the system, the relation between critical properties and the dilution, etc. In particular we show that the dilution does not change the universality of the system. In another work, we analyze the implications of using a power law quality distribution for vertices in the growth dynamics of a network studied by Bianconi and Barabási. It incorporates in the preferential attachment the different ability (fitness) of the nodes to compete for links. Finally, we study the vehicular traffic on road networks when it is submitted to an increasing flux of cars. In this way, we develop two models which enable the analysis of the total flux on each road as well as the flux leaving the system and the behavior of the total number of congested roads

Análises estatísticas em redes complexas: propriedades topológicas, críticas e dinâmicas

In this thesis, we address two issues of broad conceptual and practical relevance in the study of complex networks. The first is associated with the topological characterization of networks while the second relates to dynamical processes that occur on top of them. Regarding the first line of study, we initially designed a model for networks growth where preferential attachment includes: (i) connectivity and (ii) homophily (links between sites with similar characteristics are more likely). From this, we observe that the competition between these two aspects leads to a heterogeneous pattern of connections with the topological properties of the network showing quite interesting results. In particular, we emphasize that there is a region where the characteristics of sites play an important role not only for the rate at which they get links, but also for the number of connections which occur between sites with similar and dissimilar characteristics. Finally, we investigate the spread of epidemics on the network topology developed, whereas its dissemination follows the rules of the contact process. Using Monte Carlo simulations, we show that the competition between states (infected/healthy) sites, induces a transition between an active phase (presence of sick) and an inactive (no sick). In this context, we estimate the critical point of the transition phase through the cumulant Binder and ratio between moments of the order parameter. Then, using finite size scaling analysis, we determine the critical exponents associated with this transition