Engineering Papers⌕ Search

DOE OSTI · 1649184

Spike-based graph centrality measures

Abstract

We derive several spike-based routines that compute or establish bounds on radial centrality measures for undirected graphs and trees without the use of matrix multiplication. These spike-based centrality measures utilize a direct embedding of graph nodes and edges into neurons and synapses, can be implemented with static synapses or plastic synapses, and rely on minimal post-processing of spike rasters. This work contributes to the growing set of graphical applications for neuromorphic hardware.

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hamilton, Kathleen, Mintz, Tiffany, Date, Prasanna, Schuman, Catherine. 2020-07-01. Spike-based graph centrality measures. https://doi.org/10.1145/3407197.3407199. https://engineeringpapers.com/record/osti%3A1649184/spike-based-graph-centrality-measures

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.