相关论文: Hodge Decompositions for Weighted Hypergraphs
Higher-Order Hypergraph Learning (HOHL) was recently introduced as a principled alternative to classical hypergraph regularization, enforcing higher-order smoothness via powers of multiscale Laplacians induced by the hypergraph structure.…
Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on…
Cheeger-type inequalities in which the decomposability of a graph and the spectral gap of its Laplacian mutually control each other play an important role in graph theory and network analysis, in particular in the context of expander…
In their homonymous article, Sam Payne and Thomas Willwacher construct a combinatorial graph complex to compute the weight 11 part of the compactly supported cohomology of the moduli space of curves $\cM_{g,n}$ and compute explicitly the…
In a series of recent works, we have generalised the consistency results in the stochastic block model literature to the case of uniform and non-uniform hypergraphs. The present paper continues the same line of study, where we focus on…
Motivated by problems arising in the complex analysis of perturbative quantum field theory, we investigate the homology of finite unions of certain non-degenerate quadratic affine hypersurfaces of complex dimension $n$ in general position.…
The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…
The persistence diagram (PD) is an increasingly popular topological descriptor. By encoding the size and prominence of topological features at varying scales, the PD provides important geometric and topological information about a space.…
Topological data analysis can reveal higher-order structure beyond pairwise connections between vertices in complex networks. We present a new method based on discrete Morse theory to study topological properties of unweighted and…
We introduce higher analytic geometry, a novel framework extending Lurie's derived complex analytic spaces. This theory generalizes classical complex analytic geometry, enabling the study of derived K\"ahler spaces with non-trivial higher…
We consider Laplacians on $\Z^2$-periodic discrete graphs. The following results are obtained: 1) The Floquet-Bloch decomposition is constructed and basic properties are derived. 2) The estimates of the Lebesgue measure of the spectrum in…
The dynamics of large complex systems are predominately modeled through pairwise interactions, the principle underlying structure being a network of the form of a digraph or quiver. Significant success has been obtained in applying the…
We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first…
Building upon the work of Pavel in [P. Kolesnikov, Journal of Mathematical Physics, 56, 7 (2015)], we first present the cohomology of averaging operators on the Lie conformal algebras and use it to develop the cohomology of averaging Lie…
The purpose of this article is to give another molecular decomposition for members of the weighted Hardy spaces.
A mapping $\alpha : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we…
In this work, we theoretically demonstrate that current graph positional encodings (PEs) are not beneficial and could potentially hurt performance in tasks involving heterophilous graphs, where nodes that are close tend to have different…
In this paper the chordal graph structures of polynomial sets appearing in triangular decomposition in top-down style are studied when the input polynomial set to decompose has a chordal associated graph. In particular, we prove that the…
We give a geometric proof of the Decomposition Theorem of Beilinson, Bernstein, Deligne and Gabber for the direct image of the intersection cohomology complex under a proper map of complex algebraic varieties. The method rests on new…
Higher-order relations are widespread in nature, with numerous phenomena involving complex interactions that extend beyond simple pairwise connections. As a result, advancements in higher-order processing can accelerate the growth of…