Graph Neural Networks: Mathematical Foundations, Modern Architectures, and Future Directions

سال انتشار: 1405
نوع سند: مقاله ژورنالی
زبان: فارسی
مشاهده: 48

فایل این مقاله در 26 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_JAMFN-16-2_009

تاریخ نمایه سازی: 29 مهر 1405

چکیده مقاله:

چکیده:Graph Neural Networks (GNNs) have become a central framework for learning from graph-structured data, with applications in social networks, recommendation systems, molecular science, knowledge graphs, and scientific discovery. This survey reviews the mathematical foundations, architectural evolution, and emerging directions of GNNs in a compact and unified form. We discuss message passing, spectral graph theory, graph convolution, attention-based aggregation, expressivity, stability, and the main limitations of deep graph models. Representative architectures, including recurrent GNNs, GCN, GraphSAGE, MPNN, GAT, heterogeneous GNNs, graph transformers, and graph language models, are compared from the viewpoint of their design principles, strengths, limitations, and application domains. The survey also summarizes benchmark datasets, practical modeling considerations, and future challenges such as scalability, over-smoothing, over-squashing, uncertainty estimation, foundation models, and graph--language integration. The aim is to provide a concise reference that connects theory, architecture, and practice in modern graph representation learning.

نویسندگان

Hassan Maleki

Faculty of Mathematical Sciences and Statistics, Malayer University, Malayer, Iran, Iran.

Yazdan Golzadeh

Math Teacher, Department of Education, Tehran, Iran