Community Detection In Sparse Networks
Main Article Content
Abstract
Spectral methods in which they are based on matrix eigenvectors are widely
used in network data analysis, especially for community detection. These
classical approaches are based on graph associated matrix (adjacency matrix)
and related matrices, nevertheless go wrong with sparse networks, which they
have a lot of interest in practice. The spectrum of the non-backtracking
matrix, an alternate matrix representation of a network that shows a behavior
in the sparse limit, has recently been presented as a solution to this problem.
However, the use of this matrix was limited for a specified number of
communities. We are presenting a matrix for the graph and showing that it
can be using for different number of communities.
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
