KBrace Filter

Introduction

The k-brace filter is a variant of the k-core. Instead of the degree it uses the edge’s embededness (number of common neighbors). It is useful to highlight dense connected components in social networks. The filter works only on undirected graphs. As defined in the paper “the k-brace of a graph is the subgraph formed by repeatedly deleting all edges of embeddedness less than k and then deleting all single-node connected components”

Plugin Owner’s Notes

Reference: Structural diversity in social contagion Johan Ugander, Lars Backstrom, Cameron Marlow, and Jon Kleinberg PNAS (2012)
http://www.pnas.org/content/early/2012/03/27/1116502109.full.pdf