Related papers: The Langberg-M\'{e}dard Multiple Unicast Conjectur…
We study the Reaching Stable Marriage via Divorces (DivorceSM) problem of deciding, given a Stable Marriage instance and an initial matching $M$ , whether there exists a stable matching which is reachable from $M$ by divorce operations as…
Consider $N$ stations interconnected with links, each of capacity $K$, forming a complete graph. Calls arrive to each link at rate $\lambda$ and depart at rate $1$. If a call arrives to a link $x y$, connecting stations $x$ and $y$, which…
We study the following conjecture of Matt DeVos: If there is a graph homomorphism from Cayley graph Cay(M, B) to another Cayley graph Cay(M', B') then every graph with an (M, B)-flow has an (M', B')-flow. This conjecture was originally…
In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…
Multivariate fluctuation relations are established in three stochastic models of transistors, which are electronic devices with three ports and thus two coupled currents. In the first model, the transistor has no internal state variable and…
Swarm stability is concerned for descriptor compartmental networks with linear time-invariant protocol. Compartmental network is a specific type of dynamical multi-agent system. Necessary and sufficient conditions for both consensus and…
Well known in the theory of network flows, Braess paradox states that in a congested network, it may happen that adding a new path between destinations can increase the level of congestion. In transportation networks the phenomenon results…
A natural unit interval order is a naturally labelled partially ordered set that avoids patterns ${\bf 3} + {\bf 1}$ and $\bf 2 + 2$. To each natural unit interval order one can associate a symmetric function. The Stanley-Stembridge…
Generalizing well-known results of Erd\H{o}s and Lov\'asz, we show that every graph $G$ contains a spanning $k$-partite subgraph $H$ with $\lambda{}(H)\geq \lceil{}\frac{k-1}{k}\lambda{}(G)\rceil$, where $\lambda{}(G)$ is the…
Stability is an important issue in order to characterize the performance of a network, and it has become a major topic of study in the last decade. Roughly speaking, a communication network system is said to be stable if the number of…
The stability of the linear chain structure of three $\alpha$ clusters for $^{12}$C against the bending and fission is investigated in the cranking covariant density functional theory, in which the equation of motion is solved on a 3D…
We consider nonlinear scalar conservation laws posed on a network. We establish $L^1$ stability, and thus uniqueness, for weak solutions satisfying the entropy condition. We apply standard finite volume methods and show stability and…
We believe three ingredients are needed for further progress in persistence and its use: invariants not relying on decomposition theorems to go beyond 1-dimension, outcomes suitable for statistical analysis and a setup adopted for…
A classical result in undirected wireline networks is the near optimality of routing (flow) for multiple-unicast traffic (multiple sources communicating independent messages to multiple destinations): the min cut upper bound is within a…
In this paper we address the exponential stability of a system of transport equations with intermittent damping on a network of $N \geq 2$ circles intersecting at a single point $O$. The $N$ equations are coupled through a linear mixing of…
This paper examines the stability of the \`a trous algorithm under arbitrary iteration in the context of a more general study of shift-invariant filter banks. The main results describe sufficient conditions on the associated filters under…
High levels of penetration of distributed generation and aggressive reactive power compensation with modern power electronics may result in the reversal of active and reactive power flows in future distribution grids. The voltage stability…
The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…
We study majority dynamics on the binomial random graph $G(n,p)$ with $p = d/n$ and $d > \lambda n^{1/2}$, for some large $\lambda>0$. In this process, each vertex has a state in $\{-1,+1 \}$ and at each round every vertex adopts the state…
There have been several existence results for the standing waves of FitzHugh-Nagumo equations. Such waves are the connecting orbits of an autonomous second-order Lagrangian system and the corresponding kinetic energy is an indefinite…