Vadood Adami
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Vadood Adami has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Morteza Nattagh Najafi
University of Mohaghegh Ardabili
4 shared publications - Hosein Masoomy
Department of Physics, Shahid Beheshti University, 1983969411 Tehran, Iran
2 shared publications - Hans Jürgen Herrmann
Universidade Federal do Ceará
1 shared publication Maryam Pirgholi
University of Mohaghegh Ardabili
1 shared publication- Sajjad Emdadi Mahdimahalleh
University of Akron
1 shared publication
Latest Publications
- 1 July 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (1)
Self-organized model for the flicker noise in interacting two-dimensional electron gas
- 1 July 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (1)
Self-organized model for the flicker noise in interacting two-dimensional electron gas
- Top Cited Papers
- 17 February 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (2) , 024307
Centrality and universality in scale-free networks
We propose a paradigm for modeling real-world scale-free networks, where the integration of new nodes is driven by the combined attractiveness of degree and betweenness centralities, the competition of which (expressed by a parameter 0≤p≤1) shapes the structure of the evolving network. We reveal the ability to seamlessly explore a vast landscape of scale-free networks, unlocking a class of complex networks that we call a stars-with-filament structure. Remarkably, the average degree k[over ¯] of these networks grows like lnt to some power, where t is time and the average shortest path length grows logarithmically with the system size for intermediate p values, offering fresh insights into the structural dynamics of scale-free systems. Our approach is backed by a robust mean-field theory, which nicely captures the dynamics of k[over ¯]. We further unveil a rich, p-dependent phase diagram, encompassing 47 real-world scale-free networks, shedding light on previously hidden patterns. This work opens avenues for understanding the universal properties of complex networks.
- 17 February 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (2) , 024307
Top Cited PapersCentrality and universality in scale-free networks
We propose a paradigm for modeling real-world scale-free networks, where the integration of new nodes is driven by the combined attractiveness of degree and betweenness centralities, the competition of which (expressed by a parameter 0≤p≤1) shapes the structure of the evolving network. We reveal the ability to seamlessly explore a vast landscape of scale-free networks, unlocking a class of complex networks that we call a stars-with-filament structure. Remarkably, the average degree k[over ¯] of these networks grows like lnt to some power, where t is time and the average shortest path length grows logarithmically with the system size for intermediate p values, offering fresh insights into the structural dynamics of scale-free systems. Our approach is backed by a robust mean-field theory, which nicely captures the dynamics of k[over ¯]. We further unveil a rich, p-dependent phase diagram, encompassing 47 real-world scale-free networks, shedding light on previously hidden patterns. This work opens avenues for understanding the universal properties of complex networks.
- 15 May 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (20) , 205002
Topological data analysis of the visibility graphs of the BTW avalanche-size sequences
In this paper, we use topological data analysis to explore both pairwise and higher-order connectivity aspects of the visibility graph (VG) representation of sandpile models. By transforming the time series of avalanche sizes into VGs, we investigate the structural characteristics of the Bak–Tang–Wiesenfeld model. Through an analysis of degree and betweenness centralities, we find that the resulting graphs exhibit scale-free behavior, with degree and betweenness exponents γ k = 2.50 ± 0.02 and γ b = 1.585 ± 0.008 , respectively. We further apply persistent homology to extract topological features, revealing that the distributions of one-, two-, and three-dimensional simplexes follow power-law forms with exponents γ σ 1 = 0.795 ± 0.006 , γ σ 2 = 0.602 ± 0.009 , and γ σ 3 = 0.422 ± 0.008 , respectively. Similar scaling behavior is observed in the Betti number distributions derived from homology group analysis. In addition, the persistent entropy associated with the lifetimes of d-dimensional holes increases logarithmically with the network size N for d = 0 , 1 , 2 . Although alternative methods of mapping avalanche-size sequences into VGs may yield different sets of exponents, this work contribute to a broader understanding of topological and structural patterns in complex networks derived from dynamical systems, with potential applications in modeling phenomena such as earthquakes, forest fires, and financial market dynamics.
- 15 May 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (20) , 205002
Topological data analysis of the visibility graphs of the BTW avalanche-size sequences
In this paper, we use topological data analysis to explore both pairwise and higher-order connectivity aspects of the visibility graph (VG) representation of sandpile models. By transforming the time series of avalanche sizes into VGs, we investigate the structural characteristics of the Bak–Tang–Wiesenfeld model. Through an analysis of degree and betweenness centralities, we find that the resulting graphs exhibit scale-free behavior, with degree and betweenness exponents γ k = 2.50 ± 0.02 and γ b = 1.585 ± 0.008 , respectively. We further apply persistent homology to extract topological features, revealing that the distributions of one-, two-, and three-dimensional simplexes follow power-law forms with exponents γ σ 1 = 0.795 ± 0.006 , γ σ 2 = 0.602 ± 0.009 , and γ σ 3 = 0.422 ± 0.008 , respectively. Similar scaling behavior is observed in the Betti number distributions derived from homology group analysis. In addition, the persistent entropy associated with the lifetimes of d-dimensional holes increases logarithmically with the network size N for d = 0 , 1 , 2 . Although alternative methods of mapping avalanche-size sequences into VGs may yield different sets of exponents, this work contribute to a broader understanding of topological and structural patterns in complex networks derived from dynamical systems, with potential applications in modeling phenomena such as earthquakes, forest fires, and financial market dynamics.
- 17 April 2023
- Published by American Physical Society (APS) in Physical Review E
- Vol. 107 (4) , 044303
Relation between the degree and betweenness centrality distribution in complex networks
The centrality measures, like betweenness and degree in complex networks remain fundamental quantities helping to classify them. It is realized from Barthelemy's paper [ Eur. Phys. J. B 38, 163 (2004)] that the maximal exponent for the scale-free (SF) networks is , belonging to SF trees, based on which one concludes , where and are the scaling exponents for the distribution functions of the degree and the betweenness centralities, respectively. This conjecture was violated for some special models and systems. Here we present a systematic study on this problem for visibility graphs of correlated time series, and show evidence that this conjecture fails in some correlation strengths. We consider the visibility graph of three models: two-dimensional Bak-Tang-Weisenfeld (BTW) sandpile model, one-dimensional (1D) fractional Brownian motion (FBM), and 1D Levy walks, the two latter cases are controlled by the Hurst exponent and the step index , respectively. In particular, for the BTW model and FBM with , is greater than 2, and also for the BTW model, while the Barthelemy's conjecture remains valid for the Levy process. We assert that the failure of the Barthelemy's conjecture is due to large fluctuations in the scaling relation resulting in the violation of hyperscaling relation and emergent anomalous behavior for the BTW model and FBM. Universal distribution function of generalized degree is found for these models which have the same scaling behavior as the Barabasi-Albert network.- 17 April 2023
- Published by American Physical Society (APS) in Physical Review E
- Vol. 107 (4) , 044303
Relation between the degree and betweenness centrality distribution in complex networks
The centrality measures, like betweenness and degree in complex networks remain fundamental quantities helping to classify them. It is realized from Barthelemy's paper [ Eur. Phys. J. B 38, 163 (2004)] that the maximal exponent for the scale-free (SF) networks is , belonging to SF trees, based on which one concludes , where and are the scaling exponents for the distribution functions of the degree and the betweenness centralities, respectively. This conjecture was violated for some special models and systems. Here we present a systematic study on this problem for visibility graphs of correlated time series, and show evidence that this conjecture fails in some correlation strengths. We consider the visibility graph of three models: two-dimensional Bak-Tang-Weisenfeld (BTW) sandpile model, one-dimensional (1D) fractional Brownian motion (FBM), and 1D Levy walks, the two latter cases are controlled by the Hurst exponent and the step index , respectively. In particular, for the BTW model and FBM with , is greater than 2, and also for the BTW model, while the Barthelemy's conjecture remains valid for the Levy process. We assert that the failure of the Barthelemy's conjecture is due to large fluctuations in the scaling relation resulting in the violation of hyperscaling relation and emergent anomalous behavior for the BTW model and FBM. Universal distribution function of generalized degree is found for these models which have the same scaling behavior as the Barabasi-Albert network.