Related papers: Capacitive flows on a 2D random net
Strong resilience properties of dynamical flow networks are analyzed for distributed routing policies. The latter are characterized by the property that the way the inflow at a non-destination node gets split among its outgoing links is…
We consider the standard first passage percolation model in the rescaled graph $\mathbb {Z}^d/n$ for $d\geq2$ and a domain $\Omega$ of boundary $\Gamma$ in $\mathbb {R}^d$. Let $\Gamma ^1$ and $\Gamma ^2$ be two disjoint open subsets of…
Uncertainty often plays an important role in dynamic flow problems. In this paper, we consider both, a stationary and a dynamic flow model with uncertain boundary data on networks. We introduce two different ways how to compute the…
For optimal power flow problems with chance constraints, a particularly effective method is based on a fixed point iteration applied to a sequence of deterministic power flow problems. However, a priori, the convergence of such an approach…
Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…
We provide a new algebraic technique to solve the sequential flow problem in polynomial space. The task is to maximise the flow through a graph where edge capacities can be changed over time by choosing a sequence of capacity labelings from…
The present work studies a kind of Maximum Concurrent Flow Problem, called as Extended Maximum Concurrent Flow Problem with Saturated Capacity. Our major contributions are as follows: (A) Propose the definition of Extensive Maximum…
This article focuses on a biobjective extension of the maximum flow network interdiction problem, where each arc in the network is associated with two capacity values. Two maximum flows from a source to a sink are to be computed…
We consider the standard first passage percolation model in the rescaled lattice $\mathbb{Z}^d$ for $d\geq 2$ and a bounded domain $\Omega$ in $\mathbb R ^d$. We denote by $\Gamma^1$ and $\Gamma^2$ two disjoint subsets of $\partial \Omega$…
Generalizing a result of Furstenberg, we show that for every infinite discrete group $G$, the Bernoulli flow $2^G$ is disjoint from every minimal $G$-flow. From this, we deduce that the algebra generated by the minimal functions…
Hermon and Hutchcroft have recently proved the long-standing conjecture that in Bernoulli(p) bond percolation on any nonamenable transitive graph G, at any p > p_c(G), the probability that the cluster of the origin is finite but has a large…
Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic model for wireless random networks. We prove that the capacity of…
In this paper, we investigate some properties on capacity factors, which were proposed to investigate the link failure problem from network coding. A capacity factor (CF) of a network is an edge set, deleting which will cause the maximum…
Let $f$ be a transcendental entire function. It was shown in a previous paper that the holomorphic flow $\dot z = f(z)$ always has infinitely many trajectories tending to infinity in finite time. It will be proved here that such…
The justification of hydrodynamic limits in non-convex domains has long been an open problem due to the singularity at the grazing set. In this paper, we investigate the unsteady neutron transport equation in a general bounded domain with…
Poincar\'e recurrence theorem implies the density of recurrent points for volume-preserving dynamical systems on compact domains. The density of closed orbits in the non-wandering set is one of the essential properties of Axiom A and chaos.…
We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…
We prove that for a non-amenable, locally finite, connected, transitive, planar graph with one end, any automorphism invariant site percolation on the graph does not have exactly 1 infinite 1-cluster and exactly 1 infinite 0-cluster a.s. If…
We consider a dissipative flow network that obeys the standard linear nodal flow conservation, and where flows on edges are driven by potential difference between adjacent nodes. We show that in the case when the flow is a monotonically…
We show that a certain entropy-like function is convex, under an optimal transport problem that is adapted to Ricci flow. We use this to reprove the monotonicity of Perelman's reduced volume.