Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Dynamic network”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,099 records · Page 61Linked to original sources
PubMed2001

Infection dynamics on scale-free networks.

We discuss properties of infection processes on scale-free networks, relating them to the node-connectivity distribution that characterizes the network. Considering the epidemiologically important case of a disease that confers permanent immunity upon recovery, we derive analytic expressions for the final size of an epidemic in an infinite closed population and for the dependence of infection probability on an individual's degree of connectivity within the population. As in an earlier study [R. Pastor-Satorras and A. Vesipignani, Phys. Rev. Lett. 86, 3200 (2001); Phys. Rev. E. 63, 006117 (2001)] for an infection that did not confer immunity upon recovery, the epidemic process--in contrast with many traditional epidemiological models--does not exhibit threshold behavior, and we demonstrate that this is a consequence of the extreme heterogeneity in the connectivity distribution of a scale-free network. Finally, we discuss effects that arise from finite population sizes, showing that networks of finite size do exhibit threshold effects: infections cannot spread for arbitrarily low transmission probabilities.

Journal Article↗
PubMed2002

Epidemic spreading in correlated complex networks.

We study a dynamical model of epidemic spreading on complex networks in which there are explicit correlations among the node's connectivities. For the case of Markovian complex networks, showing only correlations between pairs of nodes, we find an epidemic threshold inversely proportional to the largest eigenvalue of the connectivity matrix that gives the average number of links, which from a node with connectivity k go to nodes with connectivity k('). Numerical simulations on a correlated growing network model provide support for our conclusions.

Journal Article↗
PubMed2002

Storage capacity of attractor neural networks with depressing synapses.

We compute the capacity of a binary neural network with dynamic depressing synapses to store and retrieve an infinite number of patterns. We use a biologically motivated model of synaptic depression and a standard mean-field approach. We find that at T=0 the critical storage capacity decreases with the degree of the depression. We confirm the validity of our main mean-field results with numerical simulations.

Journal Article↗
PubMed2003

Phase separation in coupled chaotic maps on fractal networks.

The phase ordering dynamics of coupled chaotic maps on fractal networks is investigated. The statistical properties of the systems are characterized by means of the persistence probability of equivalent spin variables that define the phases. The persistence saturates and phase domains freeze for all values of the coupling parameter as a consequence of the fractal structure of the networks, in contrast to the phase transition behavior previously observed in regular Euclidean lattices. Several discontinuities and other features found in the saturation persistence curve as a function of the coupling are explained in terms of changes of stability of local phase configurations on the fractals.

Journal Article↗
PubMed2005

Parallel dynamics and computational complexity of network growth models.

The parallel computational complexity or depth of growing network models is investigated. The networks considered are generated by preferential attachment rules where the probability of attaching a new node to an existing node is given by a power alpha of the connectivity of the existing node. Algorithms for generating growing networks very quickly in parallel are described and studied. The sublinear and superlinear cases require distinct algorithms. As a result, there is a discontinuous transition in the parallel complexity of sampling these networks corresponding to the discontinuous structural transition at alpha=1 , where the networks become scale-free. For alpha>1 , networks can be generated in constant time while for 0</=alpha<1 , logarithmic parallel time is required. The results show that these networks have little depth and embody very little history dependence despite being defined by sequential growth rules.

Journal Article↗
PubMed2005

1/d expansion for k-core percolation.

The physics of k-core percolation pertains to those systems whose constituents require a minimum number of k connections to each other in order to participate in any clustering phenomenon. Examples of such a phenomenon range from orientational ordering in solid ortho-para H2 mixtures to the onset of rigidity in bar-joint networks to dynamical arrest in glass-forming liquids. Unlike ordinary (k = 1) and biconnected (k = 2) percolation, the mean field k > or = 3-core percolation transition is both continuous and discontinuous, i.e., there is a jump in the order parameter accompanied with a diverging length scale. To determine whether or not this hybrid transition survives in finite dimensions, we present a 1/d expansion for k-core percolation on the d-dimensional hypercubic lattice. We show that to order 1/d3 the singularity in the order parameter and in the susceptibility occur at the same value of the occupation probability. This result suggests that the unusual hybrid nature of the mean field k-core transition survives in high dimensions.

Journal Article↗
PubMed2006

Dynamics of helping behavior and networks in a small world.

To investigate an effect of social interaction on the bystanders' intervention in emergency situations a rescue model was introduced which includes the effects of the victim's acquaintance with bystanders and those among bystanders from a network perspective. This model reproduces the experimental result that the helping rate (success rate in our model) tends to decrease although the number of bystanders k increases. And the interaction among homogeneous bystanders results in the emergence of hubs in a helping network. For more realistic consideration it is assumed that the agents are located on a one-dimensional lattice (ring), then the randomness pE[0,1] is introduced: the kp random bystanders are randomly chosen from a whole population and the k-kp near bystanders are chosen in the nearest order to the victim. We find that there appears another peak of the network density in the vicinity of k=9 and p=0.3 due to the cooperative and competitive interaction between the near and random bystanders.

Journal Article↗
PubMed2001

Motor-driven dynamics in actin-myosin networks.

The effect of myosin motor protein activity on the filamentous actin (F-actin) rheological response is studied using diffusing wave spectroscopy. Under conditions of saturating motor activity, we find an enhancement of longitudinal filament fluctuations corresponding to a scaling of the viscoelastic shear modulus G(d)(omega) approximately omega(7/8). As the adenosine tri-phosphate reservoir sustaining motor activity is depleted, we find an abrupt transient to a passive, "rigor state" and a return to dissipation dominated by transverse filament modes. Single-filament measurements of the apparent persistence length support the notion that motor activity leads to an increase in the effective temperature for tangential motion.

Actins↗
PubMed2002

Fluctuation-driven dynamics of the internet topology.

We study the dynamics of the Internet topology based on empirical data on the level of the autonomous systems. It is found that the fluctuations occurring in the stochastic process of connecting and disconnecting edges are important features of the Internet dynamics. The network's overall growth can be described approximately by a single characteristic degree growth rate g(eff) approximately 0.016 and the fluctuation strength sigma(eff) approximately 0.14, together with the vertex growth rate alpha approximately 0.029. A stochastic model which incorporates these values and an adaptation rule newly introduced reproduces several features of the real Internet topology such as the correlations between the degrees of different vertices.

Internet↗
PubMed2006

Polynomial growth in branching processes with diverging reproductive number.

We study the spreading dynamics on graphs with a power law degree distribution pk approximately k-gamma, with 2<gamma<3, as an example of a branching process with a diverging reproductive number. We provide evidence that the divergence of the second moment of the degree distribution carries as a consequence a qualitative change in the growth pattern, deviating from the standard exponential growth. First, the population growth is extensive, meaning that the average number of vertices reached by the spreading process becomes of the order of the graph size in a time scale that vanishes in the large graph size limit. Second, the temporal evolution is governed by a polynomial growth, with a degree determined by the characteristic distance between vertices in the graph. These results open a path to further investigation on the dynamics on networks.

Animals↗
PubMed2004

Reduction of stimulus artifact in somatosensory evoked potentials: segmented versus subthreshold training.

A new approach to stimulus artifact cancellation is introduced, which attempts to model the process of stimulus artifact generation. This is done by training an estimator with multiple exemplars of the stimulus artifact at levels below the threshold of evoked response stimulation. Two estimators are formulated: one using a dynamic neural network and another using a linear estimator. The performance of these new approaches is compared to the segmented training approach, which has been previously demonstrated to be one of the most capable methods available. Performance assessment is carried out using a novel metric introduced in this paper, which focuses upon the relevant portion of the recorded waveform. The new cancellation schemes show distinct performance advantages over the segmented training approach.

Adult↗
PubMed2001

Learning related modulation of functional retrieval networks in man.

The medial temporal lobe has been implicated in studies of episodic memory tasks involving spatio-temporal context and object-location conjunctions. We have previously demonstrated that an increased level of practice in a free-recall task parallels a decrease in the functional activity of several brain regions, including the medial temporal lobe, the prefrontal, the anterior cingulate, the anterior insular, and the posterior parietal cortices, that in concert demonstrate a move from elaborate controlled processing towards a higher degree of automaticity. Here we report data from two experiments that extend these initial observations. We used a similar experimental approach but probed for effects of retrieval paradigms and stimulus material. In the first experiment we investigated practice related changes during recognition of object-location conjunctions and in the second during free-recall of pseudo-words. Learning in a neural network is a dynamic consequence of information processing and network plasticity. The present and previous PET results indicate that practice can induce a learning related functional restructuring of information processing. Different adaptive processes likely subserve the functional re-organisation observed. These may in part be related to different demands for attentional and working memory processing. It appears that the role(s) of the prefrontal cortex and the medial temporal lobe in memory retrieval are complex, perhaps reflecting several different interacting processes or cognitive components. We suggest that an integrative interactive perspective on the role of the prefrontal and medial temporal lobe is necessary for an understanding of the processing significance of these regions in learning and memory. It appears necessary to develop elaborated and explicit computational models for prefrontal and medial temporal functions in order to derive detailed empirical predictions, and in combination with an efficient use and development of functional neuroimaging approaches, to further the understanding of the processing significance of these regions in memory.

Adult↗
PubMed2005

Intermediate filaments and vesicular membrane traffic: the odd couple's first dance?

During the last two decades, much attention has been focused on the regulation of membrane traffic by the actin and microtubule cytoskeletal networks. Their dynamic and polarized behavior and associated motors provide a logical framework from which architectural and movement cues can be communicated to organelles. The study of these cytoskeletal systems has been greatly aided by pharmacological agents. In contrast, intermediate filaments (IFs) have largely been neglected as a potential player in membrane traffic, both because a comprehensive pharmacology to perturb them does not exist and because they lack the intrinsic polarity and specific motors that make the other cytoskeletal systems attractive. In this review, we will discuss evidence suggesting that IFs may play roles in controlling organelle positioning and in membrane protein targeting. Furthermore, we will discuss potential mechanisms by which IFs may regulate the localization and function of organelles.

Adaptor Protein Complex 3↗
PubMed2004

Tankyrase polymerization is controlled by its sterile alpha motif and poly(ADP-ribose) polymerase domains.

Tankyrases are novel poly(ADP-ribose) polymerases that have SAM and ankyrin protein-interaction domains. They are found at telomeres, centrosomes, nuclear pores, and Golgi vesicles and have been shown to participate in telomere length regulation. Their other function(s) are unknown, and it has been difficult to envision a common role at such diverse cellular locations. We have shown that tankyrase 1 polymerizes through its sterile alpha motif (SAM) domain to assemble large protein complexes. In vitro polymerization is reversible and still allows interaction with ankyrin-domain binding proteins. Polymerization can also occur in vivo, with SAM-dependent association of overexpressed tankyrase leading to formation of large tankyrase-containing vesicles, disruption of Golgi structure, and inhibition of apical secretion. Finally, tankyrase polymers are dissociated efficiently by poly(ADP-ribosy)lation. This disassembly is prevented by mutation of the PARP domain. Our findings indicate that tankyrase 1 has the unique capacity to promote both assembly and disassembly of large protein complexes. Thus, tankyrases appear to be master scaffolding proteins that regulate the formation of dynamic protein networks at different cellular locations. This implies a common scaffolding function for tankyrases at each location, with specific tankyrase interaction partners conferring location-specific roles to each network, e.g., telomere compaction or regulation of vesicle trafficking.

Amino Acid Motifs↗
PubMed2004

Adaptors for clathrin coats: structure and function.

Clathrin-coated vesicles (CCVs) are responsible for the transport of proteins between various compartments of the secretory and endocytic systems. Clathrin forms a scaffold around these vesicles that is linked to membranes by clathrin adaptors. The adaptors simultaneously bind to clathrin and to transmembrane proteins and/or phospholipids and can also interact with each other and with other components of the CCV formation machinery. The result is a collection of proteins that can make multiple, moderate strength (microM Kd) interactions and thereby establish the dynamic regulatable networks to drive vesicle genesis at the correct time and place in the cell. This review focuses on the structure of clathrin adaptors and how these structures provide functional information on the mechanism of CCV formation.

Adaptor Proteins, Vesicular Transport↗
PubMed2005

Cortactin overexpression inhibits ligand-induced down-regulation of the epidermal growth factor receptor.

Ligand-induced receptor down-regulation by endocytosis is a critical process regulating the intensity and duration of receptor tyrosine kinase signaling. Ubiquitylation of specific receptor tyrosine kinases, for example, the epidermal growth factor receptor (EGFR) by the E3 ubiquitin ligase c-Cbl, provides a sorting signal for lysosomal degradation and leads to termination of receptor signaling. Cortactin, which couples the endocytic machinery to dynamic actin networks, is encoded by EMS1, a gene commonly amplified in breast and head and neck cancers. One mechanism whereby cortactin overexpression contributes to tumor progression is by enhancing tumor cell invasion and metastasis. However, in this study, we show that overexpression of cortactin in HeLa cells markedly inhibits ligand-induced down-regulation of the EGFR. This is independent of alterations in receptor autophosphorylation and correlates with impaired c-Cbl phosphorylation and association with the EGFR, reduced EGFR ubiquitylation, and sustained EGF-induced extracellular signal-regulated kinase activation. Furthermore, analysis of a panel of head and neck squamous cell carcinoma (HNSCC) cell lines revealed that cortactin overexpression is associated with attenuated ligand-induced EGFR down-regulation. Importantly, RNAi-mediated reduction of cortactin expression in an 11q13-amplified HNSCC cell line accelerates EGFR degradation. This represents the first demonstration of modulation of growth factor receptor signaling by cortactin. Moreover, enhanced EGFR signaling due to cortactin overexpression may provide an alternative explanation for EMS1 gene amplification in human cancers.

Cortactin↗