<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" 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" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mathematics</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник российских университетов. Математика</journal-title><trans-title-group xml:lang="en"><trans-title>Russian Universities Reports. Mathematics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2686-9667</issn><issn pub-type="epub">2782-3342</issn><publisher><publisher-name>Тамбовский государственный университет имени Г.Р. Державина</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.20310/2686-9667-2026-31-153-32-40</article-id><article-id custom-type="elpub" pub-id-type="custom">mathematics-40</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>СТАТЬИ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>ARTICLES</subject></subj-group></article-categories><title-group><article-title>Эффект конденсации в моделях пространственного предпочтительного присоединения с шагом с добавлением ребра</article-title><trans-title-group xml:lang="en"><trans-title>Condensation effects in spatial preferential attachment with edge step</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/https://orcid.org/0000-0003-4216-9894</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Малышкин</surname><given-names>Юрий Андреевич</given-names></name><name name-style="western" xml:lang="en"><surname>Malyshkin</surname><given-names>Yury Andreevich</given-names></name></name-alternatives><email xlink:type="simple">yury.malyshkin@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Груздков</surname><given-names>Денис Александрович</given-names></name><name name-style="western" xml:lang="en"><surname>Gruzdkov</surname><given-names>Denis Aleksandrovich</given-names></name></name-alternatives><email xlink:type="simple">Gruzdkov.DA@tversu.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Тверской государственный университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Tver State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>10</day><month>04</month><year>2026</year></pub-date><volume>31</volume><issue>153</issue><fpage>32</fpage><lpage>40</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Малышкин Ю.А., Груздков Д.А., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Малышкин Ю.А., Груздков Д.А.</copyright-holder><copyright-holder xml:lang="en">Malyshkin Y.A., Gruzdkov D.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://mathematics.elpub.ru/jour/article/view/40">https://mathematics.elpub.ru/jour/article/view/40</self-uri><abstract><p>Мы исследуем асимптотическое поведение максимальной степени в графах пространственного предпочтительного присоединения, с дополнительным шагом с выбором ребер. В пространственных моделях предпочтительного присоединения каждой вершине присваивается координата (в нашем случае, случайное число в [0,1]). Модель строится рекурсивно, причем шаг рекурсии состоит из двух частей. Сначала мы вводим новую вершину и проводим k ребер от нее к близлежащим вершинам, выбранным с помощью слегка модифицированного правила пространственного предпочтительного присоединения. Затем мы проводим m ребер между вершинами по правилу обычного предпочтительного присоединения. В статье доказывается, что в зависимости от параметров модели максимальная степень может демонстрировать сублинейное (аналогично стандартному предпочтительному присоединению) и линейное поведение двух видов: случайное распределение, подобное классической урновой модели, и концентрацию у фиксированного значения (такой эффект наблюдался в моделях предпочтительного присоединения с выбором).</p></abstract><trans-abstract xml:lang="en"><p>We study the asymptotic behavior of the maximum degree in the spatial preferential attachment graph model with a preferential attachment edge step. In spatial models, each vertex is assigned a coordinate (in our case, in [0,1]). The model is built recursively, with the recursion step consisting of two parts. First, we introduce a new vertex and draw k edges from it to close vertices, chosen by a slightly modified spatial preferential attachment rule. Then, we draw m edges between vertices by the preferential attachment rule. We prove that, dependent on model parameters, the maximum degree could exhibit sublinear (similar to the standard preferential attachment) and linear behavior of 2 types: random distribution similar to the classical urn model and concentration over a fixed value (such an effect was observed in models with the addition of choice).</p></trans-abstract><kwd-group xml:lang="ru"><kwd>случайные графы</kwd><kwd>пространственное предпочтительное присоединение</kwd><kwd>эффект конденсации</kwd></kwd-group><kwd-group xml:lang="en"><kwd>random graphs</kwd><kwd>spatial preferential attachment</kwd><kwd>condensation effect</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Исследование выполнено за счет гранта Российского научного фонда (проект № 24-21-00247, https://rscf.ru/project/24-21-00247/)</funding-statement><funding-statement xml:lang="en">The research was supported by the Russian Science Foundation (project no. 24-21-00247, https://rscf.ru/en/project/24-21-00247/)</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">A. Barabási, R. Albert, "Emergence of scaling in random networks", Science, 286:5439 (1999), 509-512.</mixed-citation><mixed-citation xml:lang="en">A. Barabási, R. Albert, "Emergence of scaling in random networks", Science, 286:5439 (1999), 509-512.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">T.F. Móri, "On random trees", Studia Sci. Math. Hungar., 39:1-2 (2002), 143-155.</mixed-citation><mixed-citation xml:lang="en">T.F. Móri, "On random trees", Studia Sci. Math. Hungar., 39:1-2 (2002), 143-155.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">T.F. Móri, "The maximum degree of the Barabasi-Albert random tree", Combinatorics, Probability &amp; Computing, 14, eds. I. Leader, O. Riordan, Cambridge University Press, Cambridge, 2005, 339-348.</mixed-citation><mixed-citation xml:lang="en">T.F. Móri, "The maximum degree of the Barabasi-Albert random tree", Combinatorics, Probability &amp; Computing, 14, eds. I. Leader, O. Riordan, Cambridge University Press, Cambridge, 2005, 339-348.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">R. van der Hofstad, Random Graphs and Complex Networks, Cambridge University Press, Cambridge, 2016.</mixed-citation><mixed-citation xml:lang="en">R. van der Hofstad, Random Graphs and Complex Networks, Cambridge University Press, Cambridge, 2016.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">V. Latora, G. Russo, V. Nicosia, Complex Networks: Principles, Methods an Applications, Cambridge University Press, Cambridge, 2017.</mixed-citation><mixed-citation xml:lang="en">V. Latora, G. Russo, V. Nicosia, Complex Networks: Principles, Methods an Applications, Cambridge University Press, Cambridge, 2017.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">C. Alves, R. Ribeiro, R. Sanchis, "Preferential attachment random graphs with edge-step functions", Journal of Theoretical Probability, 34:1 (2021), 438-476.</mixed-citation><mixed-citation xml:lang="en">C. Alves, R. Ribeiro, R. Sanchis, "Preferential attachment random graphs with edge-step functions", Journal of Theoretical Probability, 34:1 (2021), 438-476.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">W. Aiello, A. Bonato, C. Cooper, J. Janssen, P. Pral, "A spatial web graph model with local inuence regions", Internet Mathematics, 5:1 (2008), 175-196.</mixed-citation><mixed-citation xml:lang="en">W. Aiello, A. Bonato, C. Cooper, J. Janssen, P. Pral, "A spatial web graph model with local inuence regions", Internet Mathematics, 5:1 (2008), 175-196.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">J. Haslegrave, J. Jordan, "Preferential attachment with choice", Random Structures and Algorithms, 48 (2016), 751-766.</mixed-citation><mixed-citation xml:lang="en">J. Haslegrave, J. Jordan, "Preferential attachment with choice", Random Structures and Algorithms, 48 (2016), 751-766.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Y. Malyshkin, "Preferential attachment combined with the random number of choices", Internet Mathematics, 1:1 (2018), 1-25.</mixed-citation><mixed-citation xml:lang="en">Y. Malyshkin, "Preferential attachment combined with the random number of choices", Internet Mathematics, 1:1 (2018), 1-25.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">J. Haslegrave, J. Jordan, M. Yarrow, "Condensation in preferential attachment models with location-based choice", Random Structures and Algorithms, 56:3 (2020), 775-795.</mixed-citation><mixed-citation xml:lang="en">J. Haslegrave, J. Jordan, M. Yarrow, "Condensation in preferential attachment models with location-based choice", Random Structures and Algorithms, 56:3 (2020), 775-795.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Y. Malyshkin, E. Paquette, "The power of choice over preferential attachment", ALEA, Latin American Journal of Probability and Mathematical Statistics, 12:2 (2015), 903-915.</mixed-citation><mixed-citation xml:lang="en">Y. Malyshkin, E. Paquette, "The power of choice over preferential attachment", ALEA, Latin American Journal of Probability and Mathematical Statistics, 12:2 (2015), 903-915.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Y. Malyshkin, "Preferential attachment with choice based edge-step", Stat. Probab. Lett., 224:110438 (2025), 1-7.</mixed-citation><mixed-citation xml:lang="en">Y. Malyshkin, "Preferential attachment with choice based edge-step", Stat. Probab. Lett., 224:110438 (2025), 1-7.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">R. Pemantle, "A survey of random processes with reinforcement", Probab. Surv., 4 (2007), 1-79.</mixed-citation><mixed-citation xml:lang="en">R. Pemantle, "A survey of random processes with reinforcement", Probab. Surv., 4 (2007), 1-79.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">N.L. Johnson, S. Kotz, Urn Models and their Application, John Wiley and Sons, New York, 1977.</mixed-citation><mixed-citation xml:lang="en">N.L. Johnson, S. Kotz, Urn Models and their Application, John Wiley and Sons, New York, 1977.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">P.A. Galashin, "Existence of a persistent hub in the convex preferential attachment model", Probability and Mathematical Statistics, 36:1 (2016), 59-74.</mixed-citation><mixed-citation xml:lang="en">P.A. Galashin, "Existence of a persistent hub in the convex preferential attachment model", Probability and Mathematical Statistics, 36:1 (2016), 59-74.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
