相关论文: Asymptotic Traffic Flow in a Hyperbolic Network: N…
In this work we study the asymptotic traffic flow in Gromov's hyperbolic graphs. We prove that under certain mild hypotheses the traffic flow in a hyperbolic graph tends to pass through a finite set of highly congested nodes. These nodes…
In this paper we prove that random $d$--regular graphs with $d\geq 3$ have traffic congestion of the order $O(n\log_{d-1}^{3}(n))$ where $n$ is the number of nodes and geodesic routing is used. We also show that these graphs are not…
This paper proposes a mathematical justification of the phenomenon of extreme congestion at a very limited number of nodes in very large networks. It is argued that this phenomenon occurs as a combination of the negative curvature property…
We investigate the impact the negative curvature has on the traffic congestion in large-scale networks. We prove that every Gromov hyperbolic network $G$ admits a core, thus answering in the positive a conjecture by Jonckheere, Lou,…
In this paper we define the notion of $(p,\delta)$--Gromov hyperbolic space where we relax Gromov's {\it slimness} condition to allow that not all but a positive fraction of all triangles are $\delta$--slim. Furthermore, we study maximum…
Turn the set of permutations of $n$ objects into a graph $G_n$ by connecting two permutations that differ by one transposition, and let $\sigma_t$ be the simple random walk on this graph. In a previous paper, Berestycki and Durrett [In…
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong…
We study the microscopic time fluctuations of traffic-load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. For a wide range of driving rates $R$ the traffic is stationary and the load…
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…
It is understood that congestion in traffic can be interpreted in terms of the instability of the equation of dynamic motion. The evolution of a traffic system from an unstable or metastable state to a globally stable state bears a strong…
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…
The central points of communication network flow has often been identified using graph theoretical centrality measures. In real networks, the state of traffic density arises from an interplay between the dynamics of the flow and the…
We study traffic flow on roads with a localized periodic inhomogeneity such as traffic signals, using a stochastic car-following model. We find that in cases of congestion, traffic flow can be optimized by controlling the inhomogeneity's…
In this paper we study a model for traffic flow on networks based on a hyperbolic system of conservation laws with discontinuous flux. Each equation describes the density evolution of vehicles having a common path along the network. In this…
We consider time-dependent convection-diffusion problems with high P\'eclet number of order $\mathcal{O}(\varepsilon^{-1})$ in thin three-dimensional graph-like networks consisting of cylinders that are interconnected by small domains…
The paper provides results for a non-standard, hyperbolic, 1-D, nonlinear traffic flow model on a bounded domain. The model consists of two first-order PDEs with a dynamic boundary condition that involves the time derivative of the…
We present a phase diagram of the different kinds of congested traffic that are triggered by disturbances when passing ramps or other spatial inhomogeneities of a freeway. The simulation results obtained by the nonlocal, gas-kinetic-based…
We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic…
Starting from a non-local version of the Prigogine-Herman traffic model, we derive a natural hierarchy of kinetic discrete velocity models for traffic flow consisting of systems of quasi-linear hyperbolic equations with relaxation terms.…
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…