Generative Models and Learning Algorithms for Core-Periphery Structured Graphs

10/04/2022
by   Sravanthi Gurugubelli, et al.
0

We consider core-periphery structured graphs, which are graphs with a group of densely and sparsely connected nodes, respectively, referred to as core and periphery nodes. The so-called core score of a node is related to the likelihood of it being a core node. In this paper, we focus on learning the core scores of a graph from its node attributes and connectivity structure. To this end, we propose two classes of probabilistic graphical models: affine and nonlinear. First, we describe affine generative models to model the dependence of node attributes on its core scores, which determine the graph structure. Next, we discuss nonlinear generative models in which the partial correlations of node attributes influence the graph structure through latent core scores. We develop algorithms for inferring the model parameters and core scores of a graph when both the graph structure and node attributes are available. When only the node attributes of graphs are available, we jointly learn a core-periphery structured graph and its core scores. We provide results from numerical experiments on several synthetic and real-world datasets to demonstrate the efficacy of the developed models and algorithms.

READ FULL TEXT

page 1

page 11

research
10/08/2021

Learning Sparse Graphs with a Core-periphery Structure

In this paper, we focus on learning sparse graphs with a core-periphery ...
research
07/26/2017

The Advantage of Evidential Attributes in Social Networks

Nowadays, there are many approaches designed for the task of detecting c...
research
10/21/2019

Sparse Networks with Core-Periphery Structure

We propose a statistical model for graphs with a core-periphery structur...
research
08/01/2023

DYMOND: DYnamic MOtif-NoDes Network Generative Model

Motifs, which have been established as building blocks for network struc...
research
10/27/2022

A Graph Is More Than Its Nodes: Towards Structured Uncertainty-Aware Learning on Graphs

Current graph neural networks (GNNs) that tackle node classification on ...
research
02/08/2022

GraphDCA – a Framework for Node Distribution Comparison in Real and Synthetic Graphs

We argue that when comparing two graphs, the distribution of node struct...
research
02/08/2022

Simplified Graph Convolution with Heterophily

Graph convolutional networks (GCNs) (Kipf Welling, 2017) attempt to ...

Please sign up or login with your details

Forgot password? Click here to reset