Searcharxiv⌕ Search

arXiv subjects

İsmail Güzel

Publications and source records attributed to İsmail Güzel.

7 recordsLinked to original sources

Persistent Homology of Time Series through Complex Networks

We present a unified pipeline for univariate time series classification via complex networks and persistent homology. A time series is mapped to a graph through one of five constructions across three families (visibility (natural and horizontal visibility graphs), transition, and proximity) and the graph is converted to a dissimilarity matrix from which a Vietoris-Rips filtration yields persistence diagrams. These diagrams are vectorized into fixed-length features through persistence landscapes and topological summary statistics. By standardizing the downstream processing, differences in classification performance are attributable to the network construction and distance metric alone. Experiments on twelve UCR benchmarks show that (i) no single construction dominates: the optimal graph type depends on the signal's discriminative structure; (ii) the graph distance metric is a first-order design choice, with diffusion distance uniformly outperforming shortest-path alternatives; and (iii) persistence-based features degrade gracefully under noise, consistent with the classical stability theorem of persistent homology.

math.AT↗

Robust Short-Term OEE Forecasting in Industry 4.0 via Topological Data Analysis

In Industry 4.0 manufacturing environments, forecasting Overall Equipment Efficiency (OEE) is critical for data-driven operational control and predictive maintenance. However, the highly volatile and nonlinear nature of OEE time series--particularly in complex production lines and hydraulic press systems--limits the effectiveness of forecasting. This study proposes a novel informational framework that leverages Topological Data Analysis (TDA) to transform raw OEE data into structured engineering knowledge for production management. The framework models hourly OEE data from production lines and systems using persistent homology to extract large-scale topological features that characterize intrinsic operational behaviors. These features are integrated into a SARIMAX (Seasonal Autoregressive Integrated Moving Average with Exogenous Regressors) architecture, where TDA components serve as exogenous variables to capture latent temporal structures. Experimental results demonstrate forecasting accuracy improvements of at least 17% over standard seasonal benchmarks, with Heat Kernel-based features consistently identified as the most effective predictors. The proposed framework was deployed in a Global Lighthouse Network manufacturing facility, providing a new strategic layer for production management and achieving a 7.4% improvement in total OEE. This research contributes a formal methodology for embedding topological signatures into classical stochastic models to enhance decision-making in knowledge-intensive production systems.

stat.AP↗

Persistent Homology, Matroids and Cobordisms

The homological information about a filtered simplicial complex over the poset of positive real numbers is often presented by a barcode which depicts the evolution of the associated Betti numbers. However, there is a wonderfully complex combinatorics associated with the homology classes of a filtered complex, and one can do more than just counting them over the index poset. Here, we show that this combinatorial information can be encoded by filtered matroids, or even better, by rooted forests. We also show that these rooted forests can be realized as cobordisms.

math.AT↗

Detecting bifurcations in dynamical systems with CROCKER plots

Existing tools for bifurcation detection from signals of dynamical systems typically are either limited to a special class of systems, or they require carefully chosen input parameters, and significant expertise to interpret the results. Therefore, we describe an alternative method based on persistent homology -- a tool from Topological Data Analysis (TDA) -- that utilizes Betti numbers and CROCKER plots. Betti numbers are topological invariants of topological spaces, while the CROCKER plot is a coarsened but easy to visualize data representation of a one-parameter varying family of persistence barcodes. The specific bifurcations we investigate are transitions from periodic to chaotic behavior or vice versa in a one-parameter family of differential equations. We validate our methods using numerical experiments on ten dynamical systems and contrast the results with existing tools that use the maximum Lyapunov exponent. We further prove the relationship between the Wasserstein distance to the empty diagram and the norm of the Betti vector, which shows that an even more simplified version of the information has the potential to provide insight into the bifurcation parameter. The results show that our approach reveals more information about the shape of the periodic attractor than standard tools, and it has more favorable computational time in comparison to the Rosenstein algorithm for computing the Lyapunov exponent from time series.

math.DS↗

Classification of Stochastic Processes with Topological Data Analysis

In this study, we examine if engineered topological features can distinguish time series sampled from different stochastic processes with different noise characteristics, in both balanced and unbalanced sampling schemes. We compare our classification results against the results of the same classification tasks built on statistical and raw features. We conclude that in classification tasks of time series, different machine learning models built on engineered topological features perform consistently better than those built on standard statistical and raw features.

stat.ML↗

A Case Study on Identifying Bifurcation and Chaos with CROCKER Plots

The CROCKER plot is a coarsened but easy to visualize representation of the data in a one-parameter varying family of persistence barcodes. In this paper, we use the CROCKER plot to view changes in the persistence under a varying bifurcation parameter. We perform experiments to support our methods using the Rössler and Lorenz system and show the relationship with common methods for bifurcation analysis such as the Lyapunov exponent.

math.DS↗

A New Non-archimedean Metric on Persistent Homology

In this article, we define a new non-archimedean metric structure, called cophenetic metric, on persistent homology classes of all degrees. We then show that zeroth persistent homology together with the cophenetic metric and hierarchical clustering algorithms with a number of different metrics do deliver statistically verifiable commensurate topological information based on experimental results we obtained on different datasets. We also observe that the resulting clusters coming from cophenetic distance do shine in terms of different evaluation measures such as silhouette score and the Rand index. Moreover, since the cophenetic metric is defined for all homology degrees, one can now display the inter-relations of persistent homology classes in all degrees via rooted trees.

math.AT↗