相关论文: Enumerating ODE Equivalent Homogeneous Networks
Coupled cell systems associated with a coupled cell network are determined by (smooth) vector fields that are consistent with the network structure. Here, we follow the formalisms of Stewart, Golubitsky and Pivato (Symmetry groupoids and…
A coupled cell system is an ODE system associated with a coupled cell network, where the dimension is determined by the number of cells. A heteroclinic connection is a set of solution trajectories between two equilibria of an ODE system. A…
We introduce the concept of a semigroup coupled cell network and show that the collection of semigroup network vector fields forms a Lie algebra. This implies that near a dynamical equilibrium the local normal form of a semigroup network is…
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements of networks for being robust against homogeneous faults…
A coupled cell network describes interacting (coupled) individual systems (cells). As in networks from real applications, coupled cell networks can represent inhomogeneous networks where different types of cells interact with each other in…
Zero-one reaction networks are pivotal to cellular signaling, and establishing the equivalence of such networks represents a foundational computational challenge in the realm of chemical reaction network research. Herein, we propose a…
Inhomogeneity in networks can be detected by the analysis of the correlation of the total degree of nearest neighbors. This is illustrated by two models. The first one is a random multi-partitions network that the Aboav Weaire law, which…
Cycles are ubiquitous in various networks such as social, biological, and technological systems, where they play a significant functional and dynamical role. This paper proposes a node similarity measure based on minimal simple cycles,…
Dynamical systems with a coupled cell network structure can display synchronous solutions, spectral degeneracies and anomalous bifurcation behavior. We explain these phenomena here for homogeneous networks, by showing that every homogeneous…
We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…
In the study of deterministic distributed algorithms it is commonly assumed that each node has a unique $O(\log n)$-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms)…
In this paper we characterize the unique graph whose algebraic connectivity is minimum among all connected graphs with given order and fixed matching number or edge covering number, and present two lower bounds for the algebraic…
It is common to use a compartmental, fluid model described by a system of ordinary differential equations (ODEs) to model disease spread. In addition to their simplicity, these models are also the mean-field approximations of more accurate…
We describe a synchronous distributed algorithm which identifies the edge-biconnected components of a connected network. It requires a leader, and uses messages of size O(log |V|). The main idea is to preorder a BFS spanning tree, and then…
Simplicial homology is a tool that provides a mathematical way to compute the connectivity and the coverage of a cellular network without any node location information. In this article, we use simplicial homology in order to not only…
Let $G$ be a finite connected simple graph with a chosen orientation of its edges. For the edge potential $\psi(t)=\cosh t-1,$ we minimize $\sum_{e\in E^\to}\psi(z_e)$ over each affine class $\omega+dC^0(G)\subset C^1(G)$. The minimizer is…
We consider the problem of graph matchability in non-identically distributed networks. In a general class of edge-independent networks, we demonstrate that graph matchability can be lost with high probability when matching the networks…
A central theme in sublinear graph algorithms is the relationship between counting and sampling: can the ability to approximately count a combinatorial structure be leveraged to sample it nearly uniformly at essentially the same cost? We…
Dynamical systems with a network structure can display anomalous bifurcations as a generic phenomenon. As an explanation for this it has been noted that homogeneous networks can be realized as quotient networks of so-called fundamental…
In this paper, we show that every $O(m)$-edge-connected simple graph $G$ of size divisible by $m$ with minimum degree at least $2^{O(m)}$ has an edge-decomposition into isomorphic copies of any given tree $T$ of size $m$. Moreover, the…