A complex networks approach for data clustering

This work proposes a method for data clustering based on complex networks theory. A data set is represented as a network by considering different metrics to establish the connection between each pair of objects. The clusters are obtained by taking into account five community detection algorithms. The network-based clustering approach is applied in two real-world databases and two sets of artificially generated data. The obtained results suggest that the exponential of the Minkowski distance is the most suitable metric to quantify the similarities between pairs of objects. In addition, the community identification method based on the greedy optimization provides the best cluster solution. We compare the network-based clustering approach with some traditional clustering algorithms and verify that it provides the lowest classification error rate. (C) 2012 Elsevier B.V. All rights reserved.

Effective carrying capacity and analytical solution of a particular case of the Richards-like two-species population dynamics model

We consider a generalized two-species population dynamic model and analytically solve it for the amensalism and commensalism ecological interactions. These two-species models can be simplified to a one-species model with a time dependent extrinsic growth factor. With a one-species model with an effective carrying capacity one is able to retrieve the steady state solutions of the previous one-species model. The equivalence obtained between the effective carrying capacity and the extrinsic growth factor is complete only for a particular case, the Gompertz model. Here we unveil important aspects of sigmoid growth curves, which are relevant to growth processes and population dynamics. (C) 2011 Elsevier B.V. All rights reserved.

Inhomogeneous Fermi and quantum spin systems on lattices

We study the thermodynamic properties of a certain type of space-inhomogeneous Fermi and quantum spin systems on lattices. We are particularly interested in the case where the space scale of the inhomogeneities stays macroscopic, but very small as compared to the side-length of the box containing fermions or spins. The present study is however not restricted to "macroscopic inhomogeneities" and also includes the (periodic) microscopic and mesoscopic cases. We prove that - as in the homogeneous case - the pressure is, up to a minus sign, the conservative value of a two-person zero-sum game, named here thermodynamic game. Because of the absence of space symmetries in such inhomogeneous systems, it is not clear from the beginning what kind of object equilibrium states should be in the thermodynamic limit. However, we give rigorous statements on correlations functions for large boxes. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.4763465]

A peculiar Maxwell's Demon observed in a time-dependent stadium-like billiard

The dynamics of a driven stadium-like billiard is considered using the formalism of discrete mappings. The model presents a resonant velocity that depends on the rotation number around fixed points and external boundary perturbation which plays an important separation rule in the model. We show that particles exhibiting Fermi acceleration (initial velocity is above the resonant one) are scaling invariant with respect to the initial velocity and external perturbation. However, initial velocities below the resonant one lead the particles to decelerate therefore unlimited energy growth is not observed. This phenomenon may be interpreted as a specific Maxwell's Demon which may separate fast and slow billiard particles. (C) 2012 Elsevier B.V. All rights reserved.

Fractal descriptors based on Fourier spectrum applied to texture analysis

This work proposes the development and study of a novel technique lot the generation of fractal descriptors used in texture analysis. The novel descriptors are obtained from a multiscale transform applied to the Fourier technique of fractal dimension calculus. The power spectrum of the Fourier transform of the image is plotted against the frequency in a log-log scale and a multiscale transform is applied to this curve. The obtained values are taken as the fractal descriptors of the image. The validation of the proposal is performed by the use of the descriptors for the classification of a dataset of texture images whose real classes are previously known. The classification precision is compared to other fractal descriptors known in the literature. The results confirm the efficiency of the proposed method. (C) 2012 Elsevier B.V. All rights reserved.

Structure-semantics interplay in complex networks and its effects on the predictability of similarity in texts

The classification of texts has become a major endeavor with so much electronic material available, for it is an essential task in several applications, including search engines and information retrieval. There are different ways to define similarity for grouping similar texts into clusters, as the concept of similarity may depend on the purpose of the task. For instance, in topic extraction similar texts mean those within the same semantic field, whereas in author recognition stylistic features should be considered. In this study, we introduce ways to classify texts employing concepts of complex networks, which may be able to capture syntactic, semantic and even pragmatic features. The interplay between various metrics of the complex networks is analyzed with three applications, namely identification of machine translation (MT) systems, evaluation of quality of machine translated texts and authorship recognition. We shall show that topological features of the networks representing texts can enhance the ability to identify MT systems in particular cases. For evaluating the quality of MT texts, on the other hand, high correlation was obtained with methods capable of capturing the semantics. This was expected because the golden standards used are themselves based on word co-occurrence. Notwithstanding, the Katz similarity, which involves semantic and structure in the comparison of texts, achieved the highest correlation with the NIST measurement, indicating that in some cases the combination of both approaches can improve the ability to quantify quality in MT. In authorship recognition, again the topological features were relevant in some contexts, though for the books and authors analyzed good results were obtained with semantic features as well. Because hybrid approaches encompassing semantic and topological features have not been extensively used, we believe that the methodology proposed here may be useful to enhance text classification considerably, as it combines well-established strategies. (c) 2012 Elsevier B.V. All rights reserved.

Extractive summarization using complex networks and syntactic dependency

The realization that statistical physics methods can be applied to analyze written texts represented as complex networks has led to several developments in natural language processing, including automatic summarization and evaluation of machine translation. Most importantly, so far only a few metrics of complex networks have been used and therefore there is ample opportunity to enhance the statistics-based methods as new measures of network topology and dynamics are created. In this paper, we employ for the first time the metrics betweenness, vulnerability and diversity to analyze written texts in Brazilian Portuguese. Using strategies based on diversity metrics, a better performance in automatic summarization is achieved in comparison to previous work employing complex networks. With an optimized method the Rouge score (an automatic evaluation method used in summarization) was 0.5089, which is the best value ever achieved for an extractive summarizer with statistical methods based on complex networks for Brazilian Portuguese. Furthermore, the diversity metric can detect keywords with high precision, which is why we believe it is suitable to produce good summaries. It is also shown that incorporating linguistic knowledge through a syntactic parser does enhance the performance of the automatic summarizers, as expected, but the increase in the Rouge score is only minor. These results reinforce the suitability of complex network methods for improving automatic summarizers in particular, and treating text in general. (C) 2011 Elsevier B.V. All rights reserved.

The influence of connectivity on the firing rate in a neuronal network with electrical and chemical synapses

We study the firing rate properties of a cellular automaton model for a neuronal network with chemical synapses. We propose a simple mechanism in which the nonlocal connections are included, through electrical and chemical synapses. In the latter case, we introduce a time delay which produces self-sustained activity. Nonlocal connections, or shortcuts, are randomly introduced according to a specified connection probability. There is a range of connection probabilities for which neuron firing occurs, as well as a critical probability for which the firing ceases in the absence of time delay. The critical probability for nonlocal shortcuts depends on the network size according to a power-law. We also compute the firing rate amplification factor by varying both the connection probability and the time delay for different network sizes. (C) 2011 Elsevier B.V. All rights reserved.

Nonlocal growth processes and conformal invariance

Up to now the raise-and-peel model was the single known example of a one-dimensional stochastic process where one can observe conformal invariance. The model has one parameter. Depending on its value one has a gapped phase, a critical point where one has conformal invariance, and a gapless phase with changing values of the dynamical critical exponent z. In this model, adsorption is local but desorption is not. The raise-and-strip model presented here, in which desorption is also nonlocal, has the same phase diagram. The critical exponents are different as are some physical properties of the model. Our study suggests the possible existence of a whole class of stochastic models in which one can observe conformal invariance.

Multi-q pattern analysis: A case study in image classification

This paper compares the effectiveness of the Tsallis entropy over the classic Boltzmann-Gibbs-Shannon entropy for general pattern recognition, and proposes a multi-q approach to improve pattern analysis using entropy. A series of experiments were carried out for the problem of classifying image patterns. Given a dataset of 40 pattern classes, the goal of our image case study is to assess how well the different entropies can be used to determine the class of a newly given image sample. Our experiments show that the Tsallis entropy using the proposed multi-q approach has great advantages over the Boltzmann-Gibbs-Shannon entropy for pattern classification, boosting image recognition rates by a factor of 3. We discuss the reasons behind this success, shedding light on the usefulness of the Tsallis entropy and the multi-q approach. (C) 2012 Elsevier B.V. All rights reserved.

Quantum spherical model with competing interactions

We analyse the phase diagram of a quantum mean spherical model in terms of the temperature T, a quantum parameter g, and the ratio p = -J(2)/J(1) where J(1) > 0 refers to ferromagnetic interactions between first-neighbour sites along the d directions of a hypercubic lattice, and J(2) < 0 is associated with competing anti ferromagnetic interactions between second neighbours along m <= d directions. We regain a number of known results for the classical version of this model, including the topology of the critical line in the g = 0 space, with a Lifshitz point at p = 1/4, for d > 2, and closed-form expressions for the decay of the pair correlations in one dimension. In the T = 0 phase diagram, there is a critical border, g(c) = g(c) (p) for d >= 2, with a singularity at the Lifshitz point if d < (m + 4)/2. We also establish upper and lower critical dimensions, and analyse the quantum critical behavior in the neighborhood of p = 1/4. 2012 (C) Elsevier B.V. All rights reserved.

Using complex networks to quantify consistency in the use of words

In this paper we have quantified 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 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 eight 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.

Entanglement of excited states in critical spin chains

Renyi and von Neumann entropies quantifying the amount of entanglement in ground states of critical spin chains are known to satisfy a universal law which is given by the conformal field theory (CFT) describing their scaling regime. This law can be generalized to excitations described by primary fields in CFT, as was done by Alcaraz et al in 2011 (see reference [1], of which this work is a completion). An alternative derivation is presented, together with numerical verifications of our results in different models belonging to the c = 1, 1/2 universality classes. Oscillations of the Renyi entropy in excited states are also discussed.

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

The mechanisms responsible for containing activity in systems represented by networks are crucial in various phenomena, for example, in diseases such as epilepsy that affect 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 into modules (communities). In this paper, we introduce a new concept inspired in the Hebbian theory, through which containment of activity is achieved 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, namely, 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 spread out to the entire neuronal network, even when no special topological organization exists.

Exact correlation functions in particle-reaction models with immobile particles

Exact results on particle densities as well as correlators in two models of immobile particles, containing either a single species or else two distinct species, are derived. The models evolve following a descent dynamics through pair annihilation where each particle interacts once at most throughout its entire history. The resulting large number of stationary states leads to a non-vanishing configurational entropy. Our results are established for arbitrary initial conditions and are derived via a generating function method. The single-species model is the dual of the 1D zero-temperature kinetic Ising model with Kimball-Deker-Haake dynamics. In this way, both in finite and semi-infinite chains and also the Bethe lattice can be analysed. The relationship with the random sequential adsorption of dimers and weakly tapped granular materials is discussed.