arXiv subjects

Luciano da Fontoura Costa

Publications and source records attributed to Luciano da Fontoura Costa.

At least 37 records · Page 2Linked to original sources

arXiv2013

A Quantitative Approach to Painting Styles

This research extends a method previously applied to music and philosophy,representing the evolution of art as a time-series where relations like dialectics are measured quantitatively. For that, a corpus of paintings of 12 well-known artists from baroque and modern art is analyzed. A set of 93 features is extracted and the features which most contributed to the classification of painters are selected. The projection space obtained provides the basis to the analysis of measurements. This quantitative measures underlie revealing observations about the evolution of painting styles, specially when compared with other humanity fields already analyzed: while music evolved along a master-apprentice tradition (high dialectics) and philosophy by opposition, painting presents another pattern: constant increasing skewness, low opposition between members of the same movement and opposition peaks in the transition between movements. Differences between baroque and modern movements are also observed in the projected "painting space": while baroque paintings are presented as an overlapped cluster, the modern paintings present minor overlapping and are disposed more widely in the projection than the baroque counterparts. This finding suggests that baroque painters shared aesthetics while modern painters tend to "break rules" and develop their own style.

stat.AP↗

arXiv2013

Local Dimension of Complex Networks

Dimensionality is one of the most important properties of complex physical systems. However, only recently this concept has been considered in the context of complex networks. In this paper we further develop the previously introduced definitions of dimension in complex networks by presenting a new method to characterize the dimensionality of individual nodes. The methodology consists in obtaining patterns of dimensionality at different scales for each node, which can be used to detect regions with distinct dimensional structures as well as borders. We also apply this technique to power grid networks, showing, quantitatively, that the continental European power grid is substantially more planar than the network covering the western states of US, which present topological dimension higher than their intrinsic embedding space dimension. Local dimension also successfully revealed how distinct regions of network topologies spreads along the degrees of freedom when it is embedded in a metric space.

physics.soc-ph↗

arXiv2012

Predicting epidemic outbreak from individual features of the spreaders

Knowing which individuals can be more efficient in spreading a pathogen throughout a determinate environment is a fundamental question in disease control. Indeed, over the last years the spread of epidemic diseases and its relationship with the topology of the involved system have been a recurrent topic in complex network theory, taking into account both network models and real-world data. In this paper we explore possible correlations between the heterogeneous spread of an epidemic disease governed by the susceptible-infected-recovered (SIR) model, and several attributes of the originating vertices, considering Erdös-Rényi (ER), Barabási-Albert (BA) and random geometric graphs (RGG), as well as a real case of study, the US Air Transportation Network that comprises the US 500 busiest airports along with inter-connections. Initially, the heterogeneity of the spreading is achieved considering the RGG networks, in which we analytically derive an expression for the distribution of the spreading rates among the established contacts, by assuming that such rates decay exponentially with the distance that separates the individuals. Such distribution is also considered for the ER and BA models, where we observe topological effects on the correlations. In the case of the airport network, the spreading rates are empirically defined, assumed to be directly proportional to the seat availability. Among both the theoretical and the real networks considered, we observe a high correlation between the total epidemic prevalence and the degree, as well as the strength and the accessibility of the epidemic sources. For attributes such as the betweenness centrality and the $k$-shell index, however, the correlation depends on the topology considered.

physics.soc-ph↗

arXiv2012

Quantifying the interdisciplinarity of scientific journals and fields

There is an overall perception of increased interdisciplinarity in science, but this is difficult to confirm quantitatively owing to the lack of adequate methods to evaluate subjective phenomena. This is no different from the difficulties in establishing quantitative relationships in human and social sciences. In this paper we quantified the interdisciplinarity of scientific journals and science fields by using an entropy measurement based on the diversity of the subject categories of journals citing a specific journal. The methodology consisted in building citation networks using the Journal Citation Reports database, in which the nodes were journals and edges were established based on citations among journals. The overall network for the 11-year period (1999-2009) studied was small-world and scale free with regard to the in-strength. Upon visualizing the network topology an overall structure of the various science fields could be inferred, especially their interconnections. We confirmed quantitatively that science fields are becoming increasingly interdisciplinary, with the degree of interdisplinarity (i.e. entropy) correlating strongly with the in-strength of journals and with the impact factor.

physics.soc-ph↗

arXiv2012

Scilab and SIP for Image Processing

This paper is an overview of Image Processing and Analysis using Scilab, a free prototyping environment for numerical calculations similar to Matlab. We demonstrate the capabilities of SIP -- the Scilab Image Processing Toolbox -- which extends Scilab with many functions to read and write images in over 100 major file formats, including PNG, JPEG, BMP, and TIFF. It also provides routines for image filtering, edge detection, blurring, segmentation, shape analysis, and image recognition. Basic directions to install Scilab and SIP are given, and also a mini-tutorial on Scilab. Three practical examples of image analysis are presented, in increasing degrees of complexity, showing how advanced image analysis techniques seems uncomplicated in this environment.

cs.MS↗

arXiv2012

Can the evolution of music be analyzed in a quantitative manner?

We propose a methodology to study music development by applying multivariate statistics on composers characteristics. Seven representative composers were considered in terms of eight main musical features. Grades were assigned to each characteristic and their correlations were analyzed. A bootstrap method was applied to simulate hundreds of artificial composers influenced by the seven representatives chosen. Afterwards we quantify non-numeric relations like dialectics, opposition and innovation. Composers differences on style and technique were represented as geometrical distances in the feature space, making it possible to quantify, for example, how much Bach and Stockhausen differ from other composers or how much Beethoven influenced Brahms. In addition, we compared the results with a prior investigation on philosophy. Opposition, strong on philosophy, was not remarkable on music. Supporting an observation already considered by music theorists, strong influences were identified between composers by the quantification of dialectics, implying inheritance and suggesting a stronger master-disciple evolution when compared to the philosophy analysis.

physics.data-an↗

arXiv2011

Evaluating links through spectral decomposition

Spectral decomposition has been rarely used to investigate complex networks. In this work we apply this concept in order to define two types of link-directed attacks while quantifying their respective effects on the topology. Several other types of more traditional attacks are also adopted and compared. These attacks had substantially diverse effects, depending on each specific network (models and real-world structures). It is also showed that the spectral-based attacks have special effect in affecting the transitivity of the networks.

physics.soc-ph↗

arXiv2011

Automatic Network Fingerprinting through Single-Node Motifs

Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs---a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes, as hubs before, might be found to play critical roles in real-world networks.

physics.soc-ph↗

arXiv2011

A Complex Networks Approach for Data Clustering

Many methods have been developed for data clustering, such as k-means, expectation maximization and algorithms based on graph theory. In this latter case, graphs are generally constructed by taking into account the Euclidian distance as a similarity measure, and partitioned using spectral methods. However, these methods are not accurate when the clusters are not well separated. In addition, it is not possible to automatically determine the number of clusters. These limitations can be overcome by taking into account network community identification algorithms. In this work, we propose a methodology for data clustering based on complex networks theory. We compare different metrics for quantifying the similarity between objects and take into account three community finding techniques. This approach is applied to two real-world databases and to two sets of artificially generated data. By comparing our method with traditional clustering approaches, we verify that the proximity measures given by the Chebyshev and Manhattan distances are the most suitable metrics to quantify the similarity between objects. In addition, the community identification method based on the greedy optimization provides the smallest misclassification rates.

physics.data-an↗

arXiv2010

Philosometrics

The hypothesis that philosophy is driven by difference/innovation is checked in a quantitative manner. This was performed by assigning grades to eight main philosophical features with respect to seven prominent philosophers, which allowed sound concepts from multivariate statistics and pattern recognition to be applied. A number of insights could then be inferred about the way in which philosophy has been developed. For instance, the evolution of philosophy can be represented as a trajectory on a plane (two instead of the eight original dimensions) whose axes are defined by a linear combination of the philosophical characteristics considered. In addition, all the philosophical moves have been verified to oppose the prevailing philosophical state. We also identified an intense and progressive trend toward dialectics.

physics.soc-ph↗

arXiv2010

On the Efficiency of Data Representation on the Modeling and Characterization of Complex Networks

Specific choices about how to represent complex networks can have a substantial effect on the execution time required for the respective construction and analysis of those structures. In this work we report a comparison of the effects of representing complex networks statically as matrices or dynamically as spase structures. Three theoretical models of complex networks are considered: two types of Erdos-Renyi as well as the Barabasi-Albert model. We investigated the effect of the different representations with respect to the construction and measurement of several topological properties (i.e. degree, clustering coefficient, shortest path length, and betweenness centrality). We found that different forms of representation generally have a substantial effect on the execution time, with the sparse representation frequently resulting in remarkably superior performance.

physics.comp-ph↗

arXiv2010

Beyond the average: Detecting global singular nodes from local features in complex networks

Deviations from the average can provide valuable insights about the organization of natural systems. The present article extends this important principle to the systematic identification and analysis of singular motifs in complex networks. Six measurements quantifying different and complementary features of the connectivity around each node of a network were calculated, and multivariate statistical methods applied to identify singular nodes. The potential of the presented concepts and methodology was illustrated with respect to different types of complex real-world networks, namely the US air transportation network, the protein-protein interactions of the yeast Saccharomyces cerevisiae and the Roget thesaurus networks. The obtained singular motifs possessed unique functional roles in the networks. Three classic theoretical network models were also investigated, with the Barabási-Albert model resulting in singular motifs corresponding to hubs, confirming the potential of the approach. Interestingly, the number of different types of singular node motifs as well as the number of their instances were found to be considerably higher in the real-world networks than in any of the benchmark networks.

physics.soc-ph↗

arXiv2009

On the Efficiency of Underground 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 increase of accessibility.

physics.soc-ph↗

arXiv2009

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 types of networks including Watts-Strogatz small-world networks, the greatest compatibility with three real-world cortical networks.

physics.soc-ph↗

arXiv2009

Modeling Worldwide Highway Networks

This letter addresses the problem of modeling the highway systems of different countries by using complex networks formalism. More specifically, we compare two traditional geographical models with a modified geometrical network model where paths, rather than edges, are incorporated at each step between the origin and destination nodes. Optimal configurations of parameters are obtained for each model and used in the comparison. The highway networks of Brazil, the US and England are considered and shown to be properly modeled by the modified geographical model. The Brazilian highway network yielded small deviations that are potentially accountable by specific developing and sociogeographic features of that country.

physics.soc-ph↗

arXiv2008

What Is There Between Any Two Nodes in a Complex Network?

This article focuses on the identification of the number of paths with different lengths between pairs of nodes in complex networks and how, by providing comprehensive information about the network topology, such an information can be effectively used for characterization of theoretical and real-world complex networks, as well as for identification of communities.

physics.soc-ph↗

arXiv2008

Diffusion of Time-Varying Signals in Complex Networks: A Structure-Dynamics Investigation Focusing the Distance to the Source of Activation

The way in which different types of dynamics unfold in complex networks is intrinsically related to the propagation of activation along nodes, which is strongly affected by the network connectivity. In this work we investigate to which extent a time-varying signal emanating from a specific node is modified as it diffuses, at the equilibrium regime, along uniformly random (Erdős-Rényi) and scale-free (Barabási-Albert) networks. The degree of preservation is quantified in terms of the Pearson cross-correlation between the original signal and the derivative of the signals appearing at each node along time. Several interesting results are reported. First, the fact that quite distinct signals are typically obtained at different nodes in the considered networks implies mean-field approaches to be completely inadequate. It has also been found that the peak and lag of the similarity time-signatures obtained for each specific node are strongly related to the respective distance between that node and the source node. Such a relationship tends to decrease with the average degree of the networks. Also, in the case of the lag, a less intense relationship is verified for scale-free networks. No relationship was found between the dispersion of the similarity signature and the distance to the source.

physics.soc-ph↗

arXiv2008

Seeking for Simplicity in Complex Networks

Complex networks can be understood as graphs whose connectivity deviates from those of regular or near-regular graphs, which are understood as being `simple'. While a great deal of the attention so far dedicated to complex networks has been duly driven by the `complex' nature of these structures, in this work we address the identification of simplicity, in the sense of regularity, in complex networks. The basic idea is to seek for subgraphs exhibiting small dispersion (e.g. standard deviation or entropy) of local measurements such as the node degree and clustering coefficient. This approach paves the way for the identification of subgraphs (patches) with nearly uniform connectivity, therefore complementing the characterization of the complexity of networks. We also performed analysis of cascade failures, revealing that the removal of vertices in `simple' regions results in smaller damage to the network structure than the removal of vertices in the heterogeneous regions. We illustrate the potential of the proposed methodology with respect to four theoretical models as well as protein-protein interaction networks of three different species. Our results suggest that the simplicity of protein interaction grows as the result of natural selection. This increase in simplicity makes these networks more robust to cascade failures.

physics.data-an↗