Particle competition for complex network community detection

In many real situations, randomness is considered to be uncertainty or even confusion which impedes human beings from making a correct decision. Here we study the combined role of randomness and determinism in particle dynamics for complex network community detection. In the proposed model, particles walk in the network and compete with each other in such a way that each of them tries to possess as many nodes as possible. Moreover, we introduce a rule to adjust the level of randomness of particle walking in the network, and we have found that a portion of randomness can largely improve the community detection rate. Computer simulations show that the model has good community detection performance and at the same time presents low computational complexity. (C) 2008 American Institute of Physics.

Generalized connectivity 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 these paths can be used for characterization of topological properties of theoretical and real-world complex networks. This analysis revealed that the number of paths can provide a better discrimination of network models than traditional network measurements. In addition, the analysis of real-world networks suggests that the long-range connectivity tends to be limited in these networks and may be strongly related to network growth and organization.

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.

Transition in Yield and Azimuthal Shape Modification in Dihadron Correlations in Relativistic Heavy Ion Collisions

Hard-scattered parton probes produced in collisions of large nuclei indicate large partonic energy loss, possibly with collective produced-medium response to the lost energy. We present measurements of pi(0) trigger particles at transverse momenta p(T)(t) = 4-12 GeV/c and associated charged hadrons (p(T)(a) = 0.5-7 GeV/c) vs relative azimuthal angle Delta phi in Au + Au and p + p collisions at root s(NN) = 200 GeV. The Au + Au distribution at low p(T)(a), whose shape has been interpreted as a medium effect, is modified for p(T)(t) < 7 GeV/c. At higher p(T)(t), the data are consistent with unmodified or very weakly modified shapes, even for the lowest measured p(T)(a), which quantitatively challenges some medium response models. The associated yield of hadrons opposing the trigger particle in Au + Au relative to p + p (I(AA)) is suppressed at high p(T) (I(AA) approximate to 0.35-0.5), but less than for inclusive suppression (R(AA) approximate to 0.2).

Experimental observation of a complex periodic window

The existence of a special periodic window in the two-dimensional parameter space of an experimental Chua's circuit is reported. One of the main reasons that makes such a window special is that the observation of one implies that other similar periodic windows must exist for other parameter values. However, such a window has never been experimentally observed, since its size in parameter space decreases exponentially with the period of the periodic attractor. This property imposes clear limitations for its experimental detection.

Jensen inequalities for tunneling probabilities in complex systems

The Jensen theorem is used to derive inequalities for semiclassical tunneling probabilities for systems involving several degrees of freedom. These Jensen inequalities are used to discuss several aspects of sub-barrier heavy-ion fusion reactions. The inequality hinges on general convexity properties of the tunneling coefficient calculated with the classical action in the classically forbidden region.

Elongated shape isomers in the (36)Ar nucleus

A recent analysis of the (12)C + (24)Mg scattering [W. Sciani et al., Phys. Rev. C 80, 034319 (2009)] suggests the existence of a hyperdeformed band in the (36)Ar nucleus, completely in line with the predictions of alpha [W. D. M. Rae and A. C. Merchant, Phys. Lett. B279, 207 (1992)] and binary cluster calculations [J. Cseh et al., Phys. Rev. C 70, 034311 (2004)]. Here we review the structural understanding of the superdeformed and the hyperdeformed states of (36)Ar and present new results on the shape isomers as well. Special attention is paid to the clusterization of these states, which indicates the appropriate reaction channels for their formation.

Passage of radiation through wormholes of arbitrary shape

We study quasinormal modes and scattering properties via calculation of the S matrix for scalar and electromagnetic fields propagating in the background of spherically symmetric and axially symmetric traversable Lorentzian wormholes of a generic shape. Such wormholes are described by the general Morris-Thorne ansatz. The properties of quasinormal ringing and scattering are shown to be determined by the behavior of the wormhole's shape function b(r) and shift factor Phi(r) near the throat. In particular, wormholes with the shape function b(r), such that b(dr) approximate to 1, have very long-lived quasinormal modes in the spectrum. We have proved that the axially symmetric traversable Lorentzian wormholes, unlike black holes and other compact rotating objects, do not allow for superradiance. As a by-product we have shown that the 6th order WKB formula used for scattering problems of black or wormholes gives quite high accuracy and thus can be used for quite accurate calculations of the Hawking radiation processes around various black holes.

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).

Observation of cooperative Mie scattering from an ultracold atomic cloud

Scattering of light at a distribution of scatterers is an intrinsically cooperative process, which means that the scattering rate and the angular distribution of the scattered light are essentially governed by bulk properties of the distribution, such as its size, shape, and density, although local disorder and density fluctuations may have an important impact on the cooperativity. Via measurements of the radiation pressure force exerted by a far-detuned laser beam on a very small and dense cloud of ultracold atoms, we are able to identify the respective roles of superradiant acceleration of the scattering rate and of Mie scattering in the cooperative process. They lead, respectively, to a suppression or an enhancement of the radiation pressure force. We observe a maximum in the radiation pressure force as a function of the phase shift induced in the incident laser beam by the cloud's refractive index. The maximum marks the borderline of the validity of the Rayleigh-Debye-Gans approximation from a regime, where Mie scattering is more complex. Our observations thus help to clarify the intricate relationship between Rayleigh scattering of light at a coarse-grained ensemble of individual scatterers and Mie scattering at the bulk density distribution.

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.

Iridium(III)-surfactant complex immobilized in mesoporous silica via templated synthesis: a new route to optical materials

In this work we report the preparation of a new blue-emitting material based on the templated synthesis of mesoporous silica (MCM-41) using micellar solutions of the newly synthesized monocationic metallosurfactant complex bis[1-benzyl-4-(2,4-difluorophenyl)-1H-1,2,3-triazole](4,4'-diheptadecyl-2,2'- bipyridine)-iridium(III) chloride in hexadecyl-trimethyl-ammonium bromide (CTAB). Under ambient conditions, significant increases in excited state lifetime and quantum yield values (up to 45%), were obtained for the solid materials in comparison to the corresponding micellar solutions. Solid state (1)H and (19)F NMR spectroscopies were successfully employed for quantifying the luminophore content in terms of Ir-surfactant to CTAB and Ir-surfactant to silica ratios.

Purine nucleoside phosphorylase from Schistosoma mansoni in complex with ribose-1-phosphate

Schistosomes are blood flukes which cause schistosomiasis, a disease affecting approximately 200 million people worldwide. Along with several other important human parasites including trypanosomes and Plasmodium, schistosomes lack the de novo pathway for purine synthesis and depend exclusively on the salvage pathway for their purine requirements, making the latter an attractive target for drug development. Part of the pathway involves the conversion of inosine (or guanosine) into hypoxanthine (or guanine) together with ribose-1-phosphate (R1P) or vice versa. This inter-conversion is undertaken by the enzyme purine nucleoside phosphorylase (PNP) which has been used as the basis for the development of novel anti-malarials, conceptually validating this approach. It has been suggested that, during the reverse reaction, R1P binding to the enzyme would occur only as a consequence of conformational changes induced by hypoxanthine, thus making a binary PNP-R1P complex unlikely. Contradictory to this statement, a crystal structure of just such a binary complex involving the Schistosoma mansoni enzyme has been successfully obtained. The ligand shows an intricate hydrogen-bonding network in the phosphate and ribose binding sites and adds a further chapter to our knowledge which could be of value in the future development of selective inhibitors.

Adenosine binding to low-molecular-weight purine nucleoside phosphorylase: the structural basis for recognition based on its complex with the enzyme from Schistosoma mansoni

Schistosomes are unable to synthesize purines de novo and depend exclusively on the salvage pathway for their purine requirements. It has been suggested that blockage of this pathway could lead to parasite death. The enzyme purine nucleoside phosphorylase (PNP) is one of its key components and molecules designed to inhibit the low-molecular-weight (LMW) PNPs, which include both the human and schistosome enzymes, are typically analogues of the natural substrates inosine and guanosine. Here, it is shown that adenosine both binds to Schistosoma mansoni PNP and behaves as a weak micromolar inhibitor of inosine phosphorolysis. Furthermore, the first crystal structures of complexes of an LMW PNP with adenosine and adenine are reported, together with those with inosine and hypoxanthine. These are used to propose a structural explanation for the selective binding of adenosine to some LMW PNPs but not to others. The results indicate that transition-state analogues based on adenosine or other 6-amino nucleosides should not be discounted as potential starting points for alternative inhibitors.

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.