arXiv subjects

Luciano da F. Costa

Publications and source records attributed to Luciano da F. Costa.

At least 127 records · Page 7Linked to original sources

arXiv2013

Using Complex Networks to Quantify Consistency in the Use of Words

In this paper we quantify the consistency of word usage in written texts represented by complex networks, where words were taken as nodes, by measuring the degree of preservation of the node neighborhood.} Words were considered highly consistent if the authors used them with the same neighborhood. When ranked according to the consistency of use, the words obeyed a log-normal distribution, in contrast to the Zipf's law that applies to the frequency of use. Consistency correlated positively with the familiarity and frequency of use, and negatively with ambiguity and age of acquisition. An inspection of some highly consistent words confirmed that they are used in very limited semantic contexts. A comparison of consistency indices for 8 authors indicated that these indices may be employed for author recognition. Indeed, as expected authors of novels could be distinguished from those who wrote scientific texts. Our analysis demonstrated the suitability of the consistency indices, which can now be applied in other tasks, such as emotion recognition.

physics.soc-ph↗

arXiv2012

A decaying factor accounts for contained activity in neuronal networks with no need of hierarchical or modular organization

The mechanisms responsible for contention of activity in systems represented by networks are crucial in various phenomena, as in diseases such as epilepsy that affects the neuronal networks, and for information dissemination in social networks. The first models to account for contained activity included triggering and inhibition processes, but they cannot be applied to social networks where inhibition is clearly absent. A recent model showed that contained activity can be achieved with no need of inhibition processes provided that the network is subdivided in modules (communities). In this paper, we introduce a new concept inspired in the Hebbian theory through which activity contention is reached by incorporating a dynamics based on a decaying activity in a random walk mechanism preferential to the node activity. Upon selecting the decay coefficient within a proper range, we observed sustained activity in all the networks tested, viz. random, Barabasi-Albert and geographical networks. The generality of this finding was confirmed by showing that modularity is no longer needed if the dynamics based on the integrate-and-fire dynamics incorporated the decay factor. Taken together, these results provide a proof of principle that persistent, restrained network activation might occur in the absence of any particular topological structure. This may be the reason why neuronal activity does not outspread to the entire neuronal network, even when no special topological organization exists.

physics.bio-ph↗

arXiv2012

Predicting Efficiency in master-slave grid computing systems

This work reports a quantitative analysis to predicting the efficiency of distributed computing running in three models of complex networks: Barabási-Albert, Erdős-Rényi and Watts-Strogatz. A master/slave computing model is simulated. A node is selected as master and distributes tasks among the other nodes (the clients). Topological measurements associated with the master node (e.g. its degree or betwenness centrality) are extracted and considered as predictors of the total execution time. It is found that the closeness centrality provides the best alternative. The effect of network size was also investigated.

physics.comp-ph↗

arXiv2011

Comparing intermittency and network measurements of words and their dependency on authorship

Many features from texts and languages can now be inferred from statistical analyses using concepts from complex networks and dynamical systems. In this paper we quantify how topological properties of word co-occurrence networks and intermittency (or burstiness) in word distribution depend on the style of authors. Our database contains 40 books from 8 authors who lived in the 19th and 20th centuries, for which the following network measurements were obtained: clustering coefficient, average shortest path lengths, and betweenness. We found that the two factors with stronger dependency on the authors were the skewness in the distribution of word intermittency and the average shortest paths. Other factors such as the betweeness and the Zipf's law exponent show only weak dependency on authorship. Also assessed was the contribution from each measurement to authorship recognition using three machine learning methods. The best performance was a ca. 65 % accuracy upon combining complex network and intermittency features with the nearest neighbor algorithm. From a detailed analysis of the interdependence of the various metrics it is concluded that the methods used here are complementary for providing short- and long-scale perspectives of texts, which are useful for applications such as identification of topical words and information retrieval.

physics.soc-ph↗

arXiv2011

How Many Nodes are Effectively Accessed in Complex Networks?

The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports important results regarding the properties of the accessibility, including its relationship with the average minimal time to visit all nodes reachable after $h$ steps along a random walk starting from a source, as well as the number of nodes that are visited after a finite period of time. We characterize the relationship between accessibility and the average number of walks required in order to visit all reachable nodes (the exploration time), conjecture that the maximum accessibility implies the minimal exploration time, and confirm the relationship between the accessibility values and the number of nodes visited after a basic time unit. The latter relationship is investigated with respect to three types of dynamics, namely: traditional random walks, self-avoiding random walks, and preferential random walks.

physics.soc-ph↗

arXiv2011

Unveiling the Relationship Between Structure and Dynamics in Complex Networks

Over the last years, a great deal of attention has been focused on complex networked systems, characterized by intricate structure and dynamics. The latter has been often represented in terms of overall statistics (e.g. average and standard deviations) of the time signals. While such approaches have led to many insights, they have failed to take into account that signals at different parts of the system can undergo distinct evolutions, which cannot be properly represented in terms of average values. A novel framework for identifying the principal aspects of the dynamics and how it is influenced by the network structure is proposed in this work. The potential of this approach is illustrated with respect to three important models (Integrate-and-Fire, SIS and Kuramoto), allowing the identification of highly structured dynamics, in the sense that different groups of nodes not only presented specific dynamics but also felt the structure of the network in different ways.

physics.data-an↗

arXiv2010

Long-Range Connections in Transportation Networks

Since its recent introduction, the small-world effect has been identified in several important real-world systems. Frequently, it is a consequence of the existence of a few long-range connections, which dominate the original regular structure of the systems and implies each node to become accessible from other nodes after a small number of steps, typically of order $\ell \propto \log N$. However, this effect has been observed in pure-topological networks, where the nodes have no spatial coordinates. In this paper, we present an alalogue of small-world effect observed in real-world transportation networks, where the nodes are embeded in a hree-dimensional space. Using the multidimensional scaling method, we demonstrate how the addition of a few long-range connections can suubstantially reduce the travel time in transportation systems. Also, we investigated the importance of long-range connections when the systems are under an attack process. Our findings are illustrated for two real-world systems, namely the London urban network (streets and underground) and the US highways network enhanced by some of the main US airlines routes.

physics.soc-ph↗

arXiv2010

Complexity and anisotropy in host morphology make populations safer against epidemic outbreaks

One of the challenges in epidemiology is to account for the complex morphological structure of hosts such as plant roots, crop fields, farms, cells, animal habitats and social networks, when the transmission of infection occurs between contiguous hosts. Morphological complexity brings an inherent heterogeneity in populations and affects the dynamics of pathogen spread in such systems. We have analysed the influence of realistically complex host morphology on the threshold for invasion and epidemic outbreak in an SIR (susceptible-infected-recovered) epidemiological model. We show that disorder expressed in the host morphology and anisotropy reduces the probability of epidemic outbreak and thus makes the system more resistant to epidemic outbreaks. We obtain general analytical estimates for minimally safe bounds for an invasion threshold and then illustrate their validity by considering an example of host data for branching hosts (salamander retinal ganglion cells). Several spatial arrangements of hosts with different degrees of heterogeneity have been considered in order to analyse separately the role of shape complexity and anisotropy in the host population. The estimates for invasion threshold are linked to morphological characteristics of the hosts that can be used for determining the threshold for invasion in practical applications.

q-bio.PE↗

arXiv2010

Investigating the Morphological Categories in the NeuroMorpho Database by Using Superparamagnetic Clustering

The continuing neuroscience advances, catalysed by multidisciplinary collaborations between the biological, computational, physical and chemical areas, have implied in increasingly more complex approaches to understand and model the mammals nervous systems. One particularly important related issue regards the investigation of the relationship between morphology and function of neuronal cells, which requires the application of effective means for their classification, for instance by using multivariated, pattern recognition and clustering methods. The current work aims at such a study while considering a large number of neuronal cells obtained from the NeuroMorpho database, which is currently the most comprehensive such a repository. Our approach applies an unsupervised clustering technique, known as Superparamagnetic Clustering, over a set of morphological measurements regarding four major neuronal categories. In particular, we target two important problems: (i) we investigate the coherence between the obtained clusters and the original categories; and (ii) we verify for eventual subclusters inside each of these categories. We report a good agreement between the obtained clusters and the original categories, as well as the identification of a relatively complex structure of subclusters in the case of the pyramidal neuronal cells.

physics.bio-ph↗

arXiv2009

Musical Genres: Beating to the Rhythms of Different Drums

Online music databases have increased signicantly as a consequence of the rapid growth of the Internet and digital audio, requiring the development of faster and more efficient tools for music content analysis. Musical genres are widely used to organize music collections. In this paper, the problem of automatic music genre classification is addressed by exploring rhythm-based features obtained from a respective complex network representation. A Markov model is build in order to analyse the temporal sequence of rhythmic notation events. Feature analysis is performed by using two multivariate statistical approaches: principal component analysis(unsupervised) and linear discriminant analysis (supervised). Similarly, two classifiers are applied in order to identify the category of rhythms: parametric Bayesian classifier under gaussian hypothesis (supervised), and agglomerative hierarchical clustering (unsupervised). Qualitative results obtained by Kappa coefficient and the obtained clusters corroborated the effectiveness of the proposed method.

physics.data-an↗

arXiv2009

Border Detection in Complex Networks

One important issue implied by the finite nature of real-world networks regards the identification of their more external (border) and internal nodes. The present work proposes a formal and objective definition of these properties, founded on the recently introduced concept of node diversity. It is shown that this feature does not exhibit any relevant correlation with several well-established complex networks measurements. A methodology for the identification of the borders of complex networks is described and illustrated with respect to theoretical (geographical and knitted networks) as well as real-world networks (urban and word association networks), yielding interesting results and insights in both cases.

physics.soc-ph↗

arXiv2008

Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications

The success of new scientific areas can be assessed by their potential for contributing to new theoretical approaches and in applications to real-world problems. Complex networks have fared extremely well in both of these aspects, with their sound theoretical basis developed over the years and with a variety of applications. In this survey, we analyze the applications of complex networks to real-world problems and data, with emphasis in representation, analysis and modeling, after an introduction to the main concepts and models. A diversity of phenomena are surveyed, which may be classified into no less than 22 areas, providing a clear indication of the impact of the field of complex networks.

physics.soc-ph↗

arXiv2008

Characterizing the Diversity of Dynamics in Complex Networks Without Border Effects

The importance of structured, complex connectivity patterns found in several real-world systems is to a great extent related to their respective effects in constraining and even defining the respective dynamics. Yet, while complex networks have been comprehensively investigated along the last decade in terms of their topological measurements, relatively less attention has been focused on the characterization of the respective dynamics. Introduced recently, the diversity entropy of complex systems can provide valuable information about the respective possible unfolding of dynamics. In the case of self-avoiding random walks, the situation assumed here, the diversity measurement allows one to quantify in how many different places an agent may effectively arrive after a given number of steps from its initial activity. Because this measurement is highly affected by border effects frequently found as a consequence of network sampling, it becomes critical to devise means for sound estimation of the diversity without being affected by this type of artifacts. We describe such an algorithm and illustrate its potential with respect to the characterization of the self-avoiding random walk dynamics in two real-world networks, namely bone canals and air transportation.

q-bio.TO↗

arXiv2007

Chain motifs: The tails and handles of complex networks

Great part of the interest in complex networks has been motivated by the presence of structured, frequently non-uniform, connectivity. Because diverse connectivity patterns tend to result in distinct network dynamics, and also because they provide the means to identify and classify several types of complex networks, it becomes important to obtain meaningful measurements of the local network topology. In addition to traditional features such as the node degree, clustering coefficient and shortest path, motifs have been introduced in the literature in order to provide complementary description of the networks connectivity. The current work proposes a new type of motifs, namely chains of nodes, namely sequences of connected nodes with degree two. These chains have been subdivided into cords, tails, rings and handles, depending on the type of their extremities (e.g. open or connected). A theoretical analysis of the density of such motifs in random and scale free networks is described, and an algorithm for identifying those motifs in general networks is presented. The potential of considering chains for network characterization has been illustrated with respect to five categories of real-world networks including 16 cases. Several interesting findings were obtained, including the fact that several chains were observed in the real-world networks, especially the WWW, books, and power-grid. The possibility of chains resulting from incompletely sampled networks is also investigated.

cond-mat.dis-nn↗

arXiv2007

Hierarchical Spatial Organization of Geographical Networks

In this work we propose the use of a hirarchical extension of the polygonality index as a means to characterize and model geographical networks: each node is associated with the spatial position of the nodes, while the edges of the network are defined by progressive connectivity adjacencies. Through the analysis of such networks, while relating its topological and geometrical properties, it is possible to obtain important indications about the development dynamics of the networks under analysis. The potential of the methodology is illustrated with respect to synthetic geographical networks.

physics.soc-ph↗

arXiv2007

Border trees of complex networks

The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small world property of real networks were fundamental to stimulate more realistic models and to understand some dynamical processes such as network growth. However, properties related to the network borders (nodes with degree equal to one), one of its most fragile parts, remain little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze complex networks by looking for border trees, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider a series of their measurements, including their number of vertices, number of leaves, and depth. We investigate the properties of border trees for several theoretical models as well as real-world networks.

physics.comp-ph↗

arXiv2007

What are the Best Hierarchical Descriptors for Complex Networks?

This work reviews several hierarchical measurements of the topology of complex networks and then applies feature selection concepts and methods in order to quantify the relative importance of each measurement with respect to the discrimination between four representative theoretical network models, namely Erdös-Rényi, Barabási-Albert, Watts-Strogatz as well as a geographical type of network. The obtained results confirmed that the four models can be well-separated by using a combination of measurements. In addition, the relative contribution of each considered feature for the overall discrimination of the models was quantified in terms of the respective weights in the canonical projection into two dimensions, with the traditional clustering coefficient, hierarchical clustering coefficient and neighborhood clustering coefficient resulting particularly effective. Interestingly, the average shortest path length and hierarchical node degrees contributed little for the separation of the four network models.

cond-mat.dis-nn↗

arXiv2006

Network Structure Revealed by Short Cycles

This article explores the relationship between communities and short cycles in complex networks, based on the fact that nodes more densely connected amongst one another are more likely to be linked through short cycles. By identifying combinations of 3-, 4- and 5-edge-cycles, a subnetwork is obtained which contains only those nodes and links belonging to such cycles, which can then be used to highlight community structure. Examples are shown using a theoretical model (Sznajd networks) and a real-world network (NCAA football).

cond-mat.dis-nn↗