993 resultados para Metabolic Networks
Resumo:
Soil information is needed for managing the agricultural environment. The aim of this study was to apply artificial neural networks (ANNs) for the prediction of soil classes using orbital remote sensing products, terrain attributes derived from a digital elevation model and local geology information as data sources. This approach to digital soil mapping was evaluated in an area with a high degree of lithologic diversity in the Serra do Mar. The neural network simulator used in this study was JavaNNS and the backpropagation learning algorithm. For soil class prediction, different combinations of the selected discriminant variables were tested: elevation, declivity, aspect, curvature, curvature plan, curvature profile, topographic index, solar radiation, LS topographic factor, local geology information, and clay mineral indices, iron oxides and the normalized difference vegetation index (NDVI) derived from an image of a Landsat-7 Enhanced Thematic Mapper Plus (ETM+) sensor. With the tested sets, best results were obtained when all discriminant variables were associated with geological information (overall accuracy 93.2 - 95.6 %, Kappa index 0.924 - 0.951, for set 13). Excluding the variable profile curvature (set 12), overall accuracy ranged from 93.9 to 95.4 % and the Kappa index from 0.932 to 0.948. The maps based on the neural network classifier were consistent and similar to conventional soil maps drawn for the study area, although with more spatial details. The results show the potential of ANNs for soil class prediction in mountainous areas with lithological diversity.
Resumo:
Random scale-free networks have the peculiar property of being prone to the spreading of infections. Here we provide for the susceptible-infected-susceptible model an exact result showing that a scale-free degree distribution with diverging second moment is a sufficient condition to have null epidemic threshold in unstructured networks with either assortative or disassortative mixing. Degree correlations result therefore irrelevant for the epidemic spreading picture in these scale-free networks. The present result is related to the divergence of the average nearest neighbors degree, enforced by the degree detailed balance condition.
Resumo:
We study the relationship between topological scales and dynamic time scales in complex networks. The analysis is based on the full dynamics towards synchronization of a system of coupled oscillators. In the synchronization process, modular structures corresponding to well-defined communities of nodes emerge in different time scales, ordered in a hierarchical way. The analysis also provides a useful connection between synchronization dynamics, complex networks topology, and spectral graph analysis.
Resumo:
We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clustering, i.e., cycles of length three, plays a crucial role in this framework as a topological reflection of the triangle inequality in the hidden geometry. We prove that a class of hidden variable models with underlying metric spaces are able to accurately reproduce the self-similarity properties that we measured in the real networks. Our findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization.
Resumo:
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant connected component, it cannot restore a finite percolation threshold. In turn, this implies the absence of an epidemic threshold in this class of networks, thus extending this result to a wide variety of real scale-free networks which shows a high level of transitivity. Our findings are in good agreement with numerical simulations.
Resumo:
We develop a full theoretical approach to clustering in complex networks. A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge. This quantity extends the clustering coefficient in that it involves the properties of two¿and not just one¿vertices. The formalism is completed with the definition of a three-vertex correlation function, which is the fundamental quantity describing the properties of clustered networks. The formalism suggests different metrics that are able to thoroughly characterize transitive relations. A rigorous analysis of several real networks, which makes use of this formalism and the metrics, is also provided. It is also found that clustered networks can be classified into two main groups: the weak and the strong transitivity classes. In the first class, edge multiplicity is small, with triangles being disjoint. In the second class, edge multiplicity is high and so triangles share many edges. As we shall see in the following paper, the class a network belongs to has strong implications in its percolation properties.
Resumo:
We develop a general theory for percolation in directed random networks with arbitrary two-point correlations and bidirectional edgesthat is, edges pointing in both directions simultaneously. These two ingredients alter the previously known scenario and open new views and perspectives on percolation phenomena. Equations for the percolation threshold and the sizes of the giant components are derived in the most general case. We also present simulation results for a particular example of uncorrelated network with bidirectional edges confirming the theoretical predictions.
Resumo:
The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows us to find the critical threshold and the size of the giant component. Numerical simulations confirm the accuracy of our results. In more general terms, we show that weak clustering hinders the onset of the giant component whereas strong clustering favors its appearance. This is a direct consequence of the differences in the k-core structure of the networks, which are found to be totally different depending on the level of clustering. An empirical analysis of a real social network confirms our predictions.
Resumo:
We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the clustering coefficient for each class of nodes of degree k are fixed ad hoc and a priori. The algorithm generates corresponding topologies by applying first a closure of triangles and second the classical closure of remaining free stubs. The procedure unveils an universal relation among clustering and degree-degree correlations for all networks, where the level of assortativity establishes an upper limit to the level of clustering. Maximum assortativity ensures no restriction on the decay of the clustering coefficient whereas disassortativity sets a stronger constraint on its behavior. Correlation measures in real networks are seen to observe this structural bound.
Resumo:
We study synchronization dynamics of a population of pulse-coupled oscillators. In particular, we focus our attention on the interplay between topological disorder and synchronization features of networks. First, we analyze synchronization time T in random networks, and find a scaling law which relates T to network connectivity. Then, we compare synchronization time for several other topological configurations, characterized by a different degree of randomness. The analysis shows that regular lattices perform better than a disordered network. This fact can be understood by considering the variability in the number of links between two adjacent neighbors. This phenomenon is equivalent to having a nonrandom topology with a distribution of interactions and it can be removed by an adequate local normalization of the couplings.
Resumo:
Although sleep is defined as a behavioral state, at the cortical level sleep has local and use-dependent features suggesting that it is a property of neuronal assemblies requiring sleep in function of the activation experienced during prior wakefulness. Here we show that mature cortical cultured neurons display a default state characterized by synchronized burst-pause firing activity reminiscent of sleep. This default sleep-like state can be changed to transient tonic firing reminiscent of wakefulness when cultures are stimulated with a mixture of waking neurotransmitters and spontaneously returns to sleep-like state. In addition to electrophysiological similarities, the transcriptome of stimulated cultures strikingly resembles the cortical transcriptome of sleep-deprived mice, and plastic changes as reflected by AMPA receptors phosphorylation are also similar. We used our in vitro model and sleep-deprived animals to map the metabolic pathways activated by waking. Only a few metabolic pathways were identified, including glycolysis, aminoacid, and lipids. Unexpectedly large increases in lysolipids were found both in vivo after sleep deprivation and in vitro after stimulation, strongly suggesting that sleep might play a major role in reestablishing the neuronal membrane homeostasis. With our in vitro model, the cellular and molecular consequences of sleep and wakefulness can now be investigated in a dish.
Resumo:
Preharvest burning is widely used in Brazil for sugarcane cropping. However, due to environmental restrictions, harvest without burning is becoming the predominant option. Consequently, changes in the microbial community are expected from crop residue accumulation on the soil surface, as well as alterations in soil metabolic diversity as of the first harvest. Because biological properties respond quickly and can be used to monitor environmental changes, we evaluated soil metabolic diversity and bacterial community structure after the first harvest under sugarcane management without burning compared to management with preharvest burning. Soil samples were collected under three sugarcane varieties (SP813250, SP801842 and RB72454) and two harvest management systems (without and with preharvest burning). Microbial biomass C (MBC), carbon (C) substrate utilization profiles, bacterial community structure (based on profiles of 16S rRNA gene amplicons), and soil chemical properties were determined. MBC was not different among the treatments. C-substrate utilization and metabolic diversity were lower in soil without burning, except for the evenness index of C-substrate utilization. Soil samples under the variety SP801842 showed the greatest changes in substrate utilization and metabolic diversity, but showed no differences in bacterial community structure, regardless of the harvest management system. In conclusion, combined analysis of soil chemical and microbiological data can detect early changes in microbial metabolic capacity and diversity, with lower values in management without burning. However, after the first harvest, there were no changes in the soil bacterial community structure detected by PCR-DGGE under the sugarcane variety SP801842. Therefore, the metabolic profile is a more sensitive indicator of early changes in the soil microbial community caused by the harvest management system.
Resumo:
Uncorrelated random scale-free networks are useful null models to check the accuracy and the analytical solutions of dynamical processes defined on complex networks. We propose and analyze a model capable of generating random uncorrelated scale-free networks with no multiple and self-connections. The model is based on the classical configuration model, with an additional restriction on the maximum possible degree of the vertices. We check numerically that the proposed model indeed generates scale-free networks with no two- and three-vertex correlations, as measured by the average degree of the nearest neighbors and the clustering coefficient of the vertices of degree k, respectively.