In this paper, we study the analytic connectivity of a k-uniform hypergraph H, denoted by . In addition to computing the analytic connectivity of a complete k-graph, we present several bounds on analytic connectivity that relate it with other graph invariants, such as degree, vertex connectivity, diameter and isoperimetric number.
Spectral clustering algorithms are often used to find clusters in the community detection problem. Recently, a degree-corrected spectral clustering algorithm was proposed. However, it is only used for partitioning graphs which are generated from stochastic blockmodels. This paper studies the degree-corrected spectral clustering algorithm based on the spectral graph theory and shows that it gives a good approximation of the optimal clustering for a wide class of graphs. Moreover, we also give theoretical support for finding an appropriate degree-correction. Several numerical experiments for community detection are conducted in this paper to evaluate our method.
This paper investigates the construction of spectral siblings and spectral cousins-pairs of graphs whose characteristic polynomials differ by a constant or a linear function, respectively-through a series of graph operations. We establish sufficient conditions for generating families of such graphs by coalescing known siblings with specific structures.
Self-supervised learning (SSL) has become a powerful paradigm for graph representation learning. However, most existing methods operate in the graph topology domain and rely on complex data augmentations or contrastive objectives, which constrain them to local structural information and hinder the effective modeling of global or long-range dependencies. In this work, we propose the inverse-filter graph neural network (IF-GNN), an alternative spectral-based method for SSL. IF-GNN employs a fixed spectral operator as a low-pass inverse filter, enabling efficient and label-free node representation learning in the spectral domain. The inverse filter can be interpreted as an infinite-order polynomial filter, allowing the model to aggregate high-order neighborhood information without layer stacking or explicit message passing. This design helps alleviate over-smoothing by avoiding repeated feature averaging and improves the interpretability of spectral SSL models. Extensive experiments on multiple benchmark datasets demonstrate that IF-GNN achieves competitive or superior performance compared to both spectral and self-supervised baselines, establishing inverse filtering as a new and effective spectral SSL paradigm.