相关论文: Transport Networks Revisited: Why Dual Graphs?

We construct a data-driven model of flows in graphs that captures the essential elements of the movement of workers between jobs in the companies (firms) of entire economic systems such as countries. The model is based on the observation…

Urban mobility forecast and analysis can be addressed through grid-based and graph-based models. However, graph-based representations have the advantage of more realistically depicting the mobility networks and being more robust since they…

Non-equilibrium steady states (NESS) of Markov processes give rise to non-trivial cyclic probability fluxes. Cycle decompositions of the steady state offer an effective description of such fluxes. Here, we present an iterative cycle…

In this article we give an in depth overview of the recent advances in the field of equilibrium networks. After outlining this topic, we provide a novel way of defining equilibrium graph (network) ensembles. We illustrate this concept on…

We consider transport in a fluid flow of arbitrary complexity but with a dominant flow direction. This is the situation encountered, for example, when analyzing the dynamics of sufficiently small particles immersed in a turbulent fluid and…

Numerous problems of both theoretical and practical interest are related to finding shortest (or otherwise optimal) paths in networks, frequently in the presence of some obstacles or constraints. A somewhat related class of problems focuses…

The knowledge of real-life traffic pattern is crucial for good understanding and analysis of transportation systems. This data is quite rare. In this paper we propose an algorithm for extracting both the real physical topology and the…

Mapping network flows provides insight into the organization of networks, but even though many real-networks are bipartite, no method for mapping flows takes advantage of the bipartite structure. What do we miss by discarding this…

Every route of a transport network approaching equilibrium can be represented by a vector of Euclidean space which length quantifies its segregation from the rest of the graph. We have empirically observed that the distribution of lengths…

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…

Optimal transport maps define a one-to-one correspondence between probability distributions, and as such have grown popular for machine learning applications. However, these maps are generally defined on empirical observations and cannot be…

Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…

In graph analysis, a classic task consists in computing similarity measures between (groups of) nodes. In latent space random graphs, nodes are associated to unknown latent variables. One may then seek to compute distances directly in the…

We investigate urban street networks as a whole within the frameworks of information physics and statistical physics. Urban street networks are envisaged as evolving social systems subject to a logarithmical entropic equilibrium.

Congestion and extreme events in transportation networks are emergent phenomena with significant socio-economic implications. In this work, we study congestion and extreme event properties on real urban street (planar) networks drawn from…

Air pollution can be studied in the urban structure regulated by transport networks. Transport networks can be studied as geometric and topological graph characteristics through designed models. Current studies do not offer a comprehensive…

We study the growth of London's street-network in its dual representation, as the city has evolved over the last 224 years. The dual representation of a planar graph is a content-based network, where each node is a set of edges of the…

This paper analyzes stochastic networks consisting of a set of finite capacity sites where different classes of individuals move according to some routing policy. The associated Markov jump processes are analyzed under a thermodynamic limit…

Random networks are increasingly used to analyse complex transportation networks, such as airline routes, roads and rail networks. So far, this research has been focused on describing the properties of the networks with the help of random…

Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…