Related papers: Comparing Teichm\"uller and curve graph translatio…

Recently, Temporal Graph Neural Networks (TGNNs) have demonstrated state-of-the-art performance in various high-impact applications, including fraud detection and content recommendation. Despite the success of TGNNs, they are prone to the…

The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about the intrinsic geometry of MSTs of most standard models, and…

Let $S_g$ be the closed surface of genus $g$, $\mathcal{L}$ be the infinite Jacob's ladder surface, and $\mathrm{Map}(S)$ denote the mapping class group of a surface $S$. Let $q_g:\mathcal{L}\to S_g$ be the regular infinite-sheeted cover…

The rich information underlying graphs has inspired further investigation of unsupervised graph representation. Existing studies mainly depend on node features and topological properties within static graphs to create self-supervised…

In this paper, we prove that the infimum of the mean curvature is zero for a translating solitons of hypersurface in $\re^{n+k}$. We give some conditions under which a complete hypersurface translating soliton is stable. We show that if the…

Let S be a complete surface of constant curvature K = + 1 or -1, i.e. the sphere S^2 or the Lobachevskij plane L^2, and D a bounded convex subset of S. If S = S^2, assume also diameter (D) < pi/2. It is proved that the length of any…

Let $\Gamma$ be a Zariski dense $\Theta$-Anosov subgroup of a connected semisimple real algebraic group for some nonempty subset of simple roots $\Theta$. In the Anosov setting, there is a natural compact metric space $\mathcal{X}$ equipped…

We study the translation surfaces obtained by considering the unfoldings of the surfaces of Platonic solids. We show that they are all lattice surfaces and we compute the topology of the associated Teichm\"uller curves. Using an algorithm…

Let $\mathcal{C}(S_{g,p})$ denote the curve complex of the closed orientable surface of genus $g$ with $p$ punctures. Masur-Minksy and subsequently Bowditch showed that $\mathcal{C}(S_{g,p})$ is $\delta$-hyperbolic for some…

A translation surface in the Heisenberg group $\mathrm{Nil}_3$ is a surface constructed by multiplying (using the group operation) two curves. We completely classify minimal translation surfaces in the Heisenberg group $\mathrm{Nil}_3$.

In fault-tolerant distance labeling we wish to assign short labels to the vertices of a graph $G$ such that from the labels of any three vertices $u,v,f$ we can infer the $u$-to-$v$ distance in the graph $G\setminus \{f\}$. We show that any…

We study the discrete-to-continuum consistency of the training of shallow graph convolutional neural networks (GCNNs) on proximity graphs of sampled point clouds under a manifold assumption. Graph convolution is defined spectrally via the…

We give a cluster algebraic description of the reduction procedure of mapping classes along a multicurve. Based on this description, we characterize pseudo-Anosov mapping classes on a general marked surface in terms of a weaker version of…

In a connected simple graph G = (V,E), each vertex of V is colored by a color from the set of colors C={c1, c2,..., c_{\alpha}}$. We take a subset S of V, such that for every vertex v in V\S, at least one vertex of the same color is present…

We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…

We present an explicit sequence of pseudo-Anosov maps $\phi_k: S_{2k}\to S_{2k}$ of surfaces of genus $2k$ whose growth rates converge to one.

We study the weak $K_s$-saturation number of the Erd\H{o}s--R\'{e}nyi random graph $\mathbbmsl{G}(n, p)$, denoted by $\mathrm{wsat}(\mathbbmsl{G}(n, p), K_s)$, where $K_s$ is the complete graph on $s$ vertices. Kor\'{a}ndi and Sudakov in…

Graph convolutional neural networks (GCNNs) are nonlinear processing tools to learn representations from network data. A key property of GCNNs is their stability to graph perturbations. Current analysis considers deterministic perturbations…

We describe algorithms to efficiently compute minimum $(s,t)$-cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph $G$ with $n$ vertices embedded on an orientable surface of genus $g$,…

Let $\gamma$ be a pseudo-Anosov homeomorphism and $X$ an element of the Teichmuller space of a genus $g$ surface. In this paper, we find asymptotics for the number of pseudo-Anosov homeomorphisms that are conjugate to $\gamma$ and the axis…