121 citations · 203 across the 6 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.NA2013★ 121 cited
On the limiting behavior of parameter-dependent network centrality measures
Michele Benzi, Christine Klymko
We consider a broad class of walk-based, parameterized node centrality measures for network analysis. These measures are expressed in terms of functions of the adjacency matrix and…
quant-ph2013★ 27 cited
An Integrated Programming and Development Environment for Adiabatic Quantum Optimization
Travis S. Humble, Alex J. McCaskey, Ryan S. Bennink +5
Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware has raised cha…
cs.SI2013
Total communicability as a centrality measure
Michele Benzi, Christine Klymko
We examine a node centrality measure based on the notion of total communicability, defined in terms of the row sums of the exponential of the adjacency matrix of the network. We ar…