Related papers: The image complexity of an analytic map germ
Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We consider equivalence relations among smooth map germs with respect to geometry of G-structures on the target space germ. These equivalence relations are natural generalization of right-left equivalence (i.e., A-equivalence) in the sense…
We define the notion of a sheaf over a complex of groups. As an application, we give a criterion for the developability of a complex of groups. When the developability is witnessed by a morphism to $\mathrm{GL}(V)$ for some $V$, our…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
We study the behavior of the analytic capacity of a compact set under deformations obtained by families of conformal maps depending holomorphically on the complex parameter. We show that, under those deformations, the logarithm of the…
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
Usually bundle gerbes are considered as objects of a 2-groupoid, whose 1-morphisms, called stable isomorphisms, are all invertible. I introduce new 1-morphisms which include stable isomorphisms, trivializations and bundle gerbe modules.…
An independent set may not contain both a vertex and one of its neighbours. This basic fact makes the uniform distribution over independent sets rather special. We consider the hard-core model, an essential generalization of the uniform…
We construct holomorphic maps with a Siegel disk whose boundary is not locally connected (and is an indecomposable continuum), yet compactly contained in the domain of definition of the map. Our examples are injective and defined on a…
This paper addresses the enumeration of rooted and unrooted hypermaps of a given genus. For rooted hypermaps the enumeration method consists of considering the more general family of multirooted hypermaps, in which darts other than the root…
A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The…
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…
The effects of a boundary on the circuit complexity are studied in two dimensional theories. The analysis is performed in the holographic realization of a conformal field theory with a boundary by employing different proposals for the dual…
In this article we investigate the natural domain of definition of a holonomy map associated to a singular holomorphic foliation of the complex projective plane. We prove that germs of holonomy between algebraic curves can have large sets…
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through dimensionality reduction techniques. However, these…
We study two recent conjectures for holographic complexity: the complexity=action conjecture and the complexity=volume conjecture. In particular, we examine the structure of the UV divergences appearing in these quantities, and show that…
Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional…