Related papers: Can smooth graphons in several dimensions be repre…
Exchangeable graph models (ExGM) subsume a number of popular network models. The mathematical object that characterizes an ExGM is termed a graphon. Finding scalable estimators of graphons, provably consistent, remains an open issue. In…
The genus of a graph is a topological invariant that measures the minimum genus of a surface on which the graph can be embedded without any edges crossing. Graph genus plays a fundamental role in topological graph theory, used to classify…
Hypergraph is a general way of representing high-order relations on a set of objects. It is a generalization of graph, in which only pairwise relations can be represented. It finds applications in various domains where relationships of more…
Graphene is the two-dimensional (2d) building block for carbon allotropes of every other dimensionality. It can be stacked into 3d graphite, rolled into 1d nanotubes, or wrapped into 0d fullerenes. Its recent discovery in free state has…
Graphons are analytic objects representing limits of convergent sequences of graphs. Lov\'asz and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determined by finitely many graph densities, has a simple…
Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the…
$H_q(n,d)$ is defined as the graph with vertex set ${\mathbb Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$.…
The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that the series of independence numbers in strong powers of a fixed…
Learning useful node and graph representations with graph neural networks (GNNs) is a challenging task. It is known that deep GNNs suffer from over-smoothing where, as the number of layers increases, node representations become nearly…
Graphons are continuous models that represent the structure of graphs and allow the generation of graphs of varying sizes. We propose Scalable Implicit Graphon Learning (SIGL), a scalable method that combines implicit neural representations…
In this paper which is the first of a series of papers on smooth structures, the concepts of C-structures and smooth structures are introduced and studied. The notion of smooth structure on semi-integral domains is given. It is shown that…
The paper is concerned with `geometrization' of smooth (i.e. with open stabilizers) representations of the automorphism group of universal domains, and with the properties of `geometric' representations of such groups. As an application, we…
In the continuous setting, we expect the product of two oscillating functions to oscillate even more (generically). On a graph $G=(V,E)$, there are only $|V|$ eigenvectors of the Laplacian $L=D-A$, so one oscillates `the most'. The purpose…
A graph $G$ is said to be a $k$-degenerate graph if any subgraph of $G$ contains a vertex of degree at most $k$. Let $\kappa$ be any non-negative function on the vertex set of $G$. We first define a $\kappa$-degenerate graph. Next we give…
Recently, graph neural networks (GNNs) have shown prominent performance in graph representation learning by leveraging knowledge from both graph structure and node features. However, most of them have two major limitations. First, GNNs can…
A recent paper, ``A Graphon-Signal Analysis of Graph Neural Networks'', by Levie, analyzed message passing graph neural networks (MPNNs) by embedding the input space of MPNNs, i.e., attributed graphs (graph-signals), to a space of…
Let $f$ be a meromorphic function with simply connected domain $G\subset\mathbb{C}$, and let $\Gamma\subset\mathbb{C}$ be a smooth Jordan curve. We call a component of $f^{-1}(\Gamma)$ in $G$ a $\Gamma$-$pseudo$-$lemniscate$ of $f$. In this…
We study the singularity (multifractal) spectrum of the convex hull of the typical/generic continuous functions defined on $[0,1]^{d}$. We denote by ${\mathbf E}_ { { \varphi } }^{h} $ the set of points at which $ \varphi : [0,1]^d\to…
A theorem of Mumford states that, on complex surfaces, any normal isolated singularity whose link is diffeomorphic to a sphere is actually a smooth point. While this property fails in higher dimensions, McLean asks whether the contact…
In this paper we try to introduce a good smoothness notion for a functor. We consider properties and conditions from geometry and algebraic geometry which we expect a smooth functor should to have.