Mohammad Mahdi Emadi Kouchak
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mohammad Mahdi Emadi Kouchak has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Farshad Safaei
Shahid Beheshti University,Faculty of Computer Science and Engineering,Tehran,Iran
3 shared publications - M. Khoddam Astaneh Hossein
Department of Computer Science, University of Calgary, Calgary, Canada
1 shared publication M. M.
1 shared publication- Midia Reshadi
Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
1 shared publication - S. E. Sajadi
Faculty of Computer Science and Engineering, Shahid Beheshti University, Tehran, Iran
1 shared publication
Latest Publications
- 24 October 2024
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 68 (3) , 283-305
Error and attack vulnerability of Apollonian networks
This article examines the resilience of different Apollonian network (AN) types—deterministic, random, and evolutionary—to systematic attacks. ANs, members of the family of maximal planar graphs, possess unique properties such as high clustering coefficients, small-world properties, scale-free behavior, Euclidean and space-filling properties, and modularity. These peculiarities require a thorough investigation of their robustness. This work presents a novel approach to studying ANs by implementing evolutionary Apollonian networks (EANs). These EANs include various probabilities distribution functions, including exponential, degenerate, logistic, Pareto, and stable (Cauchy, Lévy, Normal) distributions. To improve the robustness of these networks, we propose a novel edge rewiring mechanism using a genetic algorithm (GA). The GA aims to optimize a combined metric that includes the Flow Robustness of Degree (SFRD), Betweenness (SFRB), and Dangalchev's closeness (SFRC) centralities while preserving the original degree distribution and structural properties of the network. To evaluate the effectiveness of this approach, we use various robustness measures to assess the resilience of different AN types. The results show that SFRB, SFRD, and SFRC effectively rank ANs based on their robustness.
- 24 October 2024
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 68 (3) , 283-305
Error and attack vulnerability of Apollonian networks
This article examines the resilience of different Apollonian network (AN) types—deterministic, random, and evolutionary—to systematic attacks. ANs, members of the family of maximal planar graphs, possess unique properties such as high clustering coefficients, small-world properties, scale-free behavior, Euclidean and space-filling properties, and modularity. These peculiarities require a thorough investigation of their robustness. This work presents a novel approach to studying ANs by implementing evolutionary Apollonian networks (EANs). These EANs include various probabilities distribution functions, including exponential, degenerate, logistic, Pareto, and stable (Cauchy, Lévy, Normal) distributions. To improve the robustness of these networks, we propose a novel edge rewiring mechanism using a genetic algorithm (GA). The GA aims to optimize a combined metric that includes the Flow Robustness of Degree (SFRD), Betweenness (SFRB), and Dangalchev's closeness (SFRC) centralities while preserving the original degree distribution and structural properties of the network. To evaluate the effectiveness of this approach, we use various robustness measures to assess the resilience of different AN types. The results show that SFRB, SFRD, and SFRC effectively rank ANs based on their robustness.
- 24 June 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (7) , 1-29
QRP: quantum reliability polynomial for stochastic reliability analysis of reversible circuits
- 24 June 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (7) , 1-29
QRP: quantum reliability polynomial for stochastic reliability analysis of reversible circuits
- 2 August 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (2) , 1705-1749
Graph entropies-graph energies indices for quantifying network structural irregularity
- 2 August 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (2) , 1705-1749
Graph entropies-graph energies indices for quantifying network structural irregularity