相关论文: Monotone Maps, Sphericity and Bounded Second Eigen…

Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs…

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

We present a new method for upper bounding the second eigenvalue of the Laplacian of graphs. Our approach uses multi-commodity flows to deform the geometry of the graph; we embed the resulting metric into Euclidean space to recover a bound…

We study the Seifert surfaces of a link by relating the embeddings of graphs by using induced graphs. As applications, we prove that every link $L$ is the boundary of an oriented surface which is obtained from a graph embedding of a…

While the problem of determining whether an embedding of a graph $G$ in $\mathbb{R}^2$ is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\it rigid} or not is still a hard task that usually…

Stochastic embeddings of finite metric spaces into graph-theoretic trees have proven to be a vital tool for constructing approximation algorithms in theoretical computer science. In the present work, we build out some of the basic theory of…

We show that for any constant $\Delta \ge 2$, there exists a graph $G$ with $O(n^{\Delta / 2})$ vertices which contains every $n$-vertex graph with maximum degree $\Delta$ as an induced subgraph. For odd $\Delta$ this significantly improves…

Let $M$ be a separable metric space. We say that $f=(f_n):M\to c_0$ is a good-$\lambda$-embedding if, whenever $x,y\in M$, $x\ne y$ implies $d(x,y)\le\Vert f(x)-f(y)\Vert$ and, for each $n$, $Lip(f_n)<\lambda$, where $Lip(f_n)$ denotes the…

This work studies an explicit embedding of the set of probability measures into a Hilbert space, defined using optimal transport maps from a reference probability density. This embedding linearizes to some extent the 2-Wasserstein space,…

The category of metric spaces is a subcategory of quasi-metric spaces. In this paper the notion of entropy for the continuous maps of a quasi-metric space is extended via spanning and separated sets. Moreover, two metric spaces that are…

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…

In this paper we initiate the study of equivariant wave maps from 2d hyperbolic space into rotationally symmetric surfaces. This problem exhibits markedly different phenomena than its Euclidean counterpart due to the exponential volume…

We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…

Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…

The set of factorizations of permutations in to $m$ transpositions of some symmetric group $\mathcal{S}_n$ is naturally in bijection with the set of graphs of order $n$ and size $m$ with both edges and vertices labeled. We define a notion…

We first consider interval partitions whose complements are Lebesgue-null and introduce a complete metric that induces the same topology as the Hausdorff distance (between complements). This is done using correspondences between intervals.…

A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…

We study the eigenvalues of the unique connected anti-regular graph $A_n$. Using Chebyshev polynomials of the second kind, we obtain a trigonometric equation whose roots are the eigenvalues and perform elementary analysis to obtain an…

We prove that the space of persistence diagrams on $n$ points (with the bottleneck or a Wasserstein distance) coarsely embeds into Hilbert space by showing it is of asymptotic dimension $2n$. Such an embedding enables utilisation of Hilbert…

For given $\Delta>0$ and $0<\lambda<3/\sqrt{2}$, we show that the maximum multiplicity that $\lambda$ can appear as the second largest eigenvalue of a connected graph with maximum degree at most $\Delta$ is $O_{\Delta,\lambda}(1)$. This…