相关论文: Load Distribution on Small-world Networks

The spectral properties of the adjacency matrix provide a trove of information about the structure and function of complex networks. In particular, the largest eigenvalue and its associated principal eigenvector are crucial in the…

We show that eigenvector centrality exhibits localization phenomena on networks that can be easily partitioned by the removal of a vertex cut set, the most extreme example being networks with a cut vertex. Three distinct types of…

In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it…

In order to maintain consistent quality of service, computer network engineers face the task of monitoring the traffic fluctuations on the individual links making up the network. However, due to resource constraints and limited access, it…

We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly…

Complex networks has been a hot topic of research over the past several years over crossing many disciplines, starting from mathematics and computer science and ending by the social and biological sciences. Random graphs were studied to…

The central points of communication network flow has often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the…

We present a study of transport on complex networks with routing based on local information. Particles hop from one node of the network to another according to a set of routing rules with different degrees of congestion awareness, ranging…

Network architecture design is very important for the optimization of industrial networks. The type of network architecture can be divided into small-scale network and large-scale network according to its scale. Graph theory is an efficient…

A nearest neighbor-based detection scheme against load redistribution attacks is presented. The detector is designed to scale from small to very large systems while guaranteeing consistent detection performance. Extensive testing is…

Inspired by studies on the airports' network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a…

Investigation of eigenvector localization properties of complex networks is not only important for gaining insight into fundamental network problems such as network centrality measure, spectral partitioning, development of approximation…

Based on a selfconsistent theory of localization we study the electron transport properties of a disordered system in the framework of the Anderson model on a Bethe lattice. In the calculation of the dc conductivity we separately discuss…

A simple model of small world quantum networks, in which a central node plays essential role, is introduced for sharing entanglement over long distances. In view of the challenges in setting up advanced quantum labs which allows only few…

When analyzing the statistical and topological characteristics of complex networks, an effective and convenient way is to compute the centralities for recognizing influential and significant nodes or structures, yet most of them are…

The congestion formation on a urban road network is one of the key issue for the development of a sustainable mobility in the future smart cities. In this work we propose a reductionist approach studying the stationary states of a simple…

Information about primary transmitter location is crucial in enabling several key capabilities in cognitive radio networks, including improved spatio-temporal sensing, intelligent location-aware routing, as well as aiding spectrum policy…

Realistic networks display not only a complex topological structure, but also a heterogeneous distribution of weights in the connection strengths. Here we study synchronization in weighted complex networks and show that the…

Large but rare cascades triggered by small initial shocks are present in most of the infrastructure networks. Here we present a simple model for cascading failures based on the dynamical redistribution of the flow on the network. We show…

Many real-world complex systems have small-world topology characterized by the high clustering of nodes and short path lengths.It is well-known that higher clustering drives localization while shorter path length supports delocalization of…