Related papers: Mapping Class Factorization via Fatgraph Nielsen R…
Let $\Sigma$ be a compact orientable surface of genus $g=1$ with $n=1$ boundary component. The mapping class group $\Gamma$ of $\Sigma$ acts on the SU(3)-character variety of $\Sigma$. We show that the action is ergodic with respect to the…
Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…
The present work completes the classification of the compact Riemann surfaces of genus g with an analytic automorphism of order p (prime number) and p > g. More precisely, we construct a parameteriza- tion space for them, we compute their…
An example of a finite dimensional factorizable ribbon Hopf C-algebra is given by a quotient H=u_q(g) of the quantized universal enveloping algebra U_q(g) at a root of unity q of odd degree. The mapping class group M_{g,1} of a surface of…
Algorithms for node clustering typically focus on finding homophilous structure in graphs. That is, they find sets of similar nodes with many edges within, rather than across, the clusters. However, graphs often also exhibit heterophilous…
Suppose that a finite group $G$ admits a Frobenius group of automorphisms $FH$ with kernel $F$ and complement $H$ such that the fixed-point subgroup of $F$ is trivial: $C_G(F)=1$. In this situation various properties of $G$ are shown to be…
Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…
Federated Graph Learning (FGL) enables privacy-preserving, distributed training of graph neural networks without sharing raw data. Among its approaches, subgraph-FL has become the dominant paradigm, with most work focused on improving…
We study the action of the mapping class group on the real homology of finite covers of a topological surface. We use the homological representation of the mapping class to construct a faithful infinite-dimensional representation of the…
Multiresolution Matrix Factorization (MMF) is unusual amongst fast matrix factorization algorithms in that it does not make a low rank assumption. This makes MMF especially well suited to modeling certain types of graphs with complex…
Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problem. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basic matrix and a nonnegative…
Recently there has been renewed interest in the mapping-class group of a compact surface of genus $g \ge 2$ and also in its finite order elements. A finite order element of the mapping-class group will be a conformal automorphisms on some…
Using a similar algorithm to Hatcher-Thurston's algorithm for finding a presentation of the mapping class group of a surface, Wajnryb succeeded to find a presentation for the handlebody group. This is long and complicated. In this note I…
Nonnegative Matrix Factorization (NMF) is a widely used technique for data representation. Inspired by the expressive power of deep learning, several NMF variants equipped with deep architectures have been proposed. However, these methods…
In this paper we consider the action of the mapping class group of a surface on the space of homomorphisms from the fundamental group of a surface into PSL(2,R). Goldman conjectured that when the surface is closed and of genus bigger than…
We let the mapping class group $\Gamma_{g,1}$ of a genus $g$ surface $\Sigma_{g,1}$ with one boundary component act on the homology $H_*(F_{n}(\Sigma_{g,1});\mathbb{Q})$ of the $n^{th}$ ordered configuration space of the surface. We prove…
We first develop a general theory of Johnson filtrations and Johnson homomorphisms for a group $G$ acting on another group $K$ equipped with a filtration indexed by a "good" ordered commutative monoid. Then, specializing it to the case…
Sampling is a widely used graph reduction technique to accelerate graph computations and simplify graph visualizations. By comprehensively analyzing the literature on graph sampling, we assume that existing algorithms cannot effectively…
Let $\Sigma_{g'}\to \Sigma_g$ be a cover of an orientable surface of genus g by an orientable surface of genus g', branched at n points, with Galois group H. Such a cover induces a virtual action of the mapping class group…
Nonnegative matrix factorization is a powerful technique to realize dimension reduction and pattern recognition through single-layer data representation learning. Deep learning, however, with its carefully designed hierarchical structure,…