Related papers: Stations, trains and small-world networks
The behaviour of complex networks under failure or attack depends strongly on the specific scenario. Of special interest are scale-free networks, which are usually seen as robust under random failure but appear to be especially vulnerable…
Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be…
Graph datasets are frequently constructed by a projection of a bipartite graph, where two nodes are connected in the projection if they share a common neighbor in the bipartite graph; for example, a coauthorship graph is a projection of an…
This article investigates the performance of grid computing systems whose interconnections are given by random and scale-free complex network models. Regular networks, which are common in parallel computing architectures, are also used as a…
The goal of is to study how increased variability in the degree distribution impacts the global connectivity properties of a large network. We approach this question by modeling the network as a uniform random graph with a given degree…
The proposal is to use clusters, graphs and networks as models in order to analyse the Web structure. Clusters, graphs and networks provide knowledge representation and organization. Clusters were generated by co-site analysis. The sample…
Network data sets are often constructed by some kind of thresholding procedure. The resulting networks frequently possess properties such as heavy-tailed degree distributions, clustering, large connected components and short average…
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…
We consider two variational models for transport networks, an urban planning and a branched transport model, in which the degree of network complexity and ramification is governed by a small parameter $\varepsilon>0$. Smaller $\varepsilon$…
The information of the Austrian airline flights was collected and quantitatively analyzed by the concepts of complex network. It displays some features of small-world networks, namely large clustering coefficient and small average…
Small-world networks by Watts and Strogatz are a class of networks that are highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. These characteristics result in networks with unique…
Link prediction is an open problem in the complex network, which attracts much research interest currently. However, little attention has been paid to the relation between network structure and the performance of prediction methods. In…
Quantifying the topological similarities of different parts of urban road networks (URNs) enables us to understand the urban growth patterns. While conventional statistics provide useful information about characteristics of either a single…
Urban road networks have distinct geometric properties that are partially determined by their (quasi-) two-dimensional structure. In this work, we study these properties for 20 of the largest German cities. We find that the small-scale…
The structure of many real networks is not locally tree-like and hence, network analysis fails to characterise their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, Percolation in…
Studies of the effect of network structure on performance have, thus far, been restricted to examining ensembles of synthetic networks generated by canonical models from the Network Science literature, which do not plausibly represent real…
The behaviour and functioning of a variety of complex physical and biological systems depend on the spatial organisation of their constituent units, and on the presence and formation of clusters of functionally similar or related…
This paper analyses the impact of random failure or attack on the public transit networks of London and Paris in a comparative study. In particular we analyze how the dysfunction or removal of sets of stations or links (rails, roads, etc.)…
We study the behavior of the clustering coefficient in tagged networks. The rich variety of tags associated with the nodes in the studied systems provide additional information about the entities represented by the nodes which can be…
We use complex network concepts to analyze statistical properties of urban public transport networks (PTN). To this end, we present a comprehensive survey of the statistical properties of PTNs based on the data of fourteen cities of so far…