activity
20062025
most citedInvestigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm

36 citations · 124 across the 22 of their papers we have counts for

collaborators

24 papers

cs.IT2025★ 12 cited

Fastest Mixing Reversible Markov Chain: Clique Lifted Graphs and Subgraphs

Saber Jafarizadeh

Markov chains are one of the well-known tools for modeling and analyzing stochastic systems. At the same time, they are used for constructing random walks that can achieve a given…

cs.IT2025★ 7 cited

Fastest mixing reversible Markov chain on friendship graph: Trade-off between transition probabilities among friends and convergence rate

Saber Jafarizadeh

A long-standing goal of social network research has been to alter the properties of network to achieve the desired outcome. In doing so, DeGroot's consensus model has served as the…

math.PR2024★ 14 cited

Optimal Diffusion Processes

Saber Jafarizadeh

Of stochastic differential equations, diffusion processes have been adopted in numerous applications, as more relevant and flexible models. This paper studies diffusion processes i…

eess.SY2016

Continuous Time Quantum Consensus & Quantum Synchronisation

Saber Jafarizadeh

Distributed consensus algorithm over networks of quantum systems has been the focus of recent studies in the context of quantum computing and distributed control. Most of the progr…

eess.SY2016

Optimizing the Diffusion System Based on Continuous-Time Consensus Algorithm

Saber Jafarizadeh

Traditionally, systems governed by linear Partial Differential Equations (PDEs) are spatially discretized to exploit their algebraic structure and reduce the computational effort f…

eess.SY2015

Optimizing the Gossip Algorithm with Non-Uniform Clock Distribution over Classical & Quantum Networks

Saber Jafarizadeh

Distributed gossip algorithm has been studied in literature for practical implementation of the distributed consensus algorithm as a fundamental algorithm for the purpose of in-net…