Related papers: Scale-free Segregation in Transport Networks
Traffic congestion continues to escalate with urbanization and socioeconomic development, necessitating advanced modeling to understand and mitigate its impacts. In large-scale networks, traffic congestion can be studied using cascade…
Mathematical network models are extremely useful to capture complex propagation processes between different regions (nodes), for example the spread of an infectious agent between different countries, or the transport and replication of…
The study of complex networks sheds light on the relation between the structure and function of complex systems. One remarkable result is the absence of an epidemic threshold in infinite-size scale-free networks, which implies that any…
Distributions of the resilience of transport networks are studied numerically, in particular the large-deviation tails. Thus, not only typical quantities like average or variance but the distributions over the (almost) full support can be…
Critical phenomena on scale-free networks with a degree distribution $p_k \sim k^{-\lambda}$ exhibit rich finite-size effects due to its structural heterogeneity. We systematically study the finite-size scaling of percolation and identify…
We study a recent model of random networks based on the presence of an intrinsic character of the vertices called fitness. The vertices fitnesses are drawn from a given probability distribution density. The edges between pair of vertices…
Recent theoretical progress using multiscale asymptotic analysis has revealed various possible regimes of stratified turbulence. Notably, buoyancy transport can either be dominated by advection or diffusion, depending on the effective…
Traffic fluctuation has so far been studied on unweighted networks. However many real traffic systems are better represented as weighted networks, where nodes and links are assigned a weight value representing their physical properties such…
Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply.…
Universal scaling of distances between vertices of Erdos-Renyi random graphs, scale-free Barabasi-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks are observed. A…
We show how scale-free degree distributions can emerge naturally from growing networks by using random walks for selecting vertices for attachment. This result holds for several variants of the walk algorithm and for a wide range of…
Designing and optimizing the structure of urban transportation networks is a challenging task. In this study, we propose a method inspired by optimal transport theory and the principle of economy of scale that uses little information in…
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we…
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…
We model information traffic on scale-free networks by introducing the node queue length L proportional to the node degree and its delivering ability C proportional to L. The simulation gives the overall capacity of the traffic system,…
A general random graph evolution mechanism is defined. The evolution is a combination of the preferential attachment model and the interaction of N vertices (N>=3). A vertex in the graph is characterized by its degree and its weight. The…
We study scale free simple graphs with an exponent of the degree distribution $\gamma$ less than two. Generically one expects such extremely skewed networks -- which occur very frequently in systems of virtually or logically connected units…
The graph-navigability problem concerns how one can find as short paths as possible between a pair of vertices, given an incomplete picture of a graph. We study the navigability of graphs where the vertices are tagged by a number (between 1…
The advent of data science has provided an increasing number of challenges with high data complexity. This paper addresses the challenge of space-time data where the spatial domain is not a planar surface, a sphere, or a linear network, but…
Soliton transport in tube-like networks is studied by solving the nonlinear Schroedinger equation (NLSE) on finite thickness ("fat") graphs. The dependence of the solution and of the reflection at vertices on the graph thickness and on the…