Random Connections Research Articles

Expansion of the critical intensity for the random connection model

Expansion of the critical intensity for the random connection model

Bilateral Alignment of Receptive Fields in the Olfactory Cortex.

Each olfactory cortical hemisphere receives ipsilateral odor information directly from the olfactory bulb and contralateral information indirectly from the other cortical hemisphere. Since neural projections to the olfactory cortex are disordered and non-topographic, spatial information cannot be used to align projections from the two sides like in the visual cortex. Therefore, how bilateral information is integrated in individual cortical neurons is unknown. We have found, in mice, that the odor responses of individual neurons to selective stimulation of each of the two nostrils are significantly correlated, such that odor identity decoding optimized with information arriving from one nostril transfers very well to the other side. Nevertheless, these aligned responses are asymmetric enough to allow decoding of stimulus laterality. Computational analysis shows that such matched odor tuning is incompatible with purely random connections but is explained readily by Hebbian plasticity structuring bilateral connectivity. Our data reveal that despite the distributed and fragmented sensory representation in the olfactory cortex, odor information across the two hemispheres is highly coordinated.Significance statement Like other sense organs, animals typically have two nostrils, but how odor information from the two sides is combined to build bilateral olfactory representations remains largely unknown. Grimaud et al. find that the responses of neurons in the olfactory cortex in awake mice to odors presented separately to the ipsilateral or contralateral nostril are significantly correlated, beyond chance. Such aligned responses could arise from Hebbian plasticity in interhemispheric connections that relies on common odor experiences across the two nostrils. While responses are correlated, the remaining asymmetries in responses to the two nostrils allowed decoding of stimulus laterality. This study points to unexpected order in an olfactory circuit and prompts future work on how olfactory experience can shape interhemispheric information integration.

Influence maximization based on discrete particle swarm optimization on multilayer network

Influence maximization (IM) aims to strategically select influential users to maximize information propagation in social networks. Most of the existing studies focus on IM in single-layer networks. However, we have observed that individuals often engage in multiple social platforms to fulfill various social needs. To make better use of this observation, we consider an extended problem of how to maximize influence spread in multilayer networks. The Multilayer Influence Maximization (MLIM) problem is different from the IM problem because information propagation behaves differently in multilayer networks compared to single-layer networks: users influenced on one layer may trigger the propagation of information on another layer. Our work successfully models the information propagation process as a Multilayer Independent Cascade model in multilayer networks. Based on the characteristics of this model, we introduce an approximation function called Multilayer Expected Diffusion Value (MLEDV) for it. However, the NP-hardness of the MLIM problem has posed significant challenges to our work. To tackle the issue, we devise a novel algorithm based on Discrete Particle Swarm Optimization. Our algorithm consists of two stages: 1) the candidate node selection, where we devise a novel centrality metric called Random connectivity Centrality to select candidate nodes, which assesses the importance of nodes from a connectivity perspective. 2)the seed selection, where we employ a discrete particle swarm algorithm to find seed nodes from the candidate nodes. We use MLEDV as a fitness function to measure the spreading power of candidate solutions in our algorithm. Additionally, we introduce a Neighborhood Optimization strategy to increase the convergence of the algorithm. We conduct experiments on four real-world networks and two self-built networks and demonstrate that our algorithms are effective for the MLIM problem.

A Scene Graph Similarity-Based Remote Sensing Image Retrieval Algorithm

With the rapid development of remote sensing image data, the efficient retrieval of target images of interest has become an important issue in various applications including computer vision and remote sensing. This research addressed the low-accuracy problem in traditional content-based image retrieval algorithms, which largely rely on comparing entire image features without capturing sufficient semantic information. We proposed a scene graph similarity-based remote sensing image retrieval algorithm. Firstly, a one-shot object detection algorithm was designed for remote sensing images based on Siamese networks and tailored to the objects of an unknown class in the query image. Secondly, a scene graph construction algorithm was developed, based on the objects and their attributes and spatial relationships. Several construction strategies were designed based on different relationships, including full connections, random connections, nearest connections, star connections, or ring connections. Thirdly, by making full use of edge features for scene graph feature extraction, a graph feature extraction network was established based on edge features. Fourthly, a neural tensor network-based similarity calculation algorithm was designed for graph feature vectors to obtain image retrieval results. Fifthly, a dataset named remote sensing images with scene graphs (RSSG) was built for testing, which contained 929 remote sensing images with their corresponding scene graphs generated by the developed construction strategies. Finally, through performance comparison experiments with remote sensing image retrieval algorithms AMFMN, MiLaN, and AHCL, in precision rates, Precision@1 improved by 10%, 7.2%, and 5.2%, Precision@5 improved by 3%, 5%, and 1.7%; and Precision@10 improved by 1.7%, 3%, and 0.6%. In recall rates, Recall@1 improved by 2.5%, 4.3%, and 1.3%; Recall@5 improved by 3.7%, 6.2%, and 2.1%; and Recall@10 improved by 4.4%, 7.7% and 1.6%.

Association Model-Based Intermittent Connection Fault Diagnosis for Controller Area Networks

Controller Area Networks (CANs) play an important role in many safety-critical industrial systems, which places high demands on their reliability performance. However, the intermittent connection (IC) of network cables, a random and transient connectivity problem, is a common but hard troubleshooting fault that can cause network performance degradation, system-level failures, and even safety issues. Therefore, to ensure the reliability of CANs, a fault symptom association model-based IC fault diagnosis method is proposed. Firstly, the symptoms are defined by examining the error records, and the domains of the symptoms are derived to represent the causal relationship between the fault locations and the symptoms. Secondly, the fault probability for each location is calculated by minimizing the difference between the symptom probabilities calculated from the count information and those fitted by the total probability formula. Then, the fault symptom association model is designed to synthesize the causal and the probabilistic diagnostic information. Finally, a model-based maximal contribution diagnosis algorithm is developed to locate the IC faults. Experimental results of three case studies show that the proposed method can accurately and efficiently identify various IC fault location scenarios in networks.

Searching for long timescales without fine tuning.

Animal behavior occurs on timescales much longer than the response times of individual neurons. In many cases, it is plausible that these long timescales emerge from the recurrent dynamics of electrical activity in networks of neurons. In linear models, timescales are set by the eigenvalues of a dynamical matrix whose elements measure the strengths of synaptic connections between neurons. It is not clear to what extent these matrix elements need to be tuned to generate long timescales; in some cases, one needs not just a single long timescale but a whole range. Starting from the simplest case of random symmetric connections, we combine maximum entropy and random matrix theory methods to construct ensembles of networks, exploring the constraints required for long timescales to become generic. We argue that a single long timescale can emerge generically from realistic constraints, but a full spectrum of slow modes requires more tuning. Langevin dynamics that generates patterns of synaptic connections drawn from these ensembles involves a combination of Hebbian learning and activity-dependent synaptic scaling.

Mass media competition and alternative ordering in social dynamics.

We investigate the collective behavior of a system of social agents subject to the competition between two mass media influences considered as external fields. We study under what conditions either of two mass media with different intensities can impose its message to the majority. In addition to a collective state dominated by the stronger mass media and a disordered phase, we characterize two nontrivial effects as the parameters of the system are varied: (i) the appearance of a majority sharing the state of the weaker mass media, and (ii) the emergence of an alternative ordering in a state different from those of either media. We explore the dependence of both phenomena on the topology of the network of interactions. We show that the presence of long-range interactions rather than random connections is essential for the occurrence of both effects. The model can be extended to include multiple mass media and we illustrate it by considering three mass media fields acting on the system. Nontrivial collective behaviors persist for some ranges of parameters: the weakest mass media can convince the majority, and the system can spontaneously order against all applied fields.

Big-C creativity in artists and scientists is associated with more random global but less random local fMRI functional connectivity.

Big-C creativity in artists and scientists is associated with more random global but less random local fMRI functional connectivity.

Hardware Implementation of Next Generation Reservoir Computing with RRAM‐Based Hybrid Digital‐Analog System

Reservoir computing (RC) possesses a simple architecture and high energy efficiency for time‐series data analysis through machine learning algorithms. To date, RC has evolved into several innovative variants. The next generation reservoir computing (NGRC) variant, founded on nonlinear vector autoregression (NVAR) distinguishes itself due to its fewer hyperparameters and independence from physical random connection matrices, while yielding comparable results. However, NGRC networks struggle with massive Kronecker product calculations and matrix‐vector multiplications within the read out layer, leading to substantial efficiency challenges for traditional von Neumann architectures. In this work, a hybrid digital‐analog hardware system tailored for NGRC is developed. The digital part is a Kronecker product calculation unit with data filtering, which realizes transformation of nonlinear vector of the input linear vector. For matrix‐vector multiplication, a computing‐in‐memory architecture based on resistive random access memory array offers an energy‐efficient hardware solution, which markedly reduces data transfer and greatly improve computational parallelism and energy efficiency. The predictive capabilities of this hybrid NGRC system are validated through the Lorenz63 model, achieving a normalized root mean square error (NRMSE) of 0.00098 and an energy efficiency of 19.42TOPS W−1.

Automatic Classification of Defective Solar Panels in Electroluminescence Images Based on Random Connection Network

Automatic Classification of Defective Solar Panels in Electroluminescence Images Based on Random Connection Network

Holonomy of the Planar Brownian Motion in a Poisson Punctured Plane

We define a family of diffeomorphism-invariant models of random connections on principal G-bundles over the plane, whose curvatures are concentrated on singular points. We study the limit when the number of points grows to infinity whilst the singular curvature on each point diminishes, and prove that the holonomy along a Brownian trajectory converges towards an explicit limit.

Inhomogeneous long-range percolation in the weak decay regime

We study a general class of percolation models in Euclidean space including long-range percolation, scale-free percolation, the weight-dependent random connection model and several other previously investigated models. Our focus is on the weak decay regime, in which inter-cluster long-range connection probabilities fall off polynomially with small exponent, and for which we establish several structural properties. Chief among them are the continuity of the bond percolation function and the transience of infinite clusters.

Multilayer time-variant network edges synchronization method

In this work, we propose a method for measuring synchronization between the edges of a pair of networks with connections that vary over time. The product of this method is an Incidence-Fidelity network, indicating the intensity of edge synchronization during a time interval. Two distinct validations were performed: in the first, we employed time-varying multilayer graphs with random connections to validate the algorithm; and in the second, we used the coupled Rössler oscillator to validate the method. In the algorithm validation, we compared the algebraically predicted results with the results obtained by using random networks. In the method validation, we used the coupled Rössler oscillator to generate time series representing the existence of two edges, one in each layer of the time-varying multilayer graphs. We assessed the relationship between the pre-defined coupling values and the achieved synchronization indices. In the application of our method, we considered time series of 17 years of climate data for the Normalized Difference Vegetation Index (NDVI) and precipitation for all municipalities in the state of Bahia, Brazil. To do so, we first obtained the individual layers of the multilayer network using a motif synchronization method. From the individual layers, we generated the Interlayer Incidence-Fidelity network. The obtained Interlayer Incidence-Fidelity network for the NDVI and precipitation pair reflects a connection pattern that incorporates the configurations of the individual layers. This is because synchronizations are primarily distributed in the more interconnected regions of the individual layers. The Interlayer Incidence-Fidelity networks generated by our method can identify synchronization patterns in the evolution of relationships between networks over time. This method presents a promising tool for evaluating synchronization between networks, generating a weighted network that quantifies the different levels of temporal synchronization for each edge in the networks.

Modeling the evolution of collective overreaction in dynamic online product diffusion networks

With the development of e-commerce, collective overreactions such as buying frenzy have become prominent. However, studies have rarely investigated the mechanism of irrational consumer behavior at the group level. To investigate the evolution of collective overreaction in dynamic online product diffusion networks, we employed a sequential multiple-methods approach. A conceptual model is constructed to capture the influence of social network dynamic evolution on individual irrationality. An agent-based model (ABM) under different network dynamic growth mechanisms is implemented and verified. The findings revealed the following. In external dynamic growth mechanisms, key opinion consumer (KOC) connection can lead to positive collective overreaction (i.e., the adoption rate of consumer groups spikes). This effect fades as the probability of KOC connection increases and stabilizes as the node change rate decreases. Random connection is prone to negative collective overreaction (i.e., a sudden and sharp decline in the adoption rate of consumer groups), and key opinion leader (KOL) connection exhibits both positive and negative collective overreaction. Increasing the edge change rate increases the frequency of negative collective overreaction in KOL connections. In internal dynamic growth mechanisms, KOL and KOC connections are prone to negative collective overreaction; increasing the edge change rate can reduce the frequency of negative collective overreaction in KOL overreaction, and an appropriate edge change rate can inhibit the emergence of negative collective overreaction in KOC connection. This research contributes to the area of internet product marketing and provides a new basic framework through which to combine psychology and the ABM.

The contact process on scale-free geometric random graphs

We study the contact process on a class of geometric random graphs with scale-free degree distribution, defined on a Poisson point process on Rd. This class includes the age-dependent random connection model and the soft Boolean model. In the ultrasmall regime of these random graphs we provide exact asymptotics for the non-extinction probability when the rate of infection spread is small and show for a finite version of these graphs that the extinction time is of exponential order in the size of the graph.

Shortest Path of a Random Graph and its Application

The goal of this work is to provide an effective method for determining the shortest path in random graphs, which are complicated networks with random connectivity patterns. We have developed an algorithm that can identify the shortest path for both weighted and unweighted random graphs to accomplish our objective. As connectivity in these types of structures is changing, the algorithm adjusts to different edge weights and node configurations to provide fast and precise shortest path searching. The study shows that the suggested method performs more successfully in finding the shortest path throughout random graphs using comprehensive computations. Many networks, including social networks, granular networks, road traffic networks, etc., include nodes that can connect to one another and create random graphs in the present-day computational era. The outcomes demonstrate how flexible it is, which makes it a useful tool for practical uses in domains where random graph structures are common, like transportation networks, communication systems, and social networks. For illustration, we have taken into consideration an actual case study of communication road networks here. We have determined the shortest path of the road networks using our proposed algorithm, and the results have been presented. Better decision-making across a range of areas is made possible by this study, which advances effective algorithms designed for complicated and unpredictable network environments.

“Stalk Me to the End of Love”: Mutual Watching and Intimate Affections through the Use of Smartphones

“Stalk me to the end of love” is a speculative project of artistic investigation and social experimentation in the digital sphere that questions the way in which affective relationships occur when technological devices mediate them. The project proposes a hyper-surveillance space between equals (peer-to-peer watching) by creating a smartphone app. The app creates a random connection between two users who don’t know each other, allowing an unusual bond of communication and surveillance. In that sense, the main interest in this project is to question the construction of intimacy through the performative use of personal technological devices, as well as the way we are affected in our daily lives by constant and ubiquitous surveillance.

Physical Reservoir Computing Enabled by Solitary Waves and Biologically Inspired Nonlinear Transformation of Input Data

Reservoir computing (RC) systems can efficiently forecast chaotic time series using the nonlinear dynamical properties of an artificial neural network of random connections. The versatility of RC systems has motivated further research on both hardware counterparts of traditional RC algorithms and more-efficient RC-like schemes. Inspired by the nonlinear processes in a living biological brain and using solitary waves excited on the surface of a flowing liquid film, in this paper, we experimentally validated a physical RC system that substitutes the effect of randomness that underpins the operation of the traditional RC algorithm for a nonlinear transformation of input data. Carrying out all operations using a microcontroller with minimal computational power, we demonstrate that the so-designed RC system serves as a technically simple hardware counterpart to the ‘next-generation’ improvement of the traditional RC algorithm.

Composing recurrent spiking neural networks using locally-recurrent motifs and risk-mitigating architectural optimization.

In neural circuits, recurrent connectivity plays a crucial role in network function and stability. However, existing recurrent spiking neural networks (RSNNs) are often constructed by random connections without optimization. While RSNNs can produce rich dynamics that are critical for memory formation and learning, systemic architectural optimization of RSNNs is still an open challenge. We aim to enable systematic design of large RSNNs via a new scalable RSNN architecture and automated architectural optimization. We compose RSNNs based on a layer architecture called Sparsely-Connected Recurrent Motif Layer (SC-ML) that consists of multiple small recurrent motifs wired together by sparse lateral connections. The small size of the motifs and sparse inter-motif connectivity leads to an RSNN architecture scalable to large network sizes. We further propose a method called Hybrid Risk-Mitigating Architectural Search (HRMAS) to systematically optimize the topology of the proposed recurrent motifs and SC-ML layer architecture. HRMAS is an alternating two-step optimization process by which we mitigate the risk of network instability and performance degradation caused by architectural change by introducing a novel biologically-inspired "self-repairing" mechanism through intrinsic plasticity. The intrinsic plasticity is introduced to the second step of each HRMAS iteration and acts as unsupervised fast self-adaptation to structural and synaptic weight modifications introduced by the first step during the RSNN architectural "evolution." We demonstrate that the proposed automatic architecture optimization leads to significant performance gains over existing manually designed RSNNs: we achieve 96.44% on TI46-Alpha, 94.66% on N-TIDIGITS, 90.28% on DVS-Gesture, and 98.72% on N-MNIST. To the best of the authors' knowledge, this is the first work to perform systematic architecture optimization on RSNNs.

Critical exponents for marked random connection models

Critical exponents for marked random connection models