<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="review-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Informacionnye Tehnologii</journal-id><journal-title-group><journal-title xml:lang="en">Informacionnye Tehnologii</journal-title><trans-title-group xml:lang="ru"><trans-title>Информационные технологии</trans-title></trans-title-group></journal-title-group><issn publication-format="print">1684-6400</issn><publisher><publisher-name xml:lang="en">New Technologies Publishing House</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">702267</article-id><article-id pub-id-type="doi">10.17587/it.31.291-307</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Neural network technologies</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Нейросетевые технологии</subject></subj-group><subj-group subj-group-type="article-type"><subject>Review Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Graph neural networks and their extensions based on hyperbolic geometry: a review</article-title><trans-title-group xml:lang="ru"><trans-title>Графовые нейронные сети и их расширение на основе гиперболической геометрии: обзор</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Petrenko</surname><given-names>P. B.</given-names></name><name xml:lang="ru"><surname>Петренко</surname><given-names>П. Б.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Dr. of Tech. Sc., Professor, Signal Processing Center</p></bio><bio xml:lang="ru"><p>д-р техн. наук, проф., член-корр. Российской инженерной академии, Центр обработки сигналов</p></bio><email>prof.petrenko54@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Tolpygin</surname><given-names>А. S.</given-names></name><name xml:lang="ru"><surname>Толпыгин</surname><given-names>А. С.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Cand. of Tech. Sc.</p></bio><bio xml:lang="ru"><p>канд. техн. наук, доц.</p></bio><email>tolpygin@bmstu.ru</email><xref ref-type="aff" rid="aff2"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Synergy Design Bureau</institution></aff><aff><institution xml:lang="ru">КБ "Синергия"</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Bauman Moscow State Technical University</institution></aff><aff><institution xml:lang="ru">МГТУ им. Н. Э. Баумана</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2025-06-15" publication-format="electronic"><day>15</day><month>06</month><year>2025</year></pub-date><volume>31</volume><issue>6</issue><issue-title xml:lang="en"/><issue-title xml:lang="ru"/><fpage>291</fpage><lpage>307</lpage><history><date date-type="received" iso-8601-date="2026-02-06"><day>06</day><month>02</month><year>2026</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2025, Informacionnye Tehnologii</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2025, Информационные технологии</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="en">Informacionnye Tehnologii</copyright-holder><copyright-holder xml:lang="ru">Информационные технологии</copyright-holder></permissions><self-uri xlink:href="https://journals.eco-vector.com/1684-6400/article/view/702267">https://journals.eco-vector.com/1684-6400/article/view/702267</self-uri><abstract xml:lang="en"><p>Graph neural networks generalize traditional neural networks for graph-structured data and have attracted wide attention due to their impressive capabilities. They are in demand in machine learning, as they can work with heterogeneous information, help to identify relationships between events and data, provide robustness to incomplete, unclear and noisy data, allow to analysis of large amounts of data and structures in the form of knowledge graphs. Training of graph neural networks in hyperbolic space has gained popularity in recent years due to their ability to model graphs with hidden hierarchical data, and because they are more compact and denser. The purpose of applying non-Euclidean geometry theory in modifying graph neural networks is to ensure their stability and better performance compared to Euclidean neural networks. The review of research and development is devoted to the analysis of modern achievements in the field of graph neural networks creation and consideration of accompanying problems. Particular attention is paid to the issues of graph embedding and their representation in non-Euclidean space. This is due to the fact that the performance of models is largely determined by the embedding algorithms and the choice of geometric space for representing graph structures. The prospectivity and efficiency of this approach have been confirmed by works on the creation of hyperbolic convolutional networks of graphs with the property of controlling the curvature of the space in each layer. At the same time, today there is a need for a more detailed consideration of the possibilities of graph neural networks based on the application of methods of hyperbolic geometry because of the insufficient attention paid to these issues in the domestic literature.</p></abstract><trans-abstract xml:lang="ru"><p>Графовые нейронные сети обобщают традиционные нейронные сети для данных с графовой структурой и привлекают широкое внимание благодаря своим впечатляющим возможностям. Они востребованы в машинном обучении, так как позволяют работать c разнородной информацией, способствуют выявлению взаимосвязей между событиями и данными, обеспечивают устойчивость к неполным, нечетким и зашумленным данным, позволяют проводить анализ большого объема данных и структур в виде графов знаний.</p> <p>Обучение графовых нейронных сетей в гиперболическом пространстве приобрело популярность в последние годы благодаря их способности моделировать графы со скрытыми иерархическими данными, а также вследствие того, что они более компактны и плотны. Цель применения неевклидовой геометрии для расширения графовых нейронных сетей состоит в обеспечении их высокой точности и лучшей производительности в сравнении с евклидовыми нейронными сетями.</p> <p>Обзор исследований и разработок посвящен анализу современных достижений в области создания графовых нейронных сетей и рассмотрению сопутствующих этому проблем. Особое внимание уделено вопросам встраивания графов и их представлению в неевклидовом пространстве. Это обусловлено тем, что производительность моделей во многом определяется алгоритмами встраивания и выбором геометрического пространства для представления графовых структур. Перспективность и эффективность этого подхода подтвердили работы по созданию гиперболических сверточных сетей графов, обладающих свойством управления кривизной пространства в каждом слое. Вместе с этим, сегодня возникает потребность более подробного рассмотрения возможностей графовых нейронных сетей на основе применения методов гиперболической геометрии из-за недостаточного внимания, уделяемого этим вопросам в отечественной литературе.</p></trans-abstract><kwd-group xml:lang="en"><kwd>graph neural networks (GNN)</kwd><kwd>graph representation learning</kwd><kwd>hyperbolic geometry</kwd><kwd>hyperbolic graph neural networks (HGNN)</kwd><kwd>Poincare model</kwd><kwd>Lorenz model</kwd><kwd>hyperbolic graph convolutional networks (HGCN)</kwd><kwd>hyperbolic convolutional</kwd><kwd>hyperbolic deep graph convolutional neural network (HDGCNN)</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>графовые нейронные сети (GNN)</kwd><kwd>обучение представлению графа</kwd><kwd>гиперболическая геометрия</kwd><kwd>гиперболические графовые нейронные сети (HGNN)</kwd><kwd>модель Пуанкаре</kwd><kwd>модель Лоренца</kwd><kwd>гиперболические графовые сверточные сети (HGCN)</kwd><kwd>гиперболическая сверточная нейронная сеть</kwd><kwd>гиперболическая сверточная нейронная сеть с глубоким графом (HDGCNN)</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">Broadwater K., Stillman M. Graph Neural Networks in Action. Version 4. MEAP Edition, USA, Manning Publications Co, 2020, 300 р.</mixed-citation><mixed-citation xml:lang="ru">Broadwater K., Stillman M. Graph Neural Networks in Action. Version 4. MEAP Edition. Manning Publications Co. USA. 2020. 300 р.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">Zonghan W., Pan S., Chen F., Long G. A comprehensive survey on graph neural networks, IEEE Transactions on Neural Networks and Learning Systems, 2020, vol. 32, edition 1, pp. 4-24.</mixed-citation><mixed-citation xml:lang="ru">Zonghan W., Pan S., Chen F., Long G. A comprehensive survey on graph neural networks // IEEE Transactions on Neural Networks and Learning Systems. 2020. Vol. 32, edition 1. P. 4-24.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">Ward I. R., Joyner J., Lickfold C., Guo Y., Bennamoun M. A Practical Tutorial on Graph Neural Networks, arXiv:2010.05234v3, 2021, pp. 35.</mixed-citation><mixed-citation xml:lang="ru">Ward I. R., Joyner J., Lickfold C., Guo Y., Bennamoun M. A Practical Tutorial on Graph Neural Networks // arXiv:2010.05234v3. 2021. P. 35.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">Sperduti A., Starit A. Supervised neural networks for the classification of structures, IEEE Transactions on Neural Networks, 1997, vol. 8, no. 3, pp. 714-735.</mixed-citation><mixed-citation xml:lang="ru">Sperduti A., Starit A. Supervised neural networks for the classification of structures // IEEE Transactions on Neural Networks. 1997. Vol. 8, N. 3. P. 714-735.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">Zhang Z., Cui P., Zhu W. Deep Learning on Graphs: A Survey, Journal of Latex Class Files, 2015, vol. 14, no. 8, pp. 24.</mixed-citation><mixed-citation xml:lang="ru">Zhang Z., Cui P., Zhu W. Deep Learning on Graphs: A Survey // Journal of Latex Class Files. 2015. Vol. 14, N. 8. P. 24.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">Nickel M., Kiela D. Poincar'e embeddings for learning hierarchical representations, 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA, 2017, p. 10.</mixed-citation><mixed-citation xml:lang="ru">Nickel M., Kiela D. Poincar'e embeddings for learning hierarchical representations // 31st Conference on Neural Information Processing Systems (NIPS 2017). Long Beach, CA, USA, 2017. P. 10.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">Ritter H. Self-organizing maps on non-Euclidean spaces, In Kohonen maps, Elsevier, 1999, pp. 97-109.</mixed-citation><mixed-citation xml:lang="ru">Ritter H. Self-organizing maps on non-Euclidean spaces // In Kohonen maps. Elsevier, 1999. P. 97-109.</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">Nickel M., Kiela D. Learning Continuous Hierarchies in the Lorentz Model of Hyperbolic Geometry, Proceedings of the 35th International Conference on Machine Learning (ICML 2018), Stockholm, Sweden, 2018, 10-15 July, pp. 3776-3785.</mixed-citation><mixed-citation xml:lang="ru">Nickel M., Kiela D. Learning Continuous Hierarchies in the Lorentz Model of Hyperbolic Geometry // Proceedings of the 35th International Conference on Machine Learning (ICML 2018). Stockholm, Sweden. 2018. 10-15 July. P. 3776-3785.</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">Zhang Y., Wang X., Shi C., Liu N., Song G. Lorentzian. Graph Convolutional Networks, Proceedings of the The Web Conference (WWW 2021), Ljubljana, Slovenia, 2021, 19-23 April, ACM/IW3C2, 2021, pp. 1249-1261.</mixed-citation><mixed-citation xml:lang="ru">Zhang Y., Wang X., Shi C., Liu N., Song G. Lorentzian. Graph Convolutional Networks // Proceedings of the The Web Conference (WWW 2021); Ljubljana, Slovenia. 2021. 19-23 April. ACM/IW3C2. 2021. P. 1249-1261.</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">Liu Q., Nickel M., Kiela D. Hyperbolic Graph Neural Networks, arXiv:1910.12892v1, 2019.</mixed-citation><mixed-citation xml:lang="ru">Liu Q., Nickel M., Kiela D. Hyperbolic Graph Neural Networks // arXiv:1910.12892v1. 2019.</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">Bronstein M. M., Bruna J., LeCun Y., Szlam A., Vandergheynst P. Geometric deep learning: going beyond Euclidean data, IEEE Signal Processing Magazine, 2017, vol. 34, no. 4, pp. 18-42.</mixed-citation><mixed-citation xml:lang="ru">Bronstein M. M., Bruna J., LeCun Y., Szlam A., Vandergheynst P. Geometric deep learning: going beyond Euclidean data // IEEE Signal Processing Magazine. 2017. Vol. 34, N. 4. P. 18-42.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">Khamsi M. A. An Introduction to Metric Spaces and Fixed-Point Theory, New York, Wiley, 2001, 320 p.</mixed-citation><mixed-citation xml:lang="ru">Khamsi M. A. An Introduction to Metric Spaces and Fixed-Point Theory. New York: Wiley, 2001. P. 320.</mixed-citation></citation-alternatives></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">Chami I., Ying Z., R@e C., Leskovec J. Hyperbolic graph convolutional neural networks, Advances in Neural Information Processing Systems, 2019, vol. 32, pp. 4868-4879.</mixed-citation><mixed-citation xml:lang="ru">Chami I., Ying Z., R e C., Leskovec J. Hyperbolic graph convolutional neural networks // Advances in Neural Information Processing Systems. 2019. Vol. 32. P. 4868-4879.</mixed-citation></citation-alternatives></ref><ref id="B14"><label>14.</label><citation-alternatives><mixed-citation xml:lang="en">Zamir J. A. R., Savarese S., Saxena A. Structural-RNN: Deep Learning on Spatio-Temporal Graphs, Computer Science, 2016, p. 10.</mixed-citation><mixed-citation xml:lang="ru">Zamir J. A. R., Savarese S., Saxena A. Structural-RNN: Deep Learning on Spatio-Temporal Graphs // Computer Science. 2016. P. 10.</mixed-citation></citation-alternatives></ref><ref id="B15"><label>15.</label><citation-alternatives><mixed-citation xml:lang="en">Wang J., Zheng V. W., Liu Z., Chang K. C.-C. Topological Recurrent Neural Network for Diffusion Prediction, Compute Science, 2017, vol. 1, pp. 475-484.</mixed-citation><mixed-citation xml:lang="ru">Wang J., Zheng V. W., Liu Z., Chang K. C.-C. Topological Recurrent Neural Network for Diffusion Prediction // Compute Science. 2017. Vol. 1. P. 475-484.</mixed-citation></citation-alternatives></ref><ref id="B16"><label>16.</label><citation-alternatives><mixed-citation xml:lang="en">Chen J., Ma T., Xiao C. FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling, Proceedings of the 6th International Conference on Learning Representations (ICLR 2018), Vancouver, BC, Canada, 2018, p. 15.</mixed-citation><mixed-citation xml:lang="ru">Chen J., Ma T., Xiao C. FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling // Proceedings of the 6th International Conference on Learning Representations (ICLR 2018). Vancouver, BC, Canada. 2018. P. 15.</mixed-citation></citation-alternatives></ref><ref id="B17"><label>17.</label><citation-alternatives><mixed-citation xml:lang="en">Bruna J., Zaremba W., Szlam A., LeCun Y. Spectral Networks and Locally Connected Networks on Graphs, Proceedings of the 2nd International Conference on Learning Representations (ICLR 2014), Banff, AB, Canada, ICLR, 2014, p. 14.</mixed-citation><mixed-citation xml:lang="ru">Bruna J., Zaremba W., Szlam A., LeCun Y. Spectral Networks and Locally Connected Networks on Graphs // Proceedings of the 2nd International Conference on Learning Representations (ICLR 2014). Banff, AB, Canada: ICLR, 2014. P. 14.</mixed-citation></citation-alternatives></ref><ref id="B18"><label>18.</label><citation-alternatives><mixed-citation xml:lang="en">Jain A., Zamir A. R., Savarese S., Saxena A. Structural-RNN: Deep Learning on Spatio-Temporal Graphs, Computer Science, 2016, p. 10.</mixed-citation><mixed-citation xml:lang="ru">Jain A., Zamir A. R., Savarese S., Saxena A. Structural-RNN: Deep Learning on Spatio-Temporal Graphs // Computer Science. 2016. P. 10.</mixed-citation></citation-alternatives></ref><ref id="B19"><label>19.</label><citation-alternatives><mixed-citation xml:lang="en">Zhang C., Swami A., Chawla N. V. SHNE: Representation Learning for Semantic-Associated Heterogeneous Networks, Proceedings of the 12th International Conference on Web Search and Data Mining (WSDM 2019), Melbourne, VIC, Australia, 2019, pp. 690-698.</mixed-citation><mixed-citation xml:lang="ru">Zhang C., Swami A., Chawla N. V. SHNE: Representation Learning for Semantic-Associated Heterogeneous Networks // Proceedings of the 12th International Conference on Web Search and Data Mining (WSDM 2019). Melbourne, VIC, Australia. 2019. P. 690-698.</mixed-citation></citation-alternatives></ref><ref id="B20"><label>20.</label><citation-alternatives><mixed-citation xml:lang="en">Sahili Z. A., Awad M. Spatio-Temporal Graph Neural Networks: A Survey, Preprint, 2023, 12 p.</mixed-citation><mixed-citation xml:lang="ru">Sahili Z. A., Awad M. Spatio-Temporal Graph Neural Networks: A Survey. Preprint. 2023. P. 12.</mixed-citation></citation-alternatives></ref><ref id="B21"><label>21.</label><citation-alternatives><mixed-citation xml:lang="en">Zhang H., Li P., Zhang R., Li X. Embedding Graph Auto-Encoder for Graph Clustering, IEEE Transactions on Neural Networks and Learning Systems, 2022, pp. 11.</mixed-citation><mixed-citation xml:lang="ru">Zhang H., Li P., Zhang R., Li X. Embedding Graph Auto-Encoder for Graph Clustering // IEEE Transactions on Neural Networks and Learning Systems. 2022. P. 11.</mixed-citation></citation-alternatives></ref><ref id="B22"><label>22.</label><citation-alternatives><mixed-citation xml:lang="en">Scarselli F., Gori M., A. Chung T., Hagenbuchner M., Monfardini G. The Graph Neural Network Model // IEEE Transactions on Networks. 2009, vol. 20, no. 1, pp. 61-80.</mixed-citation><mixed-citation xml:lang="ru">Scarselli F., Gori M., A. Chung T., Hagenbuchner M., Monfardini G. The Graph Neural Network Model // IEEE Transactions on Networks. 2009. Vol. 20, N. 1. P. 61-80.</mixed-citation></citation-alternatives></ref><ref id="B23"><label>23.</label><citation-alternatives><mixed-citation xml:lang="en">Blasius T., Friedrich T., Katzmann M., Meyer U., Penschuck M., Weyand C. Efficiently generating geometric inhomogeneous and hyperbolic random graphs // Network Science, 2022, pp. 1-20.</mixed-citation><mixed-citation xml:lang="ru">Blasius T., Friedrich T., Katzmann M., Meyer U., Penschuck M., Weyand C. Efficiently generating geometric inhomogeneous and hyperbolic random graphs // Network Science. 2022. P. 1-20.</mixed-citation></citation-alternatives></ref><ref id="B24"><label>24.</label><citation-alternatives><mixed-citation xml:lang="en">Khemani B., Patil S., Kotecha K., Tanwar S. A review of graph neural networks: concepts, architectures, techniques, challenges, datasets, applications, and future directions // Journal of Big Data, 2024, no. 18, pp. 2-40.</mixed-citation><mixed-citation xml:lang="ru">Khemani B., Patil S., Kotecha K., Tanwar S. A review of graph neural networks: concepts, architectures, techniques, challenges, datasets, applications, and future directions // Journal of Big Data. 2024. N. 18. P. 2-40.</mixed-citation></citation-alternatives></ref><ref id="B25"><label>25.</label><citation-alternatives><mixed-citation xml:lang="en">Nunes M., Pappa G. L. Neural Architecture Search in Graph Neural Networks // arXiv:2008.00077v1, 2020, p. 15.</mixed-citation><mixed-citation xml:lang="ru">Nunes M, Pappa G. L. Neural Architecture Search in Graph Neural Networks // arXiv:2008.00077v1, 2020. P. 15.</mixed-citation></citation-alternatives></ref><ref id="B26"><label>26.</label><citation-alternatives><mixed-citation xml:lang="en">LeCun Y., Bottou L., Bengio Y., Haffner P. Gradient-Based Learning Applied to Document Recognition // Proceedings of the IEEE. 1998, vol. 86, no. 11, pp. 2278-2324.</mixed-citation><mixed-citation xml:lang="ru">LeCun Y., Bottou L., Bengio Y., Haffner P. Gradient-Based Learning Applied to Document Recognition // Proceedings of the IEEE. 1998. Vol. 86, N. 11. P. 2278-2324.</mixed-citation></citation-alternatives></ref><ref id="B27"><label>27.</label><citation-alternatives><mixed-citation xml:lang="en">Zhou J., Cui G., Hu S., Zhang Z., Yang C., Liu Z., Wang L., Li C., Sun M. Graph neural networks: A review of methods and applications // AI Open. 2020, vol. 1, pp. 57-81.</mixed-citation><mixed-citation xml:lang="ru">Zhou J., Cui G., Hu S., Zhang Z., Yang C., Liu Z., Wang L., Li C., Sun M. Graph neural networks: A review of methods and applications // AI Open. 2020. Vol. 1. P. 57-81.</mixed-citation></citation-alternatives></ref><ref id="B28"><label>28.</label><citation-alternatives><mixed-citation xml:lang="en">Makarov I., Kiselev D., Nikitinsky N., Subelj L. Survey on graph embeddings and their applications to machine learning problems on graphs // Peer. J. Comput. Sci., 2021, p. 62.</mixed-citation><mixed-citation xml:lang="ru">Makarov I., Kiselev D., Nikitinsky N., Subelj L. Survey on graph embeddings and their applications to machine learning problems on graphs // Peer. J. Comput. Sci. 2021. P. 62.</mixed-citation></citation-alternatives></ref><ref id="B29"><label>29.</label><citation-alternatives><mixed-citation xml:lang="en">Cai H., Zheng V. W., Chang K. C.-C. A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applications // arXiv:1709.07604v3, 2018, p. 20.</mixed-citation><mixed-citation xml:lang="ru">Cai H., Zheng V. W., Chang K. C.-C. A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applications // arXiv:1709.07604v3, 2018. P. 20.</mixed-citation></citation-alternatives></ref><ref id="B30"><label>30.</label><citation-alternatives><mixed-citation xml:lang="en">Xu M. Understanding graph embedding method and their application // arXiv:2012.08019v1, 2020, p. 34.</mixed-citation><mixed-citation xml:lang="ru">Xu M. Understanding graph embedding method and their application // arXiv:2012.08019v1. 2020. P. 34.</mixed-citation></citation-alternatives></ref><ref id="B31"><label>31.</label><citation-alternatives><mixed-citation xml:lang="en">Cao S., Lu W., Xu Q. GraRep: Learning graph representations with global structural information // Proceedings of the 24th ACM International on conference on information and knowledge management, 2015, pp. 891-900.</mixed-citation><mixed-citation xml:lang="ru">Cao S., Lu W., Xu Q. GraRep: Learning graph representations with global structural information // Proceedings of the 24th ACM International on conference on information and knowledge management. 2015. P. 891-900.</mixed-citation></citation-alternatives></ref><ref id="B32"><label>32.</label><citation-alternatives><mixed-citation xml:lang="en">Ou M., Cui P., Pei J., Zhang Z., Zhu W. Asymmetric transitivity preserving graph embedding // Proceedings of the 22nd ACMSIGKDD International conference on Knowledge discovery and datamining, 2016, pp. 1105-1114.</mixed-citation><mixed-citation xml:lang="ru">Ou M., Cui P., Pei J., Zhang Z., Zhu W. Asymmetric transitivity preserving graph embedding // Proceedings of the 22nd ACMSIGKDD International conference on Knowledge discovery and datamining. 2016. P. 1105-1114.</mixed-citation></citation-alternatives></ref><ref id="B33"><label>33.</label><citation-alternatives><mixed-citation xml:lang="en">Perozzi B., Al-Rfou R., Skiena S. Deepwalk: Online learning of social representations // Proceedings of the 20th ACMSIGKDD International conference on Knowledge discovery and datamining, 2014, pp. 701-710.</mixed-citation><mixed-citation xml:lang="ru">Perozzi B., Al-Rfou R., Skiena S. Deepwalk: Online learning of social representations // Proceedings of the 20th ACMSIGKDD International conference on Knowledge discovery and datamining. 2014. P. 701-710.</mixed-citation></citation-alternatives></ref><ref id="B34"><label>34.</label><citation-alternatives><mixed-citation xml:lang="en">Tang J., Qu M., Wang M., Zhang M., Yan J., Mei Q. Line: Large-scale information network embedding // Proceedings of the 24th International conference on world wide web, 2015, pp. 1067-1077.</mixed-citation><mixed-citation xml:lang="ru">Tang J., Qu M., Wang M., Zhang M., Yan J., Mei Q. Line: Large-scale information network embedding // Proceedings of the 24th International conference on world wide web, 2015. P. 1067-1077.</mixed-citation></citation-alternatives></ref><ref id="B35"><label>35.</label><citation-alternatives><mixed-citation xml:lang="en">Grover A., Leskovec J. Node2vec: Scalable feature learning for networks // Proceedings of the 22nd ACMSIGKDD International conference on Knowledge discovery and data mining, 2016, pp. 855-864.?</mixed-citation><mixed-citation xml:lang="ru">Grover A., Leskovec J. Node2vec: Scalable feature learning for networks // Proceedings of the 22nd ACMSIGKDD International conference on Knowledge discovery and data mining. 2016. P. 855-864.</mixed-citation></citation-alternatives></ref><ref id="B36"><label>36.</label><citation-alternatives><mixed-citation xml:lang="en">Wang D., Cui P., Zhu W. Structural deep network embedding // Proceedings of the 22nd ACMSIGKDD International conference on Knowledge discovery and datamining, 2016, pp. 1225-1234.</mixed-citation><mixed-citation xml:lang="ru">Wang D., Cui P., Zhu W. Structural deep network embedding // Proceedings of the 22nd ACMSIGKDD International conference on Knowledge discovery and datamining, 2016. P. 1225-1234.</mixed-citation></citation-alternatives></ref><ref id="B37"><label>37.</label><citation-alternatives><mixed-citation xml:lang="en">Bojchevski А., Gunnemann S. Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking // Journal reference: International Conference on Learning Representations ICLR, 2018, p. 13.</mixed-citation><mixed-citation xml:lang="ru">Bojchevski А., Gunnemann S. Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking // Journal reference: International Conference on Learning Representations ICLR. 2018. P. 13.</mixed-citation></citation-alternatives></ref><ref id="B38"><label>38.</label><citation-alternatives><mixed-citation xml:lang="en">He S., Liu K., Ji G., Zhao J. Learning to represent knowledge graphs with gaussian embedding // Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, 2015, pp. 623-632.</mixed-citation><mixed-citation xml:lang="ru">He S., Liu K., Ji G., Zhao J. Learning to represent knowledge graphs with gaussian embedding // Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. 2015. P. 623-632.</mixed-citation></citation-alternatives></ref><ref id="B39"><label>39.</label><citation-alternatives><mixed-citation xml:lang="en">Zhu D., Cui P., Wang D., Zhu W. Deep variational network embedding in Wasserstein space // Proceedings of the 24th ACMSIGKDD International Conference on Knowledge Discovery &amp; Data Mining, 2018, pp. 2827-2836.</mixed-citation><mixed-citation xml:lang="ru">Zhu D., Cui P., Wang D., Zhu W. Deep variational network embedding in Wasserstein space // Proceedings of the 24th ACMSIGKDD International Conference on Knowledge Discovery &amp; Data Mining. 2018. P. 2827-2836.</mixed-citation></citation-alternatives></ref><ref id="B40"><label>40.</label><citation-alternatives><mixed-citation xml:lang="en">Hoang V. T., Jeon H.-J., You E.-S., Yoon Y., Jung S., Lee O.-J. Graph Representation Learning and Its Applications: A Survey // Sensors (Basel), 2023, vol. 23, no. 8, p. 104.</mixed-citation><mixed-citation xml:lang="ru">Hoang V. T., Jeon H.-J., You E.-S., Yoon Y., Jung S., Lee O.-J. Graph Representation Learning and Its Applications: A Survey // Sensors (Basel). 2023. Vol. 23, N. 8. P. 104.</mixed-citation></citation-alternatives></ref><ref id="B41"><label>41.</label><citation-alternatives><mixed-citation xml:lang="en">Nikolentzos G., Siglidis G., Vazirgiannis M. Graph Kernels: A Survey // J. Artif. Intel. Res. 2021, vol. 72, pp. 943-1027.</mixed-citation><mixed-citation xml:lang="ru">Nikolentzos G., Siglidis G., Vazirgiannis M. Graph Kernels: A Survey // J. Artif. Intel. Res. 2021. Vol. 72. P. 943-1027.</mixed-citation></citation-alternatives></ref><ref id="B42"><label>42.</label><citation-alternatives><mixed-citation xml:lang="en">Brody S., Alon U., Yahav E. How Attentive are Graph Attention Networks? // Proceedings of the 10th International Conference on Learning Representations (ICLR 2022). Virtual Event, 2022, p. 26.</mixed-citation><mixed-citation xml:lang="ru">Brody S., Alon U., Yahav E. How Attentive are Graph Attention Networks? // Proceedings of the 10th International Conference on Learning Representations (ICLR 2022). Virtual Event. 2022. P. 26.</mixed-citation></citation-alternatives></ref><ref id="B43"><label>43.</label><citation-alternatives><mixed-citation xml:lang="en">Lee J. B., Rossi R. A., Kim S., Ahmed N. K., Koh E. Attention models in graphs: a survey // ACM Transactions on Knowledge Discovery from Data 2019, vol. 13, no. 6, pp. 1-25.</mixed-citation><mixed-citation xml:lang="ru">Lee J. B., Rossi R. A., Kim S., Ahmed N. K., Koh E. Attention models in graphs: a survey // ACM Transactions on Knowledge Discovery from Data 2019. Vol. 13, N. 6. P. 1-25.</mixed-citation></citation-alternatives></ref><ref id="B44"><label>44.</label><citation-alternatives><mixed-citation xml:lang="en">Abu-El-Haija S., Perozzi B., Al-Rfou R., Alemi A. Watch Your Step: Learning Graph Embeddings Through Attention // arXiv:1710.09599v1. 2017, p. 8.</mixed-citation><mixed-citation xml:lang="ru">Abu-El-Haija S., Perozzi B., Al-Rfou R., Alemi A. Watch Your Step: Learning Graph Embeddings Through Attention // arXiv:1710.09599v1. 2017. P. 8.</mixed-citation></citation-alternatives></ref><ref id="B45"><label>45.</label><citation-alternatives><mixed-citation xml:lang="en">Krioukov D., Papadopoulos F., Kitsak M., Vahdat A., Boguna M. Hyperbolic geometry of complex networks // Statistical Mechanics. Cornell Univ., 2010, p. 18.</mixed-citation><mixed-citation xml:lang="ru">Krioukov D., Papadopoulos F., Kitsak M., Vahdat A., Boguna M. Hyperbolic geometry of complex networks // Statistical Mechanics. Cornell Univ. 2010. P. 18.</mixed-citation></citation-alternatives></ref><ref id="B46"><label>46.</label><citation-alternatives><mixed-citation xml:lang="en">Zhou Y., Huo H., Hou Z., Bu L., Wang Y., Mao J., Lv X., Bu F. An End-To-End Hyperbolic Deep Graph Convolutional Neural Network Framework // Computer Modeling in Engineering &amp; Sciences, 2024, vol. 139, no. 1, pp. 538-563.</mixed-citation><mixed-citation xml:lang="ru">Zhou Y., Huo H., Hou Z., Bu L., Wang Y., Mao J., Lv X., Bu F. An End-To-End Hyperbolic Deep Graph Convolutional Neural Network Framework // Computer Modeling in Engineering &amp; Sciences. 2024. Vol. 139, N. 1. P. 538-563.</mixed-citation></citation-alternatives></ref><ref id="B47"><label>47.</label><citation-alternatives><mixed-citation xml:lang="en">Papadopoulos F., Psomas C., Krioukov D. Network Mapping by Replaying Hyperbolic Growth // IEEE/ACM Transactions on Networking, 2015, vol. 23, no. 1, pp. 198-211.</mixed-citation><mixed-citation xml:lang="ru">Papadopoulos F., Psomas C., Krioukov D. Network Mapping by Replaying Hyperbolic Growth // IEEE/ACM Transactions on Networking. 2015. Vol. 23, N. 1. P. 198-211.</mixed-citation></citation-alternatives></ref><ref id="B48"><label>48.</label><citation-alternatives><mixed-citation xml:lang="en">Kovacs B., Palla G. Model-independent embedding of directed networks into Euclidean and hyperbolic spaces // Communications Physics, 2023, vol. 6, no. 28, p. 16.</mixed-citation><mixed-citation xml:lang="ru">Kov cs B., Palla G. Model-independent embedding of directed networks into Euclidean and hyperbolic spaces // Communications Physics. 2023. Vol. 6, N. 28. P. 16.</mixed-citation></citation-alternatives></ref><ref id="B49"><label>49.</label><citation-alternatives><mixed-citation xml:lang="en">Benedetti R., Petronio C. Lectures on hyperbolic geometry. Springer-Verlag Berlin Heidelberg GmbH, 1992, 330 p.</mixed-citation><mixed-citation xml:lang="ru">Benedetti R., Petronio C. Lectures on hyperbolic geometry. Springer-Verlag Berlin Heidelberg GmbH, 1992. 330 p.</mixed-citation></citation-alternatives></ref><ref id="B50"><label>50.</label><citation-alternatives><mixed-citation xml:lang="en">Peng W., Varanka T., Mostafa A., Shi H., Zhao G. Hyperbolic Deep Neural Networks: A Survey // IEEE Trans Pattern. Anal. Mach. Intel., 2022, vol. 44, no. 12, pp. 10023-10044.</mixed-citation><mixed-citation xml:lang="ru">Peng W., Varanka T., Mostafa A., Shi H., Zhao G. Hyperbolic Deep Neural Networks: A Survey // IEEE Trans Pattern. Anal. Mach. Intel. 2022. Vol. 44, N. 12. P. 10023-10044.</mixed-citation></citation-alternatives></ref><ref id="B51"><label>51.</label><citation-alternatives><mixed-citation xml:lang="en">Gromov M. Hyperbolic groups. In Essays in group theory. Mathematical Sciences Research Institute Publications, 1987, pp. 75-263.</mixed-citation><mixed-citation xml:lang="ru">Gromov M. Hyperbolic groups. In Essays in group theory. Mathematical Sciences Research Institute Publications, 1987. P. 75-263.</mixed-citation></citation-alternatives></ref><ref id="B52"><label>52.</label><citation-alternatives><mixed-citation xml:lang="en">Dai J., Wu Y., Gao Z., Jia Y. A Hyperbolic-to-Hyperbolic Graph Convolutional Network // Computer Science. Machine Learning, 2021, no. 16, p. 10.</mixed-citation><mixed-citation xml:lang="ru">Dai J., Wu Y., Gao Z., Jia Y. A Hyperbolic-to-Hyperbolic Graph Convolutional Network // Computer Science. Machine Learning. 2021. N. 16. Р. 10.</mixed-citation></citation-alternatives></ref><ref id="B53"><label>53.</label><citation-alternatives><mixed-citation xml:lang="en">Miller G. A., Beckwith R., Fellbaum C., Gross D., Miller K. Introduction to WordNet: An Online Lexical Database // International Journal of Lexicography, 1991, p. 87.</mixed-citation><mixed-citation xml:lang="ru">Miller G. A., Beckwith R., Fellbaum C., Gross D., Miller K. Introduction to WordNet: An Online Lexical Database // International Journal of Lexicography. 1991. P. 87.</mixed-citation></citation-alternatives></ref><ref id="B54"><label>54.</label><citation-alternatives><mixed-citation xml:lang="en">Ungar A. A. A gyrovector space approach to hyperbolic geometry // Synthesis Lectures on Mathematics and Statistics, 2008, vol. 1, no. 1, pp. 1-194.</mixed-citation><mixed-citation xml:lang="ru">Ungar A. A. A gyrovector space approach to hyperbolic geometry // Synthesis Lectures on Mathematics and Statistics. 2008. Vol. 1, N. 1. P. 1-194.</mixed-citation></citation-alternatives></ref><ref id="B55"><label>55.</label><citation-alternatives><mixed-citation xml:lang="en">Ungar A. A. Analytic hyperbolic geometry and Albert Einstein's special theory of relativity // World scientific, 2008, 628 p.</mixed-citation><mixed-citation xml:lang="ru">Ungar A. A. Analytic hyperbolic geometry and Albert Einstein's special theory of relativity // World scientific. 2008. 628 p.</mixed-citation></citation-alternatives></ref><ref id="B56"><label>56.</label><citation-alternatives><mixed-citation xml:lang="en">Yang M., Zhou M., Li Z., Liu J., Pan L., Xiong H., King I. Hyperbolic Graph Neural Networks: A Review of Methods and Applications // arXiv:2202.13852v2, 2023, p. 13.</mixed-citation><mixed-citation xml:lang="ru">Yang M., Zhou M., Li Z., Liu J., Pan L., Xiong H., King I. Hyperbolic Graph Neural Networks: A Review of Methods and Applications // arXiv:2202.13852v2. 2023. P. 13.</mixed-citation></citation-alternatives></ref><ref id="B57"><label>57.</label><citation-alternatives><mixed-citation xml:lang="en">Liu Z., Cao S., Li Y., Zikatanov L. Neural networks with trainable matrix activation functions, Preprint, arXiv:2109.09948v5 [cs.LG], 2024, pp. 9, doi:10.48550/arXiv.2109.09948.</mixed-citation><mixed-citation xml:lang="ru">Liu Z., Cao S., Li Y., Zikatanov L. Neural networks with trainable matrix activation functions // Preprint. arXiv:2109.09948v5 [cs.LG]. 2024. P. 9. doi:10.48550/arXiv.2109.09948.</mixed-citation></citation-alternatives></ref><ref id="B58"><label>58.</label><citation-alternatives><mixed-citation xml:lang="en">Chen W., Han X., Lin Y., Zhao H., Liu Z., Li P., Sun M., Zhou J. Fully Hyperbolic Neural Networks. // Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics, 2022, vol. 1, pp. 5672-5686.</mixed-citation><mixed-citation xml:lang="ru">Chen W., Han X., Lin Y., Zhao H., Liu Z., Li P., Sun M., Zhou J. Fully Hyperbolic Neural Networks. // Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics. 2022. Vol. 1. P. 5672-5686.</mixed-citation></citation-alternatives></ref><ref id="B59"><label>59.</label><citation-alternatives><mixed-citation xml:lang="en">Moretti V. The interplay of the polar decomposition theorem and the Lorentz group // arXiv:math-ph/0211047, 2002, p. 7.</mixed-citation><mixed-citation xml:lang="ru">Moretti V. The interplay of the polar decomposition theorem and the Lorentz group // arXiv:math-ph/0211047. 2002. P. 7.</mixed-citation></citation-alternatives></ref><ref id="B60"><label>60.</label><citation-alternatives><mixed-citation xml:lang="en">Vermeer J. A geometric interpretation of Ungar's addition and of gyration in the hyperbolic plane. // Topology and its Applications, 2005, vol. 152, no. 3, pp. 226-242.</mixed-citation><mixed-citation xml:lang="ru">Vermeer J. A geometric interpretation of Ungar's addition and of gyration in the hyperbolic plane. // Topology and its Applications. 2005. Vol. 152, N. 3. P. 226-242.</mixed-citation></citation-alternatives></ref><ref id="B61"><label>61.</label><citation-alternatives><mixed-citation xml:lang="en">Ungar A. A. Thomas precession and its associated grouplike structure // American Journal of Physics, 1991, vol. 59, no. 9, pp. 824-834.</mixed-citation><mixed-citation xml:lang="ru">Ungar A. A. Thomas precession and its associated grouplike structure // American Journal of Physics. 1991. Vol. 59, N. 9. P. 824-834.</mixed-citation></citation-alternatives></ref><ref id="B62"><label>62.</label><citation-alternatives><mixed-citation xml:lang="en">Fan X., Yang C., Vemuri B. C. Nested Hyperbolic Spaces for Dimensionality Reduction and Hyperbolic // IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2022, pp. 356-365.</mixed-citation><mixed-citation xml:lang="ru">Fan X., Yang C., Vemuri B. C. Nested Hyperbolic Spaces for Dimensionality Reduction and Hyperbolic // IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). 2022. P. 356-365.</mixed-citation></citation-alternatives></ref><ref id="B63"><label>63.</label><citation-alternatives><mixed-citation xml:lang="en">Sun L., Zhang Z., Ye J., Peng H., Zhang J., Su S., Yu P. S. A Self-Supervised Mixed-Curvature Graph Neural Network // Proceedings of the AAAI Conference on Artificial Intelligence, 2022, vol. 36, no. 4, pp. 4146-4155.</mixed-citation><mixed-citation xml:lang="ru">Sun L., Zhang Z., Ye J., Peng H., Zhang J., Su S., Yu P. S. A Self-Supervised Mixed-Curvature Graph Neural Network // Proceedings of the AAAI Conference on Artificial Intelligence. 2022. Vol. 36, N. 4. P. 4146-4155.</mixed-citation></citation-alternatives></ref><ref id="B64"><label>64.</label><citation-alternatives><mixed-citation xml:lang="en">W. Ju, Y. Wang, Y. Qin, Z. A. Mao, Z. Xiao, J. Luo, J. Yang, Y. Gu, D. Wang, Q. Long, S. Yi, X. Luo, M. Zhang. Towards Graph Contrastive Learning: A Survey and Beyond J. ACM, vol. 1, no. 1, 2024, p. 35.</mixed-citation><mixed-citation xml:lang="ru">W. Ju, Y. Wang, Y. Qin, Z. A. Mao, Z. Xiao, J. Luo, J. Yang, Y. Gu, D. Wang, Q. Long, S. Yi, X. Luo, M. Zhang. Towards Graph Contrastive Learning: A Survey and Beyond J. ACM, Vol. 1, N. 1. 2024. P. 35.</mixed-citation></citation-alternatives></ref><ref id="B65"><label>65.</label><citation-alternatives><mixed-citation xml:lang="en">Fu X., Li J., Wu J., Sun Q., Ji C., Wang S., Tan J., Peng H., Yu P. S. ACE-HGNN: Adaptive Curvature Exploration Hyperbolic Graph Neural Network // 2021 IEEE International Conference on Data Mining (ICDM), 2021, p. 10.</mixed-citation><mixed-citation xml:lang="ru">Fu X., Li J., Wu J., Sun Q., Ji C., Wang S., Tan J., Peng H., Yu P. S. ACE-HGNN: Adaptive Curvature Exploration Hyperbolic Graph Neural Network // 2021 IEEE International Conference on Data Mining (ICDM). 2021. P. 10.</mixed-citation></citation-alternatives></ref><ref id="B66"><label>66.</label><citation-alternatives><mixed-citation xml:lang="en">Liu J., Yang M., Zhou M., Feng S., Fournier-Viger P. Enhancing hyperbolic graph embeddings via contrastive learning // NeurIPS'21. 2nd Workshop on Self-Supervised Learning, 2022, p. 7.</mixed-citation><mixed-citation xml:lang="ru">Liu J., Yang M., Zhou M., Feng S., Fournier-Viger P. Enhancing hyperbolic graph embeddings via contrastive learning // NeurIPS'21. 2nd Workshop on Self-Supervised Learning. 2022. P. 7.</mixed-citation></citation-alternatives></ref><ref id="B67"><label>67.</label><citation-alternatives><mixed-citation xml:lang="en">Ni C., Y. Lin, Luo F., Gao J. Community detection on networks with Ricci flow // Scientific reports, 2019, vol. 9, no. 1, pp. 1-12.</mixed-citation><mixed-citation xml:lang="ru">Ni C., Y. Lin, Luo F., Gao J. Community detection on networks with Ricci flow // Scientific reports. 2019. Vol. 9, N. 1. P. 1-12.</mixed-citation></citation-alternatives></ref><ref id="B68"><label>68.</label><citation-alternatives><mixed-citation xml:lang="en">Zhang X., He Y., Brugnone N., Perlmutter M., Hirn M. MagNet: A Neural Network for Directed Graphs // 35th Conference on Neural Information Processing Systems (NeurIPS), 2021, p. 13.</mixed-citation><mixed-citation xml:lang="ru">Zhang X., He Y., Brugnone N., Perlmutter M., Hirn M. MagNet: A Neural Network for Directed Graphs // 35th Conference on Neural Information Processing Systems (Neur. IPS). 2021. P. 13.</mixed-citation></citation-alternatives></ref><ref id="B69"><label>69.</label><citation-alternatives><mixed-citation xml:lang="en">Dosovitskiy A., Springenberg J., Tatarchenko M., Brox T. Learning to Generate Chairs, Tables and Cars with convolutional networks // IEEE Transactions on Pattern Analysis and Machine Intelligence. arXiv:1411.5928v4. 2017, p. 14.</mixed-citation><mixed-citation xml:lang="ru">Dosovitskiy A., Springenberg J., Tatarchenko M., Brox T. Learning to Generate Chairs, Tables and Cars with convolutional networks // IEEE Transactions on Pattern Analysis and Machine Intelligence. arXiv:1411.5928v4. 2017. P. 14.</mixed-citation></citation-alternatives></ref><ref id="B70"><label>70.</label><mixed-citation>The Hyperbolic Geometry of Networks. Site of the HPI's Algorithm Engineering group lead by Tobias Friedrich. URL: https://hpi.de/friedrich/research/hyperbolic-networks.html.</mixed-citation></ref><ref id="B71"><label>71.</label><citation-alternatives><mixed-citation xml:lang="en">Wilson R. C., Hancock E. R., Pekalska E., Duin P. W. Spherical and Hyperbolic Embeddings of Data // IEEE Trans Pattern Anal Mach Intelligence, 2014, vol. 36, no. 11, pp. 2255-2269.</mixed-citation><mixed-citation xml:lang="ru">Wilson R. C., Hancock E. R., Pekalska E, Duin P. W. Spherical and Hyperbolic Embeddings of Data // IEEE Trans Pattern Anal Mach Intelligence. 2014. Vol. 36, N. 11. P. 2255-2269.</mixed-citation></citation-alternatives></ref><ref id="B72"><label>72.</label><citation-alternatives><mixed-citation xml:lang="en">Bachmann G., Becigneul G., Ganea O.-E. Constant Curvature Graph Convolutional Networks. Proceedings of the 37th International Conference on Machine Learning, 2020, p. 11.</mixed-citation><mixed-citation xml:lang="ru">Bachmann G., Becigneul G., Ganea O.-E. Constant Curvature Graph Convolutional Networks. Proceedings of the 37th International Conference on Machine Learning. 2020. P. 11.</mixed-citation></citation-alternatives></ref><ref id="B73"><label>73.</label><citation-alternatives><mixed-citation xml:lang="en">Suzuki A., Nitanda A., Wang J., Xu L., Yamanishi K., Cavazza M. Generalization error bound for hyperbolic ordinal embedding // ICML, Proceeding soft he 38th International Conference on Machine Learning, PMLR139, 2021, pp. 10011-10021.</mixed-citation><mixed-citation xml:lang="ru">Suzuki A., Nitanda A., Wang J., Xu L., Yamanishi K., Cavazza M. Generalization error bound for hyperbolic ordinal embedding // ICML, Proceeding soft he 38th International Conference on Machine Learning, PMLR139. 2021. P. 10011-10021.</mixed-citation></citation-alternatives></ref><ref id="B74"><label>74.</label><mixed-citation>Graph Neural Networks. UBC Wiki. URL: https://wiki.ubc.ca/Graph_Neural_Networks.</mixed-citation></ref><ref id="B75"><label>75.</label><citation-alternatives><mixed-citation xml:lang="en">Kochurov M., Ivanov S., Burnaev E. Are hyperbolic representations in graphs created equal? // Proceedings of the 37th International Conference on Machine Learning, Vienna, Austria, PMLR 108, 2020, p. 7.</mixed-citation><mixed-citation xml:lang="ru">Kochurov M., Ivanov S., Burnaev E. Are hyperbolic representations in graphs created equal? // Proceedings of the 37th International Conference on Machine Learning, Vienna, Austria, PMLR 108. 2020. P. 7.</mixed-citation></citation-alternatives></ref><ref id="B76"><label>76.</label><citation-alternatives><mixed-citation xml:lang="en">Cao Z., Xu Q., Yang Z., Cao X., Huang Q. Geometry Interaction Knowledge Graph Embeddings // Proceedings of the 36th Conference on Artificial Intelligence (AAAI 2022). Virtual Event. 2022. 22 February-1 March, pp. 5521-5529.</mixed-citation><mixed-citation xml:lang="ru">Cao Z., Xu Q., Yang Z., Cao X., Huang Q. Geometry Interaction Knowledge Graph Embeddings // Proceedings of the 36th Conference on Artificial Intelligence (AAAI 2022). Virtual Event. 2022. 22 February-1 March. P. 5521-5529.</mixed-citation></citation-alternatives></ref><ref id="B77"><label>77.</label><citation-alternatives><mixed-citation xml:lang="en">Dedus A. F., Dedus F. F., Makhortykh S. A., Ustinin M. N. Generalized spectral-analytic method. Part I. Theoretical foundations // Proc. SPIE, 1995, vol. 2363, pp. 109-112</mixed-citation><mixed-citation xml:lang="ru">Dedus A. F., Dedus F. F., Makhortykh S. A., Ustinin M. N. Generalized spectral-analytic method. Part I. Theoretical foundations // Proc. SPIE. 1995. Vol. 2363. P. 109-112.</mixed-citation></citation-alternatives></ref><ref id="B78"><label>78.</label><citation-alternatives><mixed-citation xml:lang="en">Muhammet B., Guillaume R., Pierre H., Benoit G., Sebastien A., Paul H. When Spectral Domain Meets Spatial Domain in Graph Neural Networks // Conference: ICML 2020 Workshop on Graph Representation Learning and Beyond, 2020, p. 9.</mixed-citation><mixed-citation xml:lang="ru">Muhammet B., Guillaume R., Pierre H., Benoit G., Sebastien A., Paul H. When Spectral Domain Meets Spatial Domain in Graph Neural Networks // Conference: ICML 2020 Workshop on Graph Representation Learning and Beyond. 2020. P. 9.</mixed-citation></citation-alternatives></ref><ref id="B79"><label>79.</label><citation-alternatives><mixed-citation xml:lang="en">Linial N., London E., Rabinovich Y. The geometry of graphs and some of its algorithmic applications // Combinatorica, 2001, vol. 15, no. 2, pp. 215-245.</mixed-citation><mixed-citation xml:lang="ru">Linial N., London E., Rabinovich Y. The geometry of graphs and some of its algorithmic applications // Combinatorica. 2001. Vol. 15, N. 2. P. 215-245.</mixed-citation></citation-alternatives></ref><ref id="B80"><label>80.</label><citation-alternatives><mixed-citation xml:lang="en">Tao Yu, Christopher De Sa. HyLa: Hyperbolic Laplacian Features for Graph Learning. // arXiv:2202.06854v1, 2022, p. 11.</mixed-citation><mixed-citation xml:lang="ru">Tao Yu, Christopher De Sa. HyLa: Hyperbolic Laplacian Features for Graph Learning. // arXiv:2202.06854v1. 2022. P. 11.</mixed-citation></citation-alternatives></ref></ref-list></back></article>
