Constructing Numerical Scheme Using Python in Neural Field Model

dc.contributor.authorGHULAM QADIR
dc.contributor.authorCIIT/FA21-RMT-060/LHR
dc.contributor.authorDr. Muhammad Yousaf
dc.date.accessioned2026-03-20T14:40:12Z
dc.date.issued2023
dc.description.abstractWe analyze a two-population neuronal network model of the Wilson-Cowan type to inves- tigate the presence of localized stationary solutions called “bumps”. Specifically, we focus on a scenario where two distinct types of bump solutions exist: a narrow pair and a broad pair.To assess the stability of these bumps, we employ two different approaches: one that generalizes the Amari method and another based on a direct linearization procedure. These approaches yield consistent predictions, except for one significant difference. The narrow pair is generally unstable, while the broad pair remains stable for small and moderate values of the relative inhibition time.Interestingly, at a critical relative inhibition time, the broad pair typically undergoes a Hopf bifurcation, transitioning into stable breathers. Notably, in our numerical example, the broad pulse pair remains stable even when the inhibition time constant is three times longer than the excitation time constant. Consequently, our model findings contradict the assertion that slow excitation mediated by NMDA-receptors or similar mechanisms is nec- essary for the presence of stable bumps.
dc.identifier.urihttps://repository.cuilahore.edu.pk/handle/123456789/2981
dc.language.isoen_US
dc.publisherLibrary Information Services, CUI Lahore
dc.subjectDr. Muhammad Yousaf
dc.subjectConstructing Numerical Scheme Using Python in Neural Field Model
dc.titleConstructing Numerical Scheme Using Python in Neural Field Model
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Main_thesis_GHQ.pdf
Size:
7.14 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
319 B
Format:
Item-specific license agreed to upon submission
Description: