Structural Properties of Associative Knowledge Graphs

Janusz A. Starzyk, Przemyslaw Stoklosa, Adrian Horzyk, Pawel Raif

Abstract: This paper introduces a novel structural approach to constructing associative knowledge graphs. These graphs are composed of many overlapping scenes, with each scene representing a specific set of objects. In the knowledge graph, each scene is represented as a complete subgraph associating scene objects. Knowledge graph nodes represent various objects present within the scenes. The same object can appear in multiple scenes. The recreation of the stored scenes from the knowledge graph occurs through association with a given context, which includes some of the objects stored in the graph. The memory capacity of the system is determined by the size of the graph and the density of its synaptic connections. Theoretical dependencies are derived to describe both the critical graph density and the memory capacity of scenes stored in such graphs. The critical graph density represents the maximum density at which it is possible to reproduce all elements of the scene without errors.