This study explores how to model cell assemblies using graph theory. Cell assemblies are patterns of neural activity first described by Hebb. The researchers created specific graph structures called Kn X Km graphs. These graphs have a large number of nodes and connections, which allows for many cell assemblies. They also introduced new ways to measure connectivity in directed graphs. These methods help understand how to build graphs with high assembly counts. The results suggest these graphs could be used in communication networks and associative memory systems. The study does not claim these are the only useful graphs but shows they have specific properties that make them promising for future applications.
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Area of Science:
Background:
The concept of cell assemblies has long been central to understanding patterns of neural activity. Hebb's original framework has not yet been fully formalized in modern graph theory. Prior research has shown that graph structures can model neural connectivity. However, no prior work had resolved how to count or size assemblies in large graphs. This gap motivated exploring graph constructions to maximize assembly counts. Existing models lack specific definitions for directed graph connectivity. That uncertainty drove the need for new connectivity measures in directed graphs. This paper proposes addressing these gaps through novel graph constructions.
Purpose Of The Study:
The aim is to formalize the concept of cell assemblies using graph theory. This study focuses on defining assembly size and number in large graphs. It also seeks to construct graphs with high assembly counts and connectivity. A specific problem is the lack of connectivity measures for directed graphs. The motivation stems from applications in neurodynamics and communication networks. This work addresses the need for a mathematical framework for assembly modeling. It also aims to provide new tools for analyzing and constructing complex graphs. The study proposes using Kn X Km graphs to explore assembly properties.
The researchers constructed Kn X Km graphs with n*m nodes and n+m-2 connections per node, which contain at least 2n + 2m - 4 assemblies.
The study introduced several new notions of connectivity in directed graphs and explored their relationships.
This structure allows for high assembly counts and connectivity, making it useful for modeling neural networks and communication systems.
Connectivity measures help define and count cell assemblies, which are crucial for modeling neural activity patterns.
Main Methods:
The researchers used graph theory to define cell assemblies mathematically. They constructed Kn X Km graphs with n*m nodes and n+m-2 connections per node. These graphs were analyzed for assembly count and connectivity properties. New connectivity measures were defined for directed graphs. The relationships between these measures were systematically investigated. The study focused on quantifying assembly numbers and sizes in large graphs. Graph constructions were tested for their ability to maximize assembly counts. Theoretical analysis was used to derive properties of the proposed graph structures.
Main Results:
The Kn X Km graphs contain at least 2n + 2m - 4 assemblies. These graphs have n*m nodes and n+m-2 connections per node. New connectivity measures were defined for directed graph structures. The relationships between these measures were clearly established. The assembly count in these graphs increases exponentially with graph size. This construction provides a framework for maximizing assembly numbers. The results suggest potential applications in communication network design. The study also shows how to build highly connected graphs with many assemblies.
Conclusions:
The authors propose that cell assemblies can be formalized through graph theory. Their results suggest that Kn X Km graphs maximize assembly counts. New connectivity measures for directed graphs were successfully defined. These measures may help in constructing graphs with high assembly numbers. The study shows that assembly count increases with graph size in these structures. The proposed framework may find applications in communication network design. The results do not claim essentiality of any specific graph construction. The authors suggest further exploration of these graph properties in practice.
Failed At:
2026-07-14T07:29:36.214160+00:00
The assembly count increases exponentially with graph size in the proposed Kn X Km structures.
The authors suggest these graphs may find use in communication network design and associative memory systems.