scholarly journals Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks

2021 ◽  
Vol 81 (6) ◽  
pp. 2704-2724
Author(s):  
Lucas Böttcher ◽  
Mason A. Porter
Keyword(s):  
Random Walk ◽  
Centrality Measures ◽  
Multilayer Networks ◽  
Quantum Random Walk

Centrality Measures

2018 ◽  
Author(s):  
Ginestra Bianconi
Keyword(s):  
State Of The Art ◽  
Centrality Measures ◽  
Eigenvector Centrality ◽  
Multilayer Networks ◽  
Comprehensive Description ◽  
Multilayer Network ◽  
Suitable Definition ◽  
Katz Centrality ◽  
Pagerank Centrality

Defining the centrality of nodes and layers in multilayer networks is of fundamental importance for a variety of applications from sociology to biology and finance. This chapter presents the state-of-the-art centrality measures able to characterize the centrality of nodes, the influences of layers or the centrality of replica nodes in multilayer and multiplex networks. These centrality measures include modifications of the eigenvector centrality, Katz centrality, PageRank centrality and Communicability to the multilayer network scenario. The chapter provides a comprehensive description of the research of the field and discusses the main advantages and limitations of the different definitions, allowing the readers that wish to apply these techniques to choose the most suitable definition for his or her case study.

scholarly journals Quantum random walk with Rb atoms

2009 ◽  
Vol 185 ◽  
pp. 012026 ◽  
Author(s):  
Kia Manouchehri ◽  
Jingbo Wang
Keyword(s):  
Random Walk ◽  
Quantum Random Walk

The quantum random walk within the Schrödinger-Langevin approach

1997 ◽  
Vol 71 (2-3) ◽  
pp. 187-194 ◽  
Author(s):  
Manuel O. Cáceres ◽  
Ana K. Chattah
Keyword(s):  
Random Walk ◽  
Quantum Random Walk ◽  
Langevin Approach

scholarly journals Controlling quantum random walk with a step-dependent coin

2018 ◽  
Vol 20 (8) ◽  
pp. 083028 ◽  
Author(s):  
S Panahiyan ◽  
S Fritzsche
Keyword(s):  
Random Walk ◽  
Quantum Random Walk

scholarly journals A Comprehensive Algorithm for Evaluating Node Influences in Social Networks Based on Preference Analysis and Random Walk

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Chengying Mao ◽  
Weisong Xiao
Keyword(s):  
Social Networks ◽  
Random Walk ◽  
Preference Relation ◽  
Disease Outbreak ◽  
Centrality Measures ◽  
The Internet ◽  
Virus Propagation ◽  
Preference Graph ◽  
Partial Preference ◽  
Relation Analysis

In the era of big data, social network has become an important reflection of human communications and interactions on the Internet. Identifying the influential spreaders in networks plays a crucial role in various areas, such as disease outbreak, virus propagation, and public opinion controlling. Based on the three basic centrality measures, a comprehensive algorithm named PARW-Rank for evaluating node influences has been proposed by applying preference relation analysis and random walk technique. For each basic measure, the preference relation between every node pair in a network is analyzed to construct the partial preference graph (PPG). Then, the comprehensive preference graph (CPG) is generated by combining the preference relations with respect to three basic measures. Finally, the ranking of nodes is determined by conducting random walk on the CPG. Furthermore, five public social networks are used for comparative analysis. The experimental results show that our PARW-Rank algorithm can achieve the higher precision and better stability than the existing methods with a single centrality measure.

Single-photon Bell state measurement based on a quantum random walk

2019 ◽  
Vol 100 (4) ◽  
Author(s):  
Xiao-Xiao Chen ◽  
Jia-Zhi Yang ◽  
Xu-Dan Chai ◽  
An-Ning Zhang
Keyword(s):  
Random Walk ◽  
Single Photon ◽  
Bell State ◽  
Quantum Random Walk ◽  
Bell State Measurement ◽  
State Measurement
Sign in / Sign up

Export Citation Format

Share Document