Related papers: Higher pentagram maps, weighted directed networks,…
LP algebras, introduced by Lam and Pylyavskyy, are a generalization of cluster algebras. These algebras are known to have the Laurent phenomenon, but positivity remains conjectural. Graph LP algebras are finite LP algebras encoded by a…
We propose a method for characterizing large complex networks by introducing a new matrix structure, unique for a given network, which encodes structural information; provides useful visualization, even for very large networks; and allows…
In a recent work, we constructed a rational map from a simple Lie group $\mathcal G$ to itself that intertwines the standard Poisson--Lie structure on $\mathcal G$ with a Poisson homogeneous one defined by a pair of quasi-triangular…
The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…
The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. This map is known to interact nicely with Poncelet polygons, i.e. polygons which are…
In 2013, Lee, Li, and Zelevinsky introduced combinatorial objects called compatible pairs to construct the greedy bases for rank-2 cluster algebras, consisting of indecomposable positive elements including the cluster monomials.…
A prototypical examples of a cluster algebra is the coordinate ring of a finite Grassmannian: using the Pl\"ucker embedding the cluster algebra structure allows one to move between `maximal sets' of algebraically independent Pl\"ucker…
As one type of incidence theory, the geometry of pentagram map seems quite classical at first. However, this is an excellent example of such a classical idea developed into a marvellous insight by some modern approach. We introduce an…
The inductive biases of graph representation learning algorithms are often encoded in the background geometry of their embedding space. In this paper, we show that general directed graphs can be effectively represented by an embedding model…
On a geometrical view, the conception of map geometries are introduced, which is a nice model of the Smarandache geometries, also new kind of and more general intrinsic geometry of surface. Results convinced one that map geometries are…
This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…
This paper leverages linear systems theory to propose a principled measure of complexity for network systems. We focus on a network of first-order scalar linear systems interconnected through a directed graph. By locally filtering out the…
We generalize to vector bundles the techniques introduced for line bundles in prior work of the author with Liu, Osserman and Zhang. We then use this method to prove the injectivity of the Petri map for vector bundles and the surjectivity…
Many applications in graph theory are motivated by routing or flow problems. Among these problems is Steiner Orientation: given a mixed graph G (having directed and undirected edges) and a set T of k terminal pairs in G, is there an…
In recent years, A. Grigor'yan, Y. Lin, Y. Muranov and S.T. Yau [6, 7, 8, 9] constructed a path homology theory for digraphs. Later, S. Chowdhury and F. Memoli [3] studied the persistent path homology for directed networks. In this paper,…
The integrability of two symplectic maps, that can be considered as discrete-time analogs of the Garnier and Neumann systems is established in the framework of the $r$-matrix approach, starting from their Lax representation. In contrast…
Graph clustering (or community detection) has long drawn enormous attention from the research on web mining and information networks. Recent literature on this topic has reached a consensus that node contents and link structures should be…
We construct a direct quasi-isomorphism from Kontsevich's graph complex GC_n to the oriented graph complex OGC_{n+1}, thus providing an alternative proof that the two complexes are quasi-isomorphic. Moreover, the result is extended to the…
The increasing interest in complex networks research has been a consequence of several intrinsic features of this area, such as the generality of the approach to represent and model virtually any discrete system, and the incorporation of…
We consider a class of complex manifolds constructed as multiplicative quiver varieties associated with a cyclic quiver extended by an arbitrary number of arrows starting at a new vertex. Such varieties admit a Poisson structure, which is…