<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Archiving and Interchange DTD v2.3 20070202//EN" "archivearticle.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="methods-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Comput. Neurosci.</journal-id>
<journal-title>Frontiers in Computational Neuroscience</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Comput. Neurosci.</abbrev-journal-title>
<issn pub-type="epub">1662-5188</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fncom.2025.1639829</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Neuroscience</subject>
<subj-group>
<subject>Methods</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Maximum likelihood estimation of spatially dependent interactions in large populations of cortical neurons</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Godin</surname> <given-names>Camille</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2795899/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Thivierge</surname> <given-names>J. P.</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/35546/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>School of Psychology, University of Ottawa</institution>, <addr-line>Ottawa, ON</addr-line>, <country>Canada</country></aff>
<aff id="aff2"><sup>2</sup><institution>Brain and Mind Research Institute, University of Ottawa</institution>, <addr-line>Ottawa, ON</addr-line>, <country>Canada</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Joel Zylberberg, York University, Canada</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Ian Stevenson, University of Connecticut, United States</p>
<p>Disheng Tang, Tsinghua University, China</p></fn>
<corresp id="c001">&#x002A;Correspondence: J. P. Thivierge, <email>jthivier@uottawa.ca</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>13</day>
<month>08</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>19</volume>
<elocation-id>1639829</elocation-id>
<history>
<date date-type="received">
<day>02</day>
<month>06</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>22</day>
<month>07</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x00A9; 2025 Godin and Thivierge.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Godin and Thivierge</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<p>Understanding how functional connectivity between cortical neurons varies with spatial distance is crucial for characterizing large-scale neural dynamics. However, inferring these spatial patterns is challenging when spike trains are collected from large populations of neurons. Here, we present a maximum likelihood estimation (MLE) framework to quantify distance-dependent functional interactions directly from observed spiking activity. We validate this method using both synthetic spike trains generated from a linear Poisson model and biologically realistic simulations performed with Izhikevich neurons. We then apply the approach to large-scale electrophysiological recordings from V1 cortical neurons. Our results show that the proposed MLE approach robustly captures spatial decay in functional connectivity, providing insights into the spatial structure of population-level neural interactions.</p>
</abstract>
<kwd-group>
<kwd>distance dependent connectivity</kwd>
<kwd>maximum likelihood</kwd>
<kwd>visual cortex (V1)</kwd>
<kwd>calcium imaging</kwd>
<kwd>spiking neuron model</kwd>
</kwd-group>
<contract-sponsor id="cn001">Natural Sciences and Engineering Research Council of Canada<named-content content-type="fundref-id">https://doi.org/10.13039/501100000038</named-content></contract-sponsor>
<counts>
<fig-count count="10"/>
<table-count count="1"/>
<equation-count count="53"/>
<ref-count count="65"/>
<page-count count="15"/>
<word-count count="10357"/>
</counts>
</article-meta>
</front>
<body>
<sec id="S1" sec-type="intro">
<title>Introduction</title>
<p>Understanding the organization of brain networks is a fundamental challenge in neuroscience (<xref ref-type="bibr" rid="B17">Honey et al., 2010</xref>). A key principle of neuronal wiring is spatial embedding, where the probability of synaptic contact between neurons decreases as a function of physical distance (<xref ref-type="bibr" rid="B10">Ercsey-Ravasz et al., 2013</xref>; <xref ref-type="bibr" rid="B18">Horv&#x00E1;t et al., 2016</xref>; <xref ref-type="bibr" rid="B42">Perin et al., 2011</xref>; <xref ref-type="bibr" rid="B49">Song et al., 2005</xref>; <xref ref-type="bibr" rid="B50">Stetter et al., 2012</xref>; <xref ref-type="bibr" rid="B65">Zingg et al., 2014</xref>). This principle holds across multiple spatial scales, from local neuronal networks to large-scale brain regions (<xref ref-type="bibr" rid="B33">Markov et al., 2013</xref>), and has been leveraged in computational models to explain various properties of cortical connectivity, neuronal communication (<xref ref-type="bibr" rid="B10">Ercsey-Ravasz et al., 2013</xref>), and functions including learning and working memory (<xref ref-type="bibr" rid="B25">Keller et al., 2024</xref>).</p>
<p>Advances in experimental neuroscience have enabled large-scale recordings of neural activity, capturing the dynamics of broad neuronal populations (<xref ref-type="bibr" rid="B52">Stosiek et al., 2003</xref>; <xref ref-type="bibr" rid="B53">Stringer et al., 2019a</xref>,<xref ref-type="bibr" rid="B54">b</xref>). These advances provide unprecedented insight into the complex interactions that govern brain function (<xref ref-type="bibr" rid="B4">Chen et al., 2022</xref>; <xref ref-type="bibr" rid="B17">Honey et al., 2010</xref>; <xref ref-type="bibr" rid="B47">Seth, 2008</xref>; <xref ref-type="bibr" rid="B55">Su&#x00E1;rez et al., 2020</xref>). However, characterizing distance-dependent interactions within these populations remains challenging, as the underlying synaptic connectivity is typically unknown <italic>in vivo</italic> (<xref ref-type="bibr" rid="B56">Tian et al., 2024</xref>). Addressing this challenge would provide a rich understanding of neuronal organization and enable comparisons across brain regions that play distinct roles in behavioral and mental states.</p>
<p>To examine distance-dependent interactions, most studies have relied on functional connectivity to measure statistical dependencies or mutual information between patterns of neuronal activity (<xref ref-type="bibr" rid="B13">Friston et al., 2013</xref>; <xref ref-type="bibr" rid="B50">Stetter et al., 2012</xref>). While measuring structural connectivity requires access to the physical connections between neurons, based on invasive or post-mortem techniques, functional connectivity can be derived from recorded neural activity. This makes functional connectivity a pivotal approach for investigating the dynamic relationship between interconnected neural elements. Thus, estimating functional connectivity is critical for understanding information flow in the brain and the organization of neuronal circuits.</p>
<p>A variety of measures have been proposed to infer functional connectivity, including pairwise correlations, transfer entropy, and Granger causality (<xref ref-type="bibr" rid="B56">Tian et al., 2024</xref>). Distance-based interactions estimated from pairwise correlations (<xref ref-type="bibr" rid="B48">Smith and Kohn, 2008</xref>; <xref ref-type="bibr" rid="B64">Yatsenko et al., 2015</xref>) and spike-based functional connectivity (<xref ref-type="bibr" rid="B9">English et al., 2017</xref>) have been measured in cortex. These interactions show specificity across layers (<xref ref-type="bibr" rid="B46">Senzai et al., 2019</xref>), cell types (<xref ref-type="bibr" rid="B26">Khoury et al., 2025</xref>), brain regions (<xref ref-type="bibr" rid="B18">Horv&#x00E1;t et al., 2016</xref>), as well as a dependence on sensory features such as stimulus orientation (<xref ref-type="bibr" rid="B48">Smith and Kohn, 2008</xref>; <xref ref-type="bibr" rid="B64">Yatsenko et al., 2015</xref>).</p>
<p>However, measures of functional connectivity have notable limitations. First, estimating functional connectivity is complicated by the inherently noisy and irregular nature of neuronal signals (<xref ref-type="bibr" rid="B1">Aertsen et al., 1989</xref>; <xref ref-type="bibr" rid="B20">Ito et al., 2011</xref>; <xref ref-type="bibr" rid="B22">Izzi et al., 2024</xref>; <xref ref-type="bibr" rid="B29">Liao et al., 2010</xref>; <xref ref-type="bibr" rid="B61">Vicente et al., 2011</xref>). Second, functional connectivity does not directly measure synaptic efficacy, making interpretation difficult (<xref ref-type="bibr" rid="B58">Ursino et al., 2020</xref>). Third, conventional functional connectivity measures do not explicitly account for spatial interactions, often overlooking the impact of physical distance on neuronal communication (<xref ref-type="bibr" rid="B16">Holmgren et al., 2003</xref>; <xref ref-type="bibr" rid="B23">Jiang et al., 2015</xref>; <xref ref-type="bibr" rid="B42">Perin et al., 2011</xref>; <xref ref-type="bibr" rid="B59">Vegu&#x00E9; et al., 2017</xref>). As a result, these methods fail to capture the underlying spatial structure of neuronal networks, limiting our ability to understand their functional organization. Given the critical role of spatially structured interactions in neural processing (<xref ref-type="bibr" rid="B36">Ohiorhenuan et al., 2010</xref>), new approaches are needed to extract meaningful spatial information from large-scale recordings.</p>
<p>Here, we introduce a novel maximum likelihood estimation (MLE) approach to characterize distance-dependent functional connectivity. Instead of estimating individual interaction strengths between all pairs of neurons, this method estimates a global parameter that governs the spatial decay of connectivity across a neuronal population. The proposed MLE assumes an exponential relationship between connectivity and physical distance (<xref ref-type="bibr" rid="B10">Ercsey-Ravasz et al., 2013</xref>; <xref ref-type="bibr" rid="B18">Horv&#x00E1;t et al., 2016</xref>) and infers this decay parameter from observed spike trains.</p>
<p>We validate this approach using synthetic networks of Poisson and Izhikevich neurons (<xref ref-type="bibr" rid="B21">Izhikevich, 2003</xref>) and apply it to large-scale recordings from mouse V1 neurons obtained from two-photon calcium imaging (<xref ref-type="bibr" rid="B53">Stringer et al., 2019a</xref>). Our results demonstrate that MLE successfully extracts distance-dependent interactions, revealing spatially structured neuronal communication.</p>
</sec>
<sec id="S2" sec-type="results">
<title>Results</title>
<sec id="S2.SS1">
<title>Distance-based interactions in a linear Poisson model</title>
<p>As a starting point, we designed a simple linear model where spike trains from individual neurons are generated by stationary Poisson processes, implying that the number of spikes in non-overlapping intervals is conditionally independent and that the spike rate remains constant over time (<xref ref-type="fig" rid="F1">Figure 1A</xref>) (see section &#x201C;Materials and methods&#x201D;). The spike probability <italic>p</italic>(<italic>S</italic><sub><italic>i</italic></sub>(<italic>t</italic>)) of a neuron <italic>i</italic> at time <italic>t</italic> depends on the baseline rate (<italic>r<sub>0</sub></italic>) and the spiking activity of surrounding neurons,</p>
<disp-formula id="S2.Ex1">
<mml:math id="M1"><mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mi>j</mml:mi></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi mathvariant="normal">&#x03B1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption><p>Spatially embedded Poisson neurons. <bold>(A)</bold> Schema of a stationary Poisson neuron receiving spiking activity <italic>S</italic><sub><italic>j</italic></sub>(<italic>t</italic>&#x2212;1) from <italic>j<sup>th</sup></italic> presynaptic neurons at time <italic>t-1</italic> via weighted connections &#x03B1;. Presynaptic activity is summed and a stochastic process generates spikes <italic>p</italic>(<italic>S</italic><sub><italic>i</italic></sub>(<italic>t</italic>)). <bold>(B)</bold> Illustration of spiking activity over time-steps <italic>t</italic> for a population of neurons randomly positioned on a two-dimensional grid. <bold>(C)</bold> The probability of connection between pairs of neurons is determined by an exponential function with slope parameter &#x03BB;<sub>decay</sub>.</p></caption>
<alt-text>&#x201C;Diagram A illustrates a neural network model showing inputs&#x000D;&#x000A;(S1(t &#x2212; 1), Sj(t &#x2212; 1)) with weights (&#x03B1;), producing a probability (P(Si(t))) and spike events over time. Panel B displays sequential grids at times (t = 1, 2, 3), depicting red dots representing neural activity. Graph C depicts distance-dependent exponential interactions with three curves labeled (&#x03BB;_decay = 1 mm&#x2212;1, 2 mm&#x2212;1, 10 mm&#x2212;1), showing decreasing probability of communication (p_com(dij)) with increasing distance.&#x201D;</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-19-1639829-g001.tif"/>
</fig>
<p>where <italic>S</italic><sub><italic>j</italic></sub>(<italic>t</italic>&#x2212;1) is the spiking activity of neuron <italic>j</italic> at the previous time-step, &#x03B1; is a fixed coupling strength, and <italic>J</italic><sub><italic>ij</italic></sub> = 1 if neuron <italic>j</italic> is connected to neuron <italic>i</italic>, and 0 otherwise, where the connection probability follows an exponential function with a decay parameter (&#x03BB;<sub>decay</sub>) (<xref ref-type="fig" rid="F1">Figure 1C</xref>),</p>
<disp-formula id="E1">
<label>(1)</label><mml:math id="M2"><mml:mrow><mml:mi>&#x2119;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>1</mml:mn><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mo>-</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where <italic>d</italic><sub><italic>ij</italic></sub> denotes the Euclidean distance between neurons <italic>i</italic> and <italic>j</italic>, expressed in units of millimeters. In this model, neurons are recurrently connected and embedded in two-dimensional space, meaning that each neuron is assigned a unique position along a finite two-dimensional grid where boundaries do not wrap around. Hence, spiking activity in this model is described by both spatial and temporal coordinates (<xref ref-type="fig" rid="F1">Figure 1B</xref>).</p>
<p>An example of a spike raster generated with this model using &#x03BB;<sub>decay</sub> = 5 mm<sup>&#x2013;1</sup> is shown in <xref ref-type="fig" rid="F2">Figure 2A</xref> (1 time-step set as equivalent to 1 ms). The central question addressed here is whether we can reliably estimate &#x03BB;<sub>decay</sub> based on this spike raster. This was performed by maximum likelihood estimation (see section &#x201C;Materials and methods&#x201D;). Because &#x03BB;<sub>decay</sub> is estimated from spike trains and not synaptic connections, it captures the functional interactions between spatially embedded neurons, and is not a proxy for physical connectivity, though the two may be linked, as exemplified below.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption><p>Estimating spatially dependent interactions in a network of Poisson neurons. <bold>(A)</bold> Spike raster generated by 1,000 interconnected neurons. <bold>(B)</bold> The log likelihood function was maximal near the true value of &#x03BB;<sub>decay</sub>. <bold>(C)</bold> The maximum likelihood estimate of &#x03BB;<sub>decay</sub> across different runs of the Poisson model. Dashed line: unity line showing the correspondence between the true and estimated values of &#x03BB;<sub>decay</sub>. Five approaches were employed to estimate &#x03BB;<sub>decay</sub>, from left to right: MLE, transfer entropy, pairwise correlations, Granger causality, and spatial GLM. <bold>(D)</bold> Estimated value of exponential decay. Filled black circles are individual data points obtained from connection probability (MLE and spatial GLM), transfer entropy, spike-count correlations, Granger causality.</p></caption>
<alt-text>Graphs and plots analyzing neural data from a Poisson model. Panel A shows neuron activity over time in a scatter plot. Panel B is a log likelihood graph comparing estimated and true decay rates. Panel C has multiple scatter plots showing estimated versus true decay rates using five different methods: MLE, transfer entropy, correlations, Granger causality, and spatial GLM. Panel D displays decay rate versus distance, comparing methods to a true decay rate of 5.0 mm&#x207B;&#x00B9;, depicted by red lines on plots for MLE, transfer entropy, correlations, Granger causality, and spatial GLM.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-19-1639829-g002.tif"/>
</fig>
<p>A numerical example of the log likelihood obtained from 1,000 Poisson neurons simulated for 100 s of activity is shown in <xref ref-type="fig" rid="F2">Figure 2B</xref>. The log likelihood was maximal near the true value of &#x03BB;<sub>decay</sub> = 5 mm<sup>&#x2013;1</sup>. A similar result held across a range of &#x03BB;<sub>decay</sub> values (<xref ref-type="fig" rid="F2">Figure 2C</xref>). Hence, MLE yielded a close approximation of the &#x03BB;<sub>decay</sub> parameter, providing a characterization of distance-dependent interactions based on the neural data. MLE also approximated distance-dependent interactions characterized by half-Gaussian, linear, and lognormal functions, albeit poorer results were obtained with an inverse square (<xref ref-type="supplementary-material" rid="DS1">Supplementary Figure 1</xref>).</p>
<p>To evaluate the extent to which spike data from the Poisson model could be used to recover underlying distance-dependent functions, we applied a spatial Generalized Linear Model (GLM, see section &#x201C;Materials and methods&#x201D;) (<xref ref-type="bibr" rid="B43">Pillow et al., 2008</xref>). Five different generating functions were employed to produce spike trains (exponential, half-Gaussian, linear, inverse square, and lognormal). The maximum likelihood of each generating function was computed to identify the most likely candidate function. Results show that the exponential, half-Gaussian, linear, and inverse square functions could be identified based on their maximum log likelihood (<xref ref-type="table" rid="T1">Table 1</xref>). The lognormal function, however, was confounded with the linear function and was therefore excluded from further analyses. Thus, maximum likelihood estimation based on a spatial GLM enabled the identification of several distance-dependent functions that determined spatial interactions in the Poisson model.</p>
<table-wrap position="float" id="T1">
<label>TABLE 1</label>
<caption><p>Identification of various distance-dependent functions.</p></caption>
<table cellspacing="5" cellpadding="5" frame="box" rules="all">
<thead>
<tr>
<td valign="top" align="left" rowspan="2" style="color:#ffffff;background-color: #7f8080;">Generating function</td>
<td valign="top" align="center" colspan="5" style="color:#ffffff;background-color: #7f8080;">Candidate function</td>
</tr>
<tr>
<td valign="top" align="left" style="color:#ffffff;background-color: #7f8080;">Exp.</td>
<td valign="top" align="left" style="color:#ffffff;background-color: #7f8080;">Half-Gaussian</td>
<td valign="top" align="left" style="color:#ffffff;background-color: #7f8080;">Linear</td>
<td valign="top" align="left" style="color:#ffffff;background-color: #7f8080;">Inv. square</td>
<td valign="top" align="left" style="color:#ffffff;background-color: #7f8080;">Lognormal</td>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Exponential</td>
<td valign="top" align="left"><bold>&#x2212;5998.49</bold></td>
<td valign="top" align="left"><bold>&#x2212;</bold>7930.84</td>
<td valign="top" align="left"><bold>&#x2212;</bold>11767.10</td>
<td valign="top" align="left"><bold>&#x2212;</bold>615020.87</td>
<td valign="top" align="left"><bold>&#x2212;</bold>379343.05</td>
</tr>
<tr>
<td valign="top" align="left">Half-Gaussian</td>
<td valign="top" align="left"><bold>&#x2212;</bold>795.60</td>
<td valign="top" align="left"><bold>&#x2212;794.79</bold></td>
<td valign="top" align="left"><bold>&#x2212;</bold>796.48</td>
<td valign="top" align="left"><bold>&#x2212;</bold>797.38</td>
<td valign="top" align="left">796.91</td>
</tr>
<tr>
<td valign="top" align="left">Linear</td>
<td valign="top" align="left"><bold>&#x2212;</bold>987.77</td>
<td valign="top" align="left"><bold>&#x2212;</bold>10687.99</td>
<td valign="top" align="left"><bold>&#x2212;7417.71</bold></td>
<td valign="top" align="left"><bold>&#x2212;</bold>94061.43</td>
<td valign="top" align="left"><bold>&#x2212;</bold>79478.56</td>
</tr>
<tr>
<td valign="top" align="left">Inverse square</td>
<td valign="top" align="left"><bold>&#x2212;</bold>918.71</td>
<td valign="top" align="left"><bold>&#x2212;</bold>918.89</td>
<td valign="top" align="left"><bold>&#x2212;</bold>919.00</td>
<td valign="top" align="left"><bold>&#x2212;915.27</bold></td>
<td valign="top" align="left"><bold>&#x2212;</bold>916.43</td>
</tr>
<tr>
<td valign="top" align="left">Lognormal</td>
<td valign="top" align="left"><bold>&#x2212;</bold>851.28</td>
<td valign="top" align="left"><bold>&#x2212;</bold>851.44</td>
<td valign="top" align="left"><bold>&#x2212;850.95</bold></td>
<td valign="top" align="left"><bold>&#x2212;</bold>852.80</td>
<td valign="top" align="left"><bold>&#x2212;</bold>852.64</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn><p>For each row, the highest log-likelihood across candidate functions is shown in bold.</p></fn>
</table-wrap-foot>
</table-wrap>
</sec>
<sec id="S2.SS2">
<title>Comparison to related approaches</title>
<p>Simulation results obtained with MLE were compared to three related approaches. First, functional connectivity between all pairs of simulated neurons was computed using transfer entropy (<xref ref-type="bibr" rid="B27">Kobayashi and Shinomoto, 2024</xref>; <xref ref-type="bibr" rid="B61">Vicente et al., 2011</xref>). A least-squares approximation was employed to find the best-fitting value of &#x03BB;<sub>decay</sub> relating transfer entropy to spatial distances between pairs of neurons. This approach offered a poor fit to the true value of &#x03BB;<sub>decay</sub> from which spike trains were generated (<xref ref-type="fig" rid="F2">Figure 2C</xref>).</p>
<p>In a second approach, spike-count correlations were computed between all pairs of neurons using non-overlapping time bins (10 ms), then least-squares was applied to find the &#x03BB;<sub>decay</sub> that best describes the relation between correlations and spatial distances. This approach offered a marginally better fit than transfer entropy, but its accuracy remained lower than MLE. Third, Granger causality (<xref ref-type="bibr" rid="B56">Tian et al., 2024</xref>) was computed followed by least-squares fitting, yielding a poor fit between neural interactions and spatial distances. A fourth approach employed the spatial GLM to estimate values of &#x03BB;<sub>decay</sub>, again yielding a poor fit compared to the MLE. Examples of fit obtained from MLE, transfer entropy, Granger causality, spatial GLM and spike-count correlations are shown in <xref ref-type="fig" rid="F2">Figure 2D</xref>. In summary, the fit obtained with MLE was not attained with the alternative approaches.</p>
<p>Next, we examined the computational run time required for MLE, transfer entropy, Granger causality, spatial GLM, and spike-count correlations. Run times were computed on an Intel i9 processor at 2500 Mhz. For small networks consisting of 100&#x2013;500 neurons, run times were similar across the five approaches (<xref ref-type="fig" rid="F3">Figure 3A</xref>). However, as the number of neurons increased, the run time of transfer entropy and spatial GLM increased rapidly, whereas the runtimes of MLE, Granger causality, and spike-count correlations remained comparatively low. Overall, MLE required only marginally higher run time than spike-count correlations.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption><p>Comparison of run time <bold>(A)</bold> and mean error <bold>(B)</bold> of four approaches to estimate exponential spatial decay. GLM, generalized linear model; TE, transfer entropy; GC, Granger causality; corr, spike-count correlations.</p></caption>
<alt-text>Panel A displays a line graph showing CPU time in seconds versus the number of neurons for various methods: GLM (black), TE (orange), GC (red), MLE (blue), and corr (green). GLM shows a steep increase with neuron count, while others remain lower. Panel B depicts error rates versus the number of neurons for the same methods. GLM decreases sharply with neuron count, while others remain steady.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-19-1639829-g003.tif"/>
</fig>
<p>In follow-up analyses, we compared the various approaches in terms of estimation error (computed as the absolute difference between the true and estimated values of &#x03BB;<sub>decay</sub>). We fixed &#x03BB;<sub>decay</sub> = 5 mm<sup>&#x2013;1</sup> and systematically increased the number of simulated neurons. MLE attained markedly lower error compared to related approaches <bold>(</bold><xref ref-type="fig" rid="F3">Figure 3B</xref>). While the spatial GLM achieved similar performance to MLE with &#x003E;1,500 neurons, this came at the cost of a high CPU time. Thus, MLE provided an accurate estimation of spatial interactions based on spiking activity and required conservative run times compared to alternative approaches.</p>
<p>Additional analyses revealed that while several factors impacted MLE accuracy, including firing rates, subsampling, and synaptic delays, error remained low under typical experimental conditions (<xref ref-type="supplementary-material" rid="DS1">Supplementary Figures 2</xref>&#x2013;<xref ref-type="supplementary-material" rid="DS1">4</xref>).</p>
</sec>
<sec id="S2.SS3">
<title>Izhikevich model</title>
<p>Going beyond a linear Poisson model, we examined a network of Izhikevich neurons with distance-dependent connectivity (<xref ref-type="fig" rid="F4">Figure 4A</xref>). The model generated sparse, uncorrelated activity (<xref ref-type="fig" rid="F4">Figure 4B</xref>). Importantly, because the MLE approach assumes that spike trains are close to Poisson statistics, we computed the Fano factor (FF) &#x2013; the ratio of spike count variance to its mean &#x2013; for all neurons and ensured a distribution with mean FF &#x223C; 1 (<xref ref-type="fig" rid="F4">Figure 4C</xref>). In addition, the mean spike-count correlation across all pairs of neurons was close to zero (mean: 0.0017) (<xref ref-type="fig" rid="F4">Figure 4D</xref>).</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption><p>Recurrent Izhikevich model with distance-dependent connectivity. <bold>(A)</bold> Schema of the recurrent model. The connections (black lines) of three neurons (red circles) are highlighted to show spatially-delimited interactions with neighboring units. <bold>(B)</bold> Spike raster obtained from a simulation of 1,000 neurons. Distance-dependent connectivity followed an exponential distribution with &#x03BB;<sub>decay</sub> = 5 mm<sup>&#x2013; 1</sup>. <bold>(C)</bold> Distribution of Fano factors obtained from all individual neurons using 10 ms non-overlapping bins. <bold>(D)</bold> Distribution of spike-count correlations.</p></caption>
<alt-text>Diagram showing four panels of a recurrent neural network analysis. Panel A illustrates a network with nodes and connections. Panel B displays neuron activity as a raster plot over time. Panel C presents a histogram of the normalized Fano factor, peaking around one. Panel D shows a histogram of the correlation, centered around zero.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-19-1639829-g004.tif"/>
</fig>
<p>To test the proposed MLE approach, a series of simulations were performed where a population of 1,000 neurons generated spike trains for 100 s with varying values of &#x03BB;<sub>decay</sub>. Examples of fit between the true and estimated &#x03BB;<sub>decay</sub> are shown in <xref ref-type="fig" rid="F5">Figure 5A</xref>. Close correspondence between these values was found over a range of parameters (<xref ref-type="fig" rid="F5">Figure 5B</xref>).</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption><p>Estimation of distance-dependent connectivity using MLE. <bold>(A)</bold> Examples of exponential functions estimated from different runs of the Izhikevich model that varied the true value of &#x03BB;<sub>decay</sub>. <bold>(B)</bold> Estimation of &#x03BB;<sub>decay</sub> across various runs of the model. Dashed line: best-fitting regression.</p></caption>
<alt-text>Graph A showcases six plots comparing estimated and true decay rates (&#x03BB;_decay) at values 1.2, 1.4, 1.6, 2.8, 3.0, and 3.2, displaying ponential decay versus distance in millimeters. Graph B presents a scatter plot with estimated versus true decay rates, showing a strong correlation with (R = 0.93 ).</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-19-1639829-g005.tif"/>
</fig>
<p>Next, the Izhikevich model was employed to investigate the impact of distance-dependent interactions on neural dynamics. Broadening interactions by increasing &#x03BB;<sub>decay</sub> from 1 mm<sup>&#x2013;1</sup> to 5 mm<sup>&#x2013;1</sup> (<xref ref-type="fig" rid="F6">Figure 6A</xref>) resulted in a decrease in synchronized activity (<xref ref-type="fig" rid="F6">Figure 6B</xref>). This makes intuitive sense given that longer-range connectivity promotes communication between a broader network of neurons. In turn, broadening spatial interactions by lowering &#x03BB;<sub>decay</sub> in a range between 0.5 and 3.0 resulted in a high average spike-count correlations (<xref ref-type="fig" rid="F7">Figure 7A</xref>).</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption><p>Impact of distance-dependent connectivity on population dynamics in the Izhikevich model. <bold>(A)</bold> Two exponential decay functions tested on the model. <bold>(B)</bold> Spike rasters (left) and distribution of synchronous spikes using 10 ms bins (right) obtained with two different decay functions.</p></caption>
<alt-text>Graph A shows exponential decay curves with &#x019B; decay values of 1 mm&#x207B;&#x00B9; and 5 mm&#x207B;&#x00B9; over a distance up to 1 mm. Graph B presents raster plots of neuron spikes and histograms of normalized spike counts over time for both decay values.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-19-1639829-g006.tif"/>
</fig>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption><p>Spike-count correlations are modulated by distance-dependent connectivity. <bold>(A)</bold> Exponentially decaying connectivity modulates correlations. Above: schema of connectivity patterns. Short-range: mean of correlations between neurons with distance &#x003C;0.1 mm. Long-range: neurons with distance &#x003E;1 mm. Average: mean over all neurons. <bold>(B)</bold> Analytical expression relating correlations to spatial decay and coupling strength (<xref ref-type="disp-formula" rid="E2">Equation 2</xref>). <bold>(C)</bold> Randomized network obtained after shuffling weights from panel &#x201C;A.&#x201D; <bold>(D)</bold> Zoom of panels &#x201C;A&#x201D; and &#x201C;C&#x201D; for higher values of &#x03BB;<sub>decay</sub>.</p></caption>
<alt-text>Graphical representation showing four panels (A, B, C, D) analyzing mean correlation against decay rate (&#x03BB;_decay). Panel A highlights short-range and long-range averages in a network, with insets of network layouts for varying decay rates. Panel B displays a gradient plot of correlation versus decay rate with different coupling strengths. Panel C shows a random network graph similar to A. Panel D contrasts distance-dependent and random networks, focusing on mean correlation at higher decay rates. Each graph uses color coding to differentiate data sets: red for short-range, green for long-range, and black for average.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-19-1639829-g007.tif"/>
</fig>
<p>Interestingly, an abrupt transition was observed between a state of high and low correlations, occurring around &#x03BB;<sub>decay</sub> = 3.0. To formally examine this transition, we considered an approximation for the correlation <italic>C</italic><sub><italic>ij</italic></sub> between pairs of neurons receiving a shared input under the assumption of weak coupling (see section &#x201C;<bold>Materials and Methods&#x201D;</bold>),</p>
<disp-formula id="E2">
<label>(2)</label><mml:math id="M3"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2248;</mml:mo><mml:mrow><mml:mfrac><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac><mml:mo>&#x2062;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where <italic>J</italic> is the mean synaptic strenght and &#x03C3;<sup>2</sup> is the noise variance of the shared input. Plotting <xref ref-type="disp-formula" rid="E2">Equation 2</xref> across values of &#x03BB;<sub>decay</sub> shows a non-linear relation between spatially dependent connectivity and pairwise correlations (<xref ref-type="fig" rid="F7">Figure 7B</xref>). Thus, particularly for stronger coupling strength <italic>J</italic>, correlations remained high for low values of spatial decay, with a sharp decline as decay increased further.</p>
<p>We further examined this effect in a scenario with randomized connectivity by shuffling the distance-dependent connections of the Izhikevich model. A similar transition in correlation was observed in the random model (<xref ref-type="fig" rid="F7">Figure 7C</xref>). However, in the distance-dependent model, shorter-range correlations (&#x003C; 0.1 mm) retained higher values than longer-range connections (&#x003E; 1 mm) following the transition. This effect did not arise in the random model due to the lack of spatial dependencies (<xref ref-type="fig" rid="F7">Figure 7D</xref>). Thus, while an abrupt shift in correlation may be explained by synaptic density rather than spatial dependency (<xref ref-type="bibr" rid="B44">Roxin et al., 2004</xref>), the phase transition exhibited a distance-dependent effect that was not present in the randomized model.</p>
</sec>
<sec id="S2.SS4">
<title>Application of MLE to calcium imaging data</title>
<p>We applied MLE to estimate spatial interactions in two-photon calcium imaging data (<xref ref-type="bibr" rid="B53">Stringer et al., 2019a</xref>). These data are particularly challenging given that they are composed of approximately 10,000 neurons, making approaches based on pairwise computations prohibitive. Instead, the approach taken by MLE is to estimate the best-fitting &#x03BB;<sub>decay</sub> on the basis of the spike raster and the physical distance amongst neurons, without needing to compute the strength of interactions between all pairs of neurons. Thus, this approach differs from attempts at reconstructing connectivity based on calcium data (<xref ref-type="bibr" rid="B38">Orlandi et al., 2014</xref>; <xref ref-type="bibr" rid="B50">Stetter et al., 2012</xref>). In our case, the goal is strictly focused on estimating the decay parameter of a distance-based function, without reconstructing the full connectivity.</p>
<p>A total of 14 datasets were analyzed, including 9 rasters of spontaneous activity and 5 rasters of evoked activity with drifting gratings (see section &#x201C;Materials and methods&#x201D; for details). The mean number of neurons was 11,602. A sample of neurons arrayed according to their three-dimensional coordinates is shown in <xref ref-type="fig" rid="F8">Figure 8A</xref>, showing a spatially homogeneous distribution of cell locations. A raster of spiking activity for this sample shows a weak degree of coordination across neurons (<xref ref-type="fig" rid="F8">Figure 8B</xref>) with a Fano factor near FF &#x223C; 1, indicative of approximate Poisson statistics (<xref ref-type="fig" rid="F8">Figure 8C</xref>). Mean firing rates were similar for spontaneous (2.76 Hz) and evoked (2.87 Hz) activity (<xref ref-type="fig" rid="F8">Figure 8D</xref>). Mean spike-count correlations (100 ms non-overlapping time bins) were low for both spontaneous (<italic>C</italic> = 0.0072) and evoked (<italic>C</italic> = 0.0121) activity.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption><p>Two-photon calcium imaging data from rodent visual cortex. <bold>(A)</bold> Three-dimensional position of individual neurons from a subset of the population. <bold>(B)</bold> Raster obtained from calcium imaging data (subset of neurons from panel &#x201C;A&#x201D;). <bold>(C)</bold> Distribution of Fano factors, with mean indicated by the arrow. <bold>(D)</bold> Mean firing rate (left) and spike-count correlations (right) across 9 datasets of spontaneous activity and 5 datasets of evoked activity.</p></caption>
<alt-text>Chart illustrating neuronal data: (A) 3D scatter plot showing spatial locations of neurons. (B) Raster plot displaying neuronal firing over time. (C) Histogram of Fano factor with a mean of 1.1959. (D) Bar charts comparing firing rates and mean correlation for datasets, with spontaneous in blue and evoked in orange.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-19-1639829-g008.tif"/>
</fig>
<p>An example of a log-likelihood function obtained from MLE applied to a single raster is shown in <xref ref-type="fig" rid="F9">Figure 9A</xref>. The function shows a defined peak at &#x03BB;<sub>decay</sub> = 3.53 mm<sup>&#x2013;1</sup>. Hence, the characteristic length scale of spatial interactions is 3.53<sup>&#x2013;1</sup> = 0.28 mm, which means that the probability of pairwise interactions decays significantly over approximately 0.28 mm (280 &#x03BC;m). To illustrate this result, we considered a two-dimensional neuronal space and assumed a putative neuron located in the center of this space. We then plotted an exponentially-distributed probability of pairwise interactions according to the function <italic>p</italic>(<italic>d</italic>) = <italic>ce</italic><sup>&#x2212;3.53<italic>d</italic></sup> (<xref ref-type="fig" rid="F9">Figure 9B</xref>). This function shows that most of the interactions are contained within a delimited spatial area surrounding each neuron, in line with work showing that a majority of cortical interactions occur within a 100&#x2013;300 &#x03BC;m radius (<xref ref-type="bibr" rid="B10">Ercsey-Ravasz et al., 2013</xref>; <xref ref-type="bibr" rid="B16">Holmgren et al., 2003</xref>; <xref ref-type="bibr" rid="B18">Horv&#x00E1;t et al., 2016</xref>; <xref ref-type="bibr" rid="B28">Levy and Reyes, 2012</xref>; <xref ref-type="bibr" rid="B33">Markov et al., 2013</xref>). This result is consistent with distance-dependent interactions observed in related measures including spike-count correlations, transfer entropy, and Granger causality for spontaneous and evoked activity (<xref ref-type="supplementary-material" rid="DS1">Supplementary Figure 5</xref>).</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption><p>Maximum likelihood estimation (MLE) applied to two-photon calcium data. <bold>(A)</bold> Log-likelihood function obtained from a single raster of spontaneous activity (10,164 neurons, 15,761 ms). Vertical dashed line shows the optimal value of &#x03BB;<sub>decay</sub> obtained with MLE. <bold>(B)</bold> Best-fitting exponential function based on the log-likelihood from panel &#x201C;A&#x201D; shown on a two-dimensional spatial grid. <bold>(C)</bold> Fluctuations in the estimated &#x03BB;<sub>decay</sub> as the number of neurons and time increased. Dashed line: &#x03BB;<sub>decay</sub> value obtained with all neurons and time-steps included. <bold>(D)</bold> Estimates of &#x03BB;<sub>decay</sub> across different recording sessions of spontaneous and stimulus-evoked activity. Filled circles are individual sessions; horizontal lines are within-group averages.</p></caption>
<alt-text>Graphical representation of decay metrics in four sections: A) Log likelihood vs. estimated lambda decay showing a peak at 3.53 mm&#x207B;&#x00B9;. B) 3D graph of a decay function over distance, showing decreasing value with distance. C) Two line graphs showing &#x019B; over neurons and time, displaying fluctuations. D) Scatter plot comparing spontaneous and evoked &#x019B;, with data points grouped and a mean line. Each graph uses distinct metrics to showcase &#x019B; behavior.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-19-1639829-g009.tif"/>
</fig>
<p>Next, we examined whether the number of neurons and duration of recordings impacted the estimation of &#x03BB;<sub>decay</sub>. Despite the large number of neurons available, a subset of &#x223C;500 neurons was sufficient to obtain a reliable estimate of &#x03BB;<sub>decay</sub> (<xref ref-type="fig" rid="F9">Figure 9C</xref>, left). This is encouraging in terms of applying MLE to smaller datasets. Similarly, stable estimates were obtained with less than 5,000 ms of data (<xref ref-type="fig" rid="F9">Figure 9C</xref>, right). This result is likely impacted by the stationarity of spike trains, with more data points required in datasets that exhibit complex fluctuations such as metastable states, a phenomenon that is not explored here.</p>
<p>We found that estimates of &#x03BB;<sub>decay</sub> overlapped across datasets of spontaneous and evoked activity (<xref ref-type="fig" rid="F9">Figure 9D</xref>). This result is consistent with an exponential decay in spatial interactions that reflects structural properties of neuronal circuits and not fluctuations across different dynamical states. Simulations of the Izhikevich model showed that restricted spatial interactions (&#x03BB;<sub>decay</sub> = 3 mm<sup>&#x2013;1</sup>) result in low spike-count correlations (<xref ref-type="fig" rid="F7">Figure 7A</xref>). This prediction agrees with cortical recordings, where the mean &#x03BB;<sub>decay</sub> was high for both spontaneous (&#x03BB;<sub>decay</sub> = 3.49 mm<sup>&#x2013;1</sup>) and evoked (&#x03BB;<sub>decay</sub> = 4.12 mm<sup>&#x2013;1</sup>) activity. Further, across all datasets, a negative correlation was found between values of &#x03BB;<sub>decay</sub> and mean spike-count correlations, showing that spatially restricted interactions yielded lower spike-count correlations (<italic>N</italic> = 14, <italic>R</italic> = &#x2212;0.5477, <italic>P</italic> = 0.0527). Interestingly, simulated activity with values of &#x03BB;<sub>decay</sub> between 3&#x2013;4 mm<sup>&#x2013;1</sup> puts the Izhikevich model at the edge of a phase transition between high and low spike-count correlations. In this state, subtle changes in distance-based interactions can have a drastic effect of neuronal dynamics.</p>
<p>Finally, we compared the fit of an exponential decay to a half-Gaussian and an inverse square decay (<xref ref-type="fig" rid="F10">Figure 10A</xref>). Log likelihood estimates for these functions were derived across all 14 datasets using the spatial GLM (Materials and Methods) (<xref ref-type="fig" rid="F10">Figure 10B</xref>). Overall, the exponential decay attained a higher log likelihood, indicative of a superior fit (<xref ref-type="fig" rid="F10">Figure 10C</xref>). Of the 14 datasets analyzed, 5 yielded a higher log-likelihood for the half-Gaussian function (three datasets of spontaneous activity, and two evoked). When comparing the average best-fitting exponential and half-Gaussian functions, the key difference was in the steepness of the decay occurring within distances &#x003C;1 mm, where the half-Gaussian function suggested a shallower decay (<xref ref-type="fig" rid="F10">Figure 10D</xref>). The best fitting half-Gaussian function had a mean standard deviation across datasets of &#x03C3; = 0.37, suggesting that 95% of functional interactions resided within a distance of 2&#x03C3; = 0.74 mm. This value is consistent with estimates of synaptic connectivity in rodent visual cortex, where the slope of the half-Gaussian function varied between 0.49 (layer 2) and 0.3 (layer 3) (<xref ref-type="bibr" rid="B15">Hellwig, 2000</xref>).</p>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption><p>Comparison of MLE across distance-dependent functions. <bold>(A)</bold> Examples of half-Gaussian and lognormal functions (&#x03BC; = 1.5) characterizing distance-based interactions. <bold>(B)</bold> Examples of log likelihood estimates obtained on single calcium imaging datasets. <bold>(C)</bold> Comparison of log likelihood across three candidate functions and 14 experimental datasets. Values shown were obtained by subtracting the minimum log likelihood. <bold>(D)</bold> Average best-fitting exponential (&#x03BB;<sub>decay</sub> = 3.8 mm<sup>&#x2013; 1</sup>) and half-Gaussian (&#x03C3; = 0.37 mm) functions across all experimental datasets.</p></caption>
<alt-text>Panel A shows graphs of half-Gaussian and lognormal functions with varying &#x03C3; values over distance in millimeters. Panel B displays log likelihood plots for the half-Gaussian and lognormal functions with respect to the estimated sigma. Panel C illustrates log likelihood comparisons among exponential, half-Gaussian, and inverse square distributions across datasets. Panel D presents exponential and half-Gaussian function plots over distance.</alt-text>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fncom-19-1639829-g010.tif"/>
</fig>
<p>Overall, these results suggest that within local circuits of the visual cortex, distance-dependent interactions are best characterized by an exponential decay. To be sure, this finding may depend on several factors not explored here. For broader spatial scales, including inter-areal interactions, the decay function would be broader to reflect longer-range connections (<xref ref-type="bibr" rid="B3">Campagnola et al., 2022</xref>; <xref ref-type="bibr" rid="B10">Ercsey-Ravasz et al., 2013</xref>; <xref ref-type="bibr" rid="B18">Horv&#x00E1;t et al., 2016</xref>). Further, we cannot rule out the possibility that distance-based interactions reflect unique connectivity patterns across cortical layers and may be altered under different regimes of neuronal activity that reflect cognitive states (<xref ref-type="bibr" rid="B19">Huang et al., 2019</xref>).</p>
</sec>
</sec>
<sec id="S3" sec-type="discussion">
<title>Discussion</title>
<p>This study introduced a statistical method based on maximum likelihood estimation (MLE) to investigate distance-dependent interactions from observed neuronal population activity. A key advantage of this approach is its ability to estimate spatial decay directly from spike data without requiring a full reconstruction of all pairwise interactions, leading to considerable savings in computational time when scaled to large networks, hence enabling the characterization of spatial interactions across large populations of neurons. Combined with simulations of spatially-embedded networks, this approach draws links between the structure and dynamics of neuronal circuits by relating spatial interactions and synchronous activity.</p>
<p>When applied to neuronal activity obtained from calcium imaging (<xref ref-type="bibr" rid="B53">Stringer et al., 2019a</xref>), MLE revealed spatially-delimited interactions that were consistent across both spontaneous and evoked states, suggesting an underlying network architecture that is strongly biased toward stronger interactions amongst nearby neurons. This result is consistent with a growing understanding that neural circuits are fundamentally shaped by their spatial embedding (<xref ref-type="bibr" rid="B63">Wang and Kennedy, 2016</xref>). This embedding emerges across a wide range of spatial scales, ranging from local microcircuits (<xref ref-type="bibr" rid="B3">Campagnola et al., 2022</xref>) to large inter-areal projections (<xref ref-type="bibr" rid="B33">Markov et al., 2013</xref>), and carries significant consequences for both the cytoarchitectural organization of the brain as well as the dynamical patterns of activity that emerge from this architecture.</p>
<p>One consequence of spatially constrained connectivity is the relative rarity of &#x201C;giant hubs&#x201D; characterized by neurons (or whole areas) that receive dense afferences from both nearby and distant projection sites (<xref ref-type="bibr" rid="B6">Deco et al., 2021</xref>). While disproportionally rare, these hubs may fulfill important functional roles in relaying information across broad networks, with implications for information processing (<xref ref-type="bibr" rid="B36">Ohiorhenuan et al., 2010</xref>). As such, a full understanding of cortical organization relies on several requisites, including not only distance-dependent interactions, but also hubs and locally clustered connectivity (<xref ref-type="bibr" rid="B30">Litwin-Kumar and Doiron, 2012</xref>).</p>
<p>The prevalence of an exponential decay in spatially embedded brain networks may be attributed to a trade-off: on one side, the need for efficient communication, and on the other, the energetic and spatial costs associated with axonal extension, myelination, and maintenance. Theoretical work shows that an exponential decay optimizes this trade-off in a scale invariant fashion, making spatially-embedded models a widely applicable framework for describing brain networks at various levels of organization (<xref ref-type="bibr" rid="B10">Ercsey-Ravasz et al., 2013</xref>; <xref ref-type="bibr" rid="B18">Horv&#x00E1;t et al., 2016</xref>).</p>
<p>Spatially embedded interactions carry profound implications for the dynamical state of neuronal circuits, shaping the scope of activity that can be expressed at the population level. Various forms of spatiotemporal dynamics, including traveling waves (<xref ref-type="bibr" rid="B19">Huang et al., 2019</xref>) and spiral waves (<xref ref-type="bibr" rid="B40">Paraskevov and Zendrikov, 2017</xref>) are supported by spatially ordered connectivity and form a hallmark of information propagation across brain areas (<xref ref-type="bibr" rid="B25">Keller et al., 2024</xref>). Further, theoretical results presented here demonstrate a direct impact of distance-based interactions on spike-count correlations (<xref ref-type="fig" rid="F7">Figure 7</xref>), showing a key role of spatially constrained connectivity in shaping population activity. This prediction of the model will need to be validated in experiments where the strength of distance-based interactions can be modulated, for instance by altering sensory input (<xref ref-type="bibr" rid="B36">Ohiorhenuan et al., 2010</xref>).</p>
<p>While our analyses revealed that an exponential decay function prevailed over alternatives including a half-Gaussian and a lognormal function, this result may depend upon several factors including the dynamical state of the network, the spatial scale of analysis, the laminar origin of the data, and the brain area considered (<xref ref-type="bibr" rid="B18">Horv&#x00E1;t et al., 2016</xref>; <xref ref-type="bibr" rid="B40">Paraskevov and Zendrikov, 2017</xref>; <xref ref-type="bibr" rid="B41">Pastorelli et al., 2018</xref>). In particular, understanding how connectivity varies across cortical layers&#x2014;with superficial layers showing more lateral, long-range connections and deep layers exhibiting more localized connectivity&#x2014;could provide important insights into the organization of neural circuits (<xref ref-type="bibr" rid="B16">Holmgren et al., 2003</xref>; <xref ref-type="bibr" rid="B28">Levy and Reyes, 2012</xref>). As a caveat, candidate functions including an exponential and half-Gaussian decay may yield similar predictions at shorter spatial scales (&#x003C; 1 mm) (<xref ref-type="fig" rid="F10">Figure 10D</xref>).</p>
<p>While an MLE approach provided accurate estimates of spatially-dependent interactions in both a linear Poisson model (<xref ref-type="fig" rid="F2">Figure 2C</xref>) and an Izhikevich network (<xref ref-type="fig" rid="F5">Figure 5B</xref>), it is worth re-iterating sources of error that may compromise accuracy, including the number of neurons considered, duration of activity, firing rate, subsampling of neurons, spatial edge effects, domain size, and neuronal delays. Further, because MLE evaluates functional interactions and not structural connectivity, it reflects a combination of mono- and poly-synaptic interactions, and hence may overestimate the spatial extent of direct synaptic connections. In recent work, the connection probability of mouse neocortex as a function of lateral intersomatic distance was estimated by fitting a Gaussian decay with &#x03C3; values ranging from between 0.1 mm and 0.13 mm (<xref ref-type="bibr" rid="B3">Campagnola et al., 2022</xref>). These values are lower than our findings (mean of &#x03C3; = 0.37 mm), but comparable to visual cortical reconstruction in other work (<xref ref-type="bibr" rid="B15">Hellwig, 2000</xref>).</p>
<p>In general, estimates of functional connectivity inferred from spike data may serve as a proxy for synaptic connectivity when several conditions are met, including: (1) spike trains are stationary over the time window of estimation; (2) functional connectivity predominantly targets monosynaptic interactions; (3) the common input between pairs of neurons is low; (4) synaptic connectivity is sparse; (5) excitation and inhibition is balanced, to avoid high synchronization or inactivity; (6) neural dynamics are approximately linear (<xref ref-type="bibr" rid="B2">Cai et al., 2017</xref>; <xref ref-type="bibr" rid="B5">Chen et al., 2011</xref>; <xref ref-type="bibr" rid="B8">Endo et al., 2021</xref>; <xref ref-type="bibr" rid="B14">Graber et al., 2024</xref>; <xref ref-type="bibr" rid="B27">Kobayashi and Shinomoto, 2024</xref>; <xref ref-type="bibr" rid="B34">Masud and Borisyuk, 2011</xref>; <xref ref-type="bibr" rid="B37">Okatan et al., 2005</xref>). While these conditions are not always met in practice, they increase the reliability of synaptic connectivity inferred from functional interactions.</p>
<p>One limitation of the proposed approach is that while the spatial GLM successfully identified distance-based interactions generated from exponential, half-Gaussian, linear, and inverse square functions, it confounded linear and lognormal functions. Therefore, we did not include these functions in the analysis of calcium imaging data. As a result, we could not assess the fit of these functions and cannot rule out the possibility that other functions not considered here may offer a more accurate characterization of cortical interactions. Ultimately, however, experimentalists may be more interested in how these interactions are altered across layers (<xref ref-type="bibr" rid="B46">Senzai et al., 2019</xref>), cell types (<xref ref-type="bibr" rid="B26">Khoury et al., 2025</xref>), brain regions (<xref ref-type="bibr" rid="B18">Horv&#x00E1;t et al., 2016</xref>), and stimuli (<xref ref-type="bibr" rid="B36">Ohiorhenuan et al., 2010</xref>; <xref ref-type="bibr" rid="B48">Smith and Kohn, 2008</xref>; <xref ref-type="bibr" rid="B64">Yatsenko et al., 2015</xref>), particularly given that several distance-dependent functions have a similar shape at short distances.</p>
<p>Another consideration is that while the proposed MLE approach provides a useful framework for investigating spatially dependent interactions, it describes a global decay function across an entire network and cannot resolve individual interactions between pairs of neurons. This limitation turns out to be an advantage in large-scale networks where we aim to characterize a spatial decay function without having to estimate all pairwise connections. In addition, MLE is not designed to distinguish between spatial interactions driven by local recurrent connections versus those driven by external inputs to a neuronal population.</p>
<p>A future direction is to apply MLE to distinguish between the spatial scales of different neuronal subtypes, including pyramidal neurons as well as subclasses of inhibitory interneurons (parvalbumin, somatostatin, and vasopressin) (<xref ref-type="bibr" rid="B11">Fino and Yuste, 2011</xref>; <xref ref-type="bibr" rid="B23">Jiang et al., 2015</xref>; <xref ref-type="bibr" rid="B57">Tremblay et al., 2016</xref>). Characterizing subtype-specific spatial patterns would deepen our understanding of how local and longer-range interactions contribute to network function.</p>
<p>More broadly, the proposed framework may offer insights into neurodevelopmental and neurodegenerative disorders marked by alterations in spatial organization. For instance, Alzheimer&#x2032;s disease is associated with synaptic loss and reduced connectivity density (<xref ref-type="bibr" rid="B7">DeKosky and Scheff, 1990</xref>), while conditions such as epilepsy and autism spectrum disorder involve distinct disruptions in spatial circuit structure (<xref ref-type="bibr" rid="B51">Stoner et al., 2014</xref>). Understanding these differences at a subtype-resolved spatial scale could help clarify the circuit-level mechanisms underlying such pathologies.</p>
<p>To conclude, the proposed MLE approach offers an efficient and accessible tool for investigating spatially dependent interactions in neuronal circuits. This analysis provides a promising avenue to deepen our understanding of how structural constraints shape neural dynamics. Further, it opens the door to characterizing the relation between spatial organization and dynamics in large-scale data obtained from healthy and pathological brain circuits.</p>
</sec>
<sec id="S4" sec-type="materials|methods">
<title>Materials and methods</title>
<sec id="S4.SS1">
<title>Maximum likelihood estimation in a linear Poisson model</title>
<p>To estimate &#x03BB;<sub>decay</sub> based on the spiking activity of a linear Poisson model with baseline firing rate <italic>r<sub>0</sub></italic> and coupling strength &#x03B1;, a maximum likelihood estimator (MLE) was employed as follows. Assuming Bernoulli spike data <italic>S</italic><sub><italic>i</italic></sub>(<italic>t</italic>) &#x2208; {0,1}, the probability of spiking is given by</p>
<disp-formula id="E3">
<label>(3)</label><mml:math id="M4"><mml:mrow><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>1</mml:mn><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where</p>
<disp-formula id="S4.Ex5">
<mml:math id="M5"><mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>j</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">&#x2260;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03B1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo rspace="7.5pt">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>assuming a large population of neurons, and &#x03C3;(<italic>x</italic>)=1/(1 + <italic>exp</italic>&#x2061;(&#x2212;<italic>x</italic>)). The likelihood is</p>
<disp-formula id="S4.Ex6">
<mml:math id="M6"><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>M</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>L</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>E</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x220F;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>t</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mi>T</mml:mi></mml:munderover><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x220F;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>i</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>Taking the log-likelihood,</p>
<disp-formula id="E4">
<label>(4)</label><mml:math id="M7"><mml:mrow><mml:mi>log</mml:mi><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>M</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>L</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>E</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mpadded width="+3.3pt"><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>t</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mi>T</mml:mi></mml:munderover></mml:mpadded><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>i</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mo maxsize="120%" minsize="120%">[</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>log</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="S4.Ex8">
<mml:math id="M8"><mml:mrow><mml:mrow><mml:mo lspace="86.5pt">(</mml:mo><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo maxsize="120%" minsize="120%">]</mml:mo></mml:mrow></mml:math>
</disp-formula>
<p>Defining <italic>P</italic><sub><italic>i</italic></sub>(<italic>t</italic>)=&#x03C3;(<italic>h</italic><sub><italic>i</italic></sub>(<italic>t</italic>)) and applying the chain rule, the derivative of <xref ref-type="disp-formula" rid="E4">Equation 4</xref> is obtained as</p>
<disp-formula id="S4.Ex9">
<mml:math id="M9"><mml:mrow><mml:mrow><mml:mfrac><mml:mi>d</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>M</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>L</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo rspace="10.8pt" stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mi/></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="S4.Ex10">
<mml:math id="M10"><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>t</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mi>T</mml:mi></mml:munderover><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>i</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x22C5;</mml:mo><mml:mfrac><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>with the full derivative given by</p>
<disp-formula id="S4.Ex11">
<mml:math id="M11"><mml:mrow><mml:mfrac><mml:mi>d</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mi>log</mml:mi><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>M</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>L</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>E</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo rspace="10.8pt" stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>-</mml:mo><mml:mi mathvariant="normal">&#x03B1;</mml:mi><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>t</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mi>T</mml:mi></mml:munderover><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>i</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="S4.Ex12">
<mml:math id="M12"><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>j</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">&#x2260;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo rspace="7.5pt">&#x22C5;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>Practically, finding the best-fitting &#x03BB;<sub>decay</sub>, denoted <inline-formula><mml:math id="INEQ59"><mml:msubsup><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow><mml:mo>&#x002A;</mml:mo></mml:msubsup></mml:math></inline-formula>, involves numerically minimizing the negative log-likelihood:</p>
<disp-formula id="S4.Ex13">
<mml:math id="M13"><mml:mrow><mml:mrow><mml:mpadded width="+3.3pt"><mml:msubsup><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow><mml:mo>&#x002A;</mml:mo></mml:msubsup></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>g</mml:mi><mml:mo>&#x2062;</mml:mo><mml:munder><mml:mo movablelimits="false">min</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub></mml:munder></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>M</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>L</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>E</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo mathvariant="italic" separator="true">&#x2003;</mml:mo></mml:mrow></mml:math>
</disp-formula>
<p>using gradient descent. We assume that the log-likelihood function (<xref ref-type="disp-formula" rid="E4">Equation 4</xref>) is maximized at the true parameter &#x03BB;<sub>decay</sub> employed to generate spike trains, which holds for long recordings (<italic>T</italic>&#x2192;&#x221E;) given the law of large numbers. We further assume that the parameter &#x03BB;<sub>decay</sub> is identifiable, meaning that distinct values of &#x03BB;<sub>decay</sub> lead to distinct distributions of the observed data. This holds true given that &#x03BB;<sub>decay</sub> uniquely determines the distance-dependent interactions, and thus spike probabilities. Under reasonable conditions of smoothness for <italic>&#x2112;</italic><sub><italic>MLE</italic></sub>(&#x03BB;<sub>decay</sub>) and finite Fisher information, the MLE is asymptotically normal and converges in probability to the true parameter &#x03BB;<sub>decay</sub>.</p>
</sec>
<sec id="S4.SS2">
<title>Maximum likelihood estimation: exponential function</title>
<p>The MLE approach employed to estimate &#x03BB;<sub>decay</sub> from spike trains was based on the same method as described above for Poisson neurons but adapted to a scenario where only the spike raster is known, and not the baseline rate or the interaction strength between neurons. The log likelihood <italic>&#x2112;</italic><sub><italic>MLE</italic></sub> is the joint probability of observing the spiking activity given &#x03BB;<sub>decay</sub> (<xref ref-type="disp-formula" rid="E4">Equation 4</xref>). Given that the baseline firing rate and coupling strength for the Izhikevich model and calcium imaging data are assumed to be unknown, we substituted the spike probability of <xref ref-type="disp-formula" rid="E3">Equation 3</xref> for</p>
<disp-formula id="S4.Ex14">
<mml:math id="M14"><mml:mrow><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>N</mml:mi></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>where <italic>N</italic> is the number of neurons. The interaction term <italic>I</italic><sub><italic>i</italic></sub>(<italic>t</italic>) was computed as</p>
<disp-formula id="S4.Ex15">
<mml:math id="M15"><mml:mrow><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mi>j</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where</p>
<disp-formula id="E5">
<label>(5)</label><mml:math id="M16"><mml:mrow><mml:mrow><mml:mi>W</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math>
</disp-formula>
<p>and <italic>S</italic><sub><italic>j</italic></sub>(<italic>t</italic>) is the spike activity of the presynaptic neuron <italic>j</italic> at time <italic>t</italic>. Finding the best-fitting &#x03BB;<sub>decay</sub> involves numerically minimizing the negative log-likelihood.</p>
</sec>
<sec id="S4.SS3">
<title>Alternative functions for maximum likelihood estimation</title>
<p>In the case of a half-Gaussian function, <italic>W</italic>(<italic>i</italic>,<italic>j</italic>) (<xref ref-type="disp-formula" rid="E5">Equation 5</xref>) is replaced with</p>
<disp-formula id="S4.Ex17">
<mml:math id="M17"><mml:mrow><mml:mrow><mml:mi>W</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:msubsup><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2062;</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where we aim to estimate &#x03C3; (the width of the half-Gaussian function). The log likelihood function is the same as before. We can also substitute in a log-normal function:</p>
<disp-formula id="S4.Ex18">
<mml:math id="M18"><mml:mrow><mml:mrow><mml:mi>W</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msqrt><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2062;</mml:mo><mml:mi mathvariant="normal">&#x03C0;</mml:mi></mml:mrow></mml:msqrt></mml:mrow></mml:mfrac><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:msubsup><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup></mml:mrow><mml:mo>-</mml:mo><mml:mpadded width="+5pt"><mml:mi mathvariant="normal">&#x03BC;</mml:mi></mml:mpadded></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2062;</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>with dimensionless parameters &#x03C3; and &#x03BC;. To focus on estimating &#x03C3;, we fix &#x03BC; as follows:</p>
<disp-formula id="S4.Ex19">
<mml:math id="M19"><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi mathvariant="normal">&#x03BC;</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>i</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">&#x2260;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mi>l</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>g</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>i</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">&#x2260;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>For a linear distance-dependent function,</p>
<disp-formula id="S4.Ex20">
<mml:math id="M20"><mml:mrow><mml:mrow><mml:mi>W</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>and for an inverse square function,</p>
<disp-formula id="S4.Ex21">
<mml:math id="M21"><mml:mrow><mml:mrow><mml:mi>W</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msubsup><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup><mml:mo>+</mml:mo><mml:mi mathvariant="normal">&#x03C3;</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
</sec>
<sec id="S4.SS4">
<title>Spatial generalized linear model</title>
<p>For the spatial GLM, the expression for the spike probability <italic>P</italic>(<italic>S</italic><sub><italic>i</italic></sub>(<italic>t</italic>)=1) follows <xref ref-type="disp-formula" rid="E3">Equation 3</xref>. The <italic>log</italic>&#x2061;<italic>&#x2112;</italic><sub><italic>GLM</italic></sub>(&#x03BB;<sub>decay</sub>,&#x03B1;,<italic>r</italic><sub>0</sub>) follows <xref ref-type="disp-formula" rid="E4">Equation 4</xref>, but is estimated over three parameters instead of only &#x03BB;<sub>decay</sub>. Gradients for these parameters are obtained as follows,</p>
<disp-formula id="S4.Ex22">
<mml:math id="M22"><mml:mrow><mml:mpadded width="+3.3pt"><mml:mfrac><mml:mrow><mml:mo>&#x2202;</mml:mo><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>L</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>&#x2202;</mml:mo><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mfrac></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>t</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mi>T</mml:mi></mml:munderover><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>i</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="S4.Ex23">
<mml:math id="M23"><mml:mrow><mml:mpadded width="+3.3pt"><mml:mfrac><mml:mrow><mml:mo>&#x2202;</mml:mo><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>L</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>&#x2202;</mml:mo><mml:mo>&#x2061;</mml:mo><mml:mi mathvariant="normal">&#x03B1;</mml:mi></mml:mrow></mml:mfrac></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>t</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mi>T</mml:mi></mml:munderover><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>i</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="S4.Ex24">
<mml:math id="M24"><mml:mrow><mml:mpadded width="+3.3pt"><mml:mfrac><mml:mrow><mml:mo>&#x2202;</mml:mo><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>G</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>L</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>&#x2202;</mml:mo><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>t</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mi>T</mml:mi></mml:munderover><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>i</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where</p>
<disp-formula id="S4.Ex25">
<mml:math id="M25"><mml:mrow><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>j</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">&#x2260;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03B1;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo rspace="7.5pt" stretchy="false">]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>The spatial GLM captures the spatiotemporal dynamics of the system, including time-dependence and directional interactions (i.e., from neuron <italic>j</italic> to <italic>i</italic>). By comparison, MLE is not a full generative model &#x2014; instead, summary statistics are extracted from the spike raster as a whole, then a spatially-dependent function, such as an exponential decay, is fitted to capture how functional connectivity declines with spatial distance.</p>
</sec>
<sec id="S4.SS5">
<title>Transfer entropy</title>
<p>Transfer entropy is a powerful information-theoretic measure used to quantify directed interactions between time series (<xref ref-type="bibr" rid="B22">Izzi et al., 2024</xref>; <xref ref-type="bibr" rid="B24">Kajiwara et al., 2021</xref>; <xref ref-type="bibr" rid="B31">Lizier et al., 2008</xref>; <xref ref-type="bibr" rid="B32">Lungarella et al., 2007</xref>; <xref ref-type="bibr" rid="B35">Novelli et al., 2019</xref>; <xref ref-type="bibr" rid="B45">Schreiber, 2000</xref>; <xref ref-type="bibr" rid="B58">Ursino et al., 2020</xref>; <xref ref-type="bibr" rid="B60">Verdes, 2005</xref>; <xref ref-type="bibr" rid="B61">Vicente et al., 2011</xref>; <xref ref-type="bibr" rid="B62">Voges et al., 2024</xref>). It quantifies causal influences by assessing the degree to which the past activity of one neuron (potentially pre-synaptic) improves the predictability of the future activity of another neuron (potentially post-synaptic) (<xref ref-type="bibr" rid="B27">Kobayashi and Shinomoto, 2024</xref>; <xref ref-type="bibr" rid="B61">Vicente et al., 2011</xref>). Given two neurons <italic>X</italic> (source) and <italic>Y</italic> (target), transfer entropy is calculated as:</p>
<disp-formula id="S4.Ex26">
<mml:math id="M26"><mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2192;</mml:mo><mml:mi>Y</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x25B3;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo rspace="5.8pt" stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mi/></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="S4.Ex27">
<mml:math id="M27"><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>,</mml:mo><mml:msubsup><mml:mi>y</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:msub></mml:munder><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msubsup><mml:mi>y</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x25B3;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>g</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mfrac><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo lspace="2.5pt" rspace="2.5pt" stretchy="false">|</mml:mo><mml:mrow><mml:msubsup><mml:mi>y</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x25B3;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo lspace="2.5pt" rspace="2.5pt" stretchy="false">|</mml:mo><mml:msubsup><mml:mi>y</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where <italic>y</italic><sub><italic>t+1</italic></sub> is the state of the target neuron at the next time step, <inline-formula><mml:math id="INEQ77"><mml:msubsup><mml:mi>y</mml:mi><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msubsup></mml:math></inline-formula> are the past states of the target neuron <italic>Y</italic> up to <italic>k</italic> time steps, <inline-formula><mml:math id="INEQ78"><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>-</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x25B3;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> are the past states of the source neuron up to <italic>l</italic>&#x2212;&#x25B3;<italic>t</italic> time steps, and &#x25B3;<italic>t</italic> is a time delay (set to 1 ms).</p>
</sec>
<sec id="S4.SS6">
<title>Granger causality</title>
<p>To compute Granger causality for a pair of neurons, we assumed two spike trains <italic>X</italic>(<italic>t</italic>) and <italic>Y</italic>(<italic>t</italic>) over a time window [0,<italic>T</italic>] and binned them using bins of size &#x25B3;<italic>t</italic> = 10 ms. We then chose a history window <italic>&#x210B;</italic> = 100 ms and for each time <italic>t</italic>, create covariates using the past spiking activity of both neurons:</p>
<disp-formula id="S4.Ex28">
<mml:math id="M28"><mml:mrow><mml:msub><mml:mtext mathvariant="bold">h</mml:mtext><mml:mi>X</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>&#x210B;</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="S4.Ex29">
<mml:math id="M29"><mml:mrow><mml:msub><mml:mtext mathvariant="bold">h</mml:mtext><mml:mi>Y</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:mi>&#x210B;</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>Then, two models were fitted to represent the instantaneous probability of neuron <italic>X</italic>. A reduced model based only on the history of <italic>X</italic> is provided by</p>
<disp-formula id="S4.Ex30">
<mml:math id="M30"><mml:mrow><mml:mrow><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:msubsup><mml:mi>&#x03BB;</mml:mi><mml:mi>X</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>c</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="10.8pt" stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03BC;</mml:mi><mml:mi>X</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">w</mml:mtext><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mtext mathvariant="bold">h</mml:mtext><mml:mi>X</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>and a full model combining the history of <italic>X</italic> and <italic>Y</italic> is given by</p>
<disp-formula id="S4.Ex31">
<mml:math id="M31"><mml:mrow><mml:mrow><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:msubsup><mml:mi>&#x03BB;</mml:mi><mml:mi>X</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="5.8pt" stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="0.8pt">=</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03BC;</mml:mi><mml:mi>X</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mtext mathvariant="bold">w</mml:mtext><mml:mrow><mml:mi>X</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mtext mathvariant="bold">h</mml:mtext><mml:mi>X</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msubsup><mml:mtext mathvariant="bold">w</mml:mtext><mml:mrow><mml:mi>Y</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>X</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:msubsup><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mtext mathvariant="bold">h</mml:mtext><mml:mi>Y</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where &#x03BC;<sub><italic>X</italic></sub> is the mean firing rate of neuron <italic>X</italic>, and <bold>w</bold><sub><italic>XX</italic></sub> and <inline-formula><mml:math id="INEQ88"><mml:msubsup><mml:mtext mathvariant="bold">w</mml:mtext><mml:mrow><mml:mi>Y</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>X</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:msubsup></mml:math></inline-formula> are weights to be estimated. Both models were fitted numerically using maximum likelihood estimation. The likelihood of the reduced model is given by</p>
<disp-formula id="S4.Ex32">
<mml:math id="M32"><mml:mrow><mml:mpadded width="-1.7pt"><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>c</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mo rspace="0.8pt">=</mml:mo><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mi>t</mml:mi></mml:munder><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#x03BB;</mml:mi><mml:mi>X</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>c</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#x03BB;</mml:mi><mml:mi>X</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>c</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mpadded width="+5pt"><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mpadded></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where &#x0394; is the bin width. Similarly, for the full model,</p>
<disp-formula id="S4.Ex33">
<mml:math id="M33"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mi>t</mml:mi></mml:munder><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#x03BB;</mml:mi><mml:mi>X</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#x03BB;</mml:mi><mml:mi>X</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mpadded width="+5pt"><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mpadded></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>The strength of causal interaction is given by</p>
<disp-formula id="S4.Ex34">
<mml:math id="M34"><mml:mrow><mml:mrow><mml:mi>G</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>Y</mml:mi><mml:mo>&#x2192;</mml:mo><mml:mi>X</mml:mi></mml:mrow></mml:msub></mml:mpadded></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>c</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>&#x2112;</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>u</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>c</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>which yields a unitless ratio of how much better the model performs at predicting the activity of neuron <italic>X</italic> by including the history of neuron <italic>Y</italic>.</p>
</sec>
<sec id="S4.SS7">
<title>Izhikevich model</title>
<p>A network of Izhikevich neurons with <italic>N</italic> = 1,000 excitatory neurons was simulated (<xref ref-type="fig" rid="F3">Figure 3A</xref>). The dynamics of each neuron&#x2019;s membrane potential (<italic>v<sub>i</sub></italic>) and recovery variable (<italic>u<sub>i</sub></italic>) are described by</p>
<disp-formula id="S4.Ex35">
<mml:math id="M35"><mml:mrow><mml:mpadded width="+3.3pt"><mml:mfrac><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mn>0.04</mml:mn><mml:mo>&#x2062;</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mn>5</mml:mn><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mn>140</mml:mn></mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="S4.Ex36">
<mml:math id="M36"><mml:mrow><mml:mpadded width="+3.3pt"><mml:mfrac><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mfrac></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>Spikes are emitted when <italic>v</italic><sub><italic>i</italic></sub>=<italic>v</italic><sub><italic>thresh</italic></sub>, where <italic>v</italic><sub><italic>thresh</italic></sub> = 30 mV. Then, the membrane potential and recovery variable are reset to <italic>v</italic><sub><italic>i</italic></sub>&#x2190;<italic>c</italic><sub><italic>i</italic></sub> and <italic>u</italic><sub><italic>i</italic></sub>&#x2190;<italic>u</italic><sub><italic>i</italic></sub> + <italic>d</italic><sub><italic>i</italic></sub>, where <italic>a<sub>i</sub></italic>, <italic>b<sub>i</sub></italic>, <italic>c<sub>i</sub></italic>, and <italic>d<sub>i</sub></italic> are parameters set as follows: <italic>a<sub>i</sub></italic> = 0.02, <italic>b<sub>i</sub></italic> = 0.2, <italic>c<sub>i</sub></italic> = &#x2212;65, and <italic>d<sub>i</sub></italic> = 8. The input current is</p>
<disp-formula id="S4.Ex37">
<mml:math id="M37"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msubsup><mml:mi>I</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:munderover><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>j</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>J</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where <italic>J</italic><sub><italic>ij</italic></sub> is the synaptic weight from neuron <italic>j</italic> to <italic>i</italic>, and <italic>S<sub>j</sub></italic> = 1 if <italic>v</italic><sub><italic>i</italic></sub>=<italic>v</italic><sub><italic>threshold</italic></sub>, and <italic>S<sub>j</sub></italic> = 0 otherwise. The external input is <inline-formula><mml:math id="INEQ93"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msubsup><mml:mi>I</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mi>&#x1D4A9;</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">&#x03BC;</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> and the total input is <inline-formula><mml:math id="INEQ94"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:msubsup><mml:mi>I</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>I</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:mrow></mml:mrow></mml:math></inline-formula>. Each neuron <italic>i</italic> was assigned a position <bold>x</bold><sub><italic>i</italic></sub>=(<italic>x</italic><sub><italic>i</italic></sub>,<italic>y</italic><sub><italic>i</italic></sub>) in two-dimensional space, and the probability of pairwise connections decayed exponentially with distance (<xref ref-type="disp-formula" rid="E1">Equation 1</xref>), with <italic>c</italic> = 30. Sparse connectivity was generated by connecting any given pair of neurons with a 10% probability, while the remainder of weights were set to zero. While inhibitory neurons are beyond our scope, they could be incorporated in further refinements of the model.</p>
<p>Using mean field theory, we define the mean firing rate of the network as</p>
<disp-formula id="S4.Ex38">
<mml:math id="M38"><mml:mrow><mml:mpadded width="+3.3pt"><mml:mi>r</mml:mi></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mo>&#x27E8;</mml:mo><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x27E9;</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where &#x27E8;&#x22C5;&#x27E9; denotes averaging over time and neurons. We then replace the exact spike trains with their statistical averages,</p>
<disp-formula id="S4.Ex39">
<mml:math id="M39"><mml:mrow><mml:mrow><mml:msubsup><mml:mi>I</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">&#x2248;</mml:mo><mml:mrow><mml:mi>J</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mi>j</mml:mi></mml:munder><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">&#x2248;</mml:mo><mml:mrow><mml:mi>J</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>N</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where <italic>J</italic> is the mean synaptic strength and <italic>N</italic> is the number of presynaptic neurons. Synaptic fluctuations are approximated by a stationary Gaussian process with mean <italic>JNr</italic> and variance <italic>J</italic><sup>2</sup><italic>r</italic>. Thus, the effective input current follows</p>
<disp-formula id="S4.Ex40">
<mml:math id="M40"><mml:mrow><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">&#x2248;</mml:mo><mml:mrow><mml:mrow><mml:mi>J</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>N</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03B7;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where &#x03B7;<sub><italic>i</italic></sub>(<italic>t</italic>) is a Gaussian noise term with variance</p>
<disp-formula id="S4.Ex41">
<mml:math id="M41"><mml:mrow><mml:mrow><mml:mi>V</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>a</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="normal">&#x03B7;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>Let us consider two neurons <italic>i</italic> and <italic>j</italic> in the network. These neurons receive inputs from a subset of common presynaptic neurons. Let <italic>S</italic><sub><italic>ij</italic></sub> denote the fraction of presynaptic neurons shared by both <italic>i</italic> and <italic>j</italic>. The total input currents are:</p>
<disp-formula id="S4.Ex42">
<mml:math id="M42"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:munder><mml:mo largeop="true" movablelimits="false" symmetric="true">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:munder><mml:mrow><mml:mi>J</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where <italic>pre</italic>(<italic>i</italic>) denotes the set of presynaptic neurons projecting to <italic>i</italic> and <italic>j</italic>. The fraction of shared presynaptic inputs between neurons <italic>i</italic> and <italic>j</italic> is given by</p>
<disp-formula id="S4.Ex43">
<mml:math id="M43"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi>p</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi>p</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>The shared presynaptic inputs introduce correlations in the inputs <italic>I<sub>i</sub></italic> and <italic>I<sub>j</sub></italic>. The covariance of inputs between neurons <italic>i</italic> and <italic>j</italic> is</p>
<disp-formula id="S4.Ex44">
<mml:math id="M44"><mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>v</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">&#x2248;</mml:mo><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>with variance</p>
<disp-formula id="S4.Ex45">
<mml:math id="M45"><mml:mrow><mml:mrow><mml:mi>V</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>a</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mi>V</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>a</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo rspace="5.8pt">)</mml:mo></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:mrow><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>The correlation coefficient is given by</p>
<disp-formula id="S4.Ex46">
<mml:math id="M46"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mfrac><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>o</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>v</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:msqrt><mml:mrow><mml:mi>V</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>a</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:mi>V</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>a</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msqrt></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>Thus, the correlation simplifies to</p>
<disp-formula id="S4.Ex47">
<mml:math id="M47"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">=</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mi>r</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>For weak coupling, we can approximate the correlation as</p>
<disp-formula id="E6">
<label>(6)</label><mml:math id="M48"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">&#x2248;</mml:mo><mml:mrow><mml:mfrac><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>Assuming a homogeneous spatial network where the shared input fraction decays exponentially with distance,</p>
<disp-formula id="S4.Ex49">
<mml:math id="M49"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">&#x2248;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math>
</disp-formula>
<p>we can rewrite <xref ref-type="disp-formula" rid="E6">Equation 6</xref> as</p>
<disp-formula id="S4.Ex50">
<mml:math id="M50"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">&#x2248;</mml:mo><mml:mrow><mml:mfrac><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac><mml:mo>&#x2062;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>Given that neurons receive synaptic inputs from a common pool of presynaptic neurons, the fraction of shared inputs between two neurons separated by distance <italic>d</italic> is approximately</p>
<disp-formula id="S4.Ex51">
<mml:math id="M51"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">&#x2248;</mml:mo><mml:mrow><mml:msub><mml:mo largeop="true" symmetric="true">&#x222B;</mml:mo><mml:mn>0</mml:mn></mml:msub><mml:mrow><mml:mi>P</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2062;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:mrow></mml:msup><mml:mo>&#x2062;</mml:mo><mml:mrow><mml:mo mathvariant="italic" rspace="0pt">d</mml:mo><mml:mpadded width="+3.3pt"><mml:mi>d</mml:mi></mml:mpadded></mml:mrow></mml:mrow></mml:mrow><mml:mo rspace="5.8pt">=</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math>
</disp-formula>
<p>We can then rewrite the approximate correlations as</p>
<disp-formula id="S4.Ex52">
<mml:math id="M52"><mml:mrow><mml:mpadded width="+3.3pt"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mpadded><mml:mo rspace="5.8pt">&#x2248;</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>&#x2062;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>&#x2062;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x2062;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub><mml:mo>&#x2062;</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>+</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>As &#x03BB;<sub>decay</sub>&#x2192;0, connectivity becomes all-to-all, hence <italic>C</italic><sub><italic>ij</italic></sub> approaches its upper bound,</p>
<disp-formula id="S4.Ex53">
<mml:math id="M53"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2062;</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mtext>decay</mml:mtext></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2192;</mml:mo><mml:mfrac><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mrow><mml:msup><mml:mi>J</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mi mathvariant="normal">&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>Conversely, when &#x03BB;<sub>decay</sub> is large, shared inputs become negligible, hence <italic>C</italic><sub><italic>ij</italic></sub>&#x2192;0.</p>
</sec>
<sec id="S4.SS8">
<title>Calcium data</title>
<p>Activity from mouse V1 cortex was obtained using two-photon calcium imaging. Details are found in related work (<xref ref-type="bibr" rid="B53">Stringer et al., 2019a</xref>). Each recording site measured 12 &#x00D7; 12 &#x03BC;m<sup>2</sup>, and the vertical spacing between adjacent sites was 20 &#x03BC;m. The recording area was 0.9 mm by 0.935 mm, with plane depth of 0.35 mm. Spike were extracted using OASIS (<xref ref-type="bibr" rid="B12">Friedrich et al., 2017</xref>; <xref ref-type="bibr" rid="B39">Pachitariu et al., 2018</xref>).</p>
</sec>
</sec>
</body>
<back>
<sec id="S5" sec-type="data-availability">
<title>Data availability statement</title>
<p>Publicly available datasets were analyzed in this study. These data can be found here: <ext-link ext-link-type="uri" xlink:href="https://janelia.figshare.com/articles/dataset/Recordings_of_ten_thousand_neurons_in_visual_cortex_during_spontaneous_behaviors/6163622">https://janelia.figshare.com/articles/dataset/Recordings_of_ten_thousand_neurons_in_visual_cortex_during_spontaneous_behaviors/6163622</ext-link>.</p>
</sec>
<sec id="S6" sec-type="author-contributions">
<title>Author contributions</title>
<p>CG: Data curation, Formal analysis, Investigation, Methodology, Software, Writing &#x2013; review &#x0026; editing. JT: Data curation, Formal analysis, Investigation, Methodology, Software, Writing &#x2013; review &#x0026; editing, Conceptualization, Funding acquisition, Project administration, Resources, Supervision, Validation, Visualization, Writing &#x2013; original draft.</p>
</sec>
<sec id="S7" sec-type="funding-information">
<title>Funding</title>
<p>The author(s) declare that financial support was received for the research and/or publication of this article. This work was funded by a grant to J.P.T. from the Natural Sciences and Engineering Research Council of Canada (NSERC Grant No. 210977).</p>
</sec>
<sec id="S8" sec-type="COI-statement">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="S9" sec-type="ai-statement">
<title>Generative AI statement</title>
<p>The authors declare that no Generative AI was used in the creation of this manuscript.</p>
</sec>
<sec id="S10" sec-type="disclaimer">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<sec id="S11" sec-type="supplementary-material">
<title>Supplementary material</title>
<p>The Supplementary Material for this article can be found online at: <ext-link ext-link-type="uri" xlink:href="https://www.frontiersin.org/articles/10.3389/fncom.2025.1639829/full#supplementary-material">https://www.frontiersin.org/articles/10.3389/fncom.2025.1639829/full#supplementary-material</ext-link></p>
<supplementary-material xlink:href="Data_Sheet_1.pdf" id="DS1" mimetype="application/pdf" xmlns:xlink="http://www.w3.org/1999/xlink"/>
</sec>
<ref-list>
<title>References</title>
<ref id="B1"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Aertsen</surname> <given-names>A. M.</given-names></name> <name><surname>Gerstein</surname> <given-names>G. L.</given-names></name> <name><surname>Habib</surname> <given-names>M. K.</given-names></name> <name><surname>Palm</surname> <given-names>G.</given-names></name></person-group> (<year>1989</year>). <article-title>Dynamics of neuronal firing correlation: Modulation of &#x201C;effective connectivity.&#x201D;</article-title> <source><italic>J. Neurophysiol.</italic></source> <volume>61</volume> <fpage>900</fpage>&#x2013;<lpage>917</lpage>. <pub-id pub-id-type="doi">10.1152/jn.1989.61.5.900</pub-id> <pub-id pub-id-type="pmid">2723733</pub-id></citation></ref>
<ref id="B2"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cai</surname> <given-names>Z.</given-names></name> <name><surname>Neveu</surname> <given-names>C. L.</given-names></name> <name><surname>Baxter</surname> <given-names>D. A.</given-names></name> <name><surname>Byrne</surname> <given-names>J. H.</given-names></name> <name><surname>Aazhang</surname> <given-names>B.</given-names></name></person-group> (<year>2017</year>). <article-title>Inferring neuronal network functional connectivity with directed information.</article-title> <source><italic>J. Neurophysiol.</italic></source> <volume>118</volume> <fpage>1055</fpage>&#x2013;<lpage>1069</lpage>. <pub-id pub-id-type="doi">10.1152/jn.00086.2017</pub-id> <pub-id pub-id-type="pmid">28468991</pub-id></citation></ref>
<ref id="B3"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Campagnola</surname> <given-names>L.</given-names></name> <name><surname>Seeman</surname> <given-names>S. C.</given-names></name> <name><surname>Chartrand</surname> <given-names>T.</given-names></name> <name><surname>Kim</surname> <given-names>L.</given-names></name> <name><surname>Hoggarth</surname> <given-names>A.</given-names></name> <name><surname>Gamlin</surname> <given-names>C.</given-names></name><etal/></person-group> (<year>2022</year>). <article-title>Local connectivity and synaptic dynamics in mouse and human neocortex.</article-title> <source><italic>Science</italic></source> <volume>375</volume>:<fpage>eabj5861</fpage>. <pub-id pub-id-type="doi">10.1126/science.abj5861</pub-id> <pub-id pub-id-type="pmid">35271334</pub-id></citation></ref>
<ref id="B4"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>Y.</given-names></name> <name><surname>Rosen</surname> <given-names>B. Q.</given-names></name> <name><surname>Sejnowski</surname> <given-names>T. J.</given-names></name></person-group> (<year>2022</year>). <article-title>Dynamical differential covariance recovers directional network structure in multiscale neural systems.</article-title> <source><italic>Proc. Natl. Acad. Sci. U.S.A.</italic></source> <volume>119</volume>:<fpage>e2117234119</fpage>. <pub-id pub-id-type="doi">10.1073/pnas.2117234119</pub-id> <pub-id pub-id-type="pmid">35679342</pub-id></citation></ref>
<ref id="B5"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Chen</surname> <given-names>Z.</given-names></name> <name><surname>Putrino</surname> <given-names>D. F.</given-names></name> <name><surname>Ghosh</surname> <given-names>S.</given-names></name> <name><surname>Barbieri</surname> <given-names>R.</given-names></name> <name><surname>Brown</surname> <given-names>E. N.</given-names></name></person-group> (<year>2011</year>). <article-title>Statistical inference for assessing functional connectivity of neuronal ensembles with sparse spiking data.</article-title> <source><italic>IEEE Trans. Neural Syst. Rehabil. Eng. Publ. IEEE Eng. Med. Biol. Soc.</italic></source> <volume>19</volume> <fpage>121</fpage>&#x2013;<lpage>135</lpage>. <pub-id pub-id-type="doi">10.1109/TNSRE.2010.2086079</pub-id> <pub-id pub-id-type="pmid">20937583</pub-id></citation></ref>
<ref id="B6"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Deco</surname> <given-names>G.</given-names></name> <name><surname>Sanz Perl</surname> <given-names>Y.</given-names></name> <name><surname>Vuust</surname> <given-names>P.</given-names></name> <name><surname>Tagliazucchi</surname> <given-names>E.</given-names></name> <name><surname>Kennedy</surname> <given-names>H.</given-names></name> <name><surname>Kringelbach</surname> <given-names>M. L.</given-names></name></person-group> (<year>2021</year>). <article-title>Rare long-range cortical connections enhance human information processing.</article-title> <source><italic>Curr. Biol.</italic></source> <volume>31</volume> <fpage>4436</fpage>&#x2013;<lpage>4448.e5</lpage>. <pub-id pub-id-type="doi">10.1016/j.cub.2021.07.064.</pub-id> <pub-id pub-id-type="pmid">34437842</pub-id></citation></ref>
<ref id="B7"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>DeKosky</surname> <given-names>S. T.</given-names></name> <name><surname>Scheff</surname> <given-names>S. W.</given-names></name></person-group> (<year>1990</year>). <article-title>Synapse loss in frontal cortex biopsies in Alzheimer&#x2019;s disease: Correlation with cognitive severity.</article-title> <source><italic>Ann. Neurol.</italic></source> <volume>27</volume> <fpage>457</fpage>&#x2013;<lpage>464</lpage>. <pub-id pub-id-type="doi">10.1002/ana.410270502</pub-id> <pub-id pub-id-type="pmid">2360787</pub-id></citation></ref>
<ref id="B8"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Endo</surname> <given-names>D.</given-names></name> <name><surname>Kobayashi</surname> <given-names>R.</given-names></name> <name><surname>Bartolo</surname> <given-names>R.</given-names></name> <name><surname>Averbeck</surname> <given-names>B. B.</given-names></name> <name><surname>Sugase-Miyamoto</surname> <given-names>Y.</given-names></name> <name><surname>Hayashi</surname> <given-names>K.</given-names></name><etal/></person-group> (<year>2021</year>). <article-title>A convolutional neural network for estimating synaptic connectivity from spike trains.</article-title> <source><italic>Sci. Rep.</italic></source> <volume>11</volume>:<fpage>12087</fpage>. <pub-id pub-id-type="doi">10.1038/s41598-021-91244-w</pub-id> <pub-id pub-id-type="pmid">34103546</pub-id></citation></ref>
<ref id="B9"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>English</surname> <given-names>D. F.</given-names></name> <name><surname>McKenzie</surname> <given-names>S.</given-names></name> <name><surname>Evans</surname> <given-names>T.</given-names></name> <name><surname>Kim</surname> <given-names>K.</given-names></name> <name><surname>Yoon</surname> <given-names>E.</given-names></name> <name><surname>Buzs&#x00E1;ki</surname> <given-names>G.</given-names></name></person-group> (<year>2017</year>). <article-title>Pyramidal cell-interneuron circuit architecture and dynamics in hippocampal networks.</article-title> <source><italic>Neuron</italic></source> <volume>96</volume> <fpage>505</fpage>&#x2013;<lpage>520.e7</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2017.09.033.</pub-id> <pub-id pub-id-type="pmid">29024669</pub-id></citation></ref>
<ref id="B10"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ercsey-Ravasz</surname> <given-names>M.</given-names></name> <name><surname>Markov</surname> <given-names>N. T.</given-names></name> <name><surname>Lamy</surname> <given-names>C.</given-names></name> <name><surname>Van Essen</surname> <given-names>D. C.</given-names></name> <name><surname>Knoblauch</surname> <given-names>K.</given-names></name> <name><surname>Toroczkai</surname> <given-names>Z.</given-names></name><etal/></person-group> (<year>2013</year>). <article-title>A predictive network model of cerebral cortical connectivity based on a distance rule.</article-title> <source><italic>Neuron</italic></source> <volume>80</volume> <fpage>184</fpage>&#x2013;<lpage>197</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2013.07.036</pub-id> <pub-id pub-id-type="pmid">24094111</pub-id></citation></ref>
<ref id="B11"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fino</surname> <given-names>E.</given-names></name> <name><surname>Yuste</surname> <given-names>R.</given-names></name></person-group> (<year>2011</year>). <article-title>Dense inhibitory connectivity in neocortex.</article-title> <source><italic>Neuron</italic></source> <volume>69</volume> <fpage>1188</fpage>&#x2013;<lpage>1203</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2011.02.025</pub-id> <pub-id pub-id-type="pmid">21435562</pub-id></citation></ref>
<ref id="B12"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Friedrich</surname> <given-names>J.</given-names></name> <name><surname>Zhou</surname> <given-names>P.</given-names></name> <name><surname>Paninski</surname> <given-names>L.</given-names></name></person-group> (<year>2017</year>). <article-title>Fast online deconvolution of calcium imaging data.</article-title> <source><italic>PLoS Comput. Biol.</italic></source> <volume>13</volume>:<fpage>e1005423</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pcbi.1005423</pub-id> <pub-id pub-id-type="pmid">28291787</pub-id></citation></ref>
<ref id="B13"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Friston</surname> <given-names>K.</given-names></name> <name><surname>Moran</surname> <given-names>R.</given-names></name> <name><surname>Seth</surname> <given-names>A. K.</given-names></name></person-group> (<year>2013</year>). <article-title>Analysing connectivity with Granger causality and dynamic causal modelling.</article-title> <source><italic>Curr. Opin. Neurobiol.</italic></source> <volume>23</volume> <fpage>172</fpage>&#x2013;<lpage>178</lpage>. <pub-id pub-id-type="doi">10.1016/j.conb.2012.11.010</pub-id> <pub-id pub-id-type="pmid">23265964</pub-id></citation></ref>
<ref id="B14"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Graber</surname> <given-names>C.</given-names></name> <name><surname>Vlasov</surname> <given-names>Y.</given-names></name> <name><surname>Schwing</surname> <given-names>A.</given-names></name></person-group> (<year>2024</year>). <article-title>Dynamic organization of visual cortical networks revealed by machine learning applied to massive spiking datasets.</article-title> <source><italic>eLife</italic></source> <volume>13</volume> <fpage>1</fpage>&#x2013;<lpage>48</lpage>. <pub-id pub-id-type="doi">10.7554/eLife.95449.1</pub-id></citation></ref>
<ref id="B15"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hellwig</surname> <given-names>B.</given-names></name></person-group> (<year>2000</year>). <article-title>A quantitative analysis of the local connectivity between pyramidal neurons in layers 2/3 of the rat visual cortex.</article-title> <source><italic>Biol. Cybern.</italic></source> <volume>82</volume> <fpage>111</fpage>&#x2013;<lpage>121</lpage>. <pub-id pub-id-type="doi">10.1007/PL00007964</pub-id> <pub-id pub-id-type="pmid">10664098</pub-id></citation></ref>
<ref id="B16"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Holmgren</surname> <given-names>C.</given-names></name> <name><surname>Harkany</surname> <given-names>T.</given-names></name> <name><surname>Svennenfors</surname> <given-names>B.</given-names></name> <name><surname>Zilberter</surname> <given-names>Y.</given-names></name></person-group> (<year>2003</year>). <article-title>Pyramidal cell communication within local networks in layer 2/3 of rat neocortex.</article-title> <source><italic>J. Physiol.</italic></source> <volume>551</volume> <fpage>139</fpage>&#x2013;<lpage>153</lpage>. <pub-id pub-id-type="doi">10.1113/jphysiol.2003.044784</pub-id> <pub-id pub-id-type="pmid">12813147</pub-id></citation></ref>
<ref id="B17"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Honey</surname> <given-names>C. J.</given-names></name> <name><surname>Thivierge</surname> <given-names>J.-P.</given-names></name> <name><surname>Sporns</surname> <given-names>O.</given-names></name></person-group> (<year>2010</year>). <article-title>Can structure predict function in the human brain?</article-title> <source><italic>NeuroImage</italic></source> <volume>52</volume> <fpage>766</fpage>&#x2013;<lpage>776</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuroimage.2010.01.071</pub-id> <pub-id pub-id-type="pmid">20116438</pub-id></citation></ref>
<ref id="B18"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Horv&#x00E1;t</surname> <given-names>S.</given-names></name> <name><surname>G&#x0103;m&#x0103;nu&#x0163;</surname> <given-names>R.</given-names></name> <name><surname>Ercsey-Ravasz</surname> <given-names>M.</given-names></name> <name><surname>Magrou</surname> <given-names>L.</given-names></name> <name><surname>G&#x0103;m&#x0103;nu&#x0163;</surname> <given-names>B.</given-names></name> <name><surname>Essen</surname> <given-names>D. C. V.</given-names></name><etal/></person-group> (<year>2016</year>). <article-title>Spatial embedding and wiring cost constrain the functional layout of the cortical network of rodents and primates.</article-title> <source><italic>PLoS Biol.</italic></source> <volume>14</volume>:<fpage>e1002512</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pbio.1002512</pub-id> <pub-id pub-id-type="pmid">27441598</pub-id></citation></ref>
<ref id="B19"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>C.</given-names></name> <name><surname>Ruff</surname> <given-names>D. A.</given-names></name> <name><surname>Pyle</surname> <given-names>R.</given-names></name> <name><surname>Rosenbaum</surname> <given-names>R.</given-names></name> <name><surname>Cohen</surname> <given-names>M. R.</given-names></name> <name><surname>Doiron</surname> <given-names>B.</given-names></name></person-group> (<year>2019</year>). <article-title>Circuit models of low-dimensional shared variability in cortical networks.</article-title> <source><italic>Neuron</italic></source> <volume>101</volume> <fpage>337</fpage>&#x2013;<lpage>348.e4</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2018.11.034.</pub-id> <pub-id pub-id-type="pmid">30581012</pub-id></citation></ref>
<ref id="B20"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ito</surname> <given-names>S.</given-names></name> <name><surname>Hansen</surname> <given-names>M. E.</given-names></name> <name><surname>Heiland</surname> <given-names>R.</given-names></name> <name><surname>Lumsdaine</surname> <given-names>A.</given-names></name> <name><surname>Litke</surname> <given-names>A. M.</given-names></name> <name><surname>Beggs</surname> <given-names>J. M.</given-names></name></person-group> (<year>2011</year>). <article-title>Extending transfer entropy improves identification of effective connectivity in a spiking cortical network model.</article-title> <source><italic>PLoS One</italic></source> <volume>6</volume>:<fpage>e27431</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0027431</pub-id> <pub-id pub-id-type="pmid">22102894</pub-id></citation></ref>
<ref id="B21"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Izhikevich</surname> <given-names>E. M.</given-names></name></person-group> (<year>2003</year>). <article-title>Simple model of spiking neurons.</article-title> <source><italic>IEEE Trans. Neural Netw.</italic></source> <volume>14</volume> <fpage>1569</fpage>&#x2013;<lpage>1572</lpage>. <pub-id pub-id-type="doi">10.1109/TNN.2003.820440</pub-id> <pub-id pub-id-type="pmid">18244602</pub-id></citation></ref>
<ref id="B22"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Izzi</surname> <given-names>J. V. R.</given-names></name> <name><surname>Ferreira</surname> <given-names>R. F.</given-names></name> <name><surname>Girardi</surname> <given-names>V. A.</given-names></name> <name><surname>Pena</surname> <given-names>R. F. O.</given-names></name></person-group> (<year>2024</year>). <article-title>Identifying effective connectivity between stochastic neurons with variable-length memory using a transfer entropy rate estimator.</article-title> <source><italic>Brain Sci.</italic></source> <volume>14</volume>:<fpage>442</fpage>. <pub-id pub-id-type="doi">10.3390/brainsci14050442</pub-id> <pub-id pub-id-type="pmid">38790421</pub-id></citation></ref>
<ref id="B23"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jiang</surname> <given-names>X.</given-names></name> <name><surname>Shen</surname> <given-names>S.</given-names></name> <name><surname>Cadwell</surname> <given-names>C. R.</given-names></name> <name><surname>Berens</surname> <given-names>P.</given-names></name> <name><surname>Sinz</surname> <given-names>F.</given-names></name> <name><surname>Ecker</surname> <given-names>A. S.</given-names></name><etal/></person-group> (<year>2015</year>). <article-title>Principles of connectivity among morphologically defined cell types in adult neocortex.</article-title> <source><italic>Science</italic></source> <volume>350</volume>:<fpage>aac9462</fpage>. <pub-id pub-id-type="doi">10.1126/science.aac9462</pub-id> <pub-id pub-id-type="pmid">26612957</pub-id></citation></ref>
<ref id="B24"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kajiwara</surname> <given-names>M.</given-names></name> <name><surname>Nomura</surname> <given-names>R.</given-names></name> <name><surname>Goetze</surname> <given-names>F.</given-names></name> <name><surname>Kawabata</surname> <given-names>M.</given-names></name> <name><surname>Isomura</surname> <given-names>Y.</given-names></name> <name><surname>Akutsu</surname> <given-names>T.</given-names></name><etal/></person-group> (<year>2021</year>). <article-title>Inhibitory neurons exhibit high controlling ability in the cortical microconnectome.</article-title> <source><italic>PLoS Comput. Biol.</italic></source> <volume>17</volume>:<fpage>e1008846</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pcbi.1008846</pub-id> <pub-id pub-id-type="pmid">33831009</pub-id></citation></ref>
<ref id="B25"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Keller</surname> <given-names>T. A.</given-names></name> <name><surname>Muller</surname> <given-names>L.</given-names></name> <name><surname>Sejnowski</surname> <given-names>T. J.</given-names></name> <name><surname>Welling</surname> <given-names>M.</given-names></name></person-group> (<year>2024</year>). <article-title>A spacetime perspective on dynamical computation in neural information processing systems.</article-title> <source><italic>arXiv</italic></source> [<comment>Preprint</comment>] <pub-id pub-id-type="doi">10.48550/arXiv.2409.13669</pub-id></citation></ref>
<ref id="B26"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Khoury</surname> <given-names>C. F.</given-names></name> <name><surname>Ferrone</surname> <given-names>M.</given-names></name> <name><surname>Runyan</surname> <given-names>C. A.</given-names></name></person-group> (<year>2025</year>). <article-title>Local differences in network organization in the auditory and parietal cortex, revealed with single neuron activation.</article-title> <source><italic>J. Neurosci.</italic></source> <volume>45</volume>:<fpage>e1385242025</fpage>. <pub-id pub-id-type="doi">10.1523/JNEUROSCI.1385-24.2025</pub-id> <pub-id pub-id-type="pmid">39890466</pub-id></citation></ref>
<ref id="B27"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kobayashi</surname> <given-names>R.</given-names></name> <name><surname>Shinomoto</surname> <given-names>S.</given-names></name></person-group> (<year>2024</year>). <article-title>Inference of monosynaptic connections from parallel spike trains: A review.</article-title> <source><italic>Neurosci. Res.</italic></source> <volume>215</volume> <fpage>37</fpage>&#x2013;<lpage>46</lpage>. <pub-id pub-id-type="doi">10.1016/j.neures.2024.07.006</pub-id> <pub-id pub-id-type="pmid">39098768</pub-id></citation></ref>
<ref id="B28"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Levy</surname> <given-names>R. B.</given-names></name> <name><surname>Reyes</surname> <given-names>A. D.</given-names></name></person-group> (<year>2012</year>). <article-title>Spatial profile of excitatory and inhibitory synaptic connectivity in mouse primary auditory cortex.</article-title> <source><italic>J. Neurosci.</italic></source> <volume>32</volume> <fpage>5609</fpage>&#x2013;<lpage>5619</lpage>. <pub-id pub-id-type="doi">10.1523/JNEUROSCI.5158-11.2012</pub-id> <pub-id pub-id-type="pmid">22514322</pub-id></citation></ref>
<ref id="B29"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liao</surname> <given-names>W.</given-names></name> <name><surname>Mantini</surname> <given-names>D.</given-names></name> <name><surname>Zhang</surname> <given-names>Z.</given-names></name> <name><surname>Pan</surname> <given-names>Z.</given-names></name> <name><surname>Ding</surname> <given-names>J.</given-names></name> <name><surname>Gong</surname> <given-names>Q.</given-names></name><etal/></person-group> (<year>2010</year>). <article-title>Evaluating the effective connectivity of resting state networks using conditional granger causality.</article-title> <source><italic>Biol. Cybern.</italic></source> <volume>102</volume> <fpage>57</fpage>&#x2013;<lpage>69</lpage>. <pub-id pub-id-type="doi">10.1007/s00422-009-0350-5</pub-id> <pub-id pub-id-type="pmid">19937337</pub-id></citation></ref>
<ref id="B30"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Litwin-Kumar</surname> <given-names>A.</given-names></name> <name><surname>Doiron</surname> <given-names>B.</given-names></name></person-group> (<year>2012</year>). <article-title>Slow dynamics and high variability in balanced cortical networks with clustered connections.</article-title> <source><italic>Nat. Neurosci.</italic></source> <volume>15</volume> <fpage>1498</fpage>&#x2013;<lpage>1505</lpage>. <pub-id pub-id-type="doi">10.1038/nn.3220</pub-id> <pub-id pub-id-type="pmid">23001062</pub-id></citation></ref>
<ref id="B31"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lizier</surname> <given-names>J. T.</given-names></name> <name><surname>Prokopenko</surname> <given-names>M.</given-names></name> <name><surname>Zomaya</surname> <given-names>A. Y.</given-names></name></person-group> (<year>2008</year>). <article-title>Local information transfer as a spatiotemporal filter for complex systems.</article-title> <source><italic>Phys. Rev. E</italic></source> <volume>77</volume>:<fpage>026110</fpage>. <pub-id pub-id-type="doi">10.1103/PhysRevE.77.026110</pub-id> <pub-id pub-id-type="pmid">18352093</pub-id></citation></ref>
<ref id="B32"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lungarella</surname> <given-names>M.</given-names></name> <name><surname>Pitti</surname> <given-names>A.</given-names></name> <name><surname>Kuniyoshi</surname> <given-names>Y.</given-names></name></person-group> (<year>2007</year>). <article-title>Information transfer at multiple scales.</article-title> <source><italic>Phys. Rev. E Stat. Nonlin. Soft Matter Phys.</italic></source> <volume>76</volume>:<fpage>056117</fpage>. <pub-id pub-id-type="doi">10.1103/PhysRevE.76.056117</pub-id> <pub-id pub-id-type="pmid">18233728</pub-id></citation></ref>
<ref id="B33"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Markov</surname> <given-names>N. T.</given-names></name> <name><surname>Ercsey-Ravasz</surname> <given-names>M.</given-names></name> <name><surname>Lamy</surname> <given-names>C.</given-names></name> <name><surname>Ribeiro Gomes</surname> <given-names>A. R.</given-names></name> <name><surname>Magrou</surname> <given-names>L.</given-names></name> <name><surname>Misery</surname> <given-names>P.</given-names></name><etal/></person-group> (<year>2013</year>). <article-title>The role of long-range connections on the specificity of the macaque interareal cortical network.</article-title> <source><italic>Proc. Natl. Acad. Sci. U. S. A.</italic></source> <volume>110</volume> <fpage>5187</fpage>&#x2013;<lpage>5192</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.1218972110</pub-id> <pub-id pub-id-type="pmid">23479610</pub-id></citation></ref>
<ref id="B34"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Masud</surname> <given-names>M. S.</given-names></name> <name><surname>Borisyuk</surname> <given-names>R.</given-names></name></person-group> (<year>2011</year>). <article-title>Statistical technique for analysing functional connectivity of multiple spike trains.</article-title> <source><italic>J. Neurosci. Methods</italic></source> <volume>196</volume> <fpage>201</fpage>&#x2013;<lpage>219</lpage>. <pub-id pub-id-type="doi">10.1016/j.jneumeth.2011.01.003</pub-id> <pub-id pub-id-type="pmid">21236298</pub-id></citation></ref>
<ref id="B35"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Novelli</surname> <given-names>L.</given-names></name> <name><surname>Wollstadt</surname> <given-names>P.</given-names></name> <name><surname>Mediano</surname> <given-names>P.</given-names></name> <name><surname>Wibral</surname> <given-names>M.</given-names></name> <name><surname>Lizier</surname> <given-names>J. T.</given-names></name></person-group> (<year>2019</year>). <article-title>Large-scale directed network inference with multivariate transfer entropy and hierarchical statistical testing.</article-title> <source><italic>Netw. Neurosci. Camb. Mass</italic></source> <volume>3</volume> <fpage>827</fpage>&#x2013;<lpage>847</lpage>. <pub-id pub-id-type="doi">10.1162/netn_a_00092</pub-id> <pub-id pub-id-type="pmid">31410382</pub-id></citation></ref>
<ref id="B36"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ohiorhenuan</surname> <given-names>I. E.</given-names></name> <name><surname>Mechler</surname> <given-names>F.</given-names></name> <name><surname>Purpura</surname> <given-names>K. P.</given-names></name> <name><surname>Schmid</surname> <given-names>A. M.</given-names></name> <name><surname>Hu</surname> <given-names>Q.</given-names></name> <name><surname>Victor</surname> <given-names>J. D.</given-names></name></person-group> (<year>2010</year>). <article-title>Sparse coding and high-order correlations in fine-scale cortical networks.</article-title> <source><italic>Nature</italic></source> <volume>466</volume> <fpage>617</fpage>&#x2013;<lpage>621</lpage>. <pub-id pub-id-type="doi">10.1038/nature09178</pub-id> <pub-id pub-id-type="pmid">20601940</pub-id></citation></ref>
<ref id="B37"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Okatan</surname> <given-names>M.</given-names></name> <name><surname>Wilson</surname> <given-names>M. A.</given-names></name> <name><surname>Brown</surname> <given-names>E. N.</given-names></name></person-group> (<year>2005</year>). <article-title>Analyzing functional connectivity using a network likelihood model of ensemble neural spiking activity.</article-title> <source><italic>Neural Comput.</italic></source> <volume>17</volume> <fpage>1927</fpage>&#x2013;<lpage>1961</lpage>. <pub-id pub-id-type="doi">10.1162/0899766054322973</pub-id> <pub-id pub-id-type="pmid">15992486</pub-id></citation></ref>
<ref id="B38"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Orlandi</surname> <given-names>J. G.</given-names></name> <name><surname>Stetter</surname> <given-names>O.</given-names></name> <name><surname>Soriano</surname> <given-names>J.</given-names></name> <name><surname>Geisel</surname> <given-names>T.</given-names></name> <name><surname>Battaglia</surname> <given-names>D.</given-names></name></person-group> (<year>2014</year>). <article-title>Transfer entropy reconstruction and labeling of neuronal connections from simulated calcium imaging.</article-title> <source><italic>PloS One</italic></source> <volume>9</volume>:<fpage>e98842</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0098842</pub-id> <pub-id pub-id-type="pmid">24905689</pub-id></citation></ref>
<ref id="B39"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pachitariu</surname> <given-names>M.</given-names></name> <name><surname>Stringer</surname> <given-names>C.</given-names></name> <name><surname>Harris</surname> <given-names>K. D.</given-names></name></person-group> (<year>2018</year>). <article-title>Robustness of spike deconvolution for neuronal calcium imaging.</article-title> <source><italic>J. Neurosci.</italic></source> <volume>38</volume> <fpage>7976</fpage>&#x2013;<lpage>7985</lpage>. <pub-id pub-id-type="doi">10.1523/JNEUROSCI.3339-17.2018</pub-id> <pub-id pub-id-type="pmid">30082416</pub-id></citation></ref>
<ref id="B40"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Paraskevov</surname> <given-names>A. V.</given-names></name> <name><surname>Zendrikov</surname> <given-names>D. K.</given-names></name></person-group> (<year>2017</year>). <article-title>A spatially resolved network spike in model neuronal cultures reveals nucleation centers, circular traveling waves and drifting spiral waves.</article-title> <source><italic>Phys. Biol.</italic></source> <volume>14</volume>:<fpage>026003</fpage>. <pub-id pub-id-type="doi">10.1088/1478-3975/aa5fc3</pub-id> <pub-id pub-id-type="pmid">28333685</pub-id></citation></ref>
<ref id="B41"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pastorelli</surname> <given-names>E.</given-names></name> <name><surname>Paolucci</surname> <given-names>P. S.</given-names></name> <name><surname>Simula</surname> <given-names>F.</given-names></name> <name><surname>Biagioni</surname> <given-names>A.</given-names></name> <name><surname>Capuani</surname> <given-names>F.</given-names></name> <name><surname>Cretaro</surname> <given-names>P.</given-names></name><etal/></person-group> (<year>2018</year>). &#x201C;<article-title>Gaussian and exponential lateral connectivity on distributed spiking neural network simulation</article-title>,&#x201D; in <source><italic>Proceedings of the 2018 26th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)</italic></source>, (<publisher-loc>Piscataway, NJ</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>658</fpage>&#x2013;<lpage>665</lpage>.</citation></ref>
<ref id="B42"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Perin</surname> <given-names>R.</given-names></name> <name><surname>Berger</surname> <given-names>T. K.</given-names></name> <name><surname>Markram</surname> <given-names>H.</given-names></name></person-group> (<year>2011</year>). <article-title>A synaptic organizing principle for cortical neuronal groups.</article-title> <source><italic>Proc. Natl. Acad. Sci. U. S. A.</italic></source> <volume>108</volume> <fpage>5419</fpage>&#x2013;<lpage>5424</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.1016051108</pub-id> <pub-id pub-id-type="pmid">21383177</pub-id></citation></ref>
<ref id="B43"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pillow</surname> <given-names>J. W.</given-names></name> <name><surname>Shlens</surname> <given-names>J.</given-names></name> <name><surname>Paninski</surname> <given-names>L.</given-names></name> <name><surname>Sher</surname> <given-names>A.</given-names></name> <name><surname>Litke</surname> <given-names>A. M.</given-names></name> <name><surname>Chichilnisky</surname> <given-names>E. J.</given-names></name><etal/></person-group> (<year>2008</year>). <article-title>Spatio-temporal correlations and visual signalling in a complete neuronal population.</article-title> <source><italic>Nature</italic></source> <volume>454</volume> <fpage>995</fpage>&#x2013;<lpage>999</lpage>. <pub-id pub-id-type="doi">10.1038/nature07140</pub-id> <pub-id pub-id-type="pmid">18650810</pub-id></citation></ref>
<ref id="B44"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Roxin</surname> <given-names>A.</given-names></name> <name><surname>Riecke</surname> <given-names>H.</given-names></name> <name><surname>Solla</surname> <given-names>S. A.</given-names></name></person-group> (<year>2004</year>). <article-title>Self-Sustained Activity in a Small-World Network of Excitable Neurons.</article-title> <source><italic>Phys. Rev. Lett.</italic></source> <volume>92</volume>:<fpage>198101</fpage>. <pub-id pub-id-type="doi">10.1103/PhysRevLett.92.198101</pub-id> <pub-id pub-id-type="pmid">15169447</pub-id></citation></ref>
<ref id="B45"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schreiber</surname> <given-names>T.</given-names></name></person-group> (<year>2000</year>). <article-title>Measuring information transfer.</article-title> <source><italic>Phys. Rev. Lett.</italic></source> <volume>85</volume> <fpage>461</fpage>&#x2013;<lpage>464</lpage>. <pub-id pub-id-type="doi">10.1103/PhysRevLett.85.461</pub-id> <pub-id pub-id-type="pmid">10991308</pub-id></citation></ref>
<ref id="B46"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Senzai</surname> <given-names>Y.</given-names></name> <name><surname>Fernandez-Ruiz</surname> <given-names>A.</given-names></name> <name><surname>Buzs&#x00E1;ki</surname> <given-names>G.</given-names></name></person-group> (<year>2019</year>). <article-title>Layer-specific physiological features and interlaminar interactions in the primary visual cortex of the mouse.</article-title> <source><italic>Neuron</italic></source> <volume>101</volume> <fpage>500</fpage>&#x2013;<lpage>513.e5</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2018.12.009.</pub-id> <pub-id pub-id-type="pmid">30635232</pub-id></citation></ref>
<ref id="B47"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Seth</surname> <given-names>A. K.</given-names></name></person-group> (<year>2008</year>). <article-title>Causal networks in simulated neural systems.</article-title> <source><italic>Cogn. Neurodyn.</italic></source> <volume>2</volume> <fpage>49</fpage>&#x2013;<lpage>64</lpage>. <pub-id pub-id-type="doi">10.1007/s11571-007-9031-z</pub-id> <pub-id pub-id-type="pmid">19003473</pub-id></citation></ref>
<ref id="B48"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Smith</surname> <given-names>M. A.</given-names></name> <name><surname>Kohn</surname> <given-names>A.</given-names></name></person-group> (<year>2008</year>). <article-title>Spatial and temporal scales of neuronal correlation in primary visual cortex.</article-title> <source><italic>J. Neurosci.</italic></source> <volume>28</volume> <fpage>12591</fpage>&#x2013;<lpage>12603</lpage>. <pub-id pub-id-type="doi">10.1523/JNEUROSCI.2929-08.2008</pub-id> <pub-id pub-id-type="pmid">19036953</pub-id></citation></ref>
<ref id="B49"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Song</surname> <given-names>S.</given-names></name> <name><surname>Sj&#x00F6;str&#x00F6;m</surname> <given-names>P. J.</given-names></name> <name><surname>Reigl</surname> <given-names>M.</given-names></name> <name><surname>Nelson</surname> <given-names>S.</given-names></name> <name><surname>Chklovskii</surname> <given-names>D. B.</given-names></name></person-group> (<year>2005</year>). <article-title>Highly nonrandom features of synaptic connectivity in local cortical circuits.</article-title> <source><italic>PLoS Biol.</italic></source> <volume>3</volume>:<fpage>e68</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pbio.0030068</pub-id> <pub-id pub-id-type="pmid">15737062</pub-id></citation></ref>
<ref id="B50"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Stetter</surname> <given-names>O.</given-names></name> <name><surname>Battaglia</surname> <given-names>D.</given-names></name> <name><surname>Soriano</surname> <given-names>J.</given-names></name> <name><surname>Geisel</surname> <given-names>T.</given-names></name></person-group> (<year>2012</year>). <article-title>Model-free reconstruction of excitatory neuronal connectivity from calcium imaging signals.</article-title> <source><italic>PLoS Comput. Biol.</italic></source> <volume>8</volume>:<fpage>e1002653</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pcbi.1002653</pub-id> <pub-id pub-id-type="pmid">22927808</pub-id></citation></ref>
<ref id="B51"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Stoner</surname> <given-names>R.</given-names></name> <name><surname>Chow</surname> <given-names>M. L.</given-names></name> <name><surname>Boyle</surname> <given-names>M. P.</given-names></name> <name><surname>Sunkin</surname> <given-names>S. M.</given-names></name> <name><surname>Mouton</surname> <given-names>P. R.</given-names></name> <name><surname>Roy</surname> <given-names>S.</given-names></name><etal/></person-group> (<year>2014</year>). <article-title>Patches of disorganization in the neocortex of children with autism.</article-title> <source><italic>N. Engl. J. Med.</italic></source> <volume>370</volume> <fpage>1209</fpage>&#x2013;<lpage>1219</lpage>. <pub-id pub-id-type="doi">10.1056/NEJMoa1307491</pub-id> <pub-id pub-id-type="pmid">24670167</pub-id></citation></ref>
<ref id="B52"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Stosiek</surname> <given-names>C.</given-names></name> <name><surname>Garaschuk</surname> <given-names>O.</given-names></name> <name><surname>Holthoff</surname> <given-names>K.</given-names></name> <name><surname>Konnerth</surname> <given-names>A.</given-names></name></person-group> (<year>2003</year>). <article-title><italic>In vivo</italic> two-photon calcium imaging of neuronal networks.</article-title> <source><italic>Proc. Natl. Acad. Sci. U.S.A.</italic></source> <volume>100</volume> <fpage>7319</fpage>&#x2013;<lpage>7324</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.1232232100</pub-id> <pub-id pub-id-type="pmid">12777621</pub-id></citation></ref>
<ref id="B53"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Stringer</surname> <given-names>C.</given-names></name> <name><surname>Pachitariu</surname> <given-names>M.</given-names></name> <name><surname>Steinmetz</surname> <given-names>N.</given-names></name> <name><surname>Carandini</surname> <given-names>M.</given-names></name> <name><surname>Harris</surname> <given-names>K. D.</given-names></name></person-group> (<year>2019a</year>). <article-title>High-dimensional geometry of population responses in visual cortex.</article-title> <source><italic>Nature</italic></source> <volume>571</volume> <fpage>361</fpage>&#x2013;<lpage>365</lpage>. <pub-id pub-id-type="doi">10.1038/s41586-019-1346-5</pub-id> <pub-id pub-id-type="pmid">31243367</pub-id></citation></ref>
<ref id="B54"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Stringer</surname> <given-names>C.</given-names></name> <name><surname>Pachitariu</surname> <given-names>M.</given-names></name> <name><surname>Steinmetz</surname> <given-names>N.</given-names></name> <name><surname>Reddy</surname> <given-names>C. B.</given-names></name> <name><surname>Carandini</surname> <given-names>M.</given-names></name> <name><surname>Harris</surname> <given-names>K. D.</given-names></name></person-group> (<year>2019b</year>). <article-title>Spontaneous behaviors drive multidimensional, brainwide activity.</article-title> <source><italic>Science</italic></source> <volume>364</volume>: 255. <pub-id pub-id-type="doi">10.1126/science.aav7893</pub-id> <pub-id pub-id-type="pmid">31000656</pub-id></citation></ref>
<ref id="B55"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Su&#x00E1;rez</surname> <given-names>L. E.</given-names></name> <name><surname>Markello</surname> <given-names>R. D.</given-names></name> <name><surname>Betzel</surname> <given-names>R. F.</given-names></name> <name><surname>Misic</surname> <given-names>B.</given-names></name></person-group> (<year>2020</year>). <article-title>Linking structure and function in macroscale brain networks.</article-title> <source><italic>Trends Cogn. Sci.</italic></source> <volume>24</volume> <fpage>302</fpage>&#x2013;<lpage>315</lpage>. <pub-id pub-id-type="doi">10.1016/j.tics.2020.01.008</pub-id> <pub-id pub-id-type="pmid">32160567</pub-id></citation></ref>
<ref id="B56"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tian</surname> <given-names>Z.-Q. K.</given-names></name> <name><surname>Chen</surname> <given-names>K.</given-names></name> <name><surname>Li</surname> <given-names>S.</given-names></name> <name><surname>McLaughlin</surname> <given-names>D. W.</given-names></name> <name><surname>Zhou</surname> <given-names>D.</given-names></name></person-group> (<year>2024</year>). <article-title>Causal connectivity measures for pulse-output network reconstruction: Analysis and applications.</article-title> <source><italic>Proc. Natl. Acad. Sci. U. S. A.</italic></source> <volume>121</volume>:<fpage>e2305297121</fpage>. <pub-id pub-id-type="doi">10.1073/pnas.2305297121</pub-id> <pub-id pub-id-type="pmid">38551842</pub-id></citation></ref>
<ref id="B57"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tremblay</surname> <given-names>R.</given-names></name> <name><surname>Lee</surname> <given-names>S.</given-names></name> <name><surname>Rudy</surname> <given-names>B.</given-names></name></person-group> (<year>2016</year>). <article-title>GABAergic interneurons in the neocortex: From cellular properties to circuits.</article-title> <source><italic>Neuron</italic></source> <volume>91</volume> <fpage>260</fpage>&#x2013;<lpage>292</lpage>. <pub-id pub-id-type="doi">10.1016/j.neuron.2016.06.033</pub-id> <pub-id pub-id-type="pmid">27477017</pub-id></citation></ref>
<ref id="B58"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ursino</surname> <given-names>M.</given-names></name> <name><surname>Ricci</surname> <given-names>G.</given-names></name> <name><surname>Magosso</surname> <given-names>E.</given-names></name></person-group> (<year>2020</year>). <article-title>Transfer entropy as a measure of brain connectivity: A critical analysis with the help of neural mass models.</article-title> <source><italic>Front. Comput. Neurosci.</italic></source> <volume>14</volume>:<fpage>45</fpage>. <pub-id pub-id-type="doi">10.3389/fncom.2020.00045</pub-id> <pub-id pub-id-type="pmid">32581756</pub-id></citation></ref>
<ref id="B59"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vegu&#x00E9;</surname> <given-names>M.</given-names></name> <name><surname>Perin</surname> <given-names>R.</given-names></name> <name><surname>Roxin</surname> <given-names>A.</given-names></name></person-group> (<year>2017</year>). <article-title>On the structure of cortical microcircuits inferred from small sample sizes.</article-title> <source><italic>J. Neurosci.</italic></source> <volume>37</volume> <fpage>8498</fpage>&#x2013;<lpage>8510</lpage>. <pub-id pub-id-type="doi">10.1523/JNEUROSCI.0984-17.2017</pub-id> <pub-id pub-id-type="pmid">28760860</pub-id></citation></ref>
<ref id="B60"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Verdes</surname> <given-names>P. F.</given-names></name></person-group> (<year>2005</year>). <article-title>Assessing causality from multivariate time series.</article-title> <source><italic>Phys. Rev. E Stat. Nonlin. Soft Matter Phys.</italic></source> <volume>72</volume>:<fpage>026222</fpage>. <pub-id pub-id-type="doi">10.1103/PhysRevE.72.026222</pub-id> <pub-id pub-id-type="pmid">16196699</pub-id></citation></ref>
<ref id="B61"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vicente</surname> <given-names>R.</given-names></name> <name><surname>Wibral</surname> <given-names>M.</given-names></name> <name><surname>Lindner</surname> <given-names>M.</given-names></name> <name><surname>Pipa</surname> <given-names>G.</given-names></name></person-group> (<year>2011</year>). <article-title>Transfer entropy&#x2013;a model-free measure of effective connectivity for the neurosciences.</article-title> <source><italic>J. Comput. Neurosci.</italic></source> <volume>30</volume> <fpage>45</fpage>&#x2013;<lpage>67</lpage>. <pub-id pub-id-type="doi">10.1007/s10827-010-0262-3</pub-id> <pub-id pub-id-type="pmid">20706781</pub-id></citation></ref>
<ref id="B62"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Voges</surname> <given-names>N.</given-names></name> <name><surname>Lima</surname> <given-names>V.</given-names></name> <name><surname>Hausmann</surname> <given-names>J.</given-names></name> <name><surname>Brovelli</surname> <given-names>A.</given-names></name> <name><surname>Battaglia</surname> <given-names>D.</given-names></name></person-group> (<year>2024</year>). <article-title>Decomposing Neural Circuit Function into Information Processing Primitives.</article-title> <source><italic>J. Neurosci.</italic></source> <volume>44</volume>:<fpage>e0157232023</fpage>. <pub-id pub-id-type="doi">10.1523/JNEUROSCI.0157-23.2023</pub-id> <pub-id pub-id-type="pmid">38050070</pub-id></citation></ref>
<ref id="B63"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>X.-J.</given-names></name> <name><surname>Kennedy</surname> <given-names>H.</given-names></name></person-group> (<year>2016</year>). <article-title>Brain structure and dynamics across scales: In search of rules.</article-title> <source><italic>Curr. Opin. Neurobiol.</italic></source> <volume>37</volume> <fpage>92</fpage>&#x2013;<lpage>98</lpage>. <pub-id pub-id-type="doi">10.1016/j.conb.2015.12.010</pub-id> <pub-id pub-id-type="pmid">26868043</pub-id></citation></ref>
<ref id="B64"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Yatsenko</surname> <given-names>D.</given-names></name> <name><surname>Josi&#x0107;</surname> <given-names>K.</given-names></name> <name><surname>Ecker</surname> <given-names>A. S.</given-names></name> <name><surname>Froudarakis</surname> <given-names>E.</given-names></name> <name><surname>Cotton</surname> <given-names>R. J.</given-names></name> <name><surname>Tolias</surname> <given-names>A. S.</given-names></name></person-group> (<year>2015</year>). <article-title>Improved estimation and interpretation of correlations in neural circuits.</article-title> <source><italic>PLoS Comput. Biol.</italic></source> <volume>11</volume>:<fpage>e1004083</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pcbi.1004083</pub-id> <pub-id pub-id-type="pmid">25826696</pub-id></citation></ref>
<ref id="B65"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zingg</surname> <given-names>B.</given-names></name> <name><surname>Hintiryan</surname> <given-names>H.</given-names></name> <name><surname>Gou</surname> <given-names>L.</given-names></name> <name><surname>Song</surname> <given-names>M. Y.</given-names></name> <name><surname>Bay</surname> <given-names>M.</given-names></name> <name><surname>Bienkowski</surname> <given-names>M. S.</given-names></name><etal/></person-group> (<year>2014</year>). <article-title>Neural networks of the mouse neocortex.</article-title> <source><italic>Cell</italic></source> <volume>156</volume> <fpage>1096</fpage>&#x2013;<lpage>1111</lpage>. <pub-id pub-id-type="doi">10.1016/j.cell.2014.02.023</pub-id> <pub-id pub-id-type="pmid">24581503</pub-id></citation></ref>
</ref-list>
</back>
</article>