Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Emergence of winner-takes-all connectivity paths in random nanowire networks.

ABSTRACT: Nanowire networks are promising memristive architectures for neuromorphic applications due to their connectivity and neurosynaptic-like behaviours. Here, we demonstrate a self-similar scaling of the conductance of networks and the junctions that comprise them. We show this behavior is an emergent property of any junction-dominated network. A particular class of junctions naturally leads to the emergence of conductance plateaus and a "winner-takes-all" conducting path that spans the entire network, and which we show corresponds to the lowest-energy connectivity path. The memory stored in the conductance state is distributed across the network but encoded in specific connectivity pathways, similar to that found in biological systems. These results are expected to have important implications for development of neuromorphic devices based on reservoir computing.

SUBMITTER: Manning HG

PROVIDER: S-EPMC6089893 | biostudies-other | 2018 Aug

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Publications

Emergence of winner-takes-all connectivity paths in random nanowire networks.

Manning Hugh G HG Niosi Fabio F da Rocha Claudia Gomes CG Bellew Allen T AT O'Callaghan Colin C Biswas Subhajit S Flowers Patrick F PF Wiley Benjamin J BJ Holmes Justin D JD Ferreira Mauro S MS Boland John J JJ

Nature communications 20180813 1

Nanowire networks are promising memristive architectures for neuromorphic applications due to their connectivity and neurosynaptic-like behaviours. Here, we demonstrate a self-similar scaling of the conductance of networks and the junctions that comprise them. We show this behavior is an emergent property of any junction-dominated network. A particular class of junctions naturally leads to the emergence of conductance plateaus and a "winner-takes-all" conducting path that spans the entire networ ...[more]

PMID: 30104665

Similar Datasets

The winner takes it all-Competitiveness of single nodes in globalized supply networks.

Project description:Quantifying the importance and power of individual nodes depending on their position in socio-economic networks constitutes a problem across a variety of applications. Examples include the reach of individuals in (online) social networks, the importance of individual banks or loans in financial networks, the relevance of individual companies in supply networks, and the role of traffic hubs in transport networks. Which features characterize the importance of a node in a trade network during the emergence of a globalized, connected market? Here we analyze a model that maps the evolution of global connectivity in a supply network to a percolation problem. In particular, we focus on the influence of topological features of the node within the underlying transport network. Our results reveal that an advantageous position with respect to different length scales determines the competitiveness of a node at different stages of the percolation process and depending on the speed of the cluster growth.

| S-EPMC6867619 | biostudies-literature

Hospital Choice for Cataract Treatments: The Winner Takes Most.

Project description:BACKGROUND:Transparency in quality of care is an increasingly important issue in healthcare. In many international healthcare systems, transparency in quality is crucial for health insurers when purchasing care on behalf of their consumers, for providers to improve the quality of care (if necessary), and for consumers to choose their provider in case treatment is needed. Conscious consumer choices incentivize healthcare providers to deliver better quality of care. This paper studies the impact of quality on patient volume and hospital choice, and more specifically whether high quality providers are able to attract more patients. METHODS:The dataset covers the period 2006-2011 and includes all patients who underwent a cataract treatment in the Netherlands. We first estimate the impact of quality on volume using a simple ordinary least squares (OLS), second we use a mixed logit to determine how patients make trade-offs between quality, distance and waiting time in provider choice. RESULTS:At the aggregate-level we find that, a one-point quality increase, on a scale of one to a hundred, raises patient volume for the average hospital by 2-4 percent. This effect is mainly driven by the hospital with the highest quality score: the effect halves after excluding this hospital from the dataset. Also at the individual-level, all else being equal, patients have a stronger preference for the hospital with the highest quality score, and appear indifferent between the remaining hospitals. CONCLUSION:Our results suggest that the top performing hospital is able to attract significantly more patients than the remaining hospitals. We find some evidence that a small share of consumers may respond to quality differences, thereby contributing to incentives for providers to invest in quality and for insurers to take quality into account in the purchasing strategy.

| S-EPMC6358653 | biostudies-literature

Winner-takes-all resource competition redirects cascading cell fate transitions.

Project description:Failure of modularity remains a significant challenge for assembling synthetic gene circuits with tested modules as they often do not function as expected. Competition over shared limited gene expression resources is a crucial underlying reason. It was reported that resource competition makes two seemingly separate genes connect in a graded linear manner. Here we unveil nonlinear resource competition within synthetic gene circuits. We first build a synthetic cascading bistable switches (Syn-CBS) circuit in a single strain with two coupled self-activation modules to achieve two successive cell fate transitions. Interestingly, we find that the in vivo transition path was redirected as the activation of one switch always prevails against the other, contrary to the theoretically expected coactivation. This qualitatively different type of resource competition between the two modules follows a 'winner-takes-all' rule, where the winner is determined by the relative connection strength between the modules. To decouple the resource competition, we construct a two-strain circuit, which achieves successive activation and stable coactivation of the two switches. These results illustrate that a highly nonlinear hidden interaction between the circuit modules due to resource competition may cause counterintuitive consequences on circuit functions, which can be controlled with a division of labor strategy.

| S-EPMC7870843 | biostudies-literature

Random Neuronal Networks show homeostatic regulation of global activity while showing persistent changes in specific connectivity paths to theta burst stimuli.

Project description:Learning in neuronal networks based on Hebbian principle has been shown to lead to destabilizing effects. Mechanisms have been identified that maintain homeostasis in such networks. However, the way in which these two opposing forces operate to support learning while maintaining stability is an active area of research. In this study, using neuronal networks grown on multi electrode arrays, we show that theta burst stimuli lead to persistent changes in functional connectivity along specific paths while the network maintains a global homeostasis. Simultaneous observations of spontaneous activity and stimulus evoked responses over several hours with theta burst training stimuli shows that global activity of the network quantified from spontaneous activity, which is disturbed due to theta burst stimuli is restored by homeostatic mechanisms while stimulus evoked changes in specific connectivity paths retain a memory trace of the training.

| S-EPMC6224599 | biostudies-literature

Synchronization in time-varying random networks with vanishing connectivity.

Project description:A sufficiently connected topology linking the constituent units of a complex system is usually seen as a prerequisite for the emergence of collective phenomena such as synchronization. We present a random network of heterogeneous phase oscillators in which the links mediating the interactions are constantly rearranged with a characteristic timescale and, possibly, an extremely low instantaneous connectivity. We show that with strong coupling and sufficiently fast rewiring the network reaches partial synchronization even in the vanishing connectivity limit. In particular, we provide an approximate analytical argument, based on the comparison between the different characteristic timescales of our system in the low connectivity regime, which is able to predict the transition to synchronization threshold with satisfactory precision beyond the formal fast rewiring limit. We interpret our results as a qualitative mechanism for emergence of consensus in social communities. In particular, our result suggest that groups of individuals are capable of aligning their opinions under extremely sparse exchanges of views, which is reminiscent of fast communications that take place in the modern social media. Our results may also be relevant to characterize the onset of collective behavior in engineered systems of mobile units with limited wireless capabilities.

| S-EPMC6629696 | biostudies-literature

Transition to chaos in random networks with cell-type-specific connectivity.

Project description:In neural circuits, statistical connectivity rules strongly depend on cell-type identity. We study dynamics of neural networks with cell-type-specific connectivity by extending the dynamic mean-field method and find that these networks exhibit a phase transition between silent and chaotic activity. By analyzing the locus of this transition, we derive a new result in random matrix theory: the spectral radius of a random connectivity matrix with block-structured variances. We apply our results to show how a small group of hyperexcitable neurons within the network can significantly increase the network's computational capacity by bringing it into the chaotic regime.

| S-EPMC4527561 | biostudies-literature

Shortest Paths in Multiplex Networks.

Project description:The shortest path problem is one of the most fundamental networks optimization problems. Nowadays, individuals interact in extraordinarily numerous ways through their offline and online life (e.g., co-authorship, co-workership, or retweet relation in Twitter). These interactions have two key features. First, they have a heterogeneous nature, and second, they have different strengths that are weighted based on their degree of intimacy, trustworthiness, service exchange or influence among individuals. These networks are known as multiplex networks. To our knowledge, none of the previous shortest path definitions on social interactions have properly reflected these features. In this work, we introduce a new distance measure in multiplex networks based on the concept of Pareto efficiency taking both heterogeneity and weighted nature of relations into account. We then model the problem of finding the whole set of paths as a form of multiple objective decision making and propose an exact algorithm for that. The method is evaluated on five real-world datasets to test the impact of considering weights and multiplexity in the resulting shortest paths. As an application to find the most influential nodes, we redefine the concept of betweenness centrality based on the proposed shortest paths and evaluate it on a real-world dataset from two-layer trade relation among countries between years 2000 and 2015.

| S-EPMC5438413 | biostudies-literature

Phylogeography takes a relaxed random walk in continuous space and time.

Project description:Research aimed at understanding the geographic context of evolutionary histories is burgeoning across biological disciplines. Recent endeavors attempt to interpret contemporaneous genetic variation in the light of increasingly detailed geographical and environmental observations. Such interest has promoted the development of phylogeographic inference techniques that explicitly aim to integrate such heterogeneous data. One promising development involves reconstructing phylogeographic history on a continuous landscape. Here, we present a Bayesian statistical approach to infer continuous phylogeographic diffusion using random walk models while simultaneously reconstructing the evolutionary history in time from molecular sequence data. Moreover, by accommodating branch-specific variation in dispersal rates, we relax the most restrictive assumption of the standard Brownian diffusion process and demonstrate increased statistical efficiency in spatial reconstructions of overdispersed random walks by analyzing both simulated and real viral genetic data. We further illustrate how drawing inference about summary statistics from a fully specified stochastic process over both sequence evolution and spatial movement reveals important characteristics of a rabies epidemic. Together with recent advances in discrete phylogeographic inference, the continuous model developments furnish a flexible statistical framework for biogeographical reconstructions that is easily expanded upon to accommodate various landscape genetic features.

| S-EPMC2915639 | biostudies-literature

Optimal learning paths in information networks.

Project description:Each sphere of knowledge and information could be depicted as a complex mesh of correlated items. By properly exploiting these connections, innovative and more efficient navigation strategies could be defined, possibly leading to a faster learning process and an enduring retention of information. In this work we investigate how the topological structure embedding the items to be learned can affect the efficiency of the learning dynamics. To this end we introduce a general class of algorithms that simulate the exploration of knowledge/information networks standing on well-established findings on educational scheduling, namely the spacing and lag effects. While constructing their learning schedules, individuals move along connections, periodically revisiting some concepts, and sometimes jumping on very distant ones. In order to investigate the effect of networked information structures on the proposed learning dynamics we focused both on synthetic and real-world graphs such as subsections of Wikipedia and word-association graphs. We highlight the existence of optimal topological structures for the simulated learning dynamics whose efficiency is affected by the balance between hubs and the least connected items. Interestingly, the real-world graphs we considered lead naturally to almost optimal learning performances.

| S-EPMC4450758 | biostudies-literature

An exponential random graph modeling approach to creating group-based representative whole-brain connectivity networks.

Project description:Group-based brain connectivity networks have great appeal for researchers interested in gaining further insight into complex brain function and how it changes across different mental states and disease conditions. Accurately constructing these networks presents a daunting challenge given the difficulties associated with accounting for inter-subject topological variability. Viable approaches to this task must engender networks that capture the constitutive topological properties of the group of subjects' networks that it is aiming to represent. The conventional approach has been to use a mean or median correlation network (Achard et al., 2006; Song et al., 2009; Zuo et al., 2011) to embody a group of networks. However, the degree to which their topological properties conform with those of the groups that they are purported to represent has yet to be explored. Here we investigate the performance of these mean and median correlation networks. We also propose an alternative approach based on an exponential random graph modeling framework and compare its performance to that of the aforementioned conventional approach. Simpson et al. (2011) illustrated the utility of exponential random graph models (ERGMs) for creating brain networks that capture the topological characteristics of a single subject's brain network. However, their advantageousness in the context of producing a brain network that "represents" a group of brain networks has yet to be examined. Here we show that our proposed ERGM approach outperforms the conventional mean and median correlation based approaches and provides an accurate and flexible method for constructing group-based representative brain networks.

| S-EPMC3303958 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data