Trudy SPIIRAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Informatics and Automation:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Trudy SPIIRAN, 2017, Issue 55, Pages 237–254
DOI: https://doi.org/10.15622/sp.55.10
(Mi trspy984)
 

This article is cited in 6 scientific papers (total in 6 papers)

Algorithms and Software

Game-theoretic methods for finding communities in academic Web

N. A. Ermolina, V. V. Mazalovb, A. A. Pechnikovb

a Petrozavodsk State University (PetrSU)
b Institute of Applied Mathematical Research Karelian Research Centre of Russian Academy of Science
Abstract: We consider the problem of community detection for the graph which is a fragment of the academic Web. The nodes of the graph are the sites of the scientific organizations, and its arcs are hyperlinks. We propose a new approach based on the methods of coalition game theory to derive the Nash-stable coalition partition. This is determined by a function of preferences for any pair of vertices in the graph. The problem of finding a stable partition is connected with finding a maximum of potential function. The algorithm for searching stable partitioning and evaluating its complexity is presented. The proposed method was compared with two well-known methods of finding communities. The efficiency of the new method is demonstrated on the fragment of the Web which consists of the official sites of the Siberian and Far East branches of RAS.
Keywords: web space; graph; community; modularity; coalition game theory.
Funding agency Grant number
Russian Foundation for Basic Research 16-51-55006
15-02-00352
15-01-06105
This research is supported by RFBR (grants №№ 16-51-5506, 15-02-00352 and 15-01-06105).
Bibliographic databases:
Document Type: Article
UDC: 519.7:004.738
Language: Russian
Citation: N. A. Ermolin, V. V. Mazalov, A. A. Pechnikov, “Game-theoretic methods for finding communities in academic Web”, Tr. SPIIRAN, 55 (2017), 237–254
Citation in format AMSBIB
\Bibitem{ErmMazPec17}
\by N.~A.~Ermolin, V.~V.~Mazalov, A.~A.~Pechnikov
\paper Game-theoretic methods for finding communities in academic Web
\jour Tr. SPIIRAN
\yr 2017
\vol 55
\pages 237--254
\mathnet{http://mi.mathnet.ru/trspy984}
\crossref{https://doi.org/10.15622/sp.55.10}
\elib{https://elibrary.ru/item.asp?id=30685509}
Linking options:
  • https://www.mathnet.ru/eng/trspy984
  • https://www.mathnet.ru/eng/trspy/v55/p237
  • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Informatics and Automation
    Statistics & downloads:
    Abstract page:206
    Full-text PDF :68
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024