General Centrality in a hypergraph
Social and Information Networks
2014-03-21 v1 Combinatorics
Physics and Society
Abstract
The goal of this paper is to present a centrality measurement for the nodes of a hypergraph, by using existing literature which extends eigenvector centrality from a graph to a hypergraph, and literature which give a general centrality measurement for a graph. We will use this measurement to say more about the number of communications in a hypergraph, to implement a learning mechanism, and to construct certain networks.
Keywords
Cite
@article{arxiv.1403.5162,
title = {General Centrality in a hypergraph},
author = {Evo Busseniers},
journal= {arXiv preprint arXiv:1403.5162},
year = {2014}
}
Comments
16 pages