相关论文: Quantifying Dismantlement in Disconnected Networks
We introduce a comprehensive and statistical framework in a model free setting for a complete treatment of localized data corruptions due to severe noise sources, e.g., an occluder in the case of a visual recording. Within this framework,…
Recently, self-similarity of complex networks have attracted much attention. Fractal dimension of complex network is an open issue. Hub repulsion plays an important role in fractal topologies. This paper models the repulsion among the nodes…
Network dismantling aims at breaking a network into disconnected components, and attacking vertices that intersect with many loops has proven to be a most efficient strategy. But the existing loop-focusing methods treat the short loops…
Modularity is widely used to effectively measure the strength of the community structure found by community detection algorithms. However, modularity maximization suffers from two opposite yet coexisting problems: in some cases, it tends to…
Percolation on complex networks is used both as a model for dynamics on networks, such as network robustness or epidemic spreading, and as a benchmark for our models of networks, where our ability to predict percolation measures our ability…
We study the quasi-uniformity properties of digital nets, a class of quasi-Monte Carlo point sets. Quasi-uniformity is a space-filling property used for instance in experimental designs and radial basis function approximation. However, it…
A variety of metrics have been proposed to measure the relative importance of nodes in a network. One of these, alpha-centrality [Bonacich, 2001], measures the number of attenuated paths that exist between nodes. We introduce a normalized…
Relations between discrete quantities such as people, genes, or streets can be described by networks, which consist of nodes that are connected by edges. Network analysis aims to identify important nodes in a network and to uncover…
The main concern of this paper is how to define proper measures of multipartite entanglement for mixed quantum states. Since the structure of partial separability and multipartite entanglement is getting complicated if the number of…
Recently much attention has been paid to the study of the robustness of interdependent and multiplex networks and, in particular, networks of networks. The robustness of interdependent networks can be evaluated by the size of a mutually…
A diffusion process on complex networks is introduced in order to uncover their large scale topological structures. This is achieved by focusing on the slowest decaying diffusive modes of the network. The proposed procedure is applied to…
We propose the use of the Distributional Zeta-Function (DZF) for constructing a new set of Systemic Performance Measures (SPM). SPM have been proposed to investigate network synthesis problems such as the growing of linear consensus…
Size uniformity is one of the main criteria of superpixel methods. But size uniformity rarely conforms to the varying content of an image. The chosen size of the superpixels therefore represents a compromise - how to obtain the fewest…
The detection of entanglement in a bipartite state is a crucial issue in quantum information science. Based on realignment of density matrices and the vectorization of the reduced density matrices, we introduce a new set of separability…
The problem of worst case edge deletion from a network is considered. Suppose that you have a communication network and you can delete a single edge. Which edge deletion causes the largest disruption? More formally, given a graph, which…
Disentanglement via mechanism sparsity was introduced recently as a principled approach to extract latent factors without supervision when the causal graph relating them in time is sparse, and/or when actions are observed and affect them…
Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable…
The need to produce accurate estimates of vertex degree in a large network, based on observation of a subnetwork, arises in a number of practical settings. We study a formalized version of this problem, wherein the goal is, given a randomly…
Identifying and quantifying structural dissimilarities between complex networks is a fundamental and challenging problem in network science. Previous network comparison methods are based on the structural features, such as the length of…
This work describes how the formalization of complex network concepts in terms of discrete mathematics, especially mathematical morphology, allows a series of generalizations and important results ranging from new measurements of the…