scholarly journals Resonant Learning in Scale-free Networks

2021 ◽  
Author(s):  
Samuel Goldman ◽  
Maximino Aldana ◽  
Philippe Cluzel

Over the last decades, analyses of the connectivity of large biological and artificial networks have identified a common scale-free topology, where few of the network elements, called hubs, control many other network elements. In monitoring the dynamics of networks hubs, recent experiments have revealed that they can show behaviors oscillating between ON and OFF states of activation. Prompted by these observations, we ask whether the existence of oscillatory hubs states could contribute to the emergence of specific network dynamical behaviors. Here, we use Boolean threshold networks with scale-free architecture as representative models to demonstrate how periodic activation of the network hub can provide a network-level advantage in learning specific new dynamical behaviors. First, we find that hub oscillations with distinct periods can induce robust and distinct attractors whose lengths depend upon the hub oscillation period. Second, we determine that a given network can exhibit series of different attractors when we sequentially change the period of hub pulses. Using rounds of evolution and selection, these different attractors could independently learn distinct target functions. We term this network-based learning strategy resonant learning, as the emergence of new learned dynamical behaviors depends on the choice of the period of the hub oscillations. Finally, we find that resonant learning leads to convergence towards target behaviors over an order of magnitude faster than standard learning procedures. While it is already known that modular network architecture contributes to learning separate tasks, our results reveal an alternative design principle based on forced oscillations of the network hub.

1992 ◽  
Vol 03 (02) ◽  
pp. 157-165
Author(s):  
D. Saad ◽  
R. Sasson

Learning by Choice of Internal Representations (CHIR) is a training algorithm presented by Grossman et al.1 based on modification of the Internal Representations (IR) along side of the direct weight matrix modification performed in conventional training methods. This algorithm was presented in several versions aimed to tackle the various training problems of nets with continuous and binary weights, multilayer and multi-output-neuron nets and training without storing the Internal Representations. The capability of one of these versions, the CHIR2 algorithm, to tackle multilayer training tasks of nets with continuous input vectors is examined in this paper. A comparison between the performance of this algorithm and of the Backpropagation algorithm2 is carried out via extensive computer simulations for the “two-spirals” problem, aimed to classify two classes of dots forming two intertwined spirals. The CHIR24 algorithm shows a rapid convergence rate for this problem, an order of magnitude faster than the results reported for the BP training algorithm (as well as those obtained by us) regarding the same training problem and network architecture.11 Moreover, the CHIR2 algorithm finds solution nets for the above mentioned problem with reduced architectures, reported as hard to solve by the BP training algorithm.11


2017 ◽  
Vol 5 (5) ◽  
pp. 776-794
Author(s):  
Benjamin Fish ◽  
Rahul Kushwaha ◽  
György Turán

Abstract Betweenness centrality of a vertex in a graph measures the fraction of shortest paths going through the vertex. This is a basic notion for determining the importance of a vertex in a network. The $k$-betweenness centrality of a vertex is defined similarly, but only considers shortest paths of length at most $k$. The sequence of $k$-betweenness centralities for all possible values of $k$ forms the betweenness centrality profile of a vertex. We study properties of betweenness centrality profiles in trees. We show that for scale-free random trees, for fixed $k$, the expectation of $k$-betweenness centrality strictly decreases as the index of the vertex increases. We also analyse worst-case properties of profiles in terms of the distance of profiles from being monotone, and the number of times pairs of profiles can cross. This is related to whether $k$-betweenness centrality, for small values of $k$, may be used instead of having to consider all shortest paths. Bounds are given that are optimal in order of magnitude. We also present some experimental results for scale-free random trees.


Sensors ◽  
2020 ◽  
Vol 20 (6) ◽  
pp. 1724
Author(s):  
Zilu Ying ◽  
Chen Xuan ◽  
Yikui Zhai ◽  
Bing Sun ◽  
Jingwen Li ◽  
...  

Since Synthetic Aperture Radar (SAR) targets are full of coherent speckle noise, the traditional deep learning models are difficult to effectively extract key features of the targets and share high computational complexity. To solve the problem, an effective lightweight Convolutional Neural Network (CNN) model incorporating transfer learning is proposed for better handling SAR targets recognition tasks. In this work, firstly we propose the Atrous-Inception module, which combines both atrous convolution and inception module to obtain rich global receptive fields, while strictly controlling the parameter amount and realizing lightweight network architecture. Secondly, the transfer learning strategy is used to effectively transfer the prior knowledge of the optical, non-optical, hybrid optical and non-optical domains to the SAR target recognition tasks, thereby improving the model’s recognition performance on small sample SAR target datasets. Finally, the model constructed in this paper is verified to be 97.97% on ten types of MSTAR datasets under standard operating conditions, reaching a mainstream target recognition rate. Meanwhile, the method presented in this paper shows strong robustness and generalization performance on a small number of randomly sampled SAR target datasets.


2003 ◽  
Vol 17 (22n24) ◽  
pp. 4045-4061 ◽  
Author(s):  
Ying-Cheng Lai ◽  
Zonghua Liu ◽  
Nong Ye

We consider the entire spectrum of architectures for large, growing, and complex networks, ranging from being heterogeneous (scale-free) to homogeneous (random or small-world), and investigate the infection dynamics by using a realistic three-state epidemiological model. In this framework, a node can be in one of the three states: susceptible (S), infected (I), or refractory (R), and the populations in the three groups are approximately described by a set of nonlinear differential equations. Our heuristic analysis predicts that, (1) regardless of the network architecture, there exists a substantial fraction of nodes that can never be infected, and (2) heterogeneous networks are relatively more robust against spread of infection as compared with homogeneous networks. These are confirmed numerically. We have also considered the problem of deliberate immunization for preventing wide spread of infection, with the result that targeted immunization can be quite effective for heterogeneous networks. We believe these results are important for a host of problems in many areas of natural science and engineering, and in social sciences as well.


2011 ◽  
Vol 22 (05) ◽  
pp. 483-493 ◽  
Author(s):  
MIN LIN ◽  
GANG WANG

A modified Olami–Feder–Christensen (OFC) earthquake model on scale-free networks with assortative mixing is introduced. In this model, the distributions of avalanche sizes and areas display power-law behaviors. It is found that the period distribution of avalanches displays a scale-invariant law with the increment of range parameter d. More importantly, different assortative topologies lead to different dynamical behaviors, such as the distribution of avalanche size, the stress evolution process, and period distribution.


1978 ◽  
Vol 100 (3) ◽  
pp. 460-465 ◽  
Author(s):  
K. Hijikata ◽  
Y. Mori ◽  
T. Nagatani

In bubble nucleation under the oscillating pressure field, when the oscillation period τ is of the same order of magnitude as the characteristic time τn of bubble nucleation, it is expected that the distribution of radius of bubble embryo in liquid will be largely affected by the pressure oscillation and the degree of superheat limit may change. In order to clarify this point, superheat limits of homogeneous nucleation under the oscillating pressure field generated by ultrasonic oscillators are measured for propane with and without dissolved carbon dioxide by the floating droplet method. From the experimental results it is found that when τ > τn the measured superheat limit agrees with that calculated by the conventional theory where the quasi-steady state is assumed, but the bubble nucleation occurs at temperature lower than that preducted by the theory when τ nearly equals τn. It is also found that the characteristic time of bubble nucleation is changed by the amount of dissolved carbon dioxide.


2018 ◽  
Author(s):  
Sang-Yoon Kim ◽  
Woochang Lim

We are concerned about burst synchronization (BS), related to neural information processes in health and disease, in the Barabasi-Albert scale-free network (SFN) composed of inhibitory bursting Hindmarsh-Rose neurons. This inhibitory neuronal population has adaptive dynamic synaptic strengths governed by the inhibitory spike-timing-dependent plasticity (iSTDP). In previous works without considering iSTDP, BS was found to appear in a range of noise intensities for fixed synaptic inhibition strengths. In contrast, in our present work, we take into consideration iSTDP and investigate its effect on BS by varying the noise intensity. Our new main result is to find occurrence of a Matthew effect in inhibitory synaptic plasticity: good BS gets better via LTD, while bad BS get worse via LTP. This kind of Matthew effect in inhibitory synaptic plasticity is in contrast to that in excitatory synaptic plasticity where good (bad) synchronization gets better (worse) via LTP (LTD). We note that, due to inhibition, the roles of LTD and LTP in inhibitory synaptic plasticity are reversed in comparison with those in excitatory synaptic plasticity. Moreover, emergences of LTD and LTP of synaptic inhibition strengths are intensively investigated via a microscopic method based on the distributions of time delays between the preand the post-synaptic burst onset times. Finally, in the presence of iSTDP we investigate the effects of network architecture on BS by varying the symmetric attachment degree l* and the asymmetry parameter Δl in the SFN.


Author(s):  
Jaani Riordan

Overview. This chapter introduces the concept of an internet intermediary and situates their activities within the layered, modular network architecture of the internet. The services considered in this work take many forms, ranging from operators of network equipment to administrators of bulletin boards. Not all providers of internet services are properly described as ‘intermediaries’ as such, and are not necessarily to be treated comparably. Services may consist of different activities or contribute in different ways to wrongdoing. Some entities supply many distinct services which vary in their complexity, control, mental state, and degree of passivity. This makes it crucial to describe these activities accurately and with precision. As Arnold J has explained in the context of blocking injunctions, when considering questions of intermediary liability ‘it is important to consider the nature of the infringing act and its relationship with the service in question’.


1965 ◽  
Vol 20 (9) ◽  
pp. 1181-1189 ◽  
Author(s):  
E. Bayer ◽  
K. H. Hellwege ◽  
G. Schaack

The time dependance of the intensity emitted by a laser, whose cavity-Q is modulated periodically with a small amplitude a and frequency ωM is investigated (Internal Modulation). Only the case where ωM is of the same order of magnitude as the frequency of the relaxation oscillations ω0 (in linear approximation) is regarded. By the introduction of a time dependance of the photonlifetime τL=τ0 (1+α cos ωM t), α «1 into the rate equations, approximate solutions in analytical form and numerical solutions of the complete equations are obtained.Similar to the behaviour of a forced oscillator, the oscillations of the intensity emitted by such a laser are synchronized to the modulation of the cavity-Q and the amplitudes reach a maximum, when ωM equals ω0. The halfwidth of this resonance-effect is proportional to the cavity-Q.For ωM < ω0 the modulated intensity is superseded by undamped relaxation oscillations with frequency ω0, which are excited anew by each modulation cycle. The amplitude of these oscillations increases when ωM approaches ω0. For ωM > ω0 the relaxation oscillations are damped out and relieved by forced oscillations of the lasers intensity with decreasing amplitudes for increasing ωM.Observations with neodymium-glass rods in plane-parallel and concentric resonators and measurements of the amplitude of the modulation confirm the desrcibed behaviour.


Sign in / Sign up

Export Citation Format

Share Document