相关论文: Enumerating ODE Equivalent Homogeneous Networks

For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv in H corresponds to a {\tau} (u) - {\tau}…

Network alignment, the process of finding correspondences between nodes in different graphs, has many scientific and industrial applications. Existing unsupervised network alignment methods find suboptimal alignments that break up node…

Existing network embedding approaches tackle the problem of learning low-dimensional node representations. However, networks can also be seen in the light of edges interlinking pairs of nodes. The broad goal of this paper is to introduce…

A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to…

Dirac's theorem states that any $n$-vertex graph $G$ with even integer $n$ satisfying $\delta(G) \geq n/2$ contains a perfect matching. We generalize this to $k$-uniform linear hypergraphs by proving the following. Any $n$-vertex…

Network alignment (NA) compares networks with the goal of finding a node mapping that uncovers highly similar (conserved) network regions. Existing NA methods are homogeneous, i.e., they can deal only with networks containing nodes and…

A path in an edge-colored graph is called a proper path if no two adjacent edges of the path are colored the same. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to…

We consider singular integrals associated to homogeneous kernels on self similar sets. Using ideas from ergodic theory we prove, among other things, that in Euclidean spaces the principal values of singular integrals associated to real…

The eccentric connectivity index of a connected graph $G$ is the sum over all vertices $v$ of the product $d_{G}(v) e_{G}(v)$, where $d_{G}(v)$ is the degree of $v$ in $G$ and $e_{G}(v)$ is the maximum distance between $v$ and any other…

Identifying networks with similar characteristics in a given ensemble, or detecting pattern discontinuities in a temporal sequence of networks, are two examples of tasks that require an effective metric capable of quantifying network…

In this Letter we identify the general rules that determine the synchronization properties of interconnected networks. We study analytically, numerically and experimentally how the degree of the nodes through which two networks are…

In random graph models, the degree distribution of an individual node should be distinguished from the (empirical) degree distribution of the graph that records the fractions of nodes with given degree. We introduce a general framework to…

A two-tier heterogeneous cellular network (HCN) with intra-tier and inter-tier dependence is studied. The macro cell deployment follows a Poisson point process (PPP) and two different clustered point processes are used to model the…

The quasi-steady state approximation and time-scale separation are commonly applied methods to simplify models of biochemical reaction networks based on ordinary differential equations (ODEs). The concentrations of the "fast" species are…

The last mile connection is dominated by wireless links where heterogeneous nodes share the limited and already crowded electromagnetic spectrum. Current contention based decentralized wireless access system is reactive in nature to…

The local complement G*i of a simple graph G at one of its vertices i is obtained by complementing the subgraph induced by the neighborhood of i and leaving the rest of the graph unchanged. If e={i,j} is an edge of G then G*e=((G*i)*j)*i is…

We classify connected 3-node restricted excitatory-inhibitory networks, extending our previous paper (`Classification of 2-node Excitatory-Inhibitory Networks', Mathematical Biosciences 373 (2024) 109205). We assume that there are two…

We study a state estimation problem for a $2\times 2$ linear hyperbolic system on networks with eigenvalues with opposite signs. The system can be seen as a simplified model for gas flow through gas networks. For this system we construct an…

Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of a binary linear code. The information sets and the minimum distance…

We present the first near-linear work and poly-logarithmic depth algorithm for computing a minimum cut in a graph, while previous parallel algorithms with poly-logarithmic depth required at least quadratic work in the number of vertices. In…