The persistent Laplacian of non-branching complexes
小
中
大
发布日期:2025-11-14 18:07:33
主 讲 人 :董瑞
活动时间:2025-11-17 16:00:00
地 点 :综合楼704 腾讯会议号:121-232-0141,密码: 2025
主办单位:数学科学学院
讲座内容:
Non-branching matrices are real matrices with entries in $\{-1,0,1\}$, where each row contains at most two non-zero entries. Such matrices naturally arise in the study of Laplacians of pseudomanifolds and cubical complexes. We show that a basis for the kernel of a non-branching matrix can be computed in near-linear time. Especially,the basis has the special property that the supports of all the column vectors in it are disjoint with each other. Building on this result, we show that the up persistent Laplacian can be computed in near-linear time for a pair of such spaces and its eigenvalues can be more efficiently computed via computing singular values.
In addition to that,we analyze the arithmetic operations of up persistent Laplacian with respect to a non-branching filtration.Furthermore, we show that the up persistent Laplacian of $q$-non-branching simplicial complexes can be represented as the Laplacian of an associated hypergraph, thus providing a higher-dimensional generalization of the Kron reduction, as well as a Cheeger-type inequality.
主讲人介绍:
董瑞,加拿大韦仕顿大学博士,阿姆斯特丹自由大学博士后,研究方向为拓扑数据分析。
学术活动


