相关论文: Capacitive flows on a 2D random net

This paper presents a comprehensive study of the combinatorial $p$-th Calabi flow for both finite and infinite ideal circle patterns. In the finite case, we establish a sharp criterion: the combinatorial $p$-th Calabi flow with $p>1$…

We consider the number of paths that must pass through a subset $X$ of vertices of a network $N$ in a maximum sequence of arc-disjoint paths connecting two vertices $y$ and $z$. We show that when $X$ is a singleton, that number equals the…

The paper presents a phenomenon occurring in population processes that start near zero and have large carrying capacity. By the classical result of Kurtz~(1970), such processes, normalized by the carrying capacity, converge on finite…

In a network where the cost of flow across an edge is nonlinear in the volume of flow, and where sources and destinations are uniform, one can consider the relationship between total volume $v$ of flow through the network and the minimum…

Let $\Phi$ be a correspondence from a normed vector space $X$ into itself, let $u: X\to \mathbf{R}$ be a function, and $\mathcal{I}$ be an ideal on $\mathbf{N}$. Also, assume that the restriction of $u$ on the fixed points of $\Phi$ has a…

We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are "orthogonal" to each other, in the sense that the flow saturates the cut and is zero…

We contribute to an original problem studied by Hamilton and others, in order to understand the behaviour of maximal solutions of the Ricci flow both in compact and non-compact complete orientable Riemannian manifolds of finite volume. The…

We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…

We address the problem of optimal transport with a quadratic cost functional and a constraint on the flux through a constriction along the path. The constriction, conceptually represented by a toll station, limits the flow rate across. We…

We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…

In potential flow networks, the equilibrium flow rates are usually not proportional to the demands and flow control elements are required to regulate the flow. The control elements can broadly be classified into two types - discrete and…

In this paper, we investigate the behavior of the normalized Ricci flow on asymptotically hyperbolic manifolds. We show that the normalized Ricci flow exists globally and converges to an Einstein metric when starting from a non-degenerate…

The steady, coaxial flow in which two immiscible, incompressible fluids move past each other in a cylindrical tube has a continuum of possibilities due to the arbitrariness of the interface between the fluids. By invoking the presence of…

In this article we study optimization problems ruled by $\alpha$-fractional diffusion operators with volume constraints. By means of penalization techniques we prove existence of solutions. We also show that every solution is locally of…

It is known that for a non-relativistic quantum particle traveling freely on the $x$-axis, the positional probability can flow in the opposite direction to the particle's velocity. The maximum possible amount of such backflow that can occur…

We prove the existence of a weak solution to the compressible Navier--Stokes system with singular pressure that explodes when density achieves its congestion level. This is a quantity whose initial value evolves according to the transport…

This paper is devoted to describe the finite-dimensionality of a two-dimensional micropolar fluid flow with periodic boundary conditions. We define the notions of determining modes and nodes and estimate the number of them, we also estimate…

We show a deterministic constant-time local algorithm for constructing an approximately maximum flow and minimum fractional cut in multisource-multitarget networks with bounded degrees and bounded edge capacities. Locality means that the…

We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that the probability that this pattern occurs at most an times on a cluster of size n is…

This paper is concerned with the convergence rates of subsonic flows for airfoil problem and infinite long largely-open nozzle problem, which is an improvement of [7,11,15,20]. The maximum principle is applied to estimate the potential…