A Clarified Typology of Core-Periphery Structure in Networks

• URL: http://arxiv.org/abs/2005.10191v2
• Date: Thu, 21 May 2020 15:31:12 GMT
• Title: A Clarified Typology of Core-Periphery Structure in Networks
• Authors: Ryan J. Gallagher, Jean-Gabriel Young, Brooke Foucault Welles
• Abstract summary: Core-periphery structure, the arrangement of a network into a dense core and sparse periphery, is a versatile descriptor of various social, biological, and technological networks. Different core-periphery algorithms are often applied, despite the fact that they can yield inconsistent descriptions of core-periphery structure.
• Score: 0.09208007322096533
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Core-periphery structure, the arrangement of a network into a dense core and sparse periphery, is a versatile descriptor of various social, biological, and technological networks. In practice, different core-periphery algorithms are often applied interchangeably, despite the fact that they can yield inconsistent descriptions of core-periphery structure. For example, two of the most widely used algorithms, the k-cores decomposition and the classic two-block model of Borgatti and Everett, extract fundamentally different structures: the latter partitions a network into a binary hub-and-spoke layout, while the former divides it into a layered hierarchy. We introduce a core-periphery typology to clarify these differences, along with Bayesian stochastic block modeling techniques to classify networks in accordance with this typology. Empirically, we find a rich diversity of core-periphery structure among networks. Through a detailed case study, we demonstrate the importance of acknowledging this diversity and situating networks within the core-periphery typology when conducting domain-specific analyses.

Related papers

• Discriminative community detection for multiplex networks [20.810096547938166]
  We introduce two discriminative community detection algorithms based on spectral clustering. The first approach aims to identify the discriminative subgraph structure between the groups, while the second one learns the discriminative and the consensus community structures, simultaneously.
  arXiv  Detail & Related papers  (2024-09-30T14:48:45Z)
• Uncovering the hidden core-periphery structure in hyperbolic networks [0.0]
  hyperbolic network models exhibit fundamental and essential features, like small-worldness, scale-freeness, high-clustering coefficient, and community structure. In this paper, we explore the presence of an important feature, the core-periphery structure, in the hyperbolic network models.
  arXiv  Detail & Related papers  (2024-06-28T14:39:21Z)
• Towards Diverse Binary Segmentation via A Simple yet General Gated Network [71.19503376629083]
  We propose a simple yet general gated network (GateNet) to tackle binary segmentation tasks. With the help of multi-level gate units, the valuable context information from the encoder can be selectively transmitted to the decoder. We introduce a "Fold" operation to improve the atrous convolution and form a novel folded atrous convolution.
  arXiv  Detail & Related papers  (2023-03-18T11:26:36Z)
• Rank Diminishing in Deep Neural Networks [71.03777954670323]
  Rank of neural networks measures information flowing across layers. It is an instance of a key structural condition that applies across broad domains of machine learning. For neural networks, however, the intrinsic mechanism that yields low-rank structures remains vague and unclear.
  arXiv  Detail & Related papers  (2022-06-13T12:03:32Z)
• Unified Field Theory for Deep and Recurrent Neural Networks [56.735884560668985]
  We present a unified and systematic derivation of the mean-field theory for both recurrent and deep networks. We find that convergence towards the mean-field theory is typically slower for recurrent networks than for deep networks. Our method exposes that Gaussian processes are but the lowest order of a systematic expansion in $1/n$.
  arXiv  Detail & Related papers  (2021-12-10T15:06:11Z)
• Fast Topological Clustering with Wasserstein Distance [0.0]
  We propose a novel and computationally practical topological clustering method that clusters complex networks with intricate topology. Such networks are aggregated into clusters through a centroid-based clustering strategy based on both their topological and geometric structure. The proposed method is demonstrated to be effective using both simulated networks and measured functional brain networks.
  arXiv  Detail & Related papers  (2021-11-30T21:02:53Z)
• Structure Amplification on Multi-layer Stochastic Block Models [16.53851254884497]
  We propose a general structure amplification technique that uncovers hidden structure in complex networks. HiCODE incrementally weakens dominant structure through randomization allowing the hidden functionality to emerge. We provide theoretical proof that the iterative reducing methods could help promote the uncovering of hidden structure.
  arXiv  Detail & Related papers  (2021-07-31T02:11:47Z)
• Learning distinct features helps, provably [98.78384185493624]
  We study the diversity of the features learned by a two-layer neural network trained with the least squares loss. We measure the diversity by the average $L$-distance between the hidden-layer features.
  arXiv  Detail & Related papers  (2021-06-10T19:14:45Z)
• Recent advances in deep learning theory [104.01582662336256]
  This paper reviews and organizes the recent advances in deep learning theory. The literature is categorized in six groups: (1) complexity and capacity-based approaches for analysing the generalizability of deep learning; (2) differential equations and their dynamic systems for modelling gradient descent and its variants; (3) the geometrical structures of the loss landscape that drives the trajectories of the dynamic systems; and (5) theoretical foundations of several special structures in network architectures.
  arXiv  Detail & Related papers  (2020-12-20T14:16:41Z)
• Classical and quantum random-walk centrality measures in multilayer networks [0.0]
  Classifying the importance of nodes and node-layers is an important aspect of the study of multilayer networks. It is common to calculate various centrality measures, which allow one to rank nodes and node-layers according to a variety of structural features. We apply our framework to a variety of synthetic and real-world multilayer networks, and we identify marked differences between classical and quantum centrality measures.
  arXiv  Detail & Related papers  (2020-12-13T21:23:29Z)
• Suppress and Balance: A Simple Gated Network for Salient Object Detection [89.88222217065858]
  We propose a simple gated network (GateNet) to solve both issues at once. With the help of multilevel gate units, the valuable context information from the encoder can be optimally transmitted to the decoder. In addition, we adopt the atrous spatial pyramid pooling based on the proposed "Fold" operation (Fold-ASPP) to accurately localize salient objects of various scales.
  arXiv  Detail & Related papers  (2020-07-16T02:00:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.