Modularity Definition and Optimization Algorithm for Community Detection in Signed Hypergraphs

Wei Du and Guangyu Li

Complexity, 2025, vol. 2025, 1-14

Abstract: The analysis of super-dyadic relations through hypergraphs is gradually gaining attention, with its community structure analysis playing a crucial role in computational social science. However, few scholars have paid attention to the impact of hyperedge diversity on the community structure of hypergraphs, especially the impact generated by heterogeneous hyperedges. This paper expands hypergraphs into signed hypergraphs and proposes a framework for community structure in signed hypergraphs along with a variant of modularity. Simultaneously, an optimization algorithm is introduced in this paper to detect potential communities by maximizing modularity. Experimental results reveal that the proposed method can effectively optimize the objective function and detect community structures.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2025/6950334.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2025/6950334.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:6950334

DOI: 10.1155/cplx/6950334

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().