Random Tree Model of Meaningful Memory
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913702933954560 |
|---|---|
| author | Zhong, Weishun Can, Tankut Georgiou, Antonis Shnayderman, Ilya Katkov, Mikhail Tsodyks, Misha |
| author_facet | Zhong, Weishun Can, Tankut Georgiou, Antonis Shnayderman, Ilya Katkov, Mikhail Tsodyks, Misha |
| contents | Traditional studies of memory for meaningful narratives focus on specific stories and their semantic structures but do not address common quantitative features of recall across different narratives. We introduce a statistical ensemble of random trees to represent narratives as hierarchies of key points, where each node is a compressed representation of its descendant leaves, which are the original narrative segments. Recall is modeled as constrained by working memory capacity from this hierarchical structure. Our analytical solution aligns with observations from large-scale narrative recall experiments. Specifically, our model explains that (1) average recall length increases sublinearly with narrative length, and (2) individuals summarize increasingly longer narrative segments in each recall sentence. Additionally, the theory predicts that for sufficiently long narratives, a universal, scale-invariant limit emerges, where the fraction of a narrative summarized by a single recall sentence follows a distribution independent of narrative length. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_01806 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Random Tree Model of Meaningful Memory Zhong, Weishun Can, Tankut Georgiou, Antonis Shnayderman, Ilya Katkov, Mikhail Tsodyks, Misha Statistical Mechanics Artificial Intelligence Computation and Language Traditional studies of memory for meaningful narratives focus on specific stories and their semantic structures but do not address common quantitative features of recall across different narratives. We introduce a statistical ensemble of random trees to represent narratives as hierarchies of key points, where each node is a compressed representation of its descendant leaves, which are the original narrative segments. Recall is modeled as constrained by working memory capacity from this hierarchical structure. Our analytical solution aligns with observations from large-scale narrative recall experiments. Specifically, our model explains that (1) average recall length increases sublinearly with narrative length, and (2) individuals summarize increasingly longer narrative segments in each recall sentence. Additionally, the theory predicts that for sufficiently long narratives, a universal, scale-invariant limit emerges, where the fraction of a narrative summarized by a single recall sentence follows a distribution independent of narrative length. |
| title | Random Tree Model of Meaningful Memory |
| topic | Statistical Mechanics Artificial Intelligence Computation and Language |
| url | https://arxiv.org/abs/2412.01806 |