Shortest Paths in a Weighted Simplicial Complex
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915671947870208 |
|---|---|
| author | Chakraborty, Sukrit Choudhury, Prasanta Mukherjee, Arindam |
| author_facet | Chakraborty, Sukrit Choudhury, Prasanta Mukherjee, Arindam |
| contents | Simplicial complexes are extensively studied in the field of algebraic topology. They have gained attention in recent time due to their applications in fields like theoretical distributed computing and simplicial neural networks. Graphs are mono-dimensional simplicial complex. Graph theory has application in topics like theoretical computer science, operations research, bioinformatics and social sciences. This makes it natural to try to adapt graph-theoretic results for simplicial complexes, which can model more intricate and detailed structures appearing in real-world systems. Though seemingly obvious, we did not find any previous work that looked into this prospect of simplicial complexes.
In this article, we define the concept of weighted simplicial complex and $d$-path in a simplicial complex. Both these concepts have the potential to have numerous real-life applications. We start by adapting the Depth-First Search and Breadth-First Search algorithms for our setup. Next, we provide two novel algorithms to find the shortest paths in a weighted simplicial complex. The core principles of our algorithms align with those of Dijkstra$^\prime$s algorithm and Bellman-Ford algorithm for graphs. Hence, this work lays a building block for the sake of integrating graph-theoretic concepts with abstract simplicial complexes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_12921 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Shortest Paths in a Weighted Simplicial Complex Chakraborty, Sukrit Choudhury, Prasanta Mukherjee, Arindam Discrete Mathematics 68R01, 68R10, 68Q25, 68W01 Simplicial complexes are extensively studied in the field of algebraic topology. They have gained attention in recent time due to their applications in fields like theoretical distributed computing and simplicial neural networks. Graphs are mono-dimensional simplicial complex. Graph theory has application in topics like theoretical computer science, operations research, bioinformatics and social sciences. This makes it natural to try to adapt graph-theoretic results for simplicial complexes, which can model more intricate and detailed structures appearing in real-world systems. Though seemingly obvious, we did not find any previous work that looked into this prospect of simplicial complexes. In this article, we define the concept of weighted simplicial complex and $d$-path in a simplicial complex. Both these concepts have the potential to have numerous real-life applications. We start by adapting the Depth-First Search and Breadth-First Search algorithms for our setup. Next, we provide two novel algorithms to find the shortest paths in a weighted simplicial complex. The core principles of our algorithms align with those of Dijkstra$^\prime$s algorithm and Bellman-Ford algorithm for graphs. Hence, this work lays a building block for the sake of integrating graph-theoretic concepts with abstract simplicial complexes. |
| title | Shortest Paths in a Weighted Simplicial Complex |
| topic | Discrete Mathematics 68R01, 68R10, 68Q25, 68W01 |
| url | https://arxiv.org/abs/2506.12921 |