Clustering quantum Markov chains on trees associated with open quantum random walks

Clustering quantum Markov chains on trees associated with open quantum random walks

In networks, the Markov clustering (MCL) algorithm is one of the most efficient approaches in detecting clustered structures. The MCL algorithm takes as input a stochastic matrix, which depends on the adjacency matrix of the graph network under consideration. Quantum clustering algorithms are proven...

Full description

Bibliographic Details
Main Authors: Luigi Accardi, Amenallah Andolsi, Farrukh Mukhamedov, Mohamed Rhaima, Abdessatar Souissi
Format: Article
Language:English
Published: AIMS Press 2023-07-01
Series:AIMS Mathematics
Subjects:
markov chains
quantum theory
clustering
cayley tree
random walks
Online Access:https://www.aimspress.com/article/doi/10.3934/math.20231170?viewType=HTML

Internet

https://www.aimspress.com/article/doi/10.3934/math.20231170?viewType=HTML

Similar Items