相关论文: Total positivity, Grassmannians, and networks

We examine a node centrality measure based on the notion of total communicability, defined in terms of the row sums of the exponential of the adjacency matrix of the network. We argue that this is a natural metric for ranking nodes in a…

It is suggested that the degree distribution for networks of the cell-metabolism for simple organisms reflects an ubiquitous randomness. This implies that natural selection has exerted no or very little pressure on the network degree…

Cell polarization is a critical process that separates molecular species into two distinct regions in prokaryotic and eukaryotic cells, guiding biological processes such as cell division and cell differentiation. Although several underlying…

In this work we study the estimation of the density of a totally positive random vector. Total positivity of the distribution of a random vector implies a strong form of positive dependence between its coordinates and, in particular, it…

Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…

Biological networks often encapsulate promotion/inhibition as signed edge-weights of a graph. Nodes may correspond to genes assigned expression levels (mass) of respective proteins. The promotion/inhibition nature of co-expression between…

In this short note we provide a proof of boundedness of solutions for a network system composed of heterogeneous nonlinear autonomous systems interconnected over a directed graph. The sole assumptions imposed are that the systems are…

We propose a new bound for generalization of neural networks using Koopman operators. Whereas most of existing works focus on low-rank weight matrices, we focus on full-rank weight matrices. Our bound is tighter than existing norm-based…

In this article we consider resistance matrix of a connected graph. For unweighted graph we study some necessary and sufficient conditions for resistance regular graphs. Also we find some relationship between Laplacian matrix and resistance…

Genetic regulatory networks (GRNs) have been widely studied, yet there is a lack of understanding with regards to the final size and properties of these networks, mainly due to no network currently being complete. In this study, we analyzed…

We investigate the impact of degree-degree correlations on the spectra of networks. Even though density distributions exhibit drastic changes depending on the (dis)assortative mixing and the network architecture, the short range…

The totally nonnegative Grassmannian $\mathrm{Gr}(k,n)_{\geq0}$ is the subset of the real Grassmannian $\mathrm{Gr}(k,n)$ consisting of points with all nonnegative Pl\"ucker coordinates. The circular Bruhat order is a poset isomorphic to…

We study wire networks that are the complements of triply periodic minimal surfaces. Here we consider the P, D, G surfaces which are exactly the cases in which the corresponding graphs are symmetric and self-dual. Our approach is using the…

We show that the tropical projective Grassmannian of planes is homeomorphic to a closed subset of the analytic Grassmannian in Berkovich's sense by constructing a continuous section to the tropicalization map. Our main tool is an explicit…

We establish a new relationship between monotonicity and contractivity and use this connection to describe a new general class of weakly contractive reaction networks. The new class is characterized by the stoichiometry matrix of the…

Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…

Recently, so-called treebased phylogenetic networks have gained considerable interest in the literature, where a treebased network is a network that can be constructed from a phylogenetic tree, called the base tree, by adding additional…

We study the combinatorial description of the LDU decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU decomposition of totally positive…

We study a generic family of nonlinear dynamics on undirected networks generalising linear consensus. We find a compact expression for its equilibrium points in terms of the topology of the network and classify their stability using the…

We investigate various groupoids associated to an arbitrary inverse semigroup with zero. We show that the groupoid of filters with respect to the natural partial order is isomorphic to the groupoid of germs arising from the standard action…