相关论文: Braess's Paradox for Flows Over Time

In the game theory literature, there appears to be little research on equilibrium selection for normal-form games with an infinite strategy space and discontinuous utility functions. Moreover, many existing selection methods are not…

The Nagel-Schreckenberg model with overtaking strategy (NSOS) is proposed, and numerical simulations are performed for both closed and open boundary conditions. The fundamental diagram, space-time diagram, and spatial-temporal distribution…

We study the dynamics of the interface given by two incompressible viscous fluids in the Stokes regime filling a 2D horizontally periodic strip. The fluids are subject to the gravity force and the density difference induces the dynamics of…

In real world social networks, there are multiple cascades which are rarely independent. They usually compete or cooperate with each other. Motivated by the reinforcement theory in sociology we leverage the fact that adoption of a user to…

In this paper, we derive a number of interesting properties and extensions of the convex flow problem from the perspective of convex geometry. We show that the sets of allowable flows always can be imbued with a downward closure property,…

The classical Prandtl-Batchelor theorem (Prandtl 1904; Batchelor 1956) states that in the regions of steady 2D flow where viscous forces are small and streamlines are closed, the vorticity is constant. In this paper, we extend this theorem…

The metabolic networks are very well characterized for a large set of organisms, a unique case in within the large-scale biological networks. For this reason they provide a a very interesting framework for the construction of analytically…

The friendship paradox is the observation that the degrees of the neighbors of a node in any network will, on average, be greater than the degree of the node itself. In common parlance, your friends have more friends than you do. In this…

We consider a flow-level model of a network operating under an $\alpha$-fair bandwidth sharing policy (with $\alpha>0$) proposed by Roberts and Massouli\'{e} [Telecomunication Systems 15 (2000) 185-201]. This is a probabilistic model that…

Since the early nineties, it has been observed that the Schroedinger bridge problem can be formulated as a stochastic control problem with atypical boundary constraints. This in turn has a fluid dynamic counterpart where the flow of…

An (r,alpha)-bounded excess flow ((r,alpha)-flow) in an orientation of a graph G=(V,E) is an assignment of a real "flow value" between 1 and r-1 to every edge. Rather than 0 as in an actual flow, some flow excess, which does not exceed…

We consider a transport problem on an infinite metric graph and discuss its well-posedness and long-term behaviour under the condition that the mass flow is buffered in at least one of the vertices. In order to show the well-posedness of…

We study diffusion in a network which is governed by non-autonomous Kirchhoff conditions at the vertices of the graph. Also the diffusion coefficients may depend on time. We prove at first a result on existence and uniqueness using form…

Networks are commonly used to define underlying interaction structures where infections, information, or other quantities may spread. Although the standard approach has been to aggregate all links into a static structure, some studies…

Two important aspects of the Internet, namely the properties of its topology and the characteristics of its data traffic, have attracted growing attention of the physics community. My thesis has considered problems of both aspects. First I…

In this paper, we focus our attention on the large capacities unsplittable flow problem in a game theoretic setting. In this setting, there are selfish agents, which control some of the requests characteristics, and may be dishonest about…

We study the influence of the complex topology of scale-free graphs on the dynamics of anti-coordination games (e.g. snowdrift games). These reference models are characterized by the coexistence (evolutionary stable mixed strategy) of two…

The Long-time behavior of orbits is one of the most fundamental properties in dynamical systems. Poincar\'e studied the Poisson stability, which satisfies a time-reversal symmetric condition, to capture the property of whether points return…

The clock paradox is analyzed for the case when the onward and return trips cover the same <<distance>> (as observed by the traveling twin) but at unequal velocities. In this case the stationary twin observes the distances covered by her…

We extend flow matching to ensembles of linear systems in both deterministic and stochastic settings. Averaging over system parameters induces memory leading to a non-Markovian interpolation problem for the stochastic case. In this setting,…