相关论文: Capacitive flows on a 2D random net
We show $L^1$-bounds of the Riemann curvature tensor on a smooth closed $n$-dimensional Ricci flow. To achieve this we introduce the notion of a neck of maximal symmetry, similar to the one in Cheeger-Jiang-Naber and Jiang-Naber and…
A new, fully-localised, energy growth optimal is found over large times and in long pipe domains at a given mass flow rate. This optimal emerges at a threshold disturbance energy below which a nonlinear version of the known…
We study Bernoulli first-passage percolation (FPP) on the triangular lattice $\mathbb{T}$ in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. Denote by $\mathcal {C}_{\infty}$ the infinite cluster with…
We develop bounds on the capacity of wireless networks when the traffic is non-uniform, i.e., not all nodes are required to receive and send similar volumes of traffic. Our results are asymptotic, i.e., they hold with probability going to…
We prove that in any finite set of $\mathbb Z^d$ with $d\ge 3$, there is a subset whose capacity and volume are both of the same order as the capacity of the initial set. As an application we obtain estimates on the probability of {\it…
In this paper, we study the stability two-dimensional (2D) steady Euler flows with sharply concentrated vorticity in a simply-connected bounded domain. These flows are obtained as maximizers of the kinetic energy subject to the constraint…
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 consider flows with normal velocities equal to powers strictly larger than one of the Gauss curvature. Under such flows closed strictly convex surfaces converge to points. In his work on the square of the norm of the second fundamental…
In this paper we consider Bernoulli percolation on an infinite connected bounded degrees graph $G$. Assuming the uniqueness of the infinite open cluster and a quasi-multiplicativity of crossing probabilities, we prove the existence of…
The percolation threshold for flow or conduction through voids surrounding randomly placed spheres is rigorously calculated. With large scale Monte Carlo simulations, we give a rigorous continuum treatment to the geometry of the…
We consider the simple random walk on the infinite cluster of a general class of percolation models on $\mathbb{Z}^d$, $d\geq 3$, including Bernoulli percolation as well as models with strong, algebraically decaying correlations. For almost…
The simplest transport problem, namely maxflow, is investigated on critical percolation clusters in two and three dimensions, using a combination of extremal statistics arguments and exact numerical computations, for power-law distributed…
We define several notions of singular set for Type I Ricci flows and show that they all coincide. In order to do this, we prove that blow-ups around singular points converge to nontrivial gradient shrinking solitons, thus extending work of…
Robust network flows are a concept for dealing with uncertainty and unforeseen failures in the network infrastructure. They and their dual counterpart, network flow interdiction, have received steady attention within the operations research…
The Betz limit expresses the maximum proportion of the kinetic energy flux incident on an energy conversion device that can be extracted from an unbounded flow. The derivation of the Betz limit requires an assumption of steady flow through…
We study the singularities for minimum time control-affine problems in 4D with 2D controls. After regularization, the problem boils down to the study of a bifurcation around some nilpotent equilibrium in the singular locus. We show that the…
We introduce Gradient Flow Aggregation (GFA), a random growth model. Given a set of existing particles $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$, a new particle arrives from a random direction at $\infty$ and flows in direction…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We study in this paper optimal mass transport over a strongly connected, directed graph on a given discrete time interval. Differently from previous literature, we do not assume full knowledge of the initial and final goods distribution…
We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the information-theoretic cut-set…