Related papers: Scale-free Segregation in Transport Networks
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 identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the models of scale-free percolation, the Boolean model with…
We consider point clouds obtained as random samples of a measure on a Euclidean domain. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. Our goal is to…
We study the tolerance to congestion failures in communication networks with scale-free topology. The traffic load carried by each damaged element in the network must be partly or totally redistributed among the remaining elements.…
Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-free networks with unbounded degree fluctuations, we obtain the asymptotics of the number of times a small connected graph occurs as a…
Scale invariance profoundly influences the dynamics and structure of complex systems, spanning from critical phenomena to network architecture. Here, we propose a precise definition of scale-invariant networks by leveraging the concept of a…
In multi-class communication networks, traffic surges due to one class of users can significantly degrade the performance for other classes. During these transient periods, it is thus of crucial importance to implement priority mechanisms…
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…
We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters)…
We discuss how various models of scale-free complex networks approach their limiting properties when the size N of the network grows. We focus mainly on equilibrated networks and their finite-size degree distributions. Our results show that…
A new model about cascading occurrences caused by perturbation is established to search after the mechanism because of which catastrophes in networks occur. We investigate the avalanche dynamics of our model on 2-dimension Euclidean…
The origin of scale-free degree distributions in the context of networks is addressed through an analogous non-network model in which the node degree corresponds to the number of balls in a box and the rewiring of links to balls moving…
A spatial scale-free network is introduced and studied whose motivation has been originated in the growing Internet as well as the Airport networks. We argue that in these real-world networks a new node necessarily selects one of its…
The transport capacity of a dense ad hoc network with n nodes scales like \sqrt(n). We show that the transport capacity divided by \sqrt(n) approaches a non-random limit with probability one when the nodes are i.i.d. distributed on the unit…
This letter propose a new model for characterizing traffic dynamics in scale-free networks. With a replotted road map of cities with roads mapped to vertices and intersections to edges, and introducing the road capacity L and its handling…
We proposed an evolving network model constituted by the same nodes but different edges. The competition between nodes and different links were introduced. Scale free properties have been found in this model by continuum theory. Different…
The concept of scale-free networks has been widely applied across natural and physical sciences. Many claims are made about the properties of these networks, even though the concept of scale-free is often vaguely defined. We present tools…
We have investigated space syntax of Venice by means of random walks. Random walks being defined on an undirected graph establish the Euclidean space in which distances and angles between nodes acquire the clear statistical interpretation.…
A spatial network is constructed on a two dimensional space where the nodes are geometrical points located at randomly distributed positions which are labeled sequentially in increasing order of one of their co-ordinates. Starting with $N$…
Random walks are one of the best investigated dynamical processes on graphs. A particularly fascinating phenomenon is the scaling relationship of fluctuations $\sigma $ with the average flux $\langle f \rangle $. Here we analyze how network…