Related papers: On the link of Lipschitz normally embedded sets
In the domain of network biology, the interactions among heterogeneous genomic and molecular entities are represented through networks. Link prediction (LP) methodologies are instrumental in inferring missing or prospective associations…
The main contribution of this paper is that every convex function with non-empty relative algebraic interior of its domain is Lipschitz and subdifferentiable in some algebraic sense without any additional topological constraints. The…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
Let $L_n$ be the free metabelian Leibniz algebra generated by the set $X_n=\{x_1,\ldots,x_n\}$ over a field $K$ of characteristic zero. This is the free algebra of rank $n$ in the variety of solvable of class $2$ Leibniz algebras. We call…
A network embedding is a representation of a large graph in a low-dimensional space, where vertices are modeled as vectors. The objective of a good embedding is to preserve the proximity between vertices in the original graph. This way,…
Let $A$ be an expanding $d\times d$ matrix with integer entries and ${\mathcal D}\subset {\mathbb Z}^d$ be a finite digit set. Then the pair $(A, {\mathcal D})$ defines a unique integral self-affine set $K=A^{-1}(K+{\mathcal D})$. In this…
Graph embedding seeks to build a low-dimensional representation of a graph G. This low-dimensional representation is then used for various downstream tasks. One popular approach is Laplacian Eigenmaps, which constructs a graph embedding…
We introduce a growing network model in which a new node attaches to a randomly-selected node, as well as to all ancestors of the target node. This mechanism produces a sparse, ultra-small network where the average node degree grows…
Lipschitz Bound Estimation is an effective method of regularizing deep neural networks to make them robust against adversarial attacks. This is useful in a variety of applications ranging from reinforcement learning to autonomous systems.…
Many real networks feature the property of nestedness, i.e. the neighbours of nodes with a few connections are hierarchically nested within the neighbours of nodes with more connections. Despite the abstract simplicity of this notion,…
Complex network theory (CNT) is gaining a lot of attention in the scientific community, due to its capability to model and interpret an impressive number of natural and anthropic phenomena. One of the most active CNT field concerns the…
Graph embedding is gaining its popularity for link prediction in complex networks and achieving excellent performance. However, limited work has been done in sparse networks that represent most of real networks. In this paper, we propose a…
The standard arithmetic measures of center, the mean and median, have natural topological counterparts which have been widely used in continuum theory. In the context of metric spaces it is natural to consider the Lipschitz continuous…
In the real-analytic setting, we show that all sub-Riemannian minimizers (parametrized by the arc-length) are real-analytic everywhere except an at most countable non-dense set. In particular, non-analyticity may occur only on a set of…
A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…
Graphs are ubiquitous due to their flexibility in representing social and technological systems as networks of interacting elements. Graph representation learning methods, such as node embeddings, are powerful approaches to map nodes into a…
Symmetries are ubiquitous in real networks and often characterize network features and functions. Here we present a generalization of network symmetry called \emph{latent symmetry}, which is an extension of the standard notion of symmetry.…
Exploiting spectral properties of symmetric banded Toeplitz matrices, we describe simple sufficient conditions for positivity of a trigonometric polynomial formulated as linear matrix inequalities (LMI) in the coefficients. As an…
We show that a function $f : X \to \mathbb R$ defined on a closed uniformly polynomially cuspidal set $X$ in $\mathbb R^n$ is real analytic if and only if $f$ is smooth and all its composites with germs of polynomial curves in $X$ are real…
We compare ambient and outer Lipschitz geometry of Lipschitz normally embedded H\"older triangles in $\mathbb{R}^4$. In contrast to the case of $\mathbb{R}^3$ there are infinitely many equivalence classes. The equivalence classes are…