Related papers: Network Parameterizations for the Grassmannian
Many different deep networks have been used to approximate, accelerate or improve traditional image operators. Among these traditional operators, many contain parameters which need to be tweaked to obtain the satisfactory results, which we…
In the Survivable Network Design Problem (SNDP), the input is an edge-weighted (di)graph $G$ and an integer $r_{uv}$ for every pair of vertices $u,v\in V(G)$. The objective is to construct a subgraph $H$ of minimum weight which contains…
The Schubert varieties on a flag manifold G/P give rise to a cell decomposition on G/P whose Kronecker duals, known as the Schubert classes on G/P, form an additive base of the integral cohomology of G/P. The Schubert's problem of…
The standard parametrization of totally non-negative Grassmannians was obtained by A. Postnikov [45] introducing the boundary measurement map in terms of discrete path integration on planar bicolored (plabic) graphs in the disk. An…
We describe a categorification of the cluster algebra structure of multi-homogeneous coordinate rings of partial flag varieties of arbitrary Dynkin type using Cohen-Macaulay modules over orders. This completes the categorification of…
We develop further the consequences of the irreducible-Boolean classification established in Ref. [9]; which have the advantage of allowing strong statistical calculations in disordered Boolean function models, such as the…
We consider node-weighted survivable network design (SNDP) in planar graphs and minor-closed families of graphs. The input consists of a node-weighted undirected graph $G=(V,E)$ and integer connectivity requirements $r(uv)$ for each…
The irreducible representations of symmetric groups can be realized as certain graded pieces of invariant rings, equivalently as global sections of line bundles on partial flag varieties. There are various ways to choose useful bases of…
In this paper, the paradigm of sphere decoding (SD) based on lattice Gaussian distribution is studied, where the sphere radius $D>0$ in the sense of Euclidean distance is characterized by the initial pruning size $K>1$, the standard…
For a given class ${\cal F}$ of uniform frames of fixed redundancy we define a Grassmannian frame as one that minimizes the maximal correlation $|< f_k,f_l >|$ among all frames $\{f_k\}_{k \in {\cal I}} \in {\cal F}$. We first analyze…
We consider the problem of finding ``dissimilar'' $k$ shortest paths from $s$ to $t$ in an edge-weighted directed graph $D$, where the dissimilarity is measured by the minimum pairwise Hamming distances between these paths. More formally,…
Quantifying the relations (e.g., similarity) between complex networks paves the way for studying the latent information shared across networks. However, fundamental relation metrics are not well-defined between networks. As a compromise,…
Certain criteria are demonstrated for a spatial derivation of a von Neumann algebra to generate a one-parameter semigroup of endomorphisms of that algebra. These are then used to establish a converse to recent results of Borchers and of…
A k-dissimilarity map on a finite set X is a function D : X \choose k \rightarrow R assigning a real value to each subset of X with cardinality k, k \geq 2. Such functions, also sometimes known as k-way dissimilarities, k-way distances, or…
The Fredholm determinants of a special class of integral operators K supported on the union of m curve segments in the complex plane are shown to be the tau-functions of an isomonodromic family of meromorphic covariant derivative operators…
This paper introduces a chordal decomposition approach for scalable analysis of linear networked systems, including stability, $\mathcal{H}_2$ and $\mathcal{H}_{\infty}$ performance. Our main strategy is to exploit any sparsity within these…
We study toric degenerations arising from Gr\"obner degenerations or the tropicalization of partial flag varieties. We produce a new family of toric degenerations of partial flag varieties whose combinatorics are governed by matching fields…
Let $\Fl_\lambda$ be a generalized flag variety of a simple Lie group $G$ embedded into the projectivization of an irreducible $G$-module $V_\lambda$. We define a flat degeneration $\Fl_\lambda^a$, which is a ${\mathbb G}^M_a$ variety.…
In this paper we construct an explicit map from planar bicolored (plabic) trivalent graphs representing a given irreducible positroid cell $S$ in the totally non-negative Grassmannian $Gr^{\mbox{TNN}}(k,n)$ to the spectral data for the…
Low Diameter Decompositions (LDDs) are invaluable tools in the design of combinatorial graph algorithms. While historically they have been applied mainly to undirected graphs, in the recent breakthrough for the negative-length Single Source…