Community detection in network using Szegedy quantum walk
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912889664700416 |
|---|---|
| author | Rahaman, Md Samsur Dutta, Supriyo |
| author_facet | Rahaman, Md Samsur Dutta, Supriyo |
| contents | In a network, the vertices with similar characteristics construct communities. The vertices in a community are well-connected. Detecting the communities in a network is a challenging and important problem in the theory of complex networks. One approach to solving this problem uses the classical random walks on graphs. In quantum computing, quantum walks are the quantum mechanical counterparts of classical random walks. In this article, we employ a variant of Szegedy's quantum walk to develop a procedure for discovering the communities in networks. The limiting probability distribution of quantum walks assists us in determining the inclusion of a vertex in a community. We apply our community detection procedure to a variety of graphs and social networks, including the relaxed caveman graph, $l$-partition graph, Karate club graph, and the dolphin's social network, among others. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_21152 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Community detection in network using Szegedy quantum walk Rahaman, Md Samsur Dutta, Supriyo Quantum Physics Social and Information Networks Combinatorics Physics and Society In a network, the vertices with similar characteristics construct communities. The vertices in a community are well-connected. Detecting the communities in a network is a challenging and important problem in the theory of complex networks. One approach to solving this problem uses the classical random walks on graphs. In quantum computing, quantum walks are the quantum mechanical counterparts of classical random walks. In this article, we employ a variant of Szegedy's quantum walk to develop a procedure for discovering the communities in networks. The limiting probability distribution of quantum walks assists us in determining the inclusion of a vertex in a community. We apply our community detection procedure to a variety of graphs and social networks, including the relaxed caveman graph, $l$-partition graph, Karate club graph, and the dolphin's social network, among others. |
| title | Community detection in network using Szegedy quantum walk |
| topic | Quantum Physics Social and Information Networks Combinatorics Physics and Society |
| url | https://arxiv.org/abs/2601.21152 |