相关论文: Quantifying Dismantlement in Disconnected Networks

Clustering evaluation measures are frequently used to evaluate the performance of algorithms. However, most measures are not properly normalized and ignore some information in the inherent structure of clusterings. We model the relation…

One of the main issues in modern network science is the phenomenon of cascading failures of a small number of attacks. Here we define the dimension of a network to be the maximal number of functions or features of nodes of the network. It…

Cook's distance [Technometrics 19 (1977) 15-18] is one of the most important diagnostic tools for detecting influential individual or subsets of observations in linear regression for cross-sectional data. However, for many complex data…

In this work we study the set size distribution estimation problem, where elements are randomly sampled from a collection of non-overlapping sets and we seek to recover the original set size distribution from the samples. This problem has…

By performing extensive simulations with unprecedentedly large system sizes, we unveil how rigidity influences the fracture of disordered materials. We observe the largest damage in networks with connectivity close to the isostatic point…

Centrality measures aim to indicate who is important in a network. Various notions of `being important' give rise to different centrality measures. In this paper, we study how important the central vertices are for the connectivity…

Nonparametric detection of existence of an anomalous structure over a network is investigated. Nodes corresponding to the anomalous structure (if one exists) receive samples generated by a distribution q, which is different from a…

Numerical analysis of data from international trade and ecological networks has shown that the non-linear fitness-complexity metric is the best candidate to rank nodes by importance in bipartite networks that exhibit a nested structure.…

We study two measures of the complexity of heterogeneous extended systems, taking random Boolean networks as prototypical cases. A measure defined by Shalizi et al. for cellular automata, based on a criterion for optimal statistical…

We study quantum entanglement distribution on networks with full-rank bi-partite mixed states linking qubits on nodes. In particular, we use entanglement swapping and purification to partially entangle widely separated nodes. The simplest…

Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…

Dislocation networks and their evolution are known to control the mechanical properties of metal samples. However, the lack of computationally efficient and statistically rigorous descriptors for such defect systems has hindered the…

We investigate stratified sampling in the context of network reliability assessment. We propose an unbalanced stratum refinement procedure, which operates on a partition of network components into clusters and the number of failed…

The divergence of the correlation length $\xi$ at criticality is an important phenomenon of percolation in two-dimensional systems. Substantial speed-ups to the calculation of the percolation threshold and component distribution have been…

Most current studies estimate the invulnerability of complex networks using a qualitative method that analyzes the inaccurate decay rate of network efficiency. This method results in confusion over the invulnerability of various types of…

What is the dimension of a network? Here, we view it as the smallest dimension of Euclidean space into which nodes can be embedded so that pairwise distances accurately reflect the connectivity structure. We show that a recently proposed…

Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social and biological networks are often characterized by degree-degree dependencies between neighbouring nodes. In this paper we propose a new way…

From the perspective of network analysis, the ubiquitous networks are comprised of regular and irregular components, which makes uncovering the complexity of network structures to be a fundamental challenge. Exploring the regular…

A crucial challenge in network theory is the study of the robustness of a network after facing a sequence of failures. In this work, we propose a dynamical definition of network's robustness based on Information Theory, that considers…

We present a new, novel approach to obtaining a network's connectivity. More specifically, we show that there exists a relationship between a network's graph isoperimetric properties and its conditional connectivity. A network's…