Related papers: Enumerating ODE Equivalent Homogeneous Networks
The Eulerian extension number of any graph~\(H\) (i.e. the minimum number of edges needed to be added to make~\(H\) Eulerian) is at least~\(t(H),\) half the number of odd degree vertices of~\(H.\) In this paper we consider an inhomogenous…
In the Correlation Clustering problem, we are given a weighted graph $G$ with its edges labeled as "similar" or "dissimilar" by a binary classifier. The goal is to produce a clustering that minimizes the weight of "disagreements": the sum…
This note considers fairly general quasi-homogeneous systems of first-order nonlinear ODEs and homogeneous systems of second-order nonlinear ODEs that contain arbitrary functions of several arguments. It presents several exact solutions to…
We classify connected 2-node excitatory-inhibitory networks under various conditions. We assume that, as well as for connections, there are two distinct node-types, excitatory and inhibitory. In our classification we consider four different…
A monomial ideal $I$ is said to have homological linear quotients if for each $k\geq 0$, the homological shift ideal $\mathrm{HS}_k(I)$ has linear quotients. It is a well-known fact that if an edge ideal $I(G)$ has homological linear…
Carrier aggregation (CA) and small cells are two distinct features of next-generation cellular networks. Cellular networks with small cells take on a very heterogeneous characteristic, and are often referred to as HetNets. In this paper, we…
Analogous to biological sequence comparison, comparing cellular networks is an important problem that could provide insight into biological understanding and therapeutics. For technical reasons, comparing large networks is computationally…
Many real-world networks have associated metadata that assigns categorical labels to nodes. Analysis of these annotations can complement the topological analysis of complex networks. Annotated networks have typically been used to evaluate…
This article proposes an algorithm that constructs a Sullivan minimal model for any simply connected simplicial set with effective homology and thereby allows one to decide algorithmically whether two simply connected spaces represented by…
Let $G$ be a connected, simply connected, simple, complex, linear algebraic group. Let $P$ be an arbitrary parabolic subgroup of $G$. Let $X=G/P$ be the $G$-homogeneous projective space attached to this situation. Let $d\in H_2(X)$ be a…
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…
Consider an undirected graph $G = (VG, EG)$ and a set of six \emph{terminals} $T = \set{s_1, s_2, s_3, t_1, t_2, t_3} \subseteq VG$. The goal is to find a collection $\calP$ of three edge-disjoint paths $P_1$, $P_2$, and $P_3$, where $P_i$…
In this paper, we study the problem of recovering the latent vertex correspondence between two correlated random graphs with vastly inhomogeneous and unknown edge probabilities between different pairs of vertices. Inspired by and extending…
In this paper we introduce the class of ordered homomorphism ideals and prove that these ideals admit minimal cellular resolutions constructed as homomorphism complexes. As a key ingredient of our work, we introduce the class of cointerval…
We say that an ideal I is homogeneous, if its restriction to any I-positive subset is isomorphic to I. The paper investigates basic properties of this notion -- we give examples of homogeneous ideals and present some applications to…
We discuss several parametrizations of the space of circular planar electrical networks. For any circular planar network we associate a canonical minimal network with the same response matrix, called a "standard" network. The conductances…
In this paper, we investigate the factors that affect the synchronization of coupled oscillators on networks. By using the edge-intercrossing method, we keep the degree distribution unchanged to see other statistical properties' effects on…
Homophily is the principle whereby "similarity breeds connections". We give a quantitative formulation of this principle within networks. Given a network and a labeled partition of its vertices, the vector indexed by each class of the…
Let $\kappa'(G)$ be the edge connectivity of $G$ and $G\times H$ the direct product of $G$ and $H$. Let $H$ be an arbitrary dense graph with minimal degree $\delta(H)>|H|/2$. We prove that for any graph $G$, $\kappa'(G\times…
We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time…