Papers › MFDFA: Efficient Multifractal Detrended Fluctuation Analysis in Python
MFDFA: Efficient Multifractal Detrended Fluctuation Analysis in Python
Leonardo Rydin Gorjão, Galib Hassan, Jürgen Kurths, Dirk Witthaut
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Multifractal detrended fluctuation analysis (MFDFA) has become a central method to characterise the variability and uncertainty in empiric time series. Extracting the fluctuations on different temporal scales allows quantifying the strength and correlations in the underlying stochastic properties, their scaling behaviour, as well as the level of fractality. Several extensions to the fundamental method have been developed over the years, vastly enhancing the applicability of MFDFA, e.g. empirical mode decomposition for the study of long-range correlations and persistence. In this article we introduce an efficient, easy-to-use python library for MFDFA, incorporating the most common extensions and harnessing the most of multi-threaded processing for very fast calculations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections