1. Home
2. Premium
3. IEEE ICASSP 2020 Virtual Conference May 2020
4. Blind Inference Of Centrality Rankings From Graph Signals

Blind Inference Of Centrality Rankings From Graph Signals

Collection:

IEEE ICASSP 2020 Virtual Conference May 2020

We study the blind centrality ranking problem, where our goal is to infer the eigenvector centrality ranking of nodes solely from nodal observations, i.e., without information about the topology of the network. We formalize these nodal observations as gra

• IEEE MemberUS $11.00
• Society MemberUS $0.00
• IEEE Student MemberUS $11.00
• Non-IEEE MemberUS $15.00

Purchase

Videos in this product

Blind Inference Of Centrality Rankings From Graph Signals

00:13:21

0 views

We study the blind centrality ranking problem, where our goal is to infer the eigenvector centrality ranking of nodes solely from nodal observations, i.e., without information about the topology of the network. We formalize these nodal observations as gra