International Symposium on Computational Geometry最新文献

筛选
英文 中文
A generalization of the persistent Laplacian to simplicial maps 持久拉普拉斯映射到简单映射的推广
International Symposium on Computational Geometry Pub Date : 2023-02-07 DOI: 10.48550/arXiv.2302.03771
Aziz Burak Gulen, Facundo M'emoli, Zhengchao Wan, Yusu Wang
{"title":"A generalization of the persistent Laplacian to simplicial maps","authors":"Aziz Burak Gulen, Facundo M'emoli, Zhengchao Wan, Yusu Wang","doi":"10.48550/arXiv.2302.03771","DOIUrl":"https://doi.org/10.48550/arXiv.2302.03771","url":null,"abstract":"The graph Laplacian is a fundamental object in the analysis of and optimization on graphs. This operator can be extended to a simplicial complex $K$ and therefore offers a way to perform ``signal processing\"on $p$-(co)chains of $K$. Recently, the concept of persistent Laplacian was proposed and studied for a pair of simplicial complexes $Khookrightarrow L$ connected by an inclusion relation, further broadening the use of Laplace-based operators. In this paper, we expand the scope of the persistent Laplacian by generalizing it to a pair of simplicial complexes connected by a simplicial map $f: K to L$. Such simplicial map setting arises frequently, e.g., when relating a coarsened simplicial representation with an original representation, or the case when the two simplicial complexes are spanned by different point sets i.e. cases in which it does not hold that $Ksubset L$. However, the simplicial map setting is more challenging than the inclusion setting since the underlying algebraic structure is more complicated. We present a natural generalization of the persistent Laplacian to the simplicial setting. To shed insight on the structure behind it, as well as to develop an algorithm to compute it, we exploit the relationship between the persistent Laplacian and the Schur complement of a matrix. A critical step is to view the Schur complement as a functorial way of restricting a self-adjoint PSD operator to a given subspace. As a consequence, we prove that persistent Betti numbers of a simplicial map can be recovered by persistent Laplacians. We then propose an algorithm for finding the matrix representations of persistent Laplacians which in turn yields a new algorithm for computing persistent Betti numbers of a simplicial map. Finally, we study the persistent Laplacian on simplicial towers under simplicial maps and establish monotonicity results for their eigenvalues.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130585316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
On Helly Numbers of Exponential Lattices 关于指数格的Helly数
International Symposium on Computational Geometry Pub Date : 2023-01-11 DOI: 10.4230/LIPIcs.SoCG.2023.8
Gergely Ambrus, M. Balko, Nóra Frankl, A. Jung, M'arton Nasz'odi
{"title":"On Helly Numbers of Exponential Lattices","authors":"Gergely Ambrus, M. Balko, Nóra Frankl, A. Jung, M'arton Nasz'odi","doi":"10.4230/LIPIcs.SoCG.2023.8","DOIUrl":"https://doi.org/10.4230/LIPIcs.SoCG.2023.8","url":null,"abstract":"Given a set $S subseteq mathbb{R}^2$, define the emph{Helly number of $S$}, denoted by $H(S)$, as the smallest positive integer $N$, if it exists, for which the following statement is true: for any finite family $mathcal{F}$ of convex sets in~$mathbb{R}^2$ such that the intersection of any $N$ or fewer members of~$mathcal{F}$ contains at least one point of $S$, there is a point of $S$ common to all members of $mathcal{F}$. We prove that the Helly numbers of emph{exponential lattices} ${alpha^n colon n in mathbb{N}_0}^2$ are finite for every $alpha>1$ and we determine their exact values in some instances. In particular, we obtain $H({2^n colon n in mathbb{N}_0}^2)=5$, solving a problem posed by Dillon (2021). For real numbers $alpha, beta>1$, we also fully characterize exponential lattices $L(alpha,beta) = {alpha^n colon n in mathbb{N}_0} times {beta^n colon n in mathbb{N}_0}$ with finite Helly numbers by showing that $H(L(alpha,beta))$ is finite if and only if $log_alpha(beta)$ is rational.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124399220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computing a Dirichlet domain for a hyperbolic surface 计算双曲曲面的狄利克雷定义域
International Symposium on Computational Geometry Pub Date : 2022-12-04 DOI: 10.48550/arXiv.2212.01934
V. Despr'e, Benedikt Kolbe, H. Parlier, M. Teillaud
{"title":"Computing a Dirichlet domain for a hyperbolic surface","authors":"V. Despr'e, Benedikt Kolbe, H. Parlier, M. Teillaud","doi":"10.48550/arXiv.2212.01934","DOIUrl":"https://doi.org/10.48550/arXiv.2212.01934","url":null,"abstract":"The goal of this paper is to exhibit and analyze an algorithm that takes a given closed orientable hyperbolic surface and outputs an explicit Dirichlet domain. The input is a fundamental polygon with side pairings. While grounded in topological considerations, the algorithm makes key use of the geometry of the surface. We introduce data structures that reflect this interplay between geometry and topology and show that the algorithm finishes in polynomial time, in terms of the initial perimeter and the genus of the surface.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122504756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
On Higher Dimensional Point Sets in General Position 一般位置上的高维点集
International Symposium on Computational Geometry Pub Date : 2022-11-29 DOI: 10.4230/LIPIcs.SoCG.2023.59
Andrew Suk, Jinlong Zeng
{"title":"On Higher Dimensional Point Sets in General Position","authors":"Andrew Suk, Jinlong Zeng","doi":"10.4230/LIPIcs.SoCG.2023.59","DOIUrl":"https://doi.org/10.4230/LIPIcs.SoCG.2023.59","url":null,"abstract":"A finite point set in $mathbb{R}^d$ is in general position if no $d + 1$ points lie on a common hyperplane. Let $alpha_d(N)$ be the largest integer such that any set of $N$ points in $mathbb{R}^d$ with no $d + 2$ members on a common hyperplane, contains a subset of size $alpha_d(N)$ in general position. Using the method of hypergraph containers, Balogh and Solymosi showed that $alpha_2(N)<N^{5/6 + o(1)}$. In this paper, we also use the container method to obtain new upper bounds for $alpha_d(N)$ when $d geq 3$. More precisely, we show that if $d$ is odd, then $alpha_d(N)<N^{frac{1}{2} + frac{1}{2d} + o(1)}$, and if $d$ is even, we have $alpha_d(N)<N^{frac{1}{2} + frac{1}{d-1} + o(1)}$. We also study the classical problem of determining the maximum number $a(d,k,n)$ of points selected from the grid $[n]^d$ such that no $k + 2$ members lie on a $k$-flat. For fixed $d$ and $k$, we show that begin{equation*} a(d,k,n)leq Oleft(n^{frac{d}{2lfloor (k+2)/4rfloor}(1-frac{1}{2lfloor(k+2)/4rfloor d+1})}right), end{equation*} which improves the previously best known bound of $Oleft(n^{frac{d}{lfloor (k + 2)/2rfloor}}right)$ due to Lefmann when $k+2$ is congruent to 0 or 1 mod 4.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122147164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
The Christoffel-Darboux kernel for topological data analysis 拓扑数据分析的Christoffel-Darboux核
International Symposium on Computational Geometry Pub Date : 2022-11-28 DOI: 10.48550/arXiv.2211.15489
Pepijn Roos Hoefgeest, Lucas Slot
{"title":"The Christoffel-Darboux kernel for topological data analysis","authors":"Pepijn Roos Hoefgeest, Lucas Slot","doi":"10.48550/arXiv.2211.15489","DOIUrl":"https://doi.org/10.48550/arXiv.2211.15489","url":null,"abstract":"Persistent homology has been widely used to study the topology of point clouds in $mathbb{R}^n$. Standard approaches are very sensitive to outliers, and their computational complexity depends badly on the number of data points. In this paper we introduce a novel persistence module for a point cloud using the theory of Christoffel-Darboux kernels. This module is robust to (statistical) outliers in the data, and can be computed in time linear in the number of data points. We illustrate the benefits and limitations of our new module with various numerical examples in $mathbb{R}^n$, for $n=1, 2, 3$. Our work expands upon recent applications of Christoffel-Darboux kernels in the context of statistical data analysis and geometric inference (Lasserre, Pauwels and Putinar, 2022). There, these kernels are used to construct a polynomial whose level sets capture the geometry of a point cloud in a precise sense. We show that the persistent homology associated to the sublevel set filtration of this polynomial is stable with respect to the Wasserstein distance. Moreover, we show that the persistent homology of this filtration can be computed in singly exponential time in the ambient dimension $n$, using a recent algorithm of Basu&Karisani (2022).","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116614529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings 基于局域敏感排序的标记近邻搜索和度量扳手
International Symposium on Computational Geometry Pub Date : 2022-11-21 DOI: 10.48550/arXiv.2211.11846
Arnold Filtser
{"title":"Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive Orderings","authors":"Arnold Filtser","doi":"10.48550/arXiv.2211.11846","DOIUrl":"https://doi.org/10.48550/arXiv.2211.11846","url":null,"abstract":"Chan, Har-Peled, and Jones [SICOMP 2020] developed locality-sensitive orderings (LSO) for Euclidean space. A $(tau,rho)$-LSO is a collection $Sigma$ of orderings such that for every $x,yinmathbb{R}^d$ there is an ordering $sigmainSigma$, where all the points between $x$ and $y$ w.r.t. $sigma$ are in the $rho$-neighborhood of either $x$ or $y$. In essence, LSO allow one to reduce problems to the $1$-dimensional line. Later, Filtser and Le [STOC 2022] developed LSO's for doubling metrics, general metric spaces, and minor free graphs. For Euclidean and doubling spaces, the number of orderings in the LSO is exponential in the dimension, which made them mainly useful for the low dimensional regime. In this paper, we develop new LSO's for Euclidean, $ell_p$, and doubling spaces that allow us to trade larger stretch for a much smaller number of orderings. We then use our new LSO's (as well as the previous ones) to construct path reporting low hop spanners, fault tolerant spanners, reliable spanners, and light spanners for different metric spaces. While many nearest neighbor search (NNS) data structures were constructed for metric spaces with implicit distance representations (where the distance between two metric points can be computed using their names, e.g. Euclidean space), for other spaces almost nothing is known. In this paper we initiate the study of the labeled NNS problem, where one is allowed to artificially assign labels (short names) to metric points. We use LSO's to construct efficient labeled NNS data structures in this model.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134165255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Reconfiguration of colorings in triangulations of the sphere 球体三角形中着色的重新配置
International Symposium on Computational Geometry Pub Date : 2022-10-31 DOI: 10.48550/arXiv.2210.17105
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Y. Okamoto, K. Ozeki
{"title":"Reconfiguration of colorings in triangulations of the sphere","authors":"Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Y. Okamoto, K. Ozeki","doi":"10.48550/arXiv.2210.17105","DOIUrl":"https://doi.org/10.48550/arXiv.2210.17105","url":null,"abstract":"In 1973, Fisk proved that any $4$-coloring of a $3$-colorable triangulation of the $2$-sphere can be obtained from any $3$-coloring by a sequence of Kempe-changes. On the other hand, in the case where we are only allowed to recolor a single vertex in each step, which is a special case of a Kempe-change, there exists a $4$-coloring that cannot be obtained from any $3$-coloring. In this paper, we present a characterization of a $4$-coloring of a $3$-colorable triangulation of the $2$-sphere that can be obtained from a $3$-coloring by a sequence of recoloring operations at single vertices, and a criterion for a $3$-colorable triangulation of the $2$-sphere that all $4$-colorings can be obtained from a $3$-coloring by such a sequence. Moreover, our first result can be generalized to a high-dimensional case, in which ``$4$-coloring,'' ``$3$-colorable,'' and ``$2$-sphere'' above are replaced with ``$k$-coloring,'' ``$(k-1)$-colorable,'' and ``$(k-2)$-sphere'' for $k geq 4$, respectively. In addition, we show that the problem of deciding whether, for given two $(k+1)$-colorings, one can be obtained from the other by such a sequence is PSPACE-complete for any fixed $k geq 4$. Our results above can be rephrased as new results on the computational problems named {sc $k$-Recoloring} and {sc Connectedness of $k$-Coloring Reconfiguration Graph}, which are fundamental problems in the field of combinatorial reconfiguration.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122810284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ephemeral Persistence Features and the Stability of Filtered Chain Complexes 过滤链配合物的短暂持久性特征和稳定性
International Symposium on Computational Geometry Pub Date : 2022-08-24 DOI: 10.4230/LIPIcs.SoCG.2023.51
Facundo M'emoli, Ling Zhou
{"title":"Ephemeral Persistence Features and the Stability of Filtered Chain Complexes","authors":"Facundo M'emoli, Ling Zhou","doi":"10.4230/LIPIcs.SoCG.2023.51","DOIUrl":"https://doi.org/10.4230/LIPIcs.SoCG.2023.51","url":null,"abstract":"We strengthen the usual stability theorem for Vietoris-Rips (VR) persistent homology of finite metric spaces by building upon constructions due to Usher and Zhang in the context of filtered chain complexes. The information present at the level of filtered chain complexes includes points with zero persistence which provide additional information to that present at homology level. The resulting invariant, called verbose barcode, which has a stronger discriminating power than the usual barcode, is proved to be stable under certain metrics which are sensitive to these ephemeral points. We also exhibit several examples of finite metric spaces with identical (standard) VR barcodes yet with different verbose VR barcodes thus confirming that these ephemeral points strengthen the standard VR barcode.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115374952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Random Projections for Curves in High Dimensions 高维曲线的随机投影
International Symposium on Computational Geometry Pub Date : 2022-07-15 DOI: 10.4230/LIPIcs.SoCG.2023.53
I. Psarros, Dennis Rohde
{"title":"Random Projections for Curves in High Dimensions","authors":"I. Psarros, Dennis Rohde","doi":"10.4230/LIPIcs.SoCG.2023.53","DOIUrl":"https://doi.org/10.4230/LIPIcs.SoCG.2023.53","url":null,"abstract":"Modern time series analysis requires the ability to handle datasets that are inherently high-dimensional; examples include applications in climatology, where measurements from numerous sensors must be taken into account, or inventory tracking of large shops, where the dimension is defined by the number of tracked items. The standard way to mitigate computational issues arising from the high dimensionality of the data is by applying some dimension reduction technique that preserves the structural properties of the ambient space. The dissimilarity between two time series is often measured by ``discrete'' notions of distance, e.g. the dynamic time warping or the discrete Fr'echet distance. Since all these distance functions are computed directly on the points of a time series, they are sensitive to different sampling rates or gaps. The continuous Fr'echet distance offers a popular alternative which aims to alleviate this by taking into account all points on the polygonal curve obtained by linearly interpolating between any two consecutive points in a sequence. We study the ability of random projections `a la Johnson and Lindenstrauss to preserve the continuous Fr'echet distance of polygonal curves by effectively reducing the dimension. In particular, we show that one can reduce the dimension to $O(epsilon^{-2} log N)$, where $N$ is the total number of input points while preserving the continuous Fr'echet distance between any two determined polygonal curves within a factor of $1pm epsilon$. We conclude with applications on clustering.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122924101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fiberwise dimensionality reduction of topologically complex data with vector bundles 具有向量束的拓扑复杂数据的光纤降维
International Symposium on Computational Geometry Pub Date : 2022-06-13 DOI: 10.48550/arXiv.2206.06513
Luis Scoccola, Jose A. Perea
{"title":"Fiberwise dimensionality reduction of topologically complex data with vector bundles","authors":"Luis Scoccola, Jose A. Perea","doi":"10.48550/arXiv.2206.06513","DOIUrl":"https://doi.org/10.48550/arXiv.2206.06513","url":null,"abstract":"Datasets with non-trivial large scale topology can be hard to embed in low-dimensional Euclidean space with existing dimensionality reduction algorithms. We propose to model topologically complex datasets using vector bundles, in such a way that the base space accounts for the large scale topology, while the fibers account for the local geometry. This allows one to reduce the dimensionality of the fibers, while preserving the large scale topology. We formalize this point of view, and, as an application, we describe an algorithm which takes as input a dataset together with an initial representation of it in Euclidean space, assumed to recover part of its large scale topology, and outputs a new representation that integrates local representations, obtained through local linear dimensionality reduction, along the initial global representation. We demonstrate this algorithm on examples coming from dynamical systems and chemistry. In these examples, our algorithm is able to learn topologically faithful embeddings of the data in lower target dimension than various well known metric-based dimensionality reduction algorithms.","PeriodicalId":413611,"journal":{"name":"International Symposium on Computational Geometry","volume":"566 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120846099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书