17 resultados para Paths and cycles (Graph theory).
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)
Resumo:
A structure-dynamic approach to cortical systems is reported which is based on the number of paths and the accessibility of each node. The latter measurement is obtained by performing self-avoiding random walks in the respective networks, so as to simulate dynamics, and then calculating the entropies of the transition probabilities for walks starting from each node. Cortical networks of three species, namely cat, macaque and humans, are studied considering structural and dynamical aspects. It is verified that the human cortical network presents the highest accessibility and number of paths (in terms of z-scores). The correlation between the number of paths and accessibility is also investigated as a mean to quantify the level of independence between paths connecting pairs of nodes in cortical networks. By comparing the cortical networks of cat, macaque and humans, it is verified that the human cortical network tends to present the largest number of independent paths of length larger than four. These results suggest that the human cortical network is potentially the most resilient to brain injures. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
Using invariance by fixed-endpoints homotopies and a generalized notion of symplectic Cayley transform, we prove a product formula for the Conley-Zehnder index of continuous paths with arbitrary endpoints in the symplectic group. We discuss two applications of the formula, to the metaplectic group and to periodic solutions of Hamiltonian systems.
Resumo:
Although the amine sulfur dioxide chemistry was well characterized in the past both experimentally and theoretically, no systematic Raman spectroscopic study describes the interaction between N,N-dimethylaniline (DMA) and sulfur dioxide (SO(2)). The formation of a deep red oil by the reaction of SO(2) with DMA is an evidence of the charge transfer (CT) nature of the DMA-SO(2) interaction. The DMA -SO(2) normal Raman spectrum shows the appearance of two intense bands at 1110 and 1151 cm(-1), which are enhanced when resonance is approached. These bands are assigned to nu(s)(SO(2)) and nu(phi-N) vibrational modes, respectively, confirming the interaction between SO(2) and the amine via the nitrogen atom. The dimethyl group steric effect favors the interaction of SO(2) with the ring pi electrons, which gives rise to a pi-pi* low-energy CT electronic transition, as confirmed by time-dependent density functional theory (TDDFT) calculations. In addition, the calculated Raman DMA-SO(2) spectrum at the B3LYP/6-311++g(3df,3pd) level shows good agreement with the experimental results (vibrational wavenumbers and relative intensities), allowing a complete assignment of the vibrational modes. A better understanding of the intermolecular interactions in this model system can be extremely useful in designing new materials to absorb, detect, or even quantify SO(2). Copyright (C) 2009 John Wiley & Sons, Ltd.
Resumo:
Raman and IR experiments have been carried out on formamide (FA) and pyridine (Py) mixtures at different compositions. The appearance of a new Raman band at 996 cm(-1) (nu(1) region of Py), whose intensity depends on the FA concentration, is assigned to an FA: Py adduct and this result is in excellent agreement with those of other authors who employed noisy light-based coherent Raman scattering spectroscopy (I((2)) CARS). Another band at 1587 cm(-1) (nu(8) region of Py) has been observed for the first time by using Raman and IR spectroscopies. Its intensity shows the same dependence on the FA concentration and this fact allows us to also attribute it to an FA: Py adduct. The good relationship between the Raman and IR data demonstrates the potential of the vibrational spectroscopy for this kind of study. Owing to higher absolute Raman scattering cross section, the nu(1) region of Py has been chosen for the quantitative analysis and a stoichiometry of 1 : 1 FA: Py is reported. The experimental data are very well supported by the density functional theory (OFT) calculation, which was employed for the first time to the present system. Furthermore, the actual investigation shows an excellent agreement with those reported from computational calculations for similar systems. A comparison with our previous studies confirms that: the solvent dielectric constant determines the stoichiometry of a given Lewis acid-base adduct in the infinite dilution limit. Copyright (C) 2009 John Wiley & Sons, Ltd.
Resumo:
A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d(G)(u, v) is at least d(C)(u, v) - e(n). Let omega(n) be any function tending to infinity with n. We consider a random d-regular graph on n vertices. We show that almost all pairs of vertices belong to an almost geodesic cycle C with e(n)= log(d-1)log(d-1) n+omega(n) and vertical bar C vertical bar =2 log(d-1) n+O(omega(n)). Along the way, we obtain results on near-geodesic paths. We also give the limiting distribution of the number of geodesics between two random vertices in this random graph. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 66: 115-136, 2011
Resumo:
We discuss an algebraic theory for generalized Jordan chains and partial signatures, that are invariants associated to sequences of symmetric bilinear forms on a vector space. We introduce an intrinsic notion of partial signatures in the Lagrangian Grassmannian of a symplectic space that does not use local coordinates, and we give a formula for the Maslov index of arbitrary real analytic paths in terms of partial signatures.
Resumo:
Roads facilitate access by deforestation agents, being relevant in studies approaching conservationist matters in rainforests. It is important to understand the relationship between road distribution, relief, land use, and forest coverage in order to evaluate where forests are more vulnerable. This study aimed at: 1) understanding the relationship between relief and density and road connectivity in three moments in time; and 2) evaluating the relationship between distance from roads and forest coverage, farmlands and rural and urban facilities in a fragmented Atlantic Forest landscape in three moments in time. Maps of roads, altitude, and land use and coverage were used. Chi-square tests showed that: 1) density and road connectivity did not present significant relationship with the relief; and 2) forest areas occupy areas distant from the roads, while farmlands and rural and urban facilities occupy areas nearer the roads. Roads and land use, regardless of relief, influence forest coverage distribution. Thus, we suggest that roads are taken into account in conservationist strategies and environmental planning.
Resumo:
One of the main consequences of habitat loss and fragmentation is the increase in patch isolation and the consequent decrease in landscape connectivity. In this context, species persistence depends on their responses to this new landscape configuration, particularly on their capacity to move through the interhabitat matrix. Here, we aimed first to determine gap-crossing probabilities related to different gap widths for two forest birds (Thamnophilus caerulescens, Thamnophilidae, and Basileuterus culicivorus, Parulidae) from the Brazilian Atlantic rainforest. These values were defined with a playback technique and then used in analyses based on graph theory to determine functional connections among forest patches. Both species were capable of crossing forest gaps between patches, and these movements were related to gap width. The probability of crossing 40 m gaps was 50% for both species. This probability falls to 10% when the gaps are 60 m (for B. culicivorus) or 80 m (for T caerulescens). Actually, birds responded to stimulation about two times more distant inside forest trials (control) than in gap-crossing trials. Models that included gap-crossing capacity improved the explanatory power of species abundance variation in comparison to strictly structural models based merely on patch area and distance measurements. These results highlighted that even very simple functional connectivity measurements related to gap-crossing capacity can improve the understanding of the effect of habitat fragmentation on bird occurrence and abundance.
Resumo:
We present the first-principle electronic structure calculation on an amorphous material including many-body corrections within the GW approximation. We show that the inclusion of the local field effects in the exchange-correlation potential is crucial to quantitatively describe amorphous systems and defect states. We show that the mobility gap of amorphous silica coincides with the band gap of quartz, contrary to the traditional picture and the densityfunctional theory results. (C) 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
Resumo:
In the present study, we propose a theoretical graph procedure to investigate multiple pathways in brain functional networks. By taking into account all the possible paths consisting of h links between the nodes pairs of the network, we measured the global network redundancy R (h) as the number of parallel paths and the global network permeability P (h) as the probability to get connected. We used this procedure to investigate the structural and dynamical changes in the cortical networks estimated from a dataset of high-resolution EEG signals in a group of spinal cord injured (SCI) patients during the attempt of foot movement. In the light of a statistical contrast with a healthy population, the permeability index P (h) of the SCI networks increased significantly (P < 0.01) in the Theta frequency band (3-6 Hz) for distances h ranging from 2 to 4. On the contrary, no significant differences were found between the two populations for the redundancy index R (h) . The most significant changes in the brain functional network of SCI patients occurred mainly in the lower spectral contents. These changes were related to an improved propagation of communication between the closest cortical areas rather than to a different level of redundancy. This evidence strengthens the hypothesis of the need for a higher functional interaction among the closest ROIs as a mechanism to compensate the lack of feedback from the peripheral nerves to the sensomotor areas.
Resumo:
The critical behavior of the stochastic susceptible-infected-recovered model on a square lattice is obtained by numerical simulations and finite-size scaling. The order parameter as well as the distribution in the number of recovered individuals is determined as a function of the infection rate for several values of the system size. The analysis around criticality is obtained by exploring the close relationship between the present model and standard percolation theory. The quantity UP, equal to the ratio U between the second moment and the squared first moment of the size distribution multiplied by the order parameter P, is shown to have, for a square system, a universal value 1.0167(1) that is the same for site and bond percolation, confirming further that the SIR model is also in the percolation class.
Resumo:
We investigate the transport properties (IxV curves and zero bias transmittance) of pristine graphene nanoribbons (GNRs) as well as doped with boron and nitrogen using an approach that combines nonequilibrium Green`s functions and density functional theory (DFT) [NEGF-DFT]. Even for a pristine nanoribbon we verify a spin-filter effect under finite bias voltage when the leads have an antiparallel magnetization. The presence of the impurities at the edges of monohydrogenated zigzag GNRs changes dramatically the charge transport properties inducing a spin-polarized conductance. The IxV curves for these systems show that depending on the bias voltage the spin polarization can be inverted. (C) 2010 Wiley Periodicals, Inc. Int J Quantum Chem 111: 1379-1386, 2011
Resumo:
Texture is one of the most important visual attributes for image analysis. It has been widely used in image analysis and pattern recognition. A partially self-avoiding deterministic walk has recently been proposed as an approach for texture analysis with promising results. This approach uses walkers (called tourists) to exploit the gray scale image contexts in several levels. Here, we present an approach to generate graphs out of the trajectories produced by the tourist walks. The generated graphs embody important characteristics related to tourist transitivity in the image. Computed from these graphs, the statistical position (degree mean) and dispersion (entropy of two vertices with the same degree) measures are used as texture descriptors. A comparison with traditional texture analysis methods is performed to illustrate the high performance of this novel approach. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
We discuss potential caveats when estimating topologies of 3D brain networks from surface recordings. It is virtually impossible to record activity from all single neurons in the brain and one has to rely on techniques that measure average activity at sparsely located (non-invasive) recording sites Effects of this spatial sampling in relation to structural network measures like centrality and assortativity were analyzed using multivariate classifiers A simplified model of 3D brain connectivity incorporating both short- and long-range connections served for testing. To mimic M/EEG recordings we sampled this model via non-overlapping regions and weighted nodes and connections according to their proximity to the recording sites We used various complex network models for reference and tried to classify sampled versions of the ""brain-like"" network as one of these archetypes It was found that sampled networks may substantially deviate in topology from the respective original networks for small sample sizes For experimental studies this may imply that surface recordings can yield network structures that might not agree with its generating 3D network. (C) 2010 Elsevier Inc All rights reserved
Resumo:
The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.