Autonomous and Ubiquitous In-node Learning Algorithms of Active Directed Graphs and Its Storage Behavior

by   Hui Wei, et al.

Memory is an important cognitive function for humans. How a brain with such a small power can complete such a complex memory function, the working mechanism behind this is undoubtedly fascinating. Engram theory views memory as the co-activation of specific neuronal clusters. From the perspective of graph theory, nodes represent neurons, and directed edges represent synapses. Then the memory engram is the connected subgraph formed between the activated nodes. In this paper, we use subgraphs as physical carriers of information and propose a parallel distributed information storage algorithm based on node scale in active-directed graphs. An active-directed graph is defined as a graph in which each node has autonomous and independent behavior and relies only on information obtained within the local field of view to make decisions. Unlike static directed graphs used for recording facts, active-directed graphs are decentralized like biological neuron networks and do not have a super manager who has a global view and can control the behavior of each node. Distinct from traditional algorithms with a global field of view, this algorithm is characterized by nodes collaborating globally on resource usage through their limited local field of view. While this strategy may not achieve global optimality as well as algorithms with a global field of view, it offers better robustness, concurrency, decentralization, and bioviability. Finally, it was tested in network capacity, fault tolerance, and robustness. It was found that the algorithm exhibits a larger network capacity in a more sparse network structure because the subgraph generated by a single sample is not a whole but consists of multiple weakly connected components. In this case, the network capacity can be understood as the number of permutations of several weakly connected components in the network.


b-articulation points and b-bridges in strongly biconnected directed graphs

A directed graph G=(V,E) is called strongly biconnected if G is strongly...

Local Structure-aware Graph Contrastive Representation Learning

Traditional Graph Neural Network (GNN), as a graph representation learni...

Local Access to Sparse Connected Subgraphs Via Edge Sampling

We contribute an approach to the problem of locally computing sparse con...

Local Graph Embeddings Based on Neighbors Degree Frequency of Nodes

We propose a local-to-global strategy for graph machine learning and net...

Self-Stabilizing Construction of a Minimal Weakly 𝒮𝒯-Reachable Directed Acyclic Graph

We propose a self-stabilizing algorithm to construct a minimal weakly 𝒮𝒯...

Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs

We investigated the computational power of a single mobile agent in an n...

QR code denoising using parallel Hopfield networks

We propose a novel algorithm for using Hopfield networks to denoise QR c...

Please sign up or login with your details

Forgot password? Click here to reset