@misc{Sikorski2023, author = {Sikorski, Alexander}, title = {VoronoiGraph.jl}, doi = {10.5281/zenodo.6417636}, year = {2023}, abstract = {This Package implements a variation of the Voronoi Graph Traversal algorithm by Polianskii and Pokorny [1]. It constructs a Voronoi Diagram from a set of points by performing a random walk on the graph of the vertices of the diagram. Unlike many other Voronoi implementations this algorithm is not limited to 2 or 3 dimensions and promises good performance even in higher dimensions.}, language = {en} } @article{SikorskiHeida2024, author = {Sikorski, Alexander and Heida, Martin}, title = {Voronoi Graph - Improved raycasting and integration schemes for high dimensional Voronoi diagrams}, arxiv = {http://arxiv.org/abs/2405.10050}, year = {2024}, abstract = {The computation of Voronoi Diagrams, or their dual Delauney triangulations is difficult in high dimensions. In a recent publication Polianskii and Pokorny propose an iterative randomized algorithm facilitating the approximation of Voronoi tesselations in high dimensions. In this paper, we provide an improved vertex search method that is not only exact but even faster than the bisection method that was previously recommended. Building on this we also provide a depth-first graph-traversal algorithm which allows us to compute the entire Voronoi diagram. This enables us to compare the outcomes with those of classical algorithms like qHull, which we either match or marginally beat in terms of computation time. We furthermore show how the raycasting algorithm naturally lends to a Monte Carlo approximation for the volume and boundary integrals of the Voronoi cells, both of which are of importance for finite Volume methods. We compare the Monte-Carlo methods to the exact polygonal integration, as well as a hybrid approximation scheme.}, language = {en} } @article{SikorskiWeberSchuette2021, author = {Sikorski, Alexander and Weber, Marcus and Sch{\"u}tte, Christof}, title = {The Augmented Jump Chain}, volume = {4}, journal = {Advanced Theory and Simulations}, number = {4}, publisher = {Wiley-VCH}, arxiv = {http://arxiv.org/abs/2008.04624}, doi = {10.1002/adts.202000274}, year = {2021}, abstract = {Modern methods of simulating molecular systems are based on the mathematical theory of Markov operators with a focus on autonomous equilibrated systems. However, non-autonomous physical systems or non-autonomous simulation processes are becoming more and more important. A representation of non-autonomous Markov jump processes is presented as autonomous Markov chains on space-time. Augmenting the spatial information of the embedded Markov chain by the temporal information of the associated jump times, the so-called augmented jump chain is derived. The augmented jump chain inherits the sparseness of the infinitesimal generator of the original process and therefore provides a useful tool for studying time-dependent dynamics even in high dimensions. Furthermore, possible generalizations and applications to the computation of committor functions and coherent sets in the non-autonomous setting are discussed. After deriving the theoretical foundations, the concepts with a proof-of-concept Galerkin discretization of the transfer operator of the augmented jump chain applied to simple examples are illustrated.}, language = {en} } @article{SikorskiNiknejadWeberetal.2024, author = {Sikorski, Alexander and Niknejad, Amir and Weber, Marcus and Donati, Luca}, title = {Tensor-SqRA: Modeling the transition rates of interacting molecular systems in terms of potential energies}, volume = {160}, journal = {Journal of Chemical Physics}, arxiv = {http://arxiv.org/abs/2311.09779}, doi = {10.1063/5.0187792}, pages = {104112}, year = {2024}, abstract = {Estimating the rate of rare conformational changes in molecular systems is one of the goals of molecular dynamics simulations. In the past few decades, a lot of progress has been done in data-based approaches toward this problem. In contrast, model-based methods, such as the Square Root Approximation (SqRA), directly derive these quantities from the potential energy functions. In this article, we demonstrate how the SqRA formalism naturally blends with the tensor structure obtained by coupling multiple systems, resulting in the tensor-based Square Root Approximation (tSqRA). It enables efficient treatment of high-dimensional systems using the SqRA and provides an algebraic expression of the impact of coupling energies between molecular subsystems. Based on the tSqRA, we also develop the projected rate estimation, a hybrid data-model-based algorithm that efficiently estimates the slowest rates for coupled systems. In addition, we investigate the possibility of integrating low-rank approximations within this framework to maximize the potential of the tSqRA.}, language = {en} } @article{FrankSikorskiRoeblitz2024, author = {Frank, Anna-Simone and Sikorski, Alexander and R{\"o}blitz, Susanna}, title = {Spectral clustering of Markov chain transition matrices with complex eigenvalues}, volume = {444}, journal = {Journal of Computational and Applied Mathematics}, arxiv = {http://arxiv.org/abs/2206.14537}, doi = {10.1016/j.cam.2024.115791}, pages = {115791}, year = {2024}, abstract = {The Robust Perron Cluster Analysis (PCCA+) has become a popular spectral clustering algorithm for coarse-graining transition matrices of nearly decomposable Markov chains with transition states. Originally developed for reversible Markov chains, the algorithm only worked for transition matrices with real eigenvalues. In this paper, we therefore extend the theoretical framework of PCCA+ to Markov chains with a complex eigen-decomposition. We show that by replacing a complex conjugate pair of eigenvectors by their real and imaginary components, a real representation of the same subspace is obtained, which is suitable for the cluster analysis. We show that our approach leads to the same results as the generalized PCCA+ (GPCCA), which replaces the complex eigen-decomposition by a conceptually more difficult real Schur decomposition. We apply the method on non-reversible Markov chains, including circular chains, and demonstrate its efficiency compared to GPCCA. The experiments are performed in the Matlab programming language and codes are provided.}, language = {de} } @misc{FackeldeySikorskiWeber2018, author = {Fackeldey, Konstantin and Sikorski, Alexander and Weber, Marcus}, title = {Spectral Clustering for Non-reversible Markov Chains}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-70218}, year = {2018}, abstract = {Spectral clustering methods are based on solving eigenvalue problems for the identification of clusters, e.g. the identification of metastable subsets of a Markov chain. Usually, real-valued eigenvectors are mandatory for this type of algorithms. The Perron Cluster Analysis (PCCA+) is a well-known spectral clustering method of Markov chains. It is applicable for reversible Markov chains, because reversibility implies a real-valued spectrum. We also extend this spectral clustering method to non-reversible Markov chains and give some illustrative examples. The main idea is to replace the eigenvalue problem by a real-valued Schur decomposition. By this extension non-reversible Markov chains can be analyzed. Furthermore, the chains do not need to have a positive stationary distribution. In addition to metastabilities, dominant cycles and sinks can also be identified. This novel method is called GenPCCA (i.e. Generalized PCCA), since it includes the case of non reversible processes. We also apply the method to real world eye tracking data.}, language = {en} } @article{FackeldeySikorskiWeber2018, author = {Fackeldey, Konstantin and Sikorski, Alexander and Weber, Marcus}, title = {Spectral Clustering for Non-Reversible Markov Chains}, volume = {37}, journal = {Computational and Applied Mathematics}, number = {5}, doi = {https://doi.org/10.1007/s40314-018-0697-0}, pages = {6376 -- 6391}, year = {2018}, abstract = {Spectral clustering methods are based on solving eigenvalue problems for the identification of clusters, e.g., the identification of metastable subsets of a Markov chain. Usually, real-valued eigenvectors are mandatory for this type of algorithms. The Perron Cluster Analysis (PCCA+) is a well-known spectral clustering method of Markov chains. It is applicable for reversible Markov chains, because reversibility implies a real-valued spectrum. We also extend this spectral clustering method to non-reversible Markov chains and give some illustrative examples. The main idea is to replace the eigenvalue problem by a real-valued Schur decomposition. By this extension non-reversible Markov chains can be analyzed. Furthermore, the chains do not need to have a positive stationary distribution. In addition to metastabilities, dominant cycles and sinks can also be identified. This novel method is called GenPCCA (i.e., generalized PCCA), since it includes the case of non-reversible processes. We also apply the method to real-world eye-tracking data.}, language = {en} } @article{KresseSikorskiChewleetal.2026, author = {Kresse, Jakob and Sikorski, Alexander and Chewle, Surahit and Sunkara, Vikram and Weber, Marcus}, title = {Revealing the Atomistic Mechanism of Rare Events in Molecular Dynamics}, journal = {Journal of Chemical Theory and Computation}, arxiv = {http://arxiv.org/abs/2511.15514}, doi = {10.1021/acs.jctc.5c01906}, year = {2026}, abstract = {Interpretable reaction coordinates are essential for understanding rare conformational transitions in molecular dynamics. The Atomistic Mechanism Of Rare Events in Molecular Dynamics (AMORE-MD) framework enhances interpretability of deep-learned reaction coordinates by connecting them to atomistic mechanisms, without requiring any a priori knowledge of collective variables, pathways, or endpoints. Here, AMORE-MD employs the ISOKANN algorithm to learn a neural membership function χ representing the dominant slow process, from which transition pathways are reconstructed as minimum-energy paths aligned with the gradient of χ, and atomic contributions are quantified through gradient-based sensitivity analysis. Iterative enhanced sampling further enriches transition regions and improves coverage of rare events enabling recovery of known mechanisms and chemically interpretable structural rearrangements at atomic resolution for the M{\"u}ller-Brown potential, alanine dipeptide, and the elastin-derived hexapeptide VGVAPG.}, language = {en} } @misc{KlebanovSikorskiSchuetteetal.2016, author = {Klebanov, Ilja and Sikorski, Alexander and Sch{\"u}tte, Christof and R{\"o}blitz, Susanna}, title = {Prior estimation and Bayesian inference from large cohort data sets}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-57475}, year = {2016}, abstract = {One of the main goals of mathematical modelling in systems biology related to medical applications is to obtain patient-specific parameterisations and model predictions. In clinical practice, however, the number of available measurements for single patients is usually limited due to time and cost restrictions. This hampers the process of making patient-specific predictions about the outcome of a treatment. On the other hand, data are often available for many patients, in particular if extensive clinical studies have been performed. Using these population data, we propose an iterative algorithm for contructing an informative prior distribution, which then serves as the basis for computing patient-specific posteriors and obtaining individual predictions. We demonsrate the performance of our method by applying it to a low-dimensional parameter estimation problem in a toy model as well as to a high-dimensional ODE model of the human menstrual cycle, which represents a typical example from systems biology modelling.}, language = {en} } @masterthesis{Sikorski2015, type = {Bachelor Thesis}, author = {Sikorski, Alexander}, title = {PCCA+ and Its Application to Spatial Time Series Clustering}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-58769}, year = {2015}, language = {en} }