Related papers: Higher pentagram maps, weighted directed networks,…
We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…
Simple algebraic rules can produce complex networks with rich structures. These graphs are obtained when looking at a monoid operating on a ring. There are relations to dynamical systems theory and number theory. This document illustrates…
We introduce a geometric construction which relates to the pentagram map much in the way that a logarithmic spiral relates to a circle. After introducing the construction, we establish some basic geometric facts about it, and speculate on…
The inclusion of link weights into the analysis of network properties allows a deeper insight into the (often overlapping) modular structure of real-world webs. We introduce a clustering algorithm (CPMw, Clique Percolation Method with…
The phenomenon that multi-path components (MPCs) arrive in clusters has been verified by channel measurements, and is widely adopted by cluster-based channel models. As a crucial intermediate processing step, MPC clustering bridges raw data…
We reformulate the theory of p-adic iterated integrals on semistable curves using the unipotent log rigid fundamental group. This fundamental group carries Frobenius and monodromy operators whose basic properties are established. By…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…
Neighborhood graphs are a critical but often fragile step in spectral clustering of text embeddings. On realistic text datasets, standard $k$-NN graphs can contain many disconnected components at practical sparsity levels (small $k$),…
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of…
A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…
A seminal technique of theoretical physics called Wick's theorem interprets the Gaussian matrix integral of the products of the trace of powers of Hermitian matrices as the number of labelled maps with a given degree sequence, sorted by…
We lay down the foundations of the theory of Poisson vertex algebras aimed at its applications to integrability of Hamiltonian partial differential equations. Such an equation is called integrable if it can be included in an infinite…
Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let $G$ be a distance well-defined graph, and let ${\sf D}(G)$ be the distance matrix of $G$.…
Floor diagrams are a class of weighted oriented graphs introduced by E. Brugalle and the second author. Tropical geometry arguments lead to combinatorial descriptions of (ordinary and relative) Gromov-Witten invariants of projective spaces…
Generalized complex geometry, introduced by Hitchin, encompasses complex and symplectic geometry as its extremal special cases. We explore the basic properties of this geometry, including its enhanced symmetry group, elliptic deformation…
Tangles of graphs have been introduced by Robertson and Seymour in the context of their graph minor theory. Tangles may be viewed as describing "k-connected components" of a graph (though in a twisted way). They play an important role in…
Generalized connectivity introduced by Hager (1985) has been studied extensively in undirected graphs and become an established area in undirected graph theory. For connectivity problems, directed graphs can be considered as generalizations…
The article presents a new approach to euclidean plane geometry based on projective geometric algebra (PGA). It is designed for anyone with an interest in plane geometry, or who wishes to familiarize themselves with PGA. After a brief…
A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…
This paper studies the problem of designing networks that are strong structurally controllable, and robust simultaneously. For given network specifications, including the number of nodes $N$, the number of leaders $N_L$, and diameter $D$,…