Модели сети соавторства научного журнала. Часть 2

Автор: Бредихин С.В., Щербакова Н.Г., Юргенсон А.Н.

Журнал: Проблемы информатики @problem-info

Рубрика: Прикладные информационные технологии

Статья в выпуске: 4 (61), 2023 года.

Бесплатный доступ

Анализируются две модели сети научного соавторства. Первая, построенная на бинарных отношениях, возникающих между авторами, совместно создавшими по крайней мере одну статью, представлена в виде неориентированного графа, вершины которого соответствуют авторам, а ребра устанавливают связи между ними. Вторая, учитывающая групповые отношения между авторами одной статьи, представлена в виде двудольного графа. Приведены методы конструирования обеих моделей на основе данных, извлеченных из XML-архива статей научного журнала. Измерены базовые параметры моделей, центральность ее вершин и выявлены шаблоны сотрудничества. Оценена публикационная активность организаций, указанных в аффилиации авторов. Эта работа продолжает изучение и апробацию методов анализа сетей соавторства

Еще

Анализ данных, библиометрия, научное соавторство, двудольный граф, xml-архив, параметры сети, центральность акторов, шаблоны сотрудничества

Короткий адрес: https://sciup.org/143182821

IDR: 143182821   |   УДК: 519.177   |   DOI: 10.24412/2073-0667-2023-4-57-72

Scientific journal co-authorship network models. Part 2

The paper analyzes two models of a scientific co-authorship network. The first model (𝑁𝑎) is built on binary relationships that arise between authors who have jointly created at least one article. This traditional model is presented in the form of an undirected graph, the vertices of which correspond to the authors, and the edges establish connections between them. The second model (𝑁𝑐𝑎), which takes into account group relations between the authors of a same article, is presented in the form of a bipartite graph. A higher-order architecture that generalizes pairwise interaction to the interaction of an arbitrary set of nodes helps expand the capabilities of modeling and understanding the behavior of a co-authorship system. This work continues the study and testing of methods for analyzing coauthorship networks [1, 2]. Methods for constructing both models based on data extracted from an XML archive of scientific journal articles are presented. The basic parameters of the models were measured, for results see table 2. It should be noted that network contains significantly fewer edges than 𝑁𝑎, which is important when studying large amounts of data. It is revealed that the distribution of degrees of the vertices of both subsets of bipartite representation corresponds to the power law, see fig. 2. The average distance between nodes is approximately six, i. e. we can apply the term “small world” [40] to it. The centralities of the actors [32-36] that determine their potential to influence processes occurring in the network are estimated. Using the small component as an example (fig. 3), it is shown that the nodes are more differentiated within the corresponding measure, see tables 3-4. Сo-authorship patterns are identified based on a study of bicliques in a bipartite representation. Analysis of bicliques showed that for this co-authorship system, the most common pattern is the presence of pairs of authors who jointly published two articles. The next most common pairs are the more stable pairs, who published three articles each, and the triplets of authors, who published two articles each. Fig. 4 illustrates the distribution of 𝐾𝑖,2. Further examination of bicliques can determine which authors participate in multiple groups and whether the group of authors is expanding over time.

Еще

Список литературы Модели сети соавторства научного журнала. Часть 2

  • Бредихин С. В., Ляпунов В. \!.. Щербакова Н. Г. Структура и параметры невзвешенной сети соавторства на основе данных БД RePEc // Пробл. информ. 2021. Л*8 3. С. 56-67. DOI: 10.24411/2073-0667-2021-3-56-57.
  • Бредихин С. В., Щербакова Н. Г. Модель сети соавторства научного журнала // Пробл. информ. 2023. № 3. С. 5-18. DOI: 10.24412/2073-0667-2023-3-5-18.
  • Albert R., BarabAsi A-L. Statistical mechanics of complex networks // Rev. of Modern Phvs. 2002. V. 74. P. 47-97. DOI: 10.1103/RevModPhys.74.47.
  • Dorogovtsev S. N., Mendes J. F. F. Evolution of networks // Advances in Phvs. 2002. V. 51, iss. 4. P. 1079-1187. DOI: 10.1080/00018730110112519.
  • Newman M. E. J. The structure and function of complex networks // SIAM Rev. 2003. V. 45, iss. 2. P. 167-256. DOI: 10.1137/S003614450342480.
  • Boccaletti S., Latora V., Moreno Y., Chavez M., Hwang D. U. Complex networks: Structure and dynamics // Phvs. Rep. 2006. V. 424, iss. 4-5. P. 175-308. DOI: 10.1016/j.physrep.2005.10.009.
  • Barrat A., BarthELEMY М., Vespignani A. Dynamic processes on complex networks. Cambridge University Press, 2008. ISBN: 9780511791383.
  • Newman M. E. J. Scientific collaboration networks. I. Network construction and fundamental results // Phvs. Rev. E. 2001. V. 64, iss. 1. 016131. DOI: 10.1103/PhvsRevE.64.016131.
  • Newman M. E. J. Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality // Phvs. Rev. E. 2001. V. 64, iss. 1, 016132. DOI: 10.1103/PhvsRevE.64.016132.
  • Uddin S., Hossain L., Abbasi A., Rasmussen K. Trend and efficiency analysis of coauthorship network // Scientometrics. 2012. V. 90, iss. 2. P. 687-699. DOI: 10.1007/slll92-011-0511-x.
  • Savic M., Ivanovic XL. Radovanovic XL. Ognjanovic Z., Pejovic A. Exploratory analysis of communities in co-authorship networks: A case study // Intern. Conf. on ICT Innovations, Ohrid (North Macedonia), 2014. P. 55-64.
  • Atkin R. H. From cohomology in physics to q-connectivitv in social science // Intern. J. Man-Machine Stud. 1972. XX 4, iss. 2. P. 139-167. DOI: 10.1016/S0020-7373(72)80029-4.
  • Atkin R. H. An algebra for patterns on a complex. I // Intern. J. Man-Machine Stud. 1974. XX 6, iss. 3. P. 285-307. DOI: 10.1016/S0020-7373(74)80024-6.
  • Atkin R. H. An algebra for patterns on a complex. II // Intern. J. Man-Machine Stud. 1976. XX 8, iss. 5. P. 483-498. DOI: 10.1016/S0020-7373(76)80015-6.
  • Patania A., Petri G., Vaccarino F. The shape of collaboration // EPJ Data Sci. 2017. XX 6, 18. DOI: 10.1140/epjds/sl3688-017-0114-8.
  • Seidman S. B. Structures induced by collections of subsets: A hvpergraph approach // Math. Soc. Sci. 1981. XX 1, iss. 4. P. 381-396. DOI: *10.1016/0165-4896(81)90016-0.
  • Estrada E., Rodriguez-Velazquez J. A. Complex networks as hvpergraphs // arXiv: phvsics/0505137. 2005. DOI: 10.1016/j.phvsa.2005.12.002.
  • Wilson T. P. Relational networks: An extension of sociometric concepts // Soc. Networks. 1982. V. 4, iss. 2. P. 105-116. DOI: 10.1016/0378-8733(82)90028-4.
  • Guillaume J.-L., Latapy M. Bipartite graphs as models of complex networks // Phvs. A: Stat. Meehan, and its Appl. 2006. XX 371, iss. 2. P. 795-813. DOI: 10.1016/j.physa.2006.04.047.'
  • Borgatti S. P., Everett M. G. Network analysis of 2-mode data // Soc. networks. 1997. V. 19. P. 243-269. DOI: 10.1016/S0378-8733(96)00301-2. '
  • Faust K. Centrality in affiliation networks // Soc. Networks. 1997. XX 19. P. 157-191. DOI: 10.1016/S0378-8733(96)00300-0.
  • Wasserman S., Faust K. Social network analysis: Methods and applications. Cambridge Univ. Press, 1994. ISBN: 9780511815478. DOI: 10.1017/СВ09780511815478.
  • Breiger R. L. The duality of persons and groups // Soc. Forces. 1974. XX 53, iss. 2. P. 181-190. DOI: 10.2307/2576011.
  • Everett XI. G., Borgatti S. P. The dual-projection approach for two-mode networks // Soc. Networks. 2013. XX 35, iss. 2. P. 204-210. DOI: 10.1016/j.socnet.2012.05.004.
  • Everett XI. G. Centrality and the dual-projection approach for two-mode social network data // Method. Innov. 2016. XX 9. P. 1-8. DOI: 10.1177/2059799116630662.
  • Latapy XL. XIagxikx C., Del Vecchio N. Basic notions for the analysis of large two-mode networks // Soc. Networks. 2008. XX 30, iss. 1. P. 31-48. DOI: 10.1016/j.socnet.2007.04.006.
  • Newman XI. E. J., Watts D. J., Strogatz S. H. Random graph models of social networks // Proc. Natl. Acad. Sci. USA. 2002. XX 99. P. 2566-2572. DOI: 10.1073/pnas.01258299.
  • Дистель P. Теория графов. Пер. с англ. Новосибирск: Ин-т математики, 2002. ISBN 5-86134-101-Х.
  • Schmidt М. The Sankev diagram in energy and material flow management. PartII: Methodology and current applications // J. Indust. Ecol. 2008. XX 12, iss. 2. P. 173-185. DOI: 10. 111 l/j.1530-9290.2008.00015.x.
  • Кормен Т., ЛеЙЗЕРСОН Ч., Ривест Р. Алгоритмы: построение и анализ. М.: МЦНМО, 2002. ISBN: 5-900916-37-5.
  • Бредихин С. В., Ляпунов В. М., Щербакова Н. Г. Библиометрические сети научных статей и журналов. Новосибирск: ИВМиМГ СО РАН, 2021. ISBN: 978-5-901548-44-8.
  • Freeman L. С. A set of measures of centrality based upon betweenness // Sociometry. 1977. V. 40. P. 35-41. DOI: 10.2307/3033543.
  • Bavelas A. Communication patterns in task-oriented groups // J. Acoustical Soc. of Amer. 1950. V. 22, iss. 6. P. 725-730. DOI: 10.1121/1.1906679.
  • BONACICH P. Factoring and weighting approaches to status scores and clique identification // J. Math. Soc. 1972. V. 2. P. 113-120. DOI: 10.1080/0022250X.1972.9989806.
  • Bonacich P. Simultaneous group and individual centralities // Soc. Networks. 1991. V. 13, iss. 2. P. 155-168. DOI: 10.1016/0378-8733(91)90018-0.
  • Brin S., Page L. The Anatomy of a large-scale hypertextual web search engine // Comput. Networks and ISDN Syst. 1998. V. 30. P. 107-117. DOI: 10.1016/S0169-7552(98)00110-X.
  • Bondy J. A., Murty U. S. R. Graph theory with applications. North-Holland, 1976. ISBN: 0-444-19451-7.
  • Zhang Y., et AL. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types // BMC Bioinform. 2014. V. 15, iss. 110. DOI: 10.1186/1471-2105-15-110.
  • Lind P. G., Gonzalez M. C., Herrmann H. J. Cycles and clustering in bipartite networks // Phys. Rev. 2005. V. 72, iss. 5. 056127. DOI: 10.1103/PhysRevE.72.056127.
  • Watts D. J., Strogatz S. H. Collective dynamics of small-world’ networks // Nature. 1998. V. 393. P. 440-442. DOI: 10.1038/30918.
Еще