Related papers: Global decomposition of networks into multiple cor…
Many networks can be usefully decomposed into a dense core plus an outlying, loosely-connected periphery. Here we propose an algorithm for performing such a decomposition on empirical network data using methods of statistical inference. Our…
We use the k-core decomposition to visualize large scale complex networks in two dimensions. This decomposition, based on a recursive pruning of the least connected vertices, allows to disentangle the hierarchical structure of networks by…
We introduce a new network statistic that measures diverse structural properties at the micro-, meso-, and macroscopic scales, while still being easy to compute and easy to interpret at a glance. Our statistic, the onion spectrum, is based…
We study core-periphery structure in networks using inference methods based on a flexible network model that allows for traditional onion-like cores within cores, but also for hierarchical tree-like structures and more general non-nested…
Multilayer networks provide a powerful framework for modeling complex systems that capture different types of interactions between the same set of entities across multiple layers. Core-periphery detection involves partitioning the nodes of…
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…
$k$-core decomposition is widely used to identify the center of a large network, it is a pruning process in which the nodes with degrees less than $k$ are recursively removed. Although the simplicity and effectiveness of this method…
Many real-world networks exhibit a multicores-periphery structure, with densely connected vertices in multiple cores surrounded by a general periphery of sparsely connected vertices. Identification of the multicores-periphery structure can…
With a core-periphery structure of networks, core nodes are densely interconnected, peripheral nodes are connected to core nodes to different extents, and peripheral nodes are sparsely interconnected. Core-periphery structure composed of a…
This study relates the local property of node dominance to local and global properties of a network. Iterative removal of dominated nodes yields a distributed algorithm for computing a core-periphery decomposition of a social network, where…
The heterogeneous structure implies that a very few nodes may play the critical role in maintaining structural and functional properties of a large-scale network. Identifying these vital nodes is one of the most important tasks in network…
Intermediate-scale (or `meso-scale') structures in networks have received considerable attention, as the algorithmic detection of such structures makes it possible to discover network features that are not apparent either at the local scale…
Profiling core-periphery structures in networks has attracted significant attention, leading to the development of various methods. Among these, the rich-core method is distinguished for being entirely parameter-free and scalable to large…
We introduce several novel and computationally efficient methods for detecting "core--periphery structure" in networks. Core--periphery structure is a type of mesoscale structure that includes densely-connected core vertices and…
Multi-layer networks or multiplex networks are generally considered as the networks that have the same set of vertices but different types of edges. Multi-layer networks are especially useful when describing the systems with several kinds…
The recursive removal of leaves (dead end vertices) and their neighbors from an undirected network results, when this pruning algorithm stops, in a so-called core of the network. This specific subgraph should be distinguished from…
We propose and study a set of algorithms for discovering community structure in networks -- natural divisions of network nodes into densely connected subgroups. Our algorithms all share two definitive features: first, they involve iterative…
Core-periphery structure and community structure are two typical meso-scale structures in complex networks. Though the community detection has been extensively investigated from different perspectives, the definition and the detection of…
Uncovering structural patterns in collaboration networks is key for understanding how knowledge flows and innovation emerges. These networks often exhibit a rich interplay of meso-scale structures, such as communities, core-periphery…
We derive and analyse a new iterative algorithm for detecting network core--periphery structure. Using techniques in nonlinear Perron-Frobenius theory, we prove global convergence to the unique solution of a relaxed version of a natural…