相关论文: Uniform multicommodity flow in the hypercube with …

We consider general, steady, balanced flows of a commodity over a network where an instance of the network flow is characterized by edge flows and nodal potentials. Edge flows in and out of a node are assumed to be conserved, thus…

In this paper, we prove a combinatorial property of flows on a cycle. $C(V,E)$ is an undirected cycle with two commodities: $\{s_{1},t_{1}\}, \{s_{2},t_{2}\}$;$r_1>0,r_2>0, \mathbf r=(r_i)_{i=1,2}$ and $f,f'$ are both feasible flows for…

We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the sum of demands and the minimum arc capacity is at least this…

We consider the problem of multicommodity flows in outerplanar graphs. Okamura and Seymour showed that the cut-condition is sufficient for routing demands in outerplanar graphs. We consider the unsplittable version of the problem and prove…

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…

The generation of 3D molecules requires simultaneously deciding the categorical features~(atom types) and continuous features~(atom coordinates). Deep generative models, especially Diffusion Models (DMs), have demonstrated effectiveness in…

Turbulent flow restricted to two dimensions can spontaneously develop order on large scales, defying entropy expectations and in sharp contrast with turbulence in three dimensions where nonlinear turbulent processes act to destroy…

We show examples of a striped superfluid in a simple $\lambda\varphi^4$ model at finite velocity and chemical potential with a global $U(1)$ or $U(2)$ symmetry. Whenever the chemical potential is large enough we find flowing homogeneous…

Designing and optimizing different flows in networks is a relevant problem in many contexts. While a number of methods have been proposed in the physics and optimal transport literature for the one-commodity case, we lack similar results…

We experimentally and numerically investigate the clogging behavior of granular materials in a two-dimensional vertical pipe. The nonmonotonicity of clogging probability found in a cylindrical vertical pipe [L\'opez et al., Phys. Rev. E…

We propose a new algorithm to obtain max flow for the multicommodity flow. This algorithm utilizes the max-flow min-cut theorem and the well known labeling algorithm due to Ford and Fulkerson [1]. We proceed as follows: We select one…

A general proof that more energy flows upscale than downscale in two-dimensional (2D) turbulence and barotropic quasi-geostrophic (QG) turbulence is given. A proof is also given that in Surface QG turbulence, the reverse is true. Though…

We present a framework for modeling complex, high-dimensional distributions on convex polytopes by leveraging recent advances in discrete and continuous normalizing flows on Riemannian manifolds. We show that any full-dimensional polytope…

We give the first local algorithm for computing multi-commodity flow and apply it to obtain a $(1+\epsilon)$-approximate algorithm for computing a $k$-commodity flow on an expander with $m$ edges in $(m+\epsilon^{-3}k^3D)n^{o(1)}$ time,…

In this paper, we generalize the minimum flow decomposition problem (MFD) to incorporate uncertain edge capacities and tackle it from the perspective of robust optimization. In the classical flow decomposition problem, a network flow is…

We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…

Multicommodity capacitated network design (MCND) models can be used to optimize the consolidation of shipments within e-commerce fulfillment networks. In practice, fulfillment networks require that shipments with the same origin and…

In this paper, we study mixing rates for $\mathbb{T}^{d}$-extensions of hyperbolic flows. Given three closed orbits with their holonomies, we can relate them to a point in $\mathbb{R}^{d+1}$. We prove that the extension flow enjoys rapid…

We consider multi-commodity network design models, where capacity can be added to the arcs of the network using multiples of facilities that may have different capacities. This class of mixed-integer optimization models appears frequently…

Let $Q^d_p$ be the random subgraph of the $d$-dimensional binary hypercube obtained after edge-percolation with probability $p$. It was shown recently by the authors that, for every $\varepsilon > 0$, there is some $c = c(\varepsilon)>0$…