Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > q-bio > arXiv:2509.16908

Help | Advanced Search

Quantitative Biology > Quantitative Methods

arXiv:2509.16908 (q-bio)
[Submitted on 21 Sep 2025 ]

Title: Discrete Heat Kernels on Simplicial Complexes and Its Application to Functional Brain Networks

Title: 离散热核在单纯复形上的应用及其在功能脑网络中的应用

Authors:Sixtus Dakurah
Abstract: Networks constitute fundamental organizational structures across biological systems, although conventional graph-theoretic analyses capture exclusively pairwise interactions, thereby omitting the intricate higher-order relationships that characterize network complexity. This work proposes a unified framework for heat kernel smoothing on simplicial complexes, extending classical signal processing methodologies from vertices and edges to cycles and higher-dimensional structures. Through Hodge Laplacian, a discrete heat kernel on a finite simplicial complex $\mathcal{K}$ is constructed to smooth signals on $k$-simplices via the boundary operator $\partial_k$. Computationally efficient sparse algorithms for constructing boundary operators are developed to implement linear diffusion processes on $k$-simplices. The methodology generalizes heat kernel smoothing to $k$-simplices, utilizing boundary structure to localize topological features while maintaining homological invariance. Simulation studies demonstrate qualitative signal enhancement across vertex and edge domains following diffusion processes. Application to parcellated human brain functional connectivity networks reveals that simplex-space smoothing attenuates spurious connections while amplifying coherent anatomical architectures, establishing practical significance for computational neuroscience applications.
Abstract: 网络在生物系统中构成了基本的组织结构,尽管传统的图论分析仅捕捉成对相互作用,从而忽略了表征网络复杂性的复杂高阶关系。 本工作提出了一种统一的框架,用于单纯复形上的热核平滑,将经典的信号处理方法从顶点和边扩展到循环和高维结构。 通过霍奇拉普拉斯算子,在有限单纯复形$\mathcal{K}$上构建了一个离散的热核,通过边界算子$\partial_k$在$k$-单形上平滑信号。 开发了计算高效的稀疏算法来构建边界算子,以在$k$-单形上实现线性扩散过程。 该方法将热核平滑推广到$k$-单形,利用边界结构来定位拓扑特征,同时保持同调不变性。 模拟研究显示,在扩散过程之后,顶点和边域中的信号质量得到定性增强。 应用于分块的人类大脑功能连接网络表明,单形空间平滑减少了虚假连接,同时增强了连贯的解剖结构,为计算神经科学应用建立了实际意义。
Subjects: Quantitative Methods (q-bio.QM) ; Neurons and Cognition (q-bio.NC)
Cite as: arXiv:2509.16908 [q-bio.QM]
  (or arXiv:2509.16908v1 [q-bio.QM] for this version)
  https://doi.org/10.48550/arXiv.2509.16908
arXiv-issued DOI via DataCite

Submission history

From: Sixtus Dakurah [view email]
[v1] Sun, 21 Sep 2025 04:00:49 UTC (45,013 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
q-bio.QM
< prev   |   next >
new | recent | 2025-09
Change to browse by:
q-bio
q-bio.NC

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号