Search arXivSearch

arXiv · 2511.06286

Multi-scale symmetry analysis in molecular structures

Abstract

Topological data analysis (TDA), as a relatively recent approach, has demonstrated great potential in capturing the intrinsic and robust structural features of complex data. While persistent homology, as a core tool of TDA, focuses on characterizing geometric shapes and topological structures, the automorphism groups of Vietoris-Rips complexes can capture the structured symmetry features of data. In this work, we propose a multi-scale symmetry analysis approach that leverages persistent automorphism modules to quantify variations in symmetries across scales. By modifying the category of graphs and constructing a suitable functor from the graph category to the category of modules, we ensure that the persistent automorphism module forms a genuine persistence module. Furthermore, we apply this framework to the structural analysis of fullerenes, predicting the stability of 12 fullerene molecules with a competitive correlation coefficient of 0.979.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jing-Wen Gao, Yunan He, Jian Liu. 2025-11-09. Multi-scale symmetry analysis in molecular structures. https://arxiv.org/abs/2511.06286

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO