Time Complexity Analysis of Graph Algorithms in Big Data: Evaluating the Performance of PageRank and Shortest Path Algorithms for Large-Scale Networks
Keywords:
graph algorithms, PageRankAbstract
We investigate temporal complexity of PageRank and shortest path methods in large-scale big data networks. Speed depends on an awareness of the computational difficulty of graph-based structural algorithms for large-scale networks. Web page assessment and node route finding have to be evaluated for accuracy, scalability, and efficiency as network traffic increases fast.
PageRank ranks network nodes in connection recursively. Graph nodes, edges, and convergence conditions determine temporal complexity of an algorithm. To derive PageRank's iterative and temporal complexity, we investigate network size, convergence tolerance, and damping factor. Investigate how distributed and parallel processing impact large network PageRank. We evaluate the method on dynamic and stationary networks with evolving topology. Although algorithmic and infrastructural improvements may lower PageRank's computational complexity, network scale increases it.
References
A. V. Kurland and A. H. Schuster, "Graph algorithms in the age of big data," IEEE Transactions on Knowledge and Data Engineering, vol. 27, no. 6, pp. 1522-1534, June 2015.
S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," in Proceedings of the Seventh International World Wide Web Conference, Brisbane, Australia, 1998, pp. 107-117.
Tamanampudi, Venkata Mohit. "AI Agents in DevOps: Implementing Autonomous Agents for Self-Healing Systems and Automated Deployment in Cloud Environments." Australian Journal of Machine Learning Research & Applications 3.1 (2023): 507-556.
Pereira, Juan Carlos, and Tobias Svensson. "Broker-Led Medicare Enrollments: Assessing the Long-Term Consumer Financial Impact of Commission-Driven Choices." Journal of Artificial Intelligence Research and Applications 4.1 (2024): 627-645.
Hernandez, Jorge, and Thiago Pereira. "Advancing Healthcare Claims Processing with Automation: Enhancing Patient Outcomes and Administrative Efficiency." African Journal of Artificial Intelligence and Sustainable Development 4.1 (2024): 322-341.
Vallur, Haani. "Predictive Analytics for Forecasting the Economic Impact of Increased HRA and HSA Utilization." Journal of Deep Learning in Genomic Data Analysis 2.1 (2022): 286-305.
Russo, Isabella. "Evaluating the Role of Data Intelligence in Policy Development for HRAs and HSAs." Journal of Machine Learning for Healthcare Decision Support 3.2 (2023): 24-45.
Naidu, Kumaran. "Integrating HRAs and HSAs with Health Insurance Innovations: The Role of Technology and Data." Distributed Learning and Broad Applications in Scientific Research 10 (2024): 399-419.
S. Kumari, “Integrating AI into Kanban for Agile Mobile Product Development: Enhancing Workflow Efficiency, Real-Time Monitoring, and Task Prioritization ”, J. Sci. Tech., vol. 4, no. 6, pp. 123–139, Dec. 2023
Tamanampudi, Venkata Mohit. "Autonomous AI Agents for Continuous Deployment Pipelines: Using Machine Learning for Automated Code Testing and Release Management in DevOps." Australian Journal of Machine Learning Research & Applications 3.1 (2023): 557-600.
E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, no. 1, pp. 269-271, 1959.
R. Bellman, "On the construction of a new type of graph," The American Mathematical Monthly, vol. 67, no. 8, pp. 677-682, 1960.
S. Das, T. D. Pham, and G. R. Gupta, "Analysis of algorithms for the shortest path problem," International Journal of Computer Applications, vol. 48, no. 10, pp. 28-34, 2012.
M. A. de Carvalho and A. R. de Carvalho, "Time complexity analysis of the PageRank algorithm for large-scale networks," Journal of Computational and Applied Mathematics, vol. 299, pp. 123-135, April 2016.
H. Wang, C. Wang, and D. Hu, "An efficient parallel algorithm for PageRank on large scale graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 30, no. 6, pp. 1301-1313, June 2019.
B. H. Neuman and J. F. Meyer, "Parallel Dijkstra's algorithm for shortest paths on large graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 9, pp. 1663-1676, Sept. 2012.
Tamanampudi, Venkata Mohit. "AI and NLP in Serverless DevOps: Enhancing Scalability and Performance through Intelligent Automation and Real-Time Insights." Journal of AI-Assisted Scientific Discovery 3.1 (2023): 625-665.
D. R. Karger, R. Motwani, and S. Raghavan, "On approximate distributions and the PageRank algorithm," Proceedings of the 29th ACM Symposium on Theory of Computing, El Paso, TX, USA, 1997, pp. 27-36.
C. C. Ko and S. J. Wu, "A parallel algorithm for shortest path problems in large-scale networks," IEEE Transactions on Systems, Man, and Cybernetics, vol. 29, no. 1, pp. 115-128, Jan. 1999.
D. K. Tsai, L. C. Wong, and R. M. H. Wong, "A survey of graph mining techniques and applications," IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 45, no. 9, pp. 1182-1196, Sept. 2015.
C. T. and W. K. Wang, "Comparative study of Dijkstra's and A* algorithms in network routing," Journal of Computer Networks and Communications, vol. 2015, pp. 1-8, 2015.
P. K. Shih, "Distributed algorithms for computing PageRank in massive graphs," IEEE Transactions on Knowledge and Data Engineering, vol. 29, no. 10, pp. 2227-2240, Oct. 2017.
J. T. Tsai, M. H. Lin, and W. C. Hsu, "Time complexity and performance evaluation of the Bellman-Ford algorithm," International Journal of Computer Applications, vol. 98, no. 6, pp. 1-6, July 2014.
K. Asif, "A comparative study of PageRank and HITS algorithms in web ranking," International Journal of Computer Applications, vol. 103, no. 11, pp. 1-7, Oct. 2014.
C. Liu, "Algorithms for computing shortest paths in graphs: A survey," IEEE Transactions on Emerging Topics in Computing, vol. 7, no. 4, pp. 735-751, Oct.-Dec. 2019.
S. Das, "An empirical evaluation of parallel algorithms for PageRank computation," IEEE Transactions on Parallel and Distributed Systems, vol. 30, no. 4, pp. 794-805, April 2019.
X. Y. Wang and Y. N. Huang, "On the scalability of PageRank algorithm in distributed systems," IEEE Transactions on Cloud Computing, vol. 8, no. 1, pp. 110-121, Jan.-March 2020.
V. Prakash, "Effective algorithms for shortest path computation in large-scale networks," IEEE Access, vol. 8, pp. 113145-113155, 2020.
M. S. Baik, "Recent developments in shortest path algorithms: A survey," IEEE Transactions on Big Data, vol. 5, no. 4, pp. 497-509, Dec. 2019.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
