Semantic graphs and associative memories.

Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.

[1]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[2]  Mariano Sigman,et al.  Global organization of the Wordnet lexicon , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Teuvo Kohonen,et al.  Correlation Matrix Memories , 1972, IEEE Transactions on Computers.

[4]  E. Mizraji,et al.  Multiplicative contexts in associative memories. , 1994, Bio Systems.

[5]  E Mizraji,et al.  Memories in context. , 1999, Bio Systems.

[6]  G Tononi,et al.  Theoretical neuroanatomy: relating anatomical and functional connectivity in graphs and cortical connection matrices. , 2000, Cerebral cortex.

[7]  Leslie G. Ungerleider,et al.  Neural correlates of category-specific knowledge , 1996, Nature.

[8]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  M. Raichle Behind the scenes of functional brain imaging: a historical and physiological perspective. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[10]  E Mizraji,et al.  Context-dependent associations in linear distributed memories. , 1989, Bulletin of mathematical biology.

[11]  C. Koch,et al.  Constraints on cortical and thalamic projections: the no-strong-loops hypothesis , 1998, Nature.

[12]  M E Raichle,et al.  What words are telling us about the brain. , 1996, Cold Spring Harbor symposia on quantitative biology.

[13]  Partha Dasgupta,et al.  Topology of the conceptual network of language. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[15]  S. Strogatz Exploring complex networks , 2001, Nature.

[16]  B Jouve,et al.  A mathematical approach to the connectivity between the cortical visual areas of the macaque monkey. , 1998, Cerebral cortex.

[17]  P. Fries,et al.  When neurons form memories , 2003, Trends in Neurosciences.

[18]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[19]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[20]  James A. Anderson,et al.  A simple neural network generating an interactive memory , 1972 .

[21]  Leon N. Cooper,et al.  MEMORIES AND MEMORY: A PHYSICIST'S APPROACH TO THE BRAIN , 2000 .

[22]  B L McNaughton,et al.  Coordinated Reactivation of Distributed Memory Traces in Primate Neocortex , 2002, Science.