Karol Capała
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Karol Capała has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Bartłomiej Dybiec
Institute of Theoretical Physics and Mark Kac Center for Complex Systems Research Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University Łojasiewicza 11 30-348 Kraków Poland
31 shared publications - Ewa Gudowska-Nowak
Jagiellonian University
7 shared publications - Ralf Metzler
Institute of Physics & Astronomy, University of Potsdam, Potsdam, Germany
3 shared publications Aleksei V. Chechkin
Institute for Physics and Astronomy, University of Potsdam 3 , 14476 Potsdam-Golm, Germany
2 shared publications- Aleksei V. Chechkin
National Science Center “Kharkiv Institute of Physics and Technology” Kharkiv Ukraine
2 shared publications - Amin Padash
Institute of Physics and Astronomy, University of Potsdam, 14476 Potsdam-Golm, Germany
2 shared publications
Latest Publications
- Open Access
- 21 September 2026
- Published by Elsevier in Information Sciences
- Vol. 762
Design and analysis of an improved constrained hypercube mixer in quantum approximate optimization algorithm
- 21 September 2026
- Published by Elsevier in Information Sciences
- Vol. 762
Open AccessDesign and analysis of an improved constrained hypercube mixer in quantum approximate optimization algorithm
- 1 April 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (4)
Hitting the blinking target under stochastic resetting
The first hitting times of a stochastic process, i.e., the first time a process reaches a particular level, are of significant interest across various scientific disciplines, including biology, chemistry, and economics. We modify the standard setup by allowing the target to spontaneously switch between two states, either active or inactive, and investigate the distribution of first hitting times accrued while the target is active. For this setup, we provide closed formulas for the distribution of the first hitting time. Additionally, we can introduce stochastic resetting to the underlying process and, utilizing our results, derive the formulas for the first time the active target is hit by the process under stochastic resetting. Interestingly, we show that resetting in this setup still leaves some memory; the system is no longer Markovian, which prevents a straightforward application of standard techniques. The analytical results are accompanied by computer simulations of Langevin dynamics.
- 1 April 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (4)
Hitting the blinking target under stochastic resetting
The first hitting times of a stochastic process, i.e., the first time a process reaches a particular level, are of significant interest across various scientific disciplines, including biology, chemistry, and economics. We modify the standard setup by allowing the target to spontaneously switch between two states, either active or inactive, and investigate the distribution of first hitting times accrued while the target is active. For this setup, we provide closed formulas for the distribution of the first hitting time. Additionally, we can introduce stochastic resetting to the underlying process and, utilizing our results, derive the formulas for the first time the active target is hit by the process under stochastic resetting. Interestingly, we show that resetting in this setup still leaves some memory; the system is no longer Markovian, which prevents a straightforward application of standard techniques. The analytical results are accompanied by computer simulations of Langevin dynamics.
- Open Access
- 27 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 7394-7410
Modularity Maximization and Community Detection in Complex Networks Through Recursive and Hierarchical Annealing in the DWAVE Advantage Quantum Processing Units
Quantum adiabatic optimization has long been expected to outperform classical methods in solving NP -type problems. While this has been proven in certain experiments, its main applications still reside in academic problems where the size of the system to be solved would not represent an obstacle to any modern desktop computer. Here, we develop a systematic procedure to find the global optima of the modularity function to discover community structure in complex networks solely relying on pure annealers rather than hybrid solutions. We bypass the one-hot encoding constraints by hierarchically and recursively encoding binary instances of the problem that can be solved without the need to guess the exact penalties for the Lagrange multipliers. We study the variability and robustness of the annealing process as a function of network size, directness of connections, topology, and the resolution of the communities. We show how our approach produces meaningful and at least equally optimal solutions to state-of-the-art community detection algorithms while maintaining tractable and potentially scalable computing times. Lastly, due to its recursive nature, the annealing process returns intermediate subdivisions, thus offering interpretable rather than black-box solutions. These dendrograms can be used to unveil normal and pathological hidden hierarchies in brain networks, hence opening the door to clinical workflows. Overall, this represents a first step towards an applicable practice-oriented usage of pure quantum annealing, potentially bridging two segregated communities in modern science and engineering: that of network science and quantum computing.
- 27 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 7394-7410
Open AccessModularity Maximization and Community Detection in Complex Networks Through Recursive and Hierarchical Annealing in the DWAVE Advantage Quantum Processing Units
Quantum adiabatic optimization has long been expected to outperform classical methods in solving NP -type problems. While this has been proven in certain experiments, its main applications still reside in academic problems where the size of the system to be solved would not represent an obstacle to any modern desktop computer. Here, we develop a systematic procedure to find the global optima of the modularity function to discover community structure in complex networks solely relying on pure annealers rather than hybrid solutions. We bypass the one-hot encoding constraints by hierarchically and recursively encoding binary instances of the problem that can be solved without the need to guess the exact penalties for the Lagrange multipliers. We study the variability and robustness of the annealing process as a function of network size, directness of connections, topology, and the resolution of the communities. We show how our approach produces meaningful and at least equally optimal solutions to state-of-the-art community detection algorithms while maintaining tractable and potentially scalable computing times. Lastly, due to its recursive nature, the annealing process returns intermediate subdivisions, thus offering interpretable rather than black-box solutions. These dendrograms can be used to unveil normal and pathological hidden hierarchies in brain networks, hence opening the door to clinical workflows. Overall, this represents a first step towards an applicable practice-oriented usage of pure quantum annealing, potentially bridging two segregated communities in modern science and engineering: that of network science and quantum computing.
- 1 July 2025
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 35 (7)
Reset induced multimodality in unbounded potential
Resetting, as a protocol that restarts the evolution of a system, can significantly influence stochastic dynamics. One notable effect is the emergence of stationary states in unbounded potentials, where such states would otherwise be absent without resetting. In this work, we explore unbounded potentials for which resetting not only induces stationary states but also leads to their multimodality, despite the repulsive nature of the potential. We present examples of potentials that, despite lacking local minima, can generate trimodal and pentamodal states, and we investigate how the modal structure of these states varies with noise intensity and resetting frequency.
- 1 July 2025
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 35 (7)
Reset induced multimodality in unbounded potential
Resetting, as a protocol that restarts the evolution of a system, can significantly influence stochastic dynamics. One notable effect is the emergence of stationary states in unbounded potentials, where such states would otherwise be absent without resetting. In this work, we explore unbounded potentials for which resetting not only induces stationary states but also leads to their multimodality, despite the repulsive nature of the potential. We present examples of potentials that, despite lacking local minima, can generate trimodal and pentamodal states, and we investigate how the modal structure of these states varies with noise intensity and resetting frequency.
- Open Access
- 18 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (9) , 5627-5638
Stability of Machine Learning Predictive Features Under Limited Data
In a world where Machine Learning (ML) is increasingly used to make predictions about critical events, such as health outcomes, it is crucial to ensure decision-makers have access to explainable, consistent, and relevant predictive features. ML prediction relies on perfect data with similar distributions for testing and validation. These results are compared with those of humans, who use more noisy and limited data. Human predictions overcome those limitations by learning from abstractions. This paper addresses these issues by conducting experiments comparing traditional machine learning methods and a previously proposed method that uses data abstractions to learn predictive feature significance. The results indicate that the previously proposed descriptive ML approach maintains higher classification accuracy and ensures the stability of feature selection as data incompleteness increases, becoming valuable under limited data scenarios. It demonstrates the possibility of developing ML capable of automatic decision-making.
- 18 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (9) , 5627-5638
Open AccessStability of Machine Learning Predictive Features Under Limited Data
In a world where Machine Learning (ML) is increasingly used to make predictions about critical events, such as health outcomes, it is crucial to ensure decision-makers have access to explainable, consistent, and relevant predictive features. ML prediction relies on perfect data with similar distributions for testing and validation. These results are compared with those of humans, who use more noisy and limited data. Human predictions overcome those limitations by learning from abstractions. This paper addresses these issues by conducting experiments comparing traditional machine learning methods and a previously proposed method that uses data abstractions to learn predictive feature significance. The results indicate that the previously proposed descriptive ML approach maintains higher classification accuracy and ensures the stability of feature selection as data incompleteness increases, becoming valuable under limited data scenarios. It demonstrates the possibility of developing ML capable of automatic decision-making.
- Open Access
- 2 May 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (18) , 185002
First-passage statistics for Lévy flights with a drift
We provide the first-passage statistics of Lévy flights in a one-dimensional semi-infinite domain, considering the effects of a constant drift µ while the jump length distribution is symmetric. By solving the space-fractional Fokker–Planck equation governing the evolution of the probability density function (PDF), we derive expressions for both the survival probability and the first-passage time for given values of the stability index α and drift parameter µ. Our findings are further validated by comparing them with simulations from the stochastic Langevin equation driven by α-stable noise. Additionally, we make use of the Skorokhod theorem for processes with stationary independent increments and show that our numerical results are in good agreement with the analytical expressions for the PDF of first-passage times and survival probabilities. Specifically, in the asymptotic long-time limit, we show that for α = 2 (Brownian motion), the first-passage time distribution follows the classical Lévy–Smirnov form and decays exponentially, irrespective of the drift direction. The survival probability exhibits a distinct asymptotic behaviour: for positive drift, it decreases exponentially, while for negative drift, it saturates to a finite value, indicating a nonzero probability for the particle to escape to − ∞ . For α = 1 (Cauchy process), the survival probability and the first-passage time density exhibit a power-law decay, with µ-dependent exponents. For 0 < α < 1 , we find that the long-time asymptotic remains consistent with the drift-free case, but with a µ-dependent prefactor. Finally, for α-stable processes with 1 < α < 2 , the first-passage time density follows a power-law decay, whose exponent depends on both α and the drift direction; concurrently, the survival probability decays in power-law form for positive drift, while in the case of negative drift, it saturates to a finite value.
- 2 May 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (18) , 185002
Open AccessFirst-passage statistics for Lévy flights with a drift
We provide the first-passage statistics of Lévy flights in a one-dimensional semi-infinite domain, considering the effects of a constant drift µ while the jump length distribution is symmetric. By solving the space-fractional Fokker–Planck equation governing the evolution of the probability density function (PDF), we derive expressions for both the survival probability and the first-passage time for given values of the stability index α and drift parameter µ. Our findings are further validated by comparing them with simulations from the stochastic Langevin equation driven by α-stable noise. Additionally, we make use of the Skorokhod theorem for processes with stationary independent increments and show that our numerical results are in good agreement with the analytical expressions for the PDF of first-passage times and survival probabilities. Specifically, in the asymptotic long-time limit, we show that for α = 2 (Brownian motion), the first-passage time distribution follows the classical Lévy–Smirnov form and decays exponentially, irrespective of the drift direction. The survival probability exhibits a distinct asymptotic behaviour: for positive drift, it decreases exponentially, while for negative drift, it saturates to a finite value, indicating a nonzero probability for the particle to escape to − ∞ . For α = 1 (Cauchy process), the survival probability and the first-passage time density exhibit a power-law decay, with µ-dependent exponents. For 0 < α < 1 , we find that the long-time asymptotic remains consistent with the drift-free case, but with a µ-dependent prefactor. Finally, for α-stable processes with 1 < α < 2 , the first-passage time density follows a power-law decay, whose exponent depends on both α and the drift direction; concurrently, the survival probability decays in power-law form for positive drift, while in the case of negative drift, it saturates to a finite value.
- Open Access
Optimization of escape kinetics by reflecting and resetting
Stochastic restarting is a strategy of starting anew. Incorporation of the resetting to the random walks can result in the decrease of the mean first passage time, due to the ability to limit unfavorably meandering, sub-optimal trajectories. In the following manuscript we examine how stochastic resetting influences escape dynamics from the $(-\infty,1)$ interval in the presence of the single-well power-law $|x|^κ$ potentials with $κ>0$. Examination of the mean first passage time is complemented by the analysis of the coefficient of variation, which provides a robust and reliable indicator assessing efficiency of stochastic resetting. The restrictive nature of resetting is compared to placing a reflective boundary in the system at hand. In particular, for each potential, the position of the reflecting barrier giving the same mean first passage time as the optimal resetting rate is determined. Finally, in addition to reflecting, we compare effectiveness of other resetting strategies with respect to optimization of the mean first passage time.Open AccessOptimization of escape kinetics by reflecting and resetting
Stochastic restarting is a strategy of starting anew. Incorporation of the resetting to the random walks can result in the decrease of the mean first passage time, due to the ability to limit unfavorably meandering, sub-optimal trajectories. In the following manuscript we examine how stochastic resetting influences escape dynamics from the $(-\infty,1)$ interval in the presence of the single-well power-law $|x|^κ$ potentials with $κ>0$. Examination of the mean first passage time is complemented by the analysis of the coefficient of variation, which provides a robust and reliable indicator assessing efficiency of stochastic resetting. The restrictive nature of resetting is compared to placing a reflective boundary in the system at hand. In particular, for each potential, the position of the reflecting barrier giving the same mean first passage time as the optimal resetting rate is determined. Finally, in addition to reflecting, we compare effectiveness of other resetting strategies with respect to optimization of the mean first passage time. - Open Access
A Stochastic Model of Translocation of Knotted Proteins
Knotted proteins, when forced through the pores, can get stuck if the knots in their backbone tighten under force. Alternatively, the knot can slide off the chain, making translocation possible. We construct a simple energy landscape model of this process with a time-periodic potential that mimics the action of a molecular motor. We calculate the translocation time as a function of the period of the pulling force, discuss the asymptotic limits and biological relevance of the results.
Open AccessA Stochastic Model of Translocation of Knotted Proteins
Knotted proteins, when forced through the pores, can get stuck if the knots in their backbone tighten under force. Alternatively, the knot can slide off the chain, making translocation possible. We construct a simple energy landscape model of this process with a time-periodic potential that mimics the action of a molecular motor. We calculate the translocation time as a function of the period of the pulling force, discuss the asymptotic limits and biological relevance of the results.
- Open Access
- 1 October 2023
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 33 (10)
Optimization of escape kinetics by reflecting and resetting
Stochastic restarting is a strategy of starting anew. Incorporation of the resetting to the random walks can result in a decrease in the mean first passage time due to the ability to limit unfavorably meandering, sub-optimal trajectories. In this paper, we examine how stochastic resetting influences escape dynamics from the (−∞,1) interval in the presence of the single-well power-law |x|κ potentials with κ>0. Examination of the mean first passage time is complemented by the analysis of the coefficient of variation, which provides a robust and reliable indicator assessing the efficiency of stochastic resetting. The restrictive nature of resetting is compared to placing a reflective boundary in the system at hand. In particular, for each potential, the position of the reflecting barrier giving the same mean first passage time as the optimal resetting rate is determined. Finally, in addition to reflecting, we compare the effectiveness of other resetting strategies with respect to optimization of the mean first passage time.
- 1 October 2023
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 33 (10)
Open AccessOptimization of escape kinetics by reflecting and resetting
Stochastic restarting is a strategy of starting anew. Incorporation of the resetting to the random walks can result in a decrease in the mean first passage time due to the ability to limit unfavorably meandering, sub-optimal trajectories. In this paper, we examine how stochastic resetting influences escape dynamics from the (−∞,1) interval in the presence of the single-well power-law |x|κ potentials with κ>0. Examination of the mean first passage time is complemented by the analysis of the coefficient of variation, which provides a robust and reliable indicator assessing the efficiency of stochastic resetting. The restrictive nature of resetting is compared to placing a reflective boundary in the system at hand. In particular, for each potential, the position of the reflecting barrier giving the same mean first passage time as the optimal resetting rate is determined. Finally, in addition to reflecting, we compare the effectiveness of other resetting strategies with respect to optimization of the mean first passage time.
- Open Access
- 17 February 2023
- Published by JMIR Publications Inc. in JMIR Preprints
Stratifying risk of bladder cancer in patients who present with haematuria using biomarkers and machine self-semantic learning (Preprint)
BACKGROUND Highly detailed and invasive clinical investigations are needed to stratify haematuria patients with no disease, benign disease, and malignant disease. Due to the heterogeneity in the patient population and wide range of potential causes of haematuria, possibility to indicate patient-specific biomarkers could improve and speed up diagnostic process, which is crucial for patients with suspected cancer. OBJECTIVE We developed a new algorithm to identify risk of bladder cancer in haematuria patients by analyzing multiple urine and serum biomarkers and identifying the most significant using complex network theory. METHODS We analyzed data collected in the HABIO case – control study of haematuria patients, containing 675 participants (190 females, 485 males) aged between 40 and 80 years. In the study, we used the initial analysis pipeline of our Self-Supervised Semantic Learning (3SL) framework grounded on the complex network theory to stratify participants into two groups: healthy (with no clear cause of haematuria) or sick (with bladder cancer, infection etc.). We compared our model sensitivity and specificity with logistic regression and binary decision tree outcomes. To assess model performance, we used balanced accuracy to account for imbalance between the number of healthy and sick participants in the dataset. Additionally, to assess how linearly separable the biomarkers were, we applied k-means clustering. RESULTS Our modelling outperformed logistic regression and binary decision trees obtaining balance accuracies of 0.693 (females) and 0.715 (males) vs 0.621 (females) and 0.533 (males) for logistic regression and 0.570 (females) and 0.597 (males) for binary trees. K-means clustering showed that the distribution of the biomarkers did not match clear macro-patterns. For the sick population (both genders) the most significant biomarkers were previously associated with infectious diseases and inflammation (thrombomodulin, sTNFRII and osmolarity) or bladder cancer (IL-8, TGF-β). Additionally, CXCL16, midkine, clusterin, CEA, 8-OHdG were previously described in the literature as a potential biomarker for urinary tract cancers. CONCLUSIONS In the study we applied a new algorithm to improve diagnosis of haematuria in study participants. The algorithm performs better than currently widely applied methods (logistic regression, binary trees, k-means clustering). Additionally, applying 3SL algorithm we identified biomarkers most relevant for the specific group of patients and dependencies between those biomarkers. We hope that our results can guide further research and provide new personalised diagnostic tools directly tailored to individual patients' needs. CLINICALTRIAL Ethical approval was obtained from the Office of Research Ethics Committee Northern Ireland (11/NI/0164).
- 17 February 2023
- Published by JMIR Publications Inc. in JMIR Preprints
Open AccessStratifying risk of bladder cancer in patients who present with haematuria using biomarkers and machine self-semantic learning (Preprint)
BACKGROUND Highly detailed and invasive clinical investigations are needed to stratify haematuria patients with no disease, benign disease, and malignant disease. Due to the heterogeneity in the patient population and wide range of potential causes of haematuria, possibility to indicate patient-specific biomarkers could improve and speed up diagnostic process, which is crucial for patients with suspected cancer. OBJECTIVE We developed a new algorithm to identify risk of bladder cancer in haematuria patients by analyzing multiple urine and serum biomarkers and identifying the most significant using complex network theory. METHODS We analyzed data collected in the HABIO case – control study of haematuria patients, containing 675 participants (190 females, 485 males) aged between 40 and 80 years. In the study, we used the initial analysis pipeline of our Self-Supervised Semantic Learning (3SL) framework grounded on the complex network theory to stratify participants into two groups: healthy (with no clear cause of haematuria) or sick (with bladder cancer, infection etc.). We compared our model sensitivity and specificity with logistic regression and binary decision tree outcomes. To assess model performance, we used balanced accuracy to account for imbalance between the number of healthy and sick participants in the dataset. Additionally, to assess how linearly separable the biomarkers were, we applied k-means clustering. RESULTS Our modelling outperformed logistic regression and binary decision trees obtaining balance accuracies of 0.693 (females) and 0.715 (males) vs 0.621 (females) and 0.533 (males) for logistic regression and 0.570 (females) and 0.597 (males) for binary trees. K-means clustering showed that the distribution of the biomarkers did not match clear macro-patterns. For the sick population (both genders) the most significant biomarkers were previously associated with infectious diseases and inflammation (thrombomodulin, sTNFRII and osmolarity) or bladder cancer (IL-8, TGF-β). Additionally, CXCL16, midkine, clusterin, CEA, 8-OHdG were previously described in the literature as a potential biomarker for urinary tract cancers. CONCLUSIONS In the study we applied a new algorithm to improve diagnosis of haematuria in study participants. The algorithm performs better than currently widely applied methods (logistic regression, binary trees, k-means clustering). Additionally, applying 3SL algorithm we identified biomarkers most relevant for the specific group of patients and dependencies between those biomarkers. We hope that our results can guide further research and provide new personalised diagnostic tools directly tailored to individual patients' needs. CLINICALTRIAL Ethical approval was obtained from the Office of Research Ethics Committee Northern Ireland (11/NI/0164).