2020/03/16 by Xavier Ouvrard, Ouvrard, Xavier, Jean‐Marie Le Goff +3
Physics and Astronomy · #Combinatorics (math.CO) #Complex Network Analysis Techniques #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Opinion Dynamics and Social Influence #Social and Information Networks (cs.SI)
paper · pdf · doi:10.48550/arxiv.2003.07323
openalex publication_date 2020/03/16 · openalex created_date 2020/03/23 · openalex updated_date 2026/07/28
Co-occurence networks can be adequately modeled by hyper-bag-graphs (hb-graphs for short). A hb-graph is a family of multisets having same universe, called the vertex set. An efficient exchange-based diffusion scheme has been previously proposed that allows the ranking of both vertices and hb-edges. In this article, we extend this scheme to allow biases of different kinds and explore their effect on the different rankings obtained. The biases enhance the emphasize on some particular aspects of the network.