Quantifying the presence/absence of meso-scale structures in networks

03/30/2022
by   Eric Yanchenko, et al.
0

Meso-scale structures are network features where nodes with similar properties are grouped together instead of being treated individually. In this work, we provide formal and mathematical definitions of three such structures: assortative communities, disassortative communities and core-periphery. We then leverage these definitions and a Bayesian framework to quantify the presence/absence of each structure in a network. This allows for probabilistic statements about the network structure as well as uncertainty estimates of the group labels and edge probabilities. The method is applied to real-world networks, yielding provocative results about well-known network data sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2019

Stochastic Blockmodels with Edge Information

Stochastic blockmodels allow us to represent networks in terms of a late...
research
12/07/2021

An Interactive Approach for Identifying Structure Definitions

Our ability to grasp and understand complex phenomena is essentially bas...
research
11/28/2014

Efficient inference of overlapping communities in complex networks

We discuss two views on extending existing methods for complex network m...
research
09/25/2020

Bayesian Testing for Exogenous Partition Structures in Stochastic Block Models

Network data often exhibit block structures characterized by clusters of...
research
01/16/2023

Bayesian Detection of Mesoscale Structures in Pathway Data on Graphs

Mesoscale structures are an integral part of the abstraction and analysi...
research
02/08/2020

The Bloom Tree

The Bloom tree is a probabilistic data structure that combines the idea ...
research
09/10/2010

Multiplex Structures: Patterns of Complexity in Real-World Networks

Complex network theory aims to model and analyze complex systems that co...

Please sign up or login with your details

Forgot password? Click here to reset