Related papers: The Langberg-M\'{e}dard Multiple Unicast Conjectur…
This paper studies the problem of information theoretic secure communication when a source has private messages to transmit to $m$ destinations, in the presence of a passive adversary who eavesdrops an unknown set of $k$ edges. The…
We prove the three candidate Plurality is Stablest Conjecture of Khot-Kindler-Mossel-O'Donnell from 2005 for correlations $\rho$ satisfying $-1/43<\rho<1/10$: the Plurality function is the most noise stable three candidate election method…
We settle the so-called degree conjecture for the separability of multipartite quantum states, which are normalized graph Laplacians, first given by Braunstein {\it et al.} [Phys. Rev. A \textbf{73}, 012320 (2006)]. The conjecture states…
When a fluid comprised of multiple phases or constituents flows through a network, non-linear phenomena such as multiple stable equilibrium states and spontaneous oscillations can occur. Such behavior has been observed or predicted in a…
The stable operation of the electric power grid relies on a precisely synchronized state of all generators and machines. All machines rotate at exactly the same frequency with fixed phase differences, leading to steady power flows…
In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of…
We present experimental evidence of multiple blood flow configurations in a relatively simple microfluidic network under constant inlet conditions. We provide evidence of multistability and unsteady dynamics and find good agreement with a…
It is known that there exists a multiple-unicast network which has a rate $1$ linear network coding solution if and only if the characteristic of the finite field belongs to a given finite or co-finite set of primes. In this paper, we show…
We study the stationary states of networks consisting of weakly coupled bistable units. We prove the existence of a high multiplicity of stable steady states in networks with very general inter-unit dynamics. We present a method for…
Let $(M,g)$ be a $C^{\infty}$ compact, boudaryless connected manifold without conjugate points with quasi-convex universal covering and divergent geodesic rays. We show that the geodesic flow of $(M,g)$ is $C^{2}$-structurally stable from…
In this paper, we study robust transshipment under consistent flow constraints. We consider demand uncertainty represented by a finite set of scenarios and characterize a subset of arcs as so-called fixed arcs. In each scenario, we require…
This paper continues the study of equilibria for flows over time in the fluid queueing model recently considered by Koch and Skutella [10]. We provide a constructive proof for the existence and uniqueness of equilibria in the case of a…
This paper analyzes stochastic networks consisting of a set of finite capacity sites where different classes of individuals move according to some routing policy. The associated Markov jump processes are analyzed under a thermodynamic limit…
An unsplittable multiflow routes the demand of each commodity along a single path from its source to its sink node. As our main result, we prove that in series-parallel digraphs, any given multiflow can be expressed as a convex combination…
We investigate the two unicast flow problem over layered linear deterministic networks with arbitrary number of nodes. When the minimum cut value between each source-destination pair is constrained to be 1, it is obvious that the triangular…
We give a 3/2-approximation algorithm for stable matchings that runs in $O(m)$ time. The previously best known algorithm by McDermid has the same approximation ratio but runs in $O(n^{3/2}m)$ time, where $n$ denotes the number of people and…
In this paper, we discuss stable pairs, which were first studied by S. Paul, and give a proof for a result I learned from him. As a consequence, we will show that the K-stability implies the CM-stability.
We consider the capacity problem for wireless networks. Networks are modeled as random unit-disk graphs, and the capacity problem is formulated as one of finding the maximum value of a multicommodity flow. In this paper, we develop a proof…
We consider four long-standing Rigidity Conjectures about synchrony and phase patterns for hyperbolic periodic orbits of admissible ODEs for networks. Proofs of stronger local versions of these conjectures, published in 2010-12, are now…
For integers $a\ge 2b>0$, a \emph{circular $a/b$-flow} is a flow that takes values from $\{\pm b, \pm(b+1), \dots, \pm(a-b)\}$. The Planar Circular Flow Conjecture states that every $2k$-edge-connected planar graph admits a circular…