<?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">ellibs</journal-id><journal-title-group><journal-title xml:lang="ru">Электронные библиотеки</journal-title><trans-title-group xml:lang="en"><trans-title>Russian Digital Libraries Journal</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">1562-5419</issn><publisher><publisher-name>Казанский (Приволжский) федеральный университет</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.26907/1562-5419-2021-24-1-184-197</article-id><article-id custom-type="elpub" pub-id-type="custom">ellibs-269</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></article-categories><title-group><article-title>О некоторых свойствах графов сотрудничества учёных в Math-Net.ru</article-title><trans-title-group xml:lang="en"><trans-title>On Some Properties of Collaboration Graphs of Scientists in Math-Net.Ru</trans-title></trans-title-group></title-group><contrib-group><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>Pechnikov</surname><given-names>A. A.</given-names></name></name-alternatives><email xlink:type="simple">pechnikov@krc.karelia.ru</email></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>Chebukov</surname><given-names>D. E.</given-names></name></name-alternatives><email xlink:type="simple">tche@mi-ras.ru</email></contrib></contrib-group><pub-date pub-type="collection"><year>2021</year></pub-date><pub-date pub-type="epub"><day>28</day><month>02</month><year>2021</year></pub-date><volume>24</volume><issue>1</issue><fpage>184</fpage><lpage>196</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Печников А.А., Чебуков Д.Е., 2021</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="ru">Печников А.А., Чебуков Д.Е.</copyright-holder><copyright-holder xml:lang="en">Pechnikov  A.A., Chebukov D.E.</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://ellibs.elpub.ru/jour/article/view/269">https://ellibs.elpub.ru/jour/article/view/269</self-uri><abstract><p>Проведено исследование двух графов научного сотрудничества, построенных на основе соавторства и цитирования по данным Общероссийского математического портала Math-Net.Ru. Граф научного сотрудничества на основе цитирования представляет собой ориентированный граф без петель и кратных ребер, вершинами которого являются авторы публикаций, а дуги связывают их, когда имеется хотя бы одна публикация первого автора, цитирующая публикацию второго автора. Граф соавторства – это неориентированный граф, в котором вершинами являются авторы, а ребра фиксируют соавторство двух авторов хотя бы в одной статье. Проводится традиционное исследование основных характеристик обоих графов: диаметр и среднее расстояние, компоненты связности и кластеризация. В обоих графах мы наблюдаем схожую структуру связности – наличие гигантской компоненты и большое количество маленьких компонент. Отмечается сходство и различие научного сотрудничества через соавторство и цитирование.
</p></abstract><trans-abstract xml:lang="en"><p>A study of two graphs of scientific cooperation based on co-authorship and citation according to the all-Russian mathematical portal was conducted Math-Net.Ru. A citation-based scientific collaboration graph is a directed graph without loops and multiple edges, whose vertices are the authors of publications, and arcs connect them when there is at least one publication of the first author that cites the publication of the second author. A co-authorship graph is an undirected graph in which the vertices are the authors, and the edges record the co-authorship of two authors in at least one article. The customary study of the main characteristics of both graphs is carried out: diameter and average distance, connectivity components and clustering. In both graphs, we observe a similar connectivity structure – the presence of a giant component and a large number of small components. The similarity and difference of scientific cooperation through co-authorship and citation is noted.
</p></trans-abstract><kwd-group xml:lang="ru"><kwd>научное сотрудничество</kwd><kwd>цитирование</kwd><kwd>соавторство</kwd><kwd>граф</kwd><kwd>математический портал Math-Net.Ru</kwd></kwd-group><kwd-group xml:lang="en"><kwd>scientific collaboration</kwd><kwd>citation</kwd><kwd>co-authorship</kwd><kwd>graph</kwd><kwd>mathematical portal Math-Net.Ru</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Kas M., Carley K.M., Carley L.R. Trends in science networks: understanding structures and statistics of scientific networks // Social Network Analysis and Mining. 2012. No. 2. P. 169–187.</mixed-citation><mixed-citation xml:lang="en">Kas M., Carley K.M., Carley L.R. Trends in science networks: understanding structures and statistics of scientific networks // Social Network Analysis and Mining. 2012. No. 2. P. 169–187.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Евин И.А., Хабибуллин Т.Ф. Социальные сети // Компьютерные исследования и моделирование. 2012. Т. 4, № 2. С. 423–430.</mixed-citation><mixed-citation xml:lang="en">Евин И.А., Хабибуллин Т.Ф. Социальные сети // Компьютерные исследования и моделирование. 2012. Т. 4, № 2. С. 423–430.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Дадалко В.А., Дадалко С.В. Метрические исследования как форма анализа научной продуктивности // Аналитика и научное проектирование. 2019. №2. С. 125–135.</mixed-citation><mixed-citation xml:lang="en">Дадалко В.А., Дадалко С.В. Метрические исследования как форма анализа научной продуктивности // Аналитика и научное проектирование. 2019. №2. С. 125–135.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Newman M.E.J. The structure of scientific collaboration networks // Proceedings of the National Academy of Sciences of the USA. 2001. No. 98 (2). P. 404–409.</mixed-citation><mixed-citation xml:lang="en">Newman M.E.J. The structure of scientific collaboration networks // Proceedings of the National Academy of Sciences of the USA. 2001. No. 98 (2). P. 404–409.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Kas M., Carley K.M., Carley L.R. Trends in science networks: understanding structures and statistics of scientific networks // Social Network Analysis and Mining. 2012. No. 2. P. 169–187.</mixed-citation><mixed-citation xml:lang="en">Kas M., Carley K.M., Carley L.R. Trends in science networks: understanding structures and statistics of scientific networks // Social Network Analysis and Mining. 2012. No. 2. P. 169–187.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Chebukov D., Izaak A., Misyurina O., Pupyrev Yu., Zhizhchenko A. Math-Net.Ru as a digital archive of the Russian mathematical knowledge from the XIX century to today // Lecture Notes in Comput. Sci. 2013. Vol. 7961. P. 344–348.</mixed-citation><mixed-citation xml:lang="en">Chebukov D., Izaak A., Misyurina O., Pupyrev Yu., Zhizhchenko A. Math-Net.Ru as a digital archive of the Russian mathematical knowledge from the XIX century to today // Lecture Notes in Comput. Sci. 2013. Vol. 7961. P. 344–348.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Malliaros F.D., Vazirgiannis M. Clustering and community detection in directed networks: A survey // Physics Reports. 2013. Vol. 533, Iss. 4. P. 95–142.</mixed-citation><mixed-citation xml:lang="en">Malliaros F.D., Vazirgiannis M. Clustering and community detection in directed networks: A survey // Physics Reports. 2013. Vol. 533, Iss. 4. P. 95–142.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Newman M.E., Girvan M. Finding and evaluating community structure in networks // Physical Review E. 2004. Vol. 69(2). P 026113.</mixed-citation><mixed-citation xml:lang="en">Newman M.E., Girvan M. Finding and evaluating community structure in networks // Physical Review E. 2004. Vol. 69(2). P 026113.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Blondel V.D., Guillaume J-L., Lambiotte R., Lefebvre E. Fast unfolding of communities in large networks // Journal of Statistical Mechanics: Theory and Experiment. 2008. P 10008.</mixed-citation><mixed-citation xml:lang="en">Blondel V.D., Guillaume J-L., Lambiotte R., Lefebvre E. Fast unfolding of communities in large networks // Journal of Statistical Mechanics: Theory and Experiment. 2008. P 10008.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Апанович З.В., Винокуров П.С. Методы и средства визуализации сетей соавторства и сетей цитирования больших научных порталов // Электронные библиотеки. 2011. Т. 14, Вып. 3. https://elbib.ru/article/view/308.</mixed-citation><mixed-citation xml:lang="en">Апанович З.В., Винокуров П.С. Методы и средства визуализации сетей соавторства и сетей цитирования больших научных порталов // Электронные библиотеки. 2011. Т. 14, Вып. 3. https://elbib.ru/article/view/308.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Kennedy D. Multiple Authors, Multiple Problems // Science. 2003. Vol. 301(5634). P. 733.</mixed-citation><mixed-citation xml:lang="en">Kennedy D. Multiple Authors, Multiple Problems // Science. 2003. Vol. 301(5634). P. 733.</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>
