arXiv subjects

Sunia Tanweer

Publications and source records attributed to Sunia Tanweer.

10 recordsLinked to original sources

arXiv2026

P-Bifurcations in Stochastic Flutter Model Under Turbulence

Aeroelastic flutter represents a critical nonlinear instability arising from the coupling between structural elasticity and unsteady aerodynamics. In deterministic settings, flutter onset is associated with bifurcations of invariant sets such as equilibria or limit cycles. However, under stochastic excitation, long-time system behavior is better described in terms of stationary probability distributions rather than trajectory-based attractors. In this work, we present a topology-based framework to detect stochastic (P-)bifurcations in a two-degree-of-freedom aeroelastic system with structural nonlinearity. The method operates on high-dimensional stationary distributions reconstructed via kernel density estimation (KDE) and characterizes their structure using persistent homology. We compare bifurcation behavior across three excitation models: sinusoidal perturbations, Dryden turbulence, and von Karman turbulence. While conventional time-domain and phase-space analyses reveal only modest differences between these models, the proposed homological bifurcation plots detect consistent shifts in bifurcation onset and topological structure. The approach enables automated and scalable analysis of stochastic bifurcations in complex dynamical systems.

physics.flu-dyn↗

arXiv2026

Asymmetrically Weighted Dowker Persistence and Applications in Dynamical Systems

By their nature it is difficult to differentiate chaotic dynamical systems through measurement. In recent years, work has begun on using methods of Topological Data Analysis (TDA) to qualitatively type dynamical data by approximating the topology of the underlying attracting set. This comes with the additional challenges of high dimensionality incurring computational complexity along with the lack of directional information encoded in the approximated topology. Due to the latter fact, standard methods of TDA for this high dimensional dynamical data do not differentiate between periodic cycles and non-periodic cycles in the attractor. We present a framework to address both of these challenges. We begin by binning the dynamical data, and capturing the sequential information in the form of a coarse-grained weighted and directed network. We then calculate the persistent Dowker homology of the asymmetric network, encoding spatial and temporal information. Analytically, we highlight the differences in periodic and non-periodic cycles by providing a full characterization of their one-dimensional Dowker persistences. We prove how the homologies of graph wedge sums can be described in terms of the wedge component homologies. Finally, we generalize our characterization to cactus graphs with arbitrary edge weights and orientations. Our analytical results give insight into how our method captures temporal information in its asymmetry, producing a persistence framework robust to noise and sensitive to dynamical structure.

math.AT↗

arXiv2026

Classification of Epileptic iEEG using Topological Machine Learning

Epileptic seizure detection from EEG signals remains challenging due to the high dimensionality and nonlinear, potentially stochastic, dynamics of neural activity. In this work, we investigate whether features derived from topological data analysis (TDA) can improve the classification of brain states in preictal, ictal and interictal iEEG recordings from epilepsy patients using multichannel data. We analyze data from 55 patients, significantly larger than many previous studies that rely on patient-specific models. Persistence diagrams derived from iEEG signals are vectorized using several TDA representations, including Carlsson coordinates, persistence images, and template functions. To understand how topological representations interact with modern machine learning pipelines, we conduct a large-scale ablation study across multiple iEEG frequency bands, dimensionality reduction techniques, feature representations, and classifier architectures. Our experiments show that dimension-reduced topological representations achieve up to 80\% balanced accuracy for three-class classification. Interestingly, classical machine learning models perform comparably to deep learning models, achieving up to 79.17\% balanced accuracy, suggesting that carefully designed topological features can substantially reduce model complexity requirements. In contrast, pipelines preserving the full multichannel feature structure exhibit severe overfitting due to the high-dimensional feature space. These findings highlight the importance of structure-preserving dimensionality reduction when applying topology-based representations to multichannel neural data.

cs.LG↗

arXiv2026

Topological Signatures of ReLU Neural Network Activation Patterns

This paper explores the topological signatures of ReLU neural network activation patterns. We consider feedforward neural networks with ReLU activation functions and analyze the polytope decomposition of the feature space induced by the network. Mainly, we investigate how the Fiedler partition of the dual graph and show that it appears to correlate with the decision boundary -- in the case of binary classification. Additionally, we compute the homology of the cellular decomposition -- in a regression task -- to draw similar patterns in behavior between the training loss and polyhedral cell-count, as the model is trained.

cs.LG↗

arXiv2026

Detecting Stochasticity in Discrete Signals via Nonparametric Excursion Theorem

We develop a practical framework for distinguishing diffusive stochastic processes from deterministic signals using only a single discrete time series. Our approach is based on classical excursion and crossing theorems for continuous semimartingales, which correlates number $N_\varepsilon$ of excursions of magnitude at least $\varepsilon$ with the quadratic variation $[X]_T$ of the process. The scaling law holds universally for all continuous semimartingales with finite quadratic variation, including general Ito diffusions with nonlinear or state-dependent volatility, but fails sharply for deterministic systems -- thereby providing a theoretically-certfied method of distinguishing between these dynamics, as opposed to the subjective entropy or recurrence based state of the art methods. We construct a robust data-driven diffusion test. The method compares the empirical excursion counts against the theoretical expectation. The resulting ratio $K(\varepsilon)=N_{\varepsilon}^{\mathrm{emp}}/N_{\varepsilon}^{\mathrm{theory}}$ is then summarized by a log-log slope deviation measuring the $\varepsilon^{-2}$ law that provides a classification into diffusion-like or not. We demonstrate the method on canonical stochastic systems, some periodic and chaotic maps and systems with additive white noise, as well as the stochastic Duffing system. The approach is nonparametric, model-free, and relies only on the universal small-scale structure of continuous semimartingales.

stat.ML↗

arXiv2025

Unsupervised Learning of Density Estimates with Topological Optimization

Kernel density estimation is a key component of a wide variety of algorithms in machine learning, Bayesian inference, stochastic dynamics and signal processing. However, the unsupervised density estimation technique requires tuning a crucial hyperparameter: the kernel bandwidth. The choice of bandwidth is critical as it controls the bias-variance trade-off by over- or under-smoothing the topological features. Topological data analysis provides methods to mathematically quantify topological characteristics, such as connected components, loops, voids et cetera, even in high dimensions where visualization of density estimates is impossible. In this paper, we propose an unsupervised learning approach using a topology-based loss function for the automated and unsupervised selection of the optimal bandwidth and benchmark it against classical techniques -- demonstrating its potential across different dimensions.

cs.LG↗

arXiv2025

Use of Topological Data Analysis for the Detection of Phenomenological Bifurcations in Stochastic Epidemiological Models

We investigate predictions of stochastic compartmental models on the severity of disease outbreaks. The models we consider are the Susceptible-Infected-Susceptible (SIS) for bacterial infections, and the Susceptible -Infected-Removed (SIR) for airborne diseases. Stochasticity enters the compartmental models as random fluctuations of the contact rate, to account for uncertainties in the disease spread. We consider three types of noise to model the random fluctuations: the Gaussian white and Ornstein-Uhlenbeck noises, and the logarithmic Ornstein-Uhlenbeck (logOU). The advantages of logOU noise are its positivity and its ability to model the presence of superspreaders. We utilize homological bifurcation plots from Topological Data Analysis to automatically determine the shape of the long-time distributions of the number of infected for the SIS, and removed for the SIR model, over a range of basic reproduction numbers and relative noise intensities. LogOU noise results in distributions that stay close to the endemic deterministic equilibrium even for high noise intensities. For low reproduction rates and increasing intensity, the distribution peak shifts towards zero, that is, disease eradication, for all three noises; for logOU noise the shift is the slowest. Our study underlines the sensitivity of model predictions to the type of noise considered in contact rate.

q-bio.QM↗

arXiv2024

Topological Detection of Phenomenological Bifurcations with Unreliable Kernel Densities

Phenomenological (P-type) bifurcations are qualitative changes in stochastic dynamical systems whereby the stationary probability density function (PDF) changes its topology. The current state of the art for detecting these bifurcations requires reliable kernel density estimates computed from an ensemble of system realizations. However, in several real world signals such as Big Data, only a single system realization is available -- making it impossible to estimate a reliable kernel density. This study presents an approach for detecting P-type bifurcations using unreliable density estimates. The approach creates an ensemble of objects from Topological Data Analysis (TDA) called persistence diagrams from the system's sole realization and statistically analyzes the resulting set. We compare several methods for replicating the original persistence diagram including Gibbs point process modelling, Pairwise Interaction Point Modelling, and subsampling. We show that for the purpose of predicting a bifurcation, the simple method of subsampling exceeds the other two methods of point process modelling in performance.

math.AT↗

arXiv2023

A Topological Framework for Identifying Phenomenological Bifurcations in Stochastic Dynamical Systems

Changes in the parameters of dynamical systems can cause the state of the system to shift between different qualitative regimes. These shifts, known as bifurcations, are critical to study as they can indicate when the system is about to undergo harmful changes in its behavior. In stochastic dynamical systems, there is particular interest in P-type (phenomenological) bifurcations, which can include transitions from a mono-stable state to multi-stable states, the appearance of stochastic limit cycles, and other features in the probability density function (PDF) of the system's state. Current practices are limited to systems with small state spaces, cannot detect all possible behaviours of the PDFs, and mandate human intervention for visually identifying the change in the PDF. In contrast, this study presents a new approach based on Topological Data Analysis (TDA) that uses superlevel persistence to mathematically quantify P-type bifurcations in stochastic systems through a "homological bifurcation plot'' -- which shows the changing ranks of 0th and 1st homology groups. Using these plots, we demonstrate the successful detection of P-bifurcations on the stochastic Duffing, Raleigh-Vander Pol and Quintic Oscillators given their analytical PDFs, and elaborate on how to generate an estimated homological bifurcation plot given a kernel density estimate (KDE) of these systems by employing a tool for finding topological consistency between PDFs and KDEs.

math.DS↗

arXiv2023

Robust Zero-crossings Detection in Noisy Signals using Topological Signal Processing

We explore a novel application of zero-dimensional persistent homology from Topological Data Analysis (TDA) for bracketing zero-crossings of both one-dimensional continuous functions, and uniformly sampled time series. We present an algorithm and show its robustness in the presence of noise for a range of sampling frequencies. In comparison to state-of-the-art software-based methods for finding zeros of a time series, our method generally converges faster, provides higher accuracy, and is capable of finding all the roots in a given interval instead of converging only to one of them. We also present and compare options for automatically setting the persistence threshold parameter that influences the accurate bracketing of the roots.

cs.CG↗