Homomorphisms of connectome graphs
Peteris Daugulis
TL;DR
This paper explores homomorphisms of connectome graphs, focusing on elementary fold operations that identify vertex pairs, and presents initial computational results for specific connectome graphs.
Contribution
It introduces a framework for studying connectome graph homomorphisms through elementary folds and defines various fold types, providing initial computational insights.
Findings
Defined several types of elementary folds.
Presented initial computational results for connectome graphs.
Established a basis for further analysis of connectome homomorphisms.
Abstract
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some connectome graphs are described.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Interconnection Networks and Systems · Graph theory and applications