English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We compare different partitioning schemes for the box-counting algorithm inthe multifractal analysis by computing the singularity spectrum and thedistribution of the box probabilities. As model system we use the Andersonmodel of localization in two and three dimensions. We show that a partitioningscheme which includes unrestricted values of the box size and an average overall box origins leads to smaller error bounds than the standard method usingonly integer ratios of the linear system size and the box size which was foundby Rodriguez et al. (Eur. Phys. J. B 67, 77-82 (2009)) to yield the mostreliable results.

Partitioning Schemes and Non-Integer Box Sizes for the Box-Counting Algorithm in Multifractal Analysis