Strong and Weak Relations in the Academic Web

Article Sidebar

PDF (Русский)
Published: 09.05.2020
UDC 519.178: 004.738.5
DOI: https://doi.org/10.26907/1562-5419-2020-23-3-526-542
Issue
Vol. 23 No. 3 (2020): Special issue «Scientific Services & Internet». Part 1

Main Article Content

Andrey Anatolievich Pechnikov
Institute of Applied Mathematical Research of the Karelian Research Centre of the Russian Academy of Sciences, Petrozavodsk

Abstract

The web graph is the most popular model of real Web fragments used in Web science. The study of communities in the web graph contributes to a better understanding of the organization of the fragment of the Web and the processes occurring in it. It is proposed to allocate a communication graph in a web graph containing only those vertices (and arcs between them) that have counter arcs, and in it to investigate the problem of splitting into communities. By analogy with social studies, connections realized through edges in a communication graph are proposed to be called "strong" and all others "weak". Thematic communities with meaningful interpretations are built on strong connections. At the same time, weak links facilitate communication between sites that do not have common features in the field of activity, geography, subordination, etc., and basically preserve the coherence of the fragments of the Web even in the absence of strong links. Experiments conducted for a fragment of the scientific and educational Web of Russia show the possibility of meaningful interpretation of the results and the prospects of such an approach.

Article Details

Author Biography

Andrey Anatolievich Pechnikov

Chief Research Associate of the Institute of Applied Mathematical Research of the Karelian Research Centre of the Russian Academy of Sciences. Research interests include mathematical modeling, discrete optimization, webometrics.

References

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. https://doi.org/10.1073/pnas.98.2.404

Thelwall M., Wilkinson D. Graph structure in three national academic Webs: Power laws with anomalies // Journal of the American Society for Information Science and Technology. 2003. №54(8). P. 706–712.

Ortega J.L., Aguillo I.F. Visualization of the Nordic academic web: Link analysis using social network tools // Information Processing and Management. 2008. Vol. 44, Iss. 4. P. 1624–1633.

Печников А.А. Методы исследования регламентируемых тематических фрагментов Web // Труды Института системного анализа Российской академии наук. Серия: Прикладные проблемы управления макросистемами. 2010. Т. 59. С. 134–145.

Watts D.J.; Strogatz S.H. Collective dynamics of 'small-world' networks // Nature. No 393. P. 440–442.

Ермолин Н.А., Мазалов В.В., Печников А.А. Теоретико-игровые методы нахождения сообществ в академическом Вебе // Труды СПИИРАН. 2017. Вып. 55. C. 237–254.

Pechnikov A.A., Chernobrovkin D.I. Adaptive Crawler for External Hyperlinks Search and Acquisition // Automation and Remote Control. 2014. V. 75. No 3. Р. 587–593.

Головин А.С., Печников А.А. База данных внешних гиперссылок для исследования фрагментов Веба // Информационная среда вуза XXI века: материалы VII Всероссийской научно-практической конференции (23–27 сентября 2013 г.). Петрозаводск, 2013. С. 55–57.

The Open Graph Viz Platform. URL: https://gephi.org

Blondel V.D., Guillaume J-L., Lambiotte R., Lefebvre E. Fast unfolding of communities in large networks // J. of Statistical Mechanics: Theory and Experiment. 2008. P. 10008.

Newman M.E., Girvan M. Finding and evaluating community structure in networks // Physical Review E. 2004. V. 69(2). P. 026113.

Левкина Л.И. Социально-историческая роль сообществ. М.: Русайнс, 2016. 216 с.

Malliaros F.D., Vazirgiannis M. Clustering and community detection in directed networks: A survey // Physics Reports. 2013. V. 533. Issue 4. P. 95–142.

Granovetter M.S. The Strength of Weak Ties // The American J. of Sociology. 1973. No 78 (6). P. 1360–1380.

Харари Ф. Теория графов. М.: Мир, 1973. 300 с.



Presenting an article for publication in the Russian Digital Libraries Journal (RDLJ), the authors automatically give consent to grant a limited license to use the materials of the Kazan (Volga) Federal University (KFU) (of course, only if the article is accepted for publication). This means that KFU has the right to publish an article in the next issue of the journal (on the website or in printed form), as well as to reprint this article in the archives of RDLJ CDs or to include in a particular information system or database, produced by KFU.

All copyrighted materials are placed in RDLJ with the consent of the authors. In the event that any of the authors have objected to its publication of materials on this site, the material can be removed, subject to notification to the Editor in writing.

Documents published in RDLJ are protected by copyright and all rights are reserved by the authors. Authors independently monitor compliance with their rights to reproduce or translate their papers published in the journal. If the material is published in RDLJ, reprinted with permission by another publisher or translated into another language, a reference to the original publication.

By submitting an article for publication in RDLJ, authors should take into account that the publication on the Internet, on the one hand, provide unique opportunities for access to their content, but on the other hand, are a new form of information exchange in the global information society where authors and publishers is not always provided with protection against unauthorized copying or other use of materials protected by copyright.

RDLJ is copyrighted. When using materials from the log must indicate the URL: index.phtml page = elbib / rus / journal?. Any change, addition or editing of the author's text are not allowed. Copying individual fragments of articles from the journal is allowed for distribute, remix, adapt, and build upon article, even commercially, as long as they credit that article for the original creation.

Request for the right to reproduce or use any of the materials published in RDLJ should be addressed to the Editor-in-Chief A.M. Elizarov at the following address: amelizarov@gmail.com.

The publishers of RDLJ is not responsible for the view, set out in the published opinion articles.

We suggest the authors of articles downloaded from this page, sign it and send it to the journal publisher's address by e-mail scan copyright agreements on the transfer of non-exclusive rights to use the work.