Social Networks Shape the Transmission Dynamics of Hepatitis C Virus

Hepatitis C virus (HCV) infects 170 million people worldwide, and is a major public health problem in Brazil, where over 1% of the population may be infected and where multiple viral genotypes co-circulate. Chronically infected individuals are both the source of transmission to others and are at risk for HCV-related diseases, such as liver cancer and cirrhosis. Before the adoption of anti-HCV control measures in blood banks, this virus was mainly transmitted via blood transfusion. Today, needle sharing among injecting drug users is the most common form of HCV transmission. Of particular importance is that HCV prevalence is growing in non-risk groups. Since there is no vaccine against HCV, it is important to determine the factors that control viral transmission in order to develop more efficient control measures. However, despite the health costs associated with HCV, the factors that determine the spread of virus at the epidemiological scale are often poorly understood. Here, we sequenced partial NS5b gene sequences sampled from blood samples collected from 591 patients in Sao Paulo state, Brazil. We show that different viral genotypes entered Sao Paulo at different times, grew at different rates, and are associated with different age groups and risk behaviors. In particular, subtype 1b is older and grew more slowly than subtypes 1a and 3a, and is associated with multiple age classes. In contrast, subtypes 1a and 3b are associated with younger people infected more recently, possibly with higher rates of sexual transmission. The transmission dynamics of HCV in Sao Paulo therefore vary by subtype and are determined by a combination of age, risk exposure and underlying social network. We conclude that social factors may play a key role in determining the rate and pattern of HCV spread, and should influence future intervention policies.

Characterization of subgraph relationships and distribution in complex networks

A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel approach which extends from single nodes to the whole network level by considering non-overlapping subgraphs (i.e. connected components) and their interrelationships and distribution through the network. Though such subgraphs can be completely general, our methodology focuses on the cases in which the nodes of these subgraphs share some special feature, such as being critical for the proper operation of the network. The methodology of subgraph characterization involves two main aspects: (i) the generation of histograms of subgraph sizes and distances between subgraphs and (ii) a merging algorithm, developed to assess the relevance of nodes outside subgraphs by progressively merging subgraphs until the whole network is covered. The latter procedure complements the histograms by taking into account the nodes lying between subgraphs, as well as the relevance of these nodes to the overall subgraph interconnectivity. Experiments were carried out using four types of network models and five instances of real-world networks, in order to illustrate how subgraph characterization can help complementing complex network-based studies.

PARTITIONED ANALYSIS FOR DIMENSIONALLY-HETEROGENEOUS HYDRAULIC NETWORKS

In this work an iterative strategy is developed to tackle the problem of coupling dimensionally-heterogeneous models in the context of fluid mechanics. The procedure proposed here makes use of a reinterpretation of the original problem as a nonlinear interface problem for which classical nonlinear solvers can be applied. Strong coupling of the partitions is achieved while dealing with different codes for each partition, each code in black-box mode. The main application for which this procedure is envisaged arises when modeling hydraulic networks in which complex and simple subsystems are treated using detailed and simplified models, correspondingly. The potentialities and the performance of the strategy are assessed through several examples involving transient flows and complex network configurations.

Chain motifs: The tails and handles of complex networks

A great part of the interest in complex networks has been motivated by the presence of structured, frequently nonuniform, 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 network, 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 descriptions of the network connectivity. The current work proposes a different type of motif, namely, chains of nodes, that is, sequences of connected nodes with degree 2. 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 these 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 real-world networks, especially the world wide web, books, and the power grid. The possibility of chains resulting from incompletely sampled networks is also investigated.

Diffusion anomaly and dynamic transitions in the Bell-Lavis water model

In this paper we investigate the dynamic properties of the minimal Bell-Lavis (BL) water model and their relation to the thermodynamic anomalies. The BL model is defined on a triangular lattice in which water molecules are represented by particles with three symmetric bonding arms interacting through van der Waals and hydrogen bonds. We have studied the model diffusivity in different regions of the phase diagram through Monte Carlo simulations. Our results show that the model displays a region of anomalous diffusion which lies inside the region of anomalous density, englobed by the line of temperatures of maximum density. Further, we have found that the diffusivity undergoes a dynamic transition which may be classified as fragile-to-strong transition at the critical line only at low pressures. At higher densities, no dynamic transition is seen on crossing the critical line. Thus evidence from this study is that relation of dynamic transitions to criticality may be discarded. (C) 2010 American Institute of Physics. [doi:10.1063/1.3479001]

Dynamic transitions in a three dimensional associating lattice gas model

The aggregation of interacting Brownian particles in sheared concentrated suspensions is an important issue in colloid and soft matter science per se. Also, it serves as a model to understand biochemical reactions occurring in vivo where both crowding and shear play an important role. We present an effective medium approach within the Smoluchowski equation with shear which allows one to calculate the encounter kinetics through a potential barrier under shear at arbitrary colloid concentrations. Experiments on a model colloidal system in simple shear flow support the validity of the model in the concentration range considered. By generalizing Kramers' rate theory to the presence of shear and collective hydrodynamics, our model explains the significant increase in the shear-induced reaction-limited aggregation kinetics upon increasing the colloid concentration.

Dynamic transitions in a two dimensional associating lattice gas model

Using Monte Carlo simulations we investigate some new aspects of the phase diagram and the behavior of the diffusion coefficient in an associating lattice gas (ALG) model on different regions of the phase diagram. The ALG model combines a two dimensional lattice gas where particles interact through a soft core potential and orientational degrees of freedom. The competition between soft core potential and directional attractive forces results in a high density liquid phase, a low density liquid phase, and a gas phase. Besides anomalies in the behavior of the density with the temperature at constant pressure and of the diffusion coefficient with density at constant temperature are also found. The two liquid phases are separated by a coexistence line that ends in a bicritical point. The low density liquid phase is separated from the gas phase by a coexistence line that ends in tricritical point. The bicritical and tricritical points are linked by a critical lambda-line. The high density liquid phase and the fluid phases are separated by a second critical tau-line. We then investigate how the diffusion coefficient behaves on different regions of the chemical potential-temperature phase diagram. We find that diffusivity undergoes two types of dynamic transitions: a fragile-to-strong transition when the critical lambda-line is crossed by decreasing the temperature at a constant chemical potential; and a strong-to-strong transition when the critical tau-line is crossed by decreasing the temperature at a constant chemical potential.

Dynamic polarizability, Cauchy moments, and the optical absorption spectrum of liquid water: A sequential molecular dynamics/quantum mechanical approach

The dynamic polarizability and optical absorption spectrum of liquid water in the 6-15 eV energy range are investigated by a sequential molecular dynamics (MD)/quantum mechanical approach. The MD simulations are based on a polarizable model for liquid water. Calculation of electronic properties relies on time-dependent density functional and equation-of-motion coupled-cluster theories. Results for the dynamic polarizability, Cauchy moments, S(-2), S(-4), S(-6), and dielectric properties of liquid water are reported. The theoretical predictions for the optical absorption spectrum of liquid water are in good agreement with experimental information.

Deformed Gaussian-orthogonal-ensemble description of small-world networks

The study of spectral behavior of networks has gained enthusiasm over the last few years. In particular, random matrix theory (RMT) concepts have proven to be useful. In discussing transition from regular behavior to fully chaotic behavior it has been found that an extrapolation formula of the Brody type can be used. In the present paper we analyze the regular to chaotic behavior of small world (SW) networks using an extension of the Gaussian orthogonal ensemble. This RMT ensemble, coined the deformed Gaussian orthogonal ensemble (DGOE), supplies a natural foundation of the Brody formula. SW networks follow GOE statistics until a certain range of eigenvalue correlations depending upon the strength of random connections. We show that for these regimes of SW networks where spectral correlations do not follow GOE beyond a certain range, DGOE statistics models the correlations very well. The analysis performed in this paper proves the utility of the DGOE in network physics, as much as it has been useful in other physical systems.

Engineering interactions for quasiperfect transfer of polariton states through nonideal bosonic networks of distinct topologies

We present a scheme for quasiperfect transfer of polariton states from a sender to a spatially separated receiver, both composed of high-quality cavities filled by atomic samples. The sender and the receiver are connected by a nonideal transmission channel -the data bus- modelled by a network of lossy empty cavities. In particular, we analyze the influence of a large class of data-bus topologies on the fidelity and transfer time of the polariton state. Moreover, we also assume dispersive couplings between the polariton fields and the data-bus normal modes in order to achieve a tunneling-like state transfer. Such a tunneling-transfer mechanism, by which the excitation energy of the polariton effectively does not populate the data-bus cavities, is capable of attenuating appreciably the dissipative effects of the data-bus cavities. After deriving a Hamiltonian for the effective coupling between the sender and the receiver, we show that the decay rate of the fidelity is proportional to a cooperativity parameter that weighs the cost of the dissipation rate against the benefit of the effective coupling strength. The increase of the fidelity of the transfer process can be achieved at the expense of longer transfer times. We also show that the dependence of both the fidelity and the transfer time on the network topology is analyzed in detail for distinct regimes of parameters. It follows that the data-bus topology can be explored to control the time of the state-transfer process.

Communication structure of cortical networks

Large-scale cortical networks exhibit characteristic topological properties that shape communication between brain regions and global cortical dynamics. Analysis of complex networks allows the description of connectedness, distance, clustering, and centrality that reveal different aspects of how the network's nodes communicate. Here, we focus on a novel analysis of complex walks in a series of mammalian cortical networks that model potential dynamics of information flow between individual brain regions. We introduce two new measures called absorption and driftness. Absorption is the average length of random walks between any two nodes, and takes into account all paths that may diffuse activity throughout the network. Driftness is the ratio between absorption and the corresponding shortest path length. For a given node of the network, we also define four related measurements, namely in-and out-absorption as well as in-and out-driftness, as the averages of the corresponding measures from all nodes to that node, and from that node to all nodes, respectively. We find that the cat thalamo-cortical system incorporates features of two classic network topologies, Erdos-Renyi graphs with respect to in-absorption and in-driftness, and configuration models with respect to out-absorption and out-driftness. Moreover, taken together these four measures separate the network nodes based on broad functional roles (visual, auditory, somatomotor, and frontolimbic).

Connectivity and dynamics of neuronal networks as defined by the shape of individual neurons

Biological neuronal networks constitute a special class of dynamical systems, as they are formed by individual geometrical components, namely the neurons. In the existing literature, relatively little attention has been given to the influence of neuron shape on the overall connectivity and dynamics of the emerging networks. The current work addresses this issue by considering simplified neuronal shapes consisting of circular regions (soma/axons) with spokes (dendrites). Networks are grown by placing these patterns randomly in the two-dimensional (2D) plane and establishing connections whenever a piece of dendrite falls inside an axon. Several topological and dynamical properties of the resulting graph are measured, including the degree distribution, clustering coefficients, symmetry of connections, size of the largest connected component, as well as three hierarchical measurements of the local topology. By varying the number of processes of the individual basic patterns, we can quantify relationships between the individual neuronal shape and the topological and dynamical features of the networks. Integrate-and-fire dynamics on these networks is also investigated with respect to transient activation from a source node, indicating that long-range connections play an important role in the propagation of avalanches.

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.

Synergistic interaction between gold nanoparticles and nickel phthalocyanine in layer-by-layer (LbL) films: evidence of constitutional dynamic chemistry (CDC)

The concept of constitutional dynamic chemistry (CDC) based on the control of non-covalent interactions in supramolecular structures is promising for having a large impact on nanoscience and nanotechnology if adequate nanoscale manipulation methods are used. In this study, we demonstrate that the layer-by-layer (LbL) technique may be used to produce electroactive electrodes with ITO coated by tetrasulfonated nickel phthalocyanine (NiTsPc) alternated with poly(allylamine hydrochloride) (PAH) incorporating gold nanoparticles (AuNP), in which synergy has been achieved in the interaction between the nanoparticles and NiTsPc. The catalytic activity toward hydrogen peroxide (H(2)O(2)) in multilayer films was investigated using cyclic voltammetry, where oxidation of H(2)O(2) led to increased currents in the PAH-AuNP/NiTsPc films for the electrochemical processes associated with the phthalocyanine ring and nickel at 0.52 and 0.81 V vs. SCE, respectively, while for PAH/NiTsPc films (without AuNP) only the first redox process was affected. In control experiments we found out that the catalytic activity was not solely due to the presence of AuNP, but rather to the nanoparticles inducing NiTsPc supramolecular structures that favored access to their redox sites, thus yielding strong charge transfer. The combined effects of NiTsPc and AuNP, which could only be observed in nanostructured LbL films, point to another avenue to pursue within the CDC paradigm.

Gene Expression Complex Networks: Synthesis, Identification, and Analysis

Thanks to recent advances in molecular biology, allied to an ever increasing amount of experimental data, the functional state of thousands of genes can now be extracted simultaneously by using methods such as cDNA microarrays and RNA-Seq. Particularly important related investigations are the modeling and identification of gene regulatory networks from expression data sets. Such a knowledge is fundamental for many applications, such as disease treatment, therapeutic intervention strategies and drugs design, as well as for planning high-throughput new experiments. Methods have been developed for gene networks modeling and identification from expression profiles. However, an important open problem regards how to validate such approaches and its results. This work presents an objective approach for validation of gene network modeling and identification which comprises the following three main aspects: (1) Artificial Gene Networks (AGNs) model generation through theoretical models of complex networks, which is used to simulate temporal expression data; (2) a computational method for gene network identification from the simulated data, which is founded on a feature selection approach where a target gene is fixed and the expression profile is observed for all other genes in order to identify a relevant subset of predictors; and (3) validation of the identified AGN-based network through comparison with the original network. The proposed framework allows several types of AGNs to be generated and used in order to simulate temporal expression data. The results of the network identification method can then be compared to the original network in order to estimate its properties and accuracy. Some of the most important theoretical models of complex networks have been assessed: the uniformly-random Erdos-Renyi (ER), the small-world Watts-Strogatz (WS), the scale-free Barabasi-Albert (BA), and geographical networks (GG). The experimental results indicate that the inference method was sensitive to average degree k variation, decreasing its network recovery rate with the increase of k. The signal size was important for the inference method to get better accuracy in the network identification rate, presenting very good results with small expression profiles. However, the adopted inference method was not sensible to recognize distinct structures of interaction among genes, presenting a similar behavior when applied to different network topologies. In summary, the proposed framework, though simple, was adequate for the validation of the inferred networks by identifying some properties of the evaluated method, which can be extended to other inference methods.