• Corpus ID: 240354288

Higher-Order Relations Skew Link Prediction in Graphs

  title={Higher-Order Relations Skew Link Prediction in Graphs},
  author={Govind Sharma and Aditya Challa and Paarth Gupta and M. Narasimha Murty},
The problem of link prediction is of active interest. The main approach to solving the link prediction problem is based on heuristics such as Common Neighbors (CN) – more number of common neighbors of a pair of nodes implies a higher chance of them getting linked. In this article, we investigate this problem in the presence of higher-order relations. Surprisingly, it is found that CN works very well, and even better in the presence of higher-order relations. However, as we prove in the current… 

Figures and Tables from this paper

Higher-order Clustering and Pooling for Graph Neural Networks

This work proposes HoscPool, a clustering-based graph pooling operator that captures higher-order information hierarchically, leading to richer graph representations and provides a deep empirical analysis of pooling operators’ inner functioning.

Dynamics on higher-order networks: a review

A variety of dynamical processes that have thus far been studied, including different synchronization phenomena, contagion processes, the evolution of cooperation and consensus formation, are studied.



An Axiomatic Approach to Link Prediction

This framework fully characterize four well known link prediction functions and shows that they are in fact derived from different variants of a single basic set of property templates, which are drawn upon in characterizations of ranking algorithms and other celebrated results from social choice.

A Survey of Link Prediction in Complex Networks

This survey will review the general-purpose techniques at the heart of the link prediction problem, which can be complemented by domain-specific heuristic methods in practice.

Simplicial closure and higher-order link prediction

It is shown that there is a rich variety of structure in the authors' datasets but datasets from the same system types have consistent patterns of higher-order structure, and it is found that tie strength and edge density are competing positive indicators ofhigher-order organization.

The link-prediction problem for social networks

Experiments on large coauthorship networks suggest that information about future interactions can be extracted from network topology alone, and that fairly subtle measures for detecting node proximity can outperform more direct measures.

Higher order learning with graphs

It is shown that various formulations of the semi-supervised and the unsupervised learning problem on hypergraphs result in the same graph theoretic problem and can be analyzed using existing tools.

SimRank: a measure of structural-context similarity

A complementary approach, applicable in any domain with object-to-object relationships, that measures similarity of the structural context in which objects occur, based on their relationships with other objects is proposed.

Latent Space Modelling of Hypergraph Data

A model for hypergraph data is presented which extends the latent space distance model of Hoff et al. (2002) and, by drawing a connection to constructs from computational topology, is developed a model whose likelihood is inexpensive to compute.

Measuring preferential attachment for evolving networks

Measurements on four networks indicate that the rate at which nodes acquire links depends on the node's degree, offering direct quantitative support for the presence of preferential attachment.

Latent Space Approaches to Social Network Analysis

This work develops a class of models where the probability of a relation between actors depends on the positions of individuals in an unobserved “social space,” and proposes Markov chain Monte Carlo procedures for making inference on latent positions and the effects of observed covariates.

Clustering and preferential attachment in growing networks.

  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
It is shown that the probability of a pair of scientists collaborating increases with the number of other collaborators they have in common, and that the probabilities of a particular scientist acquiring new collaborators increases withThe number of his or her past collaborators.