Related papers: Identifying polycentric urban structure using the …

We analyse two large-scale intra-city urban networks and traffic flows therein measured by GPS traces of taxis in San Francisco and Shanghai. Our results coincide with previous findings that, based purely on topological means, it is often…

Over the last two decades, network theory has shown to be a fruitful paradigm in understanding the organization and functioning of real-world complex systems. One technique helpful to this endeavor is identifying functionally influential…

Understanding and characterizing the vulnerability of urban infrastructures, which refers to the engineering facilities essential for the regular running of cities and that exist naturally in the form of networks, is of great value to us.…

In reliable decision-making systems based on machine learning, models have to be robust to distributional shifts or provide the uncertainty of their predictions. In node-level problems of graph learning, distributional shifts can be…

For a weighted outerplanar graph, the set of lex short cycles is known to be a minimum cycle basis [Inf. Process. Lett. 110 (2010) 970-974 ]. In this work, we show that the set of lex short cycles is a minimum cycle basis in weighted…

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…

Cycling is a promising solution to unsustainable urban transport systems. However, prevailing bicycle network development follows a slow and piecewise process, without taking into account the structural complexity of transportation…

Knowledge graphs play a central role for linking different data which leads to multiple layers. Thus, they are widely used in big data integration, especially for connecting data from different domains. Few studies have investigated the…

Cycles, which can be found in many different kinds of networks, make the problems more intractable, especially when dealing with dynamical processes on networks. On the contrary, tree networks in which no cycle exists, are simplifications…

In the framework of coupled cell systems, a coupled cell network describes graphically the dynamical dependencies between individual dynamical systems, the cells. The fundamental network of a network reveals the hidden symmetries of that…

Cities play different roles depending on their location within the transport network. Two cities of similar size might have distinct characteristics if one is located on a corridor between two capitals and the other is near a barrier, such…

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…

We study a minimal model of traffic flows in complex networks, simple enough to get analytical results, but with a very rich phenomenology, presenting continuous, discontinuous as well as hybrid phase transitions between a free-flow phase…

The complexity of urban street networks is well accepted to reside in the information space where roads map to nodes and junctions to links between nodes. Assuming that information networks preserve their amount of surprisal on average…

A city is not a tree but a semi-lattice. To use a perhaps more familiar term, a city is a complex network. The complex network constitutes a unique topological perspective on cities and enables us to better understand the kind of problem a…

Percolation transition is widely observed in networks ranging from biology to engineering. While much attention has been paid to network topologies, studies rarely focus on critical percolation phenomena driven by network dynamics. Using…

Classic measures of graph centrality capture distinct aspects of node importance, from the local (e.g., degree) to the global (e.g., closeness). Here we exploit the connection between diffusion and geometry to introduce a multiscale…

This paper aims to measure the efficiency of urban street networks (a kind of complex networks) from the perspective of the multidimensional chain of connectivity (or flow). More specifically, we define two quantities: flow dimension and…

A geodesic cycle in a graph is a cycle with no shortcuts, so that the shortest path between any two nodes in the cycle is the path along the cycle itself. A recently published paper used random graph models to investigate the geodesic cycle…

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…