Author
Listed:
- Díaz-Jiménez, Marina
- Pavón-Domínguez, Pablo
- Ruiz, Patricia
- Moreno-Pulido, Soledad
Abstract
Complex networks are fundamental for modelling and understanding a wide range of real-world applications or non-trivial systems. Understanding their multifractal geometry has become relevant in recent years. Various algorithms have been developed either to refine existing methods or to adapt them to different network topologies. However, multifractal analysis has never been applied to directed networks. In this work, we present a novel multifractal box-covering method for directed networks, referred as MF-BCd. To assess its applicability, state-of-the-art undirected networks have been used to generate the directed ones. Specifically, (u,v)-flower, the generalized minimal model, scale-free and random networks are used as weakly connected networks. Krapivsky and small-world networks are used to generate the strongly connected ones. To evaluate the impact of the degree of directionality, MF-BCd has been evaluated with different percentages of directed edges. Results show that Krapivsky networks exhibit a clear multifractal structure, with a ΔD(q) approximately 0.9, confirming the method’s effectiveness. In contrast, small-world networks display limited multifractality, with ΔD(q) less than 0.16, decreasing as the rewiring probability p becomes smaller. Moreover, adding directed shortcuts in small-world networks increases multifractality compared to the non-directed case. The weakly connected networks studied exhibit multifractality, which diminishes as the proportion of directed links increases. Higher directionality also increases the number of boxes required to cover the network and leads to a loss of multifractality, approaching monofractal behaviour. This loss is particularly pronounced in scale-free and random networks, whereas ring-based networks such as (u,v)-flower and generalized minimal model preserve multifractality up to certain thresholds. The proposed MF-BCd method is further validated using two real-world directed networks, enabling a consistent multifractal analysis and distinguishing different multifractal behaviour.
Suggested Citation
Díaz-Jiménez, Marina & Pavón-Domínguez, Pablo & Ruiz, Patricia & Moreno-Pulido, Soledad, 2026.
"Exploring multifractal geometry in directed complex networks,"
Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 690(C).
Handle:
RePEc:eee:phsmap:v:690:y:2026:i:c:s0378437126002141
DOI: 10.1016/j.physa.2026.131478
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:690:y:2026:i:c:s0378437126002141. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.