Characteristics of Algorithms to Reveal Communities in Graphs of Social Networks

Student: Orlov Aleksei

Faculty: HSE Tikhonov Moscow Institute of Electronics and Mathematics (MIEM HSE)

Educational Programme: Fundamental Informatics and Information Technologies (Bachelor)

Year of Graduation: 2017

The work considers features of Blondel‘s algorithm and checks its applicability to community detection in social networks. We identify some algorithm properties that affect the detected community structure. Some modifications of Blondel‘s algorithm are proposed, taking into these properties. The tests on a variety of LFR benchmarks show that the proposed modifications are efficient. In addition, we consider and describe the approaches to work with graph of Instagram social network, and compare partitions of Instagram ego graphs, that are recevied by the different modifications of Blondel‘s algorithm.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses