Related papers: Higher pentagram maps, weighted directed networks,…
We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…
Geometry can be used to explain many properties commonly observed in real networks. It is therefore often assumed that real networks, especially those with high average local clustering, live in an underlying hidden geometric space.…
The theory of triples of Poisson brackets and related integrable systems, based on a classical R-matrix R in End_F(g), where g is a finite dimensional associative algebra over a field F viewed as a Lie algebra, was developed by…
We examine graphs that contain a non-trivial link in every embedding into real projective space, using a weaker notion of unlink than was used by Flapan, et al. We call such graphs intrinsically linked in projective space. We fully…
We give an explicit combinatorial description of cluster structures in Schubert varieties of the Grassmannian in terms of (target labelings of) Postnikov's plabic graphs. This description is a natural generalization of the description given…
This paper studies a certain completely integrable discretization of the KP hierarchy. This was constructed by Gieseker in \cite{Gie1}, from certain algebro-geometric data. This paper has the dual aim of showing that this construction is…
We define higher pentagram maps on polygons in $P^d$ for any dimension $d$, which extend R.Schwartz's definition of the 2D pentagram map. We prove their integrability by presenting Lax representations with a spectral parameter for scale…
The structure of many complex networks includes edge directionality and weights on top of their topology. Network analysis that can seamlessly consider combination of these properties are desirable. In this paper, we study two important…
We develop a formalism that allows us to describe Markov compacta with finite sets of diagrams that are building blocks of the entire sequence. This encodes complex, continuous spaces with discrete collections of combinatorial objects. We…
Many empirical networks display an inherent tendency to cluster, i.e. to form circles of connected nodes. This feature is typically measured by the clustering coefficient (CC). The CC, originally introduced for binary, undirected graphs,…
Scene graphs represent the key components of a scene in a compact and semantically rich way, but are difficult to build during incremental SLAM operation because of the challenges of robustly identifying abstract scene elements and…
In 2004, Klavins et al. introduced the use of graph grammars to describe -- and to program -- systems of self-assembly. We show that these graph grammars can be embedded in a graph rewriting characterization of distributed systems that was…
The theory of complexes of directed trees was initiated by Kozlov to answer a question by Stanley, and later on, results from the theory were used by Babson and Kozlov in their proof of the Lovasz conjecture. We develop the theory and prove…
This paper considers a simple geometric construction, called the Pentagram map. The pentagram map, performed on N-gons, gives rise to a birational mapping on the space of all N-gons. This paper finds what conjecturally are all the…
This paper investigates the Poisson geometry of cluster algebras and the corresponding ideal theory of quantum cluster algebras. We then show how our approach can be applied to the ring theory of quantized coordinate rings. We give a new…
Bauer and Itzykson showed that associated to each labeled map embedded on an oriented Riemann surface there was a group generated by a pair of permutations. From this result an algorithm may be constructed for enumerating labeled maps, and…
Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…
Generalized cluster algebras from orbifolds were defined by Chekhov and Shapiro to give a combinatorial description of their Teichm\"uller spaces. One can also assign a gentle algebra to a triangulated orbifold, as in the work of…
Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…
In our recent works, we developed a probabilistic framework for structural analysis in undirected networks. The key idea of that framework is to sample a network by a symmetric bivariate distribution and then use that bivariate distribution…