相关论文: The shortest path to complex networks

We perform a massive evaluation of neural networks with architectures corresponding to random graphs of various types. We investigate various structural and numerical properties of the graphs in relation to neural network test accuracy. We…

Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected…

Recently, motivated by the pioneer works that reveal the small-world effect and scale-free property of various real-life networks, many scientists devote themselves into studying complex networks. One of the ultimate goals is to understand…

Modular structure is pervasive in many complex networks of interactions observed in natural, social and technological sciences. Its study sheds light on the relation between the structure and function of complex systems. Generally speaking,…

Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of…

It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and they are also scale-free (the degrees are distributed according to a power…

Systematic relations between multiple objects that occur in various fields can be represented as networks. Real-world networks typically exhibit complex topologies whose structural properties are key factors in characterizing and further…

Networks are important representations in computer science to communicate structural aspects of a given system of interacting components. The evolution of a network has several topological properties that can provide us information on the…

The connectivity of a network contains information about the relationships between nodes, which can denote interactions, associations, or dependencies. We show that this information can be analyzed by measuring the uncertainty (and…

A complete understanding of real networks requires us to understand the consequences of the uneven interaction strengths between a system's components. Here we use the minimum spanning tree (MST) to explore the effect of weight assignment…

A wealth of evidence shows that real world networks are endowed with the small-world property i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most…

We study the effects of nonreciprocity and network structure on percolation. To this end, we investigate nonreciprocal random networks - directed networks for which the probability of a link occurring from node i to node j differs from the…

The review is a survey of the present status of research in social networks highlighting the topics of small world property, degree distributions, community structure, assortativity, modelling, dynamics and searching in social networks.

Many real-world networks are large, complex and thus hard to understand, analyze or visualize. The data about networks is not always complete, their structure may be hidden or they change quickly over time. Therefore, understanding how…

Complex networks are characterized by several topological properties: degree distribution, clustering coefficient, average shortest path length, etc. Using a simple model to generate scale-free networks embedded on geographical space, we…

We give exact relations for certain types of the hierarchic fractal structures. In the blatant distinction from regular networks of the "small world" (SW) topology [1], regular fractal networks manifests the logarithmic dependence of the…

We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…

A key problem in the study and design of complex systems is the apparent disconnection between the microscopic and the macroscopic. It is not straightforward to identify the local interactions that give rise to an observed global…

Most real-world networks are embedded in latent geometries. If a node in a network is found in the vicinity of another node in the latent geometry, the two nodes have a disproportionately high probability of being connected by a link. The…

The shortest path problem is among the most fundamental combinatorial optimization problems to answer reachability queries. It is hard to deter-mine which vertices or edges are visited during shortest path traversals. In this paper, we…