Related papers: Tropicalization of Graph Profiles
A fundamental challenge in graph mining is the ever-increasing size of datasets. Graph summarization aims to find a compact representation resulting in faster algorithms and reduced storage needs. The flip side of graph summarization is the…
Patchworking theorems serve as a basic element of the correspondence between tropical and algebraic curves, which is a core of the tropical enumerative geometry. We present a new version of a patchworking theorem which relates plane…
We introduce adic tropicalizations for subschemes of toric varieties as limits of Gubler models associated to polyhedral covers of the ordinary tropicalization. Our main result shows that Huber's adic analytification of a subscheme of a…
Tropical varieties capture combinatorial information about how coordinates of points in a classical variety approach zero or infinity. We present algorithms for computing the rays of a complex and real tropical curve defined by polynomials…
We study the generalization of Correlation Clustering which incorporates fairness constraints via the notion of fairlets. The corresponding Fair Correlation Clustering problem has been studied from several perspectives to date, but has so…
This study addresses the issue of balancing graph summarization and graph change detection. Graph summarization compresses large-scale graphs into a smaller scale. However, the question remains: To what extent should the original graph be…
Graph sampling is a technique to pick a subset of vertices and/ or edges from original graph. It has a wide spectrum of applications, e.g. survey hidden population in sociology [54], visualize social graph [29], scale down Internet AS graph…
We investigate the tree gonality of a genus-$g$ metric graph, defined as the minimum degree of a tropical morphism from any tropical modification of the metric graph to a metric tree. We give a combinatorial constructive proof that this…
The homogeneous spectrum of a multigraded finitely generated algebra (in the sense of Brenner-Schr\"oer) always admits an embedding into a toric variety that is not necessarily separated, a so-called toric prevariety. In order to have a…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
In this paper, we present a novel way to summarize the structure of large graphs, based on non-parametric estimation of edge density in directed multigraphs. Following coclustering approach, we use a clustering of the vertices, with a…
A dot-product representation of a graph is a mapping of its vertices to vectors of length $k$ so that vertices are adjacent if and only if the inner product (a.k.a. dot product) of their corresponding vertices exceeds some threshold.…
Graph convolution (GConv) is a widely used technique that has been demonstrated to be extremely effective for graph learning applications, most notably node categorization. On the other hand, many GConv-based models do not quantify the…
Are users of an online social network interested equally in all connections in the network? If not, how can we obtain a summary of the network personalized to specific users? Can we use the summary for approximate query answering? As…
A graph covering projection, also referred to as a locally bijective homomorphism, is a mapping between the vertices and edges of two graphs that preserves incidences and is a local bijection. This concept originates in topological graph…
We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological…
This is an expository article on the adic tropicalization of algebraic varieties. We outline joint work with Sam Payne in which we put a topology and structure sheaf of local topological rings on the exploded tropicalization. The resulting…
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability…
The notion of geometric construction is introduced. This notion allows to compare incidence configurations in the algebraic and tropical plane. We provide an algorithm such that, given a tropical instance of a geometric construction, it…