Novel Edge and Density Metrics for Link Cohesion

03/06/2020
by   Cetin Savkli, et al.
0

We present a new metric of link cohesion for measuring the strength of edges in complex, highly connected graphs. Link cohesion accounts for local small hop connections and associated node degrees and can be used to support edge scoring and graph simplification. We also present a novel graph density measure to estimate the average cohesion across nodes. Link cohesion and the density measure are employed to demonstrate community detection through graph sparsification by maximizing graph density. Link cohesion is also shown to be loosely correlated with edge betweenness centrality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2022

The Ties that matter: From the perspective of Similarity Measure in Online Social Networks

Online Social Networks have embarked on the importance of connection str...
research
09/28/2018

Evidential community detection based on density peaks

Credal partitions in the framework of belief functions can give us a bet...
research
05/06/2022

LPGNet: Link Private Graph Networks for Node Classification

Classification tasks on labeled graph-structured data have many importan...
research
11/11/2020

Toward Edge-Centric Network Embeddings

Existing network embedding approaches tackle the problem of learning low...
research
05/09/2012

A Bayesian Framework for Community Detection Integrating Content and Link

This paper addresses the problem of community detection in networked dat...
research
07/12/2022

Edge Augmentation on Disconnected Graphs via Eigenvalue Elevation

The graph-theoretical task of determining most likely inter-community ed...
research
08/05/2019

Graph Drawing with Morphing Partial Edges

A partial edge drawing (PED) of a graph is a variation of a node-link di...

Please sign up or login with your details

Forgot password? Click here to reset