MODELING THE EVOLUTION OF COMPLEX NETWORKS THROUGH THE PATH-STAR TRANSFORMATION AND OPTIMAL MULTIVARIATE METHODS

The topology of real-world complex networks, such as in transportation and communication, is always changing with time. Such changes can arise not only as a natural consequence of their growth, but also due to major modi. cations in their intrinsic organization. For instance, the network of transportation routes between cities and towns ( hence locations) of a given country undergo a major change with the progressive implementation of commercial air transportation. While the locations could be originally interconnected through highways ( paths, giving rise to geographical networks), transportation between those sites progressively shifted or was complemented by air transportation, with scale free characteristics. In the present work we introduce the path-star transformation ( in its uniform and preferential versions) as a means to model such network transformations where paths give rise to stars of connectivity. It is also shown, through optimal multivariate statistical methods (i.e. canonical projections and maximum likelihood classification) that while the US highways network adheres closely to a geographical network model, its path-star transformation yields a network whose topological properties closely resembles those of the respective airport transportation network.

Self-dual hopfions

We construct static and time-dependent exact soliton solutions with nontrivial Hopf topological charge for a field theory in 3 + 1 dimensions with the target space being the two dimensional sphere S(2). The model considered is a reduction of the so-called extended Skyrme-Faddeev theory by the removal of the quadratic term in derivatives of the fields. The solutions are constructed using an ansatz based on the conformal and target space symmetries. The solutions are said self-dual because they solve first order differential equations which together with some conditions on the coupling constants, imply the second order equations of motion. The solutions belong to a sub-sector of the theory with an infinite number of local conserved currents. The equation for the profile function of the ansatz corresponds to the Bogomolny equation for the sine-Gordon model.

Static Hopfions in the extended Skyrme-Faddeev model

We construct static soliton solutions with non-zero Hopf topological charges to a theory which is an extension of the Skyrme-Faddeev model by the addition of a further quartic term in derivatives. We use an axially symmetric ansatz based on toroidal coordinates, and solve the resulting two coupled non-linear partial differential equations in two variables by a successive over-relaxation (SOR) method. We construct numerical solutions with Hopf charge up to four, and calculate their analytical behavior in some limiting cases. The solutions present an interesting behavior under the changes of a special combination of the coupling constants of the quartic terms. Their energies and sizes tend to zero as that combination approaches a particular special value. We calculate the equivalent of the Vakulenko and Kapitanskii energy bound for the theory and find that it vanishes at that same special value of the coupling constants. In addition, the model presents an integrable sector with an in finite number of local conserved currents which apparently are not related to symmetries of the action. In the intersection of those two special sectors the theory possesses exact vortex solutions (static and time dependent) which were constructed in a previous paper by one of the authors. It is believed that such model describes some aspects of the low energy limit of the pure SU(2) Yang-Mills theory, and our results may be important in identifying important structures in that strong coupling regime.

Investigating relationships within and between category networks in Wikipedia

This work maps and analyses cross-citations in the areas of Biology, Mathematics, Physics and Medicine in the English version of Wikipedia, which are represented as an undirected complex network where the entries correspond to nodes and the citations among the entries are mapped as edges. We found a high value of clustering coefficient for the areas of Biology and Medicine, and a small value for Mathematics and Physics. The topological organization is also different for each network, including a modular structure for Biology and Medicine, a sparse structure for Mathematics and a dense core for Physics. The networks have degree distributions that can be approximated by a power-law with a cut-off. The assortativity of the isolated networks has also been investigated and the results indicate distinct patterns for each subject. We estimated the betweenness centrality of each node considering the full Wikipedia network, which contains the nodes of the four subjects and the edges between them. In addition, the average shortest path length between the subjects revealed a close relationship between the subjects of Biology and Physics, and also between Medicine and Physics. Our results indicate that the analysis of the full Wikipedia network cannot predict the behavior of the isolated categories since their properties can be very different from those observed in the full network. (C) 2011 Elsevier Ltd. 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.

Exact vortex solutions in an extended Skyrme-Faddeev model

We construct exact vortex solutions in 3+1 dimensions to a theory which is an extension, due to Gies, of the Skyrme-Faddeev model, and that is believed to describe some aspects of the low energy limit of the pure SU(2) Yang-Mills theory. Despite the efforts in the last decades those are the first exact analytical solutions to be constructed for such type of theory. The exact vortices appear in a very particular sector of the theory characterized by special values of the coupling constants, and by a constraint that leads to an infinite number of conserved charges. The theory is scale invariant in that sector, and the solutions satisfy Bogomolny type equations. The energy of the static vortex is proportional to its topological charge, and waves can travel with the speed of light along them, adding to the energy a term proportional to a U(1) No ether charge they create. We believe such vortices may play a role in the strong coupling regime of the pure SU(2) Yang-Mills theory.

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 impact 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 by adjacency matrices or dynamically by adjacency lists. 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. (C) 2011 Elsevier B.V. All rights reserved.

Modularity and robustness of bone networks

Cortical bones, essential for mechanical support and structure in many animals, involve a large number of canals organized in intricate fashion. By using state-of-the art image analysis and computer graphics, the 3D reconstruction of a whole bone (phalange) of a young chicken was obtained and represented in terms of a complex network where each canal was associated to an edge and every confluence of three or more canals yielded a respective node. The representation of the bone canal structure as a complex network has allowed several methods to be applied in order to characterize and analyze the canal system organization and the robustness. First, the distribution of the node degrees (i.e. the number of canals connected to each node) confirmed previous indications that bone canal networks follow a power law, and therefore present some highly connected nodes (hubs). The bone network was also found to be partitioned into communities or modules, i.e. groups of nodes which are more intensely connected to one another than with the rest of the network. We verified that each community exhibited distinct topological properties that are possibly linked with their specific function. In order to better understand the organization of the bone network, its resilience to two types of failures (random attack and cascaded failures) was also quantified comparatively to randomized and regular counterparts. The results indicate that the modular structure improves the robustness of the bone network when compared to a regular network with the same average degree and number of nodes. The effects of disease processes (e. g., osteoporosis) and mutations in genes (e.g., BMP4) that occur at the molecular level can now be investigated at the mesoscopic level by using network based approaches.

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 properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, 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 how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed.

A pattern recognition approach to complex networks

Complex networks exist in many areas of science such as biology, neuroscience, engineering, and sociology. The growing development of this area has led to the introduction of several topological and dynamical measurements, which describe and quantify the structure of networks. Such characterization is essential not only for the modeling of real systems but also for the study of dynamic processes that may take place in them. However, it is not easy to use several measurements for the analysis of complex networks, due to the correlation between them and the difficulty of their visualization. To overcome these limitations, we propose an effective and comprehensive approach for the analysis of complex networks, which allows the visualization of several measurements in a few projections that contain the largest data variance and the classification of networks into three levels of detail, vertices, communities, and the global topology. We also demonstrate the efficiency and the universality of the proposed methods in a series of real-world networks in the three levels.

Axially symmetric soliton solutions in a Skyrme-Faddeev-type model with Gies`s extension

We construct static soliton solutions with non-zero Hopf topological charges to a theory which is the extended Skyrme-Faddeev model with a further quartic term in derivatives. We use an axially symmetric ansatz based on toroidal coordinates, and solve the resulting two coupled nonlinear partial differential equations in two variables by a successive over-relaxation method. We construct numerical solutions with the Hopf charge up to 4. The solutions present an interesting behavior under the changes of a special combination of the coupling constants of the quartic terms.

Fragment-based and classical quantitative structure-activity relationships for a series of hydrazides as antituberculosis agents

Worldwide, tuberculosis (TB) is the leading cause of death among curable infectious diseases. Multidrug-resistant Mycobacterium tuberculosis is an emerging problem of great importance to public health, and there is an urgent need for new anti-TB drugs. In the present work, classical 2D quantitative structure-activity relationships (QSAR) and hologram QSAR (HQSAR) studies were performed on a training set of 91 isoniazid derivatives. Significant statistical models (classical QSAR, q(2) = 0.68 and r(2) = 0.72; HQSAR, q(2) = 0.63 and r(2) = 0.86) were obtained, indicating their consistency for untested compounds. The models were then used to evaluate an external test set containing 24 compounds which were not included in the training set, and the predicted values were in good agreement with the experimental results (HQSAR, r(pred)(2) = 0.87; classical QSAR, r(pred)(2) = 0.75).

An all-substrings common subsequence algorithm

Given two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings longest common subsequence (ALCS) problem obtains, for every substring B` of B, the length of the longest string that is a subsequence of both A and B. The ALCS problem has many applications, such as finding approximate tandem repeats in strings, solving the circular alignment of two strings and finding the alignment of one string with several others that have a common substring. We present an algorithm to prepare the basic data structure for ALCS queries that takes O(n(a)n(b)) time and O(n(a) + n(b)) space. After this preparation, it is possible to build that allows any LCS length to be retrieved in constant time. Some trade-offs between the space required and a matrix of size O(n(b)(2)) the querying time are discussed. To our knowledge, this is the first algorithm in the literature for the ALCS problem. (C) 2007 Elsevier B.V. All rights reserved.

Perfect Simulation of a Coupling Achieving the (d)over-bar-distance Between Ordered Pairs of Binary Chains of Infinite Order

We explicitly construct a stationary coupling attaining Ornstein`s (d) over bar -distance between ordered pairs of binary chains of infinite order. Our main tool is a representation of the transition probabilities of the coupled bivariate chain of infinite order as a countable mixture of Markov transition probabilities of increasing order. Under suitable conditions on the loss of memory of the chains, this representation implies that the coupled chain can be represented as a concatenation of i.i.d. sequences of bivariate finite random strings of symbols. The perfect simulation algorithm is based on the fact that we can identify the first regeneration point to the left of the origin almost surely.

SUPPORT OF MAXIMIZING MEASURES FOR TYPICAL C(0) DYNAMICS ON COMPACT MANIFOLDS

Given a compact manifold X, a continuous function g : X -> IR, and a map T : X -> X, we study properties of the T-invariant Borel probability measures that maximize the integral of g. We show that if X is a n-dimensional connected Riemaniann manifold, with n >= 2, then the set of homeomorphisms for which there is a maximizing measure supported on a periodic orbit is meager. We also show that, if X is the circle, then the ""topological size"" of the set of endomorphisms for which there are g maximizing measures with support on a periodic orbit depends on properties of the function g. In particular, if g is C(1), it has interior points.