相关论文: Enumerating ODE Equivalent Homogeneous Networks
We consider wireless sensor networks under a heterogeneous random key predistribution scheme and an on-off channel model. The heterogeneous key predistribution scheme has recently been introduced by Ya\u{g}an - as an extension to the…
We propose a new procedure for testing whether two networks are edge-correlated through some latent vertex correspondence. The test statistic is based on counting the co-occurrences of signed trees for a family of non-isomorphic trees. When…
A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operations e.g. closure, boundary, connected components, and…
This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…
We develop an obstruction theory for the existence of gauge equivalences in complete differential graded Lie algebras. Specifically, this theory provides a characterization of homotopy equivalences between differential graded algebras…
In this paper, we introduce a generalization of graphlets to heterogeneous networks called typed graphlets. Informally, typed graphlets are small typed induced subgraphs. Typed graphlets generalize graphlets to rich heterogeneous networks…
Network analysis has a crucial need for tools to compare networks and assess the significance of differences between networks. We propose a principled statistical approach to network comparison that approximates networks as probability…
We study the problem of testing the existence of a heterogeneous dense subhypergraph. The null hypothesis corresponds to a heterogeneous Erd\"{o}s-R\'{e}nyi uniform random hypergraph and the alternative hypothesis corresponds to a…
Heterogeneous base stations (e.g. picocells, microcells, femtocells and distributed antennas) will become increasingly essential for cellular network capacity and coverage. Up until now, little basic research has been done on the…
We consider network structures that optimize the $\mathcal{H}_2$ norm of weighted, time scaled consensus networks, under a minimal representation of such consensus networks described by the edge Laplacian. We show that a greedy algorithm…
In this paper, we investigate some parity factors by using Lov\'asz's (g,f)-parity theorem. Let $m>0$ be an integer. Firstly, we obtain a sufficient and necessary condition for some graphs to have a parity factor with restricted minimum…
Real networks often have severe degree heterogeneity, with the maximum, average, and minimum node degrees differing significantly. This paper examines the impact of degree heterogeneity on statistical limits of network data analysis.…
Many real world networks exhibit edge heterogeneity with different pairs of nodes interacting with different intensities. Further, nodes with similar attributes tend to interact more with each other. Thus, in the presence of observed node…
We consider a network in the Euclidean plane that consists of three distinct half-lines with common start points. From that network as initial condition, there exists a network that consists of three curves that all start at one point,…
By a model of coupled phase oscillators, we show analytically how synchronization in {\em non-identical} complex networks can be enhanced by introducing a proper gradient into the couplings. It is found that, by pointing the gradient from…
Mader conjectured in 1979 that an average degree of at least $3k-1$ in a graph is sufficient for the existence of a $(k+1)$-connected subgraph. The following minimum degree analogue holds: Every graph with minimum degree at least $3k-1$…
Latent Euclidean embedding models a given network by representing each node in a Euclidean space, where the probability of two nodes sharing an edge is a function of the distances between the nodes. This implies that for two nodes to share…
Let $A=\oplus_{i\in \mathbb{Z}}A_i$ be a finite dimensional graded symmetric cellular algebra with a homogeneous symmetrizing trace of degree $d$. We prove that $A_{-d}$ contains the Higman ideal $H(A)$ of the center of $A$ and $\dim…