Related papers: On the Metropolis Algorithm for Urban Street Netwo…
A simple but efficient spectral approach for analyzing the community structure of complex networks is introduced. It works the same way for all types of networks, by spectrally splitting the adjacency matrix into a "unipartite" and a…
In this paper we present an algorithm to build a road network map enriched with traffic rules such as one-way streets and forbidden turns, based on the interpretation of already detected and classified traffic signs. Such algorithm helps to…
Smartphones and other mobile devices are today pervasive across the globe. As an interesting side effect of the surge in mobile communications, mobile network operators can now easily collect a wealth of high-resolution data on the habits…
Vehicle trajectories are a promising GNSS (Global Navigation Satellite System) data source to compute multi-scale traffic flow maps ranging from the city/regional level to the road level. The main obstacle is that trajectory data are prone…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
This article presents a theoretical investigation of generalized encoded forms of networks in a uniform multidimensional space. First, we study encoded networks with (finite) arbitrary node dimensions (or aspects), such as time instants or…
Urban streets are hierarchically organized in the sense that a majority of streets are trivial, while a minority of streets is vital. This hierarchy can be simply, but elegantly, characterized by the 80/20 principle, i.e. 80 percent of…
Accurate traffic conditions prediction provides a solid foundation for vehicle-environment coordination and traffic control tasks. Because of the complexity of road network data in spatial distribution and the diversity of deep learning…
To comprehend the hierarchical organization of large integrated systems, we introduce the hierarchical map equation, which reveals multilevel structures in networks. In this information-theoretic approach, we exploit the duality between…
We study centrality in urban street patterns of different world cities represented as networks in geographical space. The results indicate that a spatial analysis based on a set of four centrality indices allows an extended visualization…
Mitigating traffic congestion on urban roads, with paramount importance in urban development and reduction of energy consumption and air pollution, depends on our ability to foresee road usage and traffic conditions pertaining to the…
The topological information of a network can be retrieved equivalently from its complement consisting of the same nodes but complementary edges. Hence the partition of a network into certain substructures based on given criteria should be…
The interest in developing smart cities has increased dramatically in recent years. In this context an intelligent transportation system depicts a major topic. The forecast of traffic flow is indispensable for an efficient intelligent…
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…
To better understand the overlapping modular organization of large networks with respect to flow, here we introduce the map equation for overlapping modules. In this information-theoretic framework, we use the correspondence between…
Recent evidence indicates that the abundance of recurring elementary interaction patterns in complex networks, often called subgraphs or motifs, carry significant information about their function and overall organization. Yet, the…
We propose a new method for quantitative characterization of spatial network-like patterns with loops, such as surface fracture patterns, leaf vein networks and patterns of urban streets. Such patterns are not well characterized by purely…
We study the use of local heuristics to determine spanning subgraphs for use in the dissemination of information in complex networks. We introduce two different heuristics and analyze their behavior in giving rise to spanning subgraphs that…
Due to the complexity of the traffic flow dynamics in urban road networks, most quantitative descriptions of city traffic so far are based on computer simulations. This contribution pursues a macroscopic (fluid-dynamic) simulation approach,…
Growing evidence suggests that the macroscopic functional states of urban road networks exhibit multistability and hysteresis, but microscopic mechanisms underlying these phenomena remain elusive. Here, we demonstrate that in real-world…