English
Related papers

Related papers: Capacitive flows on a 2D random net

200 papers

Some examples of translation invariant site percolation processes on the $\Z^2$ lattice are constructed, the most far-reaching example being one that satisfies uniform finite energy (meaning that the probability that a site is open given…

Probability · Mathematics 2010-11-15 Olle Hägström , Péter Mester

The support of a flow $x$ in a network is the subdigraph induced by the arcs $uv$ for which $x(uv)>0$. We discuss a number of results on flows in networks where we put certain restrictions on structure of the support of the flow. Many of…

Discrete Mathematics · Computer Science 2024-05-16 Stéphane Bessy , Jørgen Bang-Jensen , Lucas Picasarri-Arrieta

We consider the standard first passage percolation model in $\mathbb{Z}^d$ for $d\geq 2$. We are interested in two quantities, the maximal flow $\tau$ between the lower half and the upper half of the box, and the maximal flow $\phi$ between…

Probability · Mathematics 2009-07-03 Raphaël Rossignol , Marie Théret

We consider the standard first passage percolation model in $\ZZ^d$ for $d\geq 2$ and we study the maximal flow from the upper half part to the lower half part (respectively from the top to the bottom) of a cylinder whose basis is a…

Probability · Mathematics 2009-07-06 Marie Theret

We consider the standard first passage percolation model in the rescaled graph $\mathbb{Z}^d/n$ for $d\geq 2$, and a domain $\Omega$ of boundary $\Gamma$ in $\mathbb{R}^d$. Let $\Gamma^1$ and $\Gamma^2$ be two disjoint open subsets of…

Probability · Mathematics 2009-08-03 Raphaël Cerf , Marie Théret

We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a…

Discrete Mathematics · Computer Science 2018-05-07 Corinna Gottschalk , Arie M. C. A. Koster , Frauke Liers , Britta Peis , Daniel Schmand , Andreas Wierz

Equip the edges of the lattice $\mathbb{Z}^2$ with i.i.d. random capacities. A law of large numbers is known for the maximal flow crossing a rectangle in $\mathbb{R}^2$ when the side lengths of the rectangle go to infinity. We prove that…

Probability · Mathematics 2009-12-21 Raphaël Rossignol , Marie Théret

We consider wall-to-wall transport of a passive tracer by divergence-free velocity vector fields $\mathbf{u}$. Given an enstrophy budget $\langle |\nabla \mathbf{u}|^{2} \rangle \le Pe^{2}$ we construct steady two-dimensional flows that…

Fluid Dynamics · Physics 2017-07-03 Ian Tobasco , Charles R. Doering

We generalize the maximal time existence of K\"{a}hler-Ricci flow in Tian-Zhang and Song-Tian to conical case. Furthermore, if the twisted canonical bundle $K_{M}+(1-\beta)[D]$ is big or big and nef, we can expect more on the limit…

Differential Geometry · Mathematics 2014-11-27 Liangming Shen

In this paper we apply techniques from optimal transport to study the neckpinch examples of Angenent-Knopf which arise through the Ricci flow on $\mathbb{S}^{n+1}$. In particular, we recover their proof of 'single-point pinching' along the…

Metric Geometry · Mathematics 2014-04-29 Sajjad Lakzian , Michael Munn

We extend some convergence results on nonsingular compact Ricci flows in the papers \cite{Ha:1}, \cite{Se:1} and \cite{FZZ:2} to certain infinite volume noncompact cases which are "partially" nonsingular. As an application, for a finite…

Differential Geometry · Mathematics 2020-09-16 Qi S Zhang

We estimate from above the rate at which a solution to the normalized Ricci flow on a closed manifold may converge to a limit soliton. Our main result implies that any solution which converges modulo diffeomorphisms to a soliton faster than…

Differential Geometry · Mathematics 2020-09-09 Brett Kotschwar

Millions of flows are routed concurrently through a modern data-center. These networks are often built as Clos topologies, and flow demands are constrained only by the link capacities at the ingress and egress points. The minimum congestion…

Networking and Internet Architecture · Computer Science 2025-05-08 Miguel Ferreira , Nirav Atre , Justine Sherry , Michael Dinitz , João Luís Sobrinho

We consider the volume-normalized Ricci flow close to compact shrinking Ricci solitons. We show that if a compact Ricci soliton $(M,g)$ is a local maximum of Perelman's shrinker entropy, any normalized Ricci flow starting close to it exists…

Differential Geometry · Mathematics 2015-06-29 Klaus Kroencke

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…

Probability · Mathematics 2014-03-28 Raphaël Cerf , Marie Théret

The capacity (or maximum flow) of an unicast network is known to be equal to the minimum s-t cut capacity due to the max-flow min-cut theorem. If the topology of a network (or link capacities) is dynamically changing or unknown, it is not…

Information Theory · Computer Science 2015-06-12 Yuki Fujii , Tadashi Wadayama

We prove that for Bernoulli percolation on a graph $\mathbb{Z}^2\times\{0,\dots,k\}$ ($k\ge 0$), there is no infinite cluster at criticality, almost surely. The proof extends to finite range Bernoulli percolation models on $\mathbb{Z}^2$…

Probability · Mathematics 2014-01-29 Hugo Duminil-Copin , Vladas Sidoravicius , Vincent Tassion

In order to utilize the full potential of tailored flows of electromagnetic energy at the nanoscale, we need to understand its general behaviour given by its generic representation of interfering random waves. For applications in on-chip…

Optics · Physics 2020-04-28 M. A. van Gogh , T. Bauer , L. De Angelis , L. Kuipers

We study wave-current interactions in two-dimensional water flows of constant vorticity over a flat bed. For large-amplitude periodic traveling waves that propagate at the water surface in the same direction as the underlying current…

Analysis of PDEs · Mathematics 2018-11-27 Adrian Constantin , Walter Strauss , Eugen Varvaruca

For memoryless channels with continuous input alphabets, deterministic identification (DI) typically exhibits a linearithmic ($n\log n$) message growth. However, the exact DI capacity has long remained open due to a persistent gap between…

Information Theory · Computer Science 2026-05-07 Pau Colomer , Christian Deppe , Holger Boche , Andreas Winter