Reservoir performance is optimized by modifying minimal representative cycles of one-dimensional GLMY homology groups, with results showing joint influence from network structure and data periodicity.
Homotopy theory for digraphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy invariance of homologies of digraphs and the relation between the fundamental group of the digraph and its first homology group. The category of (undirected) graphs can be identified by a natural way with a full subcategory of digraphs. Thus we obtain also consistent homology and homotopy theories for graphs. Note that the homotopy theory for graphs coincides with the one constructed in the paper of Babson et.
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Topology Structure Optimization of Reservoirs Using GLMY Homology
Reservoir performance is optimized by modifying minimal representative cycles of one-dimensional GLMY homology groups, with results showing joint influence from network structure and data periodicity.