Related papers: The Langberg-M\'{e}dard Multiple Unicast Conjectur…

Let the coefficients $a_{ij}$ and $b_i$, $i,j \leq d$, of the linear Fokker-Planck-Kolmogorov equation (FPK-eq.) $$\partial_t\mu_t = \partial_i\partial_j(a_{ij}\mu_t)-\partial_i(b_i\mu_t)$$ be Borel measurable, bounded and continuous in…

In this work we present a strategic network formation model predicting the emergence of multigroup structures. Individuals decide to form or remove links based on the benefits and costs those connections carry; we focus on bilateral consent…

Entropic regularization provides a simple way to approximate linear programs whose constraints split into two or more tractable blocks. The resulting objectives are amenable to cyclic Kullback-Leibler (KL) Bregman projections, with…

This paper considers the conjecture by Gr\"unbaum that every planar 3-connected graph has a spanning tree $T$ such that both $T$ and its co-tree have maximum degree at most 3. Here, the co-tree of $T$ is the spanning tree of the dual…

The Fan-Raspaud Conjecture states that every bridgeless cubic graph has three 1-factors with empty intersection. A weaker one than this conjecture is that every bridgeless cubic graph has two 1-factors and one join with empty intersection.…

Combinatorial threshold-linear networks (CTLNs) are a special class of recurrent neural networks whose dynamics are tightly controlled by an underlying directed graph. Recurrent networks have long been used as models for associative memory…

We prove that the `Upper Matching Conjecture' of Friedland, Krop, and Markstr\"om and the analogous conjecture of Kahn for independent sets in regular graphs hold for all large enough graphs as a function of the degree. That is, for every…

We consider multi-class single-server queueing networks that have a product form stationary distribution. A new limit result proves a sequence of such networks converges weakly to a stochastic flow level model. The stochastic flow level…

This paper investigates the existence of an equilibrium point in multiterminal HVDC (MT-HVDC) grids, assesses its uniqueness and defines conditions to ensure its stability. An offshore MT-HVDC system including two wind farms is selected as…

We consider a decentralised multi-access algorithm, motivated primarily by the control of transmissions in a wireless network. For a finite single-hop network with arbitrary interference constraints we prove stochastic stability under the…

Information does not generally behave like a conservative fluid flow in communication networks with multiple sources and sinks. However, it is often conceptually and practically useful to be able to associate separate data streams with each…

We initiate the study of the inherent tradeoffs between the size of a neural network and its robustness, as measured by its Lipschitz constant. We make a precise conjecture that, for any Lipschitz activation function and for most datasets,…

For integers x and k, let T(x;2k) denote the number of twin prime pairs (p,p+2k) with a distance 2k<=2x**0.5 and p<=x (not p+2k<=x). Let Tg(x;2x**0.5) denote the average of T(x;2k) for all 2k<=2x**0.5. Logically, T(x;2k) should be a…

This paper concerns the recent Virasoro conjecture for the theory of stable pairs on a 3-fold proposed by Oblomkov, Okounkov, Pandharipande and the author in arXiv:2008.12514. Here we extend the conjecture to 3-folds with…

In this paper, we address the Ehrenborg's conjecture which proposes that for any bipartite graph the number of spanning trees does not exceed the product of the degrees of the vertices divided by the product of the sizes of the graph…

In networked systems, the interplay between the dynamics of individual subsystems and their network interactions has been found to generate multistability in various contexts. Despite its ubiquity, the specific mechanisms and ingredients…

The Linear Arboricity Conjecture asserts that the linear arboricity of a graph with maximum degree $\Delta$ is $\lceil (\Delta+1)/2 \rceil$. For a $2k$-regular graph $G$, this implies $la(G) = k+1$. In this note, we utilize a network flow…

In the stable marriage problem, a set of men and a set of women are given, each of whom has a strictly ordered preference list over the acceptable agents in the opposite class. A matching is called stable if it is not blocked by any pair of…

We consider a damped linear hyperbolic system modelling the propagation of pressure waves in a network of pipes. Well-posedness is established via semi-group theory and the existence of a unique steady state is proven in the absence of…

A family of sets is called union-closed if whenever $A$ and $B$ are sets of the family, so is $A\cup B$. The long-standing union-closed conjecture states that if a family of subsets of $[n]$ is union-closed, some element appears in at least…