2022/09/15 by Shuang Gao, Gao, Shuang · 1 citation
Biochemistry, Genetics and Molecular Biology · #FOS: Computer and information sciences #FOS: Electrical engineering #Gene Regulatory Network Analysis #Machine Learning (stat.ML) #Social and Information Networks (cs.SI) #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2209.07070
openalex publication_date 2022/09/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper proposes a family of network centralities called fixed-point centralities. This centrality family is defined via the fixed point of permutation equivariant mappings related to the underlying network. Such a centrality notion is immediately extended to define fixed-point centralities for infinite graphs characterized by graphons. Variation bounds of such centralities with respect to the variations of the underlying graphs and graphons under mild assumptions are established. Fixed-point centralities connect with a variety of different models on networks including graph neural networks, static and dynamic games on networks, and Markov decision processes.