A local geometry of hyperedges in hypergraphs, and its applications to social networks

09/29/2020
by   Dong Quan Ngoc Nguyen, et al.
0

In many real world datasets arising from social networks, there are hidden higher order relations among data points which cannot be captured using graph modeling. It is natural to use a more general notion of hypergraphs to model such social networks. In this paper, we introduce a new local geometry of hyperdges in hypergraphs which allows to capture higher order relations among data points. Furthermore based on this new geometry, we also introduce new methodology–the nearest neighbors method in hypergraphs–for analyzing datasets arising from sociology.

READ FULL TEXT
research
09/29/2020

Community detection, pattern recognition, and hypergraph-based learning: approaches using metric geometry and persistent homology

Hypergraph data appear and are hidden in many places in the modern age. ...
research
02/06/2021

Opinion Dynamics Incorporating Higher-Order Interactions

The issue of opinion sharing and formation has received considerable att...
research
09/29/2020

Weight Prediction for Variants of Weighted Directed Networks

A weighted directed network (WDN) is a directed graph in which each edge...
research
08/26/2019

Motif Enhanced Recommendation over Heterogeneous Information Network

Heterogeneous Information Networks (HIN) has been widely used in recomme...
research
04/21/2022

Maximizing the Influence of Bichromatic Reverse k Nearest Neighbors in Geo-Social Networks

Geo-social networks offer opportunities for the marketing and promotion ...
research
02/02/2017

HoNVis: Visualizing and Exploring Higher-Order Networks

Unlike the conventional first-order network (FoN), the higher-order netw...
research
03/02/2018

Higher order monotonicity and submodularity of influence in social networks: from local to global

Kempe, Kleinberg and Tardos (KKT) proposed the following conjecture abou...

Please sign up or login with your details

Forgot password? Click here to reset