{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/an-information-theoretic-framework-to-measure","title":"An information-theoretic framework to measure the dynamic interaction between neural spike trains","arxiv_id":"2012.08667","date":"2020-12-15","proceeding":null,"authors":["Gorana Mijatovic","Yuri Antonacci","Tatjana Loncar-Turukalo","Ludovico Minati","Luca Faes"],"abstract":"Understanding the interaction patterns among simultaneous recordings of spike trains from multiple neuronal units is a key topic in neuroscience. However, an optimal approach of assessing these interactions has not been established, as existing methods either do not consider the inherent point process nature of spike trains or are based on parametric assumptions that may lead to wrong inferences if not met. This work presents a framework, grounded in the field of information dynamics, for the model-free, continuous-time estimation of both undirected (symmetric) and directed (causal) interactions between pairs of spike trains. The framework decomposes the overall information exchanged dynamically between two point processes X and Y as the sum of the dynamic mutual information (dMI) between the histories of X and Y, plus the transfer entropy (TE) along the directions X->Y and Y->X. Building on recent work which derived theoretical expressions and consistent estimators for the TE in continuous time, we develop algorithms for estimating efficiently all measures in our framework through nearest neighbor statistics. These algorithms are validated in simulations of independent and coupled spike train processes, showing the accuracy of dMI and TE in the assessment of undirected and directed interactions even for weakly coupled and short realizations, and proving the superiority of the continuous-time estimator over the discrete-time method. Then, the usefulness of the framework is illustrated in a real data scenario of recordings from in-vitro preparations of spontaneously-growing cultures of cortical neurons, where we show the ability of dMI and TE to identify how the networks of undirected and directed spike train interactions change their topology through maturation of the neuronal cultures.","url_abs":"https://arxiv.org/abs/2012.08667v1","url_pdf":"https://arxiv.org/pdf/2012.08667v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"an-information-theoretic-framework-to-measure","repo_url":"https://github.com/mijatovicg/TEMI","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"point-processes","task_name":"Point Processes"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2012.08667","atlas_url":"https://app.syntology.ai/?focus=2012.08667","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2012.08667"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2012.08667\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2012.08667"},"call":"get_concepts_for_paper(arxiv_id=\"2012.08667\")"}],"by_repo":[{"repo":"mijatovicg/TEMI","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"438ec129a8301742dfff7f76f63c92fa652e6eaac290bce70e3702ceba81549b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}