Related papers: Core-periphery structure requires something else i…

In this paper, we focus on learning sparse graphs with a core-periphery structure. We propose a generative model for data associated with core-periphery structured networks to model the dependence of node attributes on core scores of the…

Recently, the core-periphery (CP) structure of networks as one type of meso-scale structure has received attention. The CP structure is composed of a dense core and a sparse connected periphery. In this paper, we propose an algorithm to…

Common experience suggests that many networks might possess community structure - division of vertices into groups, with a higher density of edges within groups than between them. Here we describe a new computer algorithm that detects…

A number of important transport networks, such as the airline and trade networks of the world, exhibit a characteristic core-periphery structure, wherein a few nodes are highly interconnected and the rest of the network frays into a tree.…

We introduce a random hypergraph model for core-periphery structure. By leveraging our model's sufficient statistics, we develop a novel statistical inference algorithm that is able to scale to large hypergraphs with runtime that is…

Many of the structural characteristics of a network depend on the connectivity with and within the hubs. These dependencies can be related to the degree of a node and the number of links that a node shares with nodes of higher degree. In…

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…

A standard approach to reduce the complexity of very large networks is to group together sets of nodes into clusters according to some criterion which reflects certain structural properties of the network. Beyond the well-known modularity…

Networks are ubiquitous in various fields, representing systems where nodes and their interconnections constitute their intricate structures. We introduce a network decomposition scheme to reveal multiscale core-periphery structures lurking…

Core-periphery structure is an emerging property of a wide range of complex systems and indicate the presence of group of actors in the system with an higher number of connections among them and a lower number of connections with a sparsely…

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…

A core is said to be a group of central and densely connected nodes which governs the overall behavior of a network. Profiling this meso--scale structure currently relies on a limited number of methods which are often complex, and have…

Multiplex networks are convenient mathematical representations for many real-world -- biological, social, and technological -- systems of interacting elements, where pairwise interactions among elements have different flavors. Previous…

The core group is an invariant of unoriented virtual links. We introduce a peripheral structure for the core group, in which the longitudes are sensitive to orientations. We show that the combination of the core group and its peripheral…

Networks have in recent years emerged as an invaluable tool for describing and quantifying complex systems in many branches of science. Recent studies suggest that networks often exhibit hierarchical organization, where vertices divide into…

Network science has presented community detection as a valuable tool for revealing functional modules in complex systems rooted in the wiring architectures of complex networks. The varying procedures of community detection can produce,…

The structure of the Internet at the Autonomous System (AS) level has been studied by both the Physics and Computer Science communities. We extend this work to include features of the core and the periphery, taking a radial perspective on…

The community structure of a complex network can be determined by finding the partitioning of its nodes that maximizes modularity. Many of the proposed algorithms for doing this work by recursively bisecting the network. We show that this…

Much work has been devoted to studying percolation of networks and interdependent networks under varying levels of failures. Researchers have considered many different realistic network structures, but thus far no study has incorporated the…