Conley-Morse graphs for a two-dimensional discrete neuron model (low resolution) - Open Research Data - Bridge of Knowledge

Search

Conley-Morse graphs for a two-dimensional discrete neuron model (low resolution)

Description

This dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.

The parameter space a=0.89, b∊[0,0.5], c=0.28, k∊[0.017,0.027] was sampled at the resolution of 200×50. The phase space [−0.1,7.5] × [−1.3,2.7] was sampled at the resolution of 256×256. A collection of isolating neighborhoods that enclose Morse sets in a Morse decomposition was computed for each box of parameters, and a Conley-Morse graph was determined, with the Conley indices of the Morse sets computed where feasible. Clutching graphs between Morse decompositions found for adjacent boxes were also computed, and the parameter space was subdivided into classes of equivalent Morse decompositions, as described in the paper.

The dataset contains the Conley-Morse graphs computed for all the parameter boxes. Each graph is encoded in the text format compatible with the "dot" program from the Graphviz Graph Visualization Software package (https://graphviz.org/). All the text files are compressed together in the zipped archive file. The name of each file is in the format "gn_m.txt", where n,m are the integer coordinates of the box, both starting with 0. For example, in order to obtain a PDF file with the visualization of the graph contained in the file "g12_0.txt" one could run the command "dot g12_0.txt -T pdf -o g12_0.pdf". Each node of the graph contains the information on the corresponding isolating neighborhood of a Morse set: the consecutive number of the neighborhood (starting with 0), the number of boxes comprising the neighborhood, and if a Conley index pair was constructed successfully then additionally the homology of the index pair, followed by the index map at each homology level, and the eigenvalues of the map at each homology level. The nodes have different shapes and colors for easy visual identification of the set type; for example, a yellow box indicates an attractor, and a cyan-filled oval stands for an isolating neighborhood with a non-trivial exit set. The directed edges between the nodes show direct connections between the sets (the transitive reduction should be taken for the full set of possible connections).

An interactive browser of all the Conley-Morse graphs and phase space portraits of the Morse decompositions provided in the current series of datasets is available at the address https://www.pawelpilarczyk.com/neuron/.

Dataset file

neuron25c.zip
2.8 MB, S3 ETag db4d213dcddf4986c3cd9b0ed3937c9f-1, downloads: 52
The file hash is calculated from the formula
hexmd5(md5(part1)+md5(part2)+...)-{parts_count} where a single part of the file is 512 MB in size.

Example script for calculation:
https://github.com/antespi/s3md5
download file neuron25c.zip

File details

License:
Creative Commons: by 4.0 open in new tab
CC BY
Attribution
Software:
GraphViz

Details

Year of publication:
2023
Verification date:
2023-01-16
Dataset language:
English
Fields of science:
  • mathematics (Natural sciences)
  • biological sciences (Natural sciences)
DOI:
DOI ID 10.34808/5b59-ha87 open in new tab
Funding:
Series:
Verified by:
Gdańsk University of Technology

Keywords

Cite as

seen 138 times