Main content

Date created: | Last Updated:

: DOI | ARK

Creating DOI. Please wait...

Create DOI

Category: Project

Description: Identifying communities in social networks is one of the most important tasks nowadays. Social networks are especially relevant for networks represented by large-scale graphics. At the same time, it is important to use approximate methods that lead to near-optimal rather than optimal results within a given time. In this article, we propose to extract the communities based on the method of maximum likelihood similarity by representing them by letters. The community structure search algorithm is described and the performance of the algorithm is illustrated using examples of different views of the octagonal network.. Calculations were carried out using the Maple program.

License: CC-By Attribution 4.0 International

Files

Loading files...

Redirect Link

This project contains a forward to .

Citation

Tags

Recent Activity

Loading logs...

OSF does not support the use of Internet Explorer. For optimal performance, please switch to another browser.
Accept
This website relies on cookies to help provide a better user experience. By clicking Accept or continuing to use the site, you agree. For more information, see our Privacy Policy and information on cookie use.
Accept
×

Start managing your projects on the OSF today.

Free and easy to use, the Open Science Framework supports the entire research lifecycle: planning, execution, reporting, archiving, and discovery.