Related papers: Hodge Laplacians on Weighted Simplicial Complexes:…
We associate (under a minor assumption) to any analytic isolated singularity of dimension $n\geq 2$ the `analytic lattice cohomology' ${\mathbb H}^*_{an}=\oplus_{q\geq 0}{\mathbb H}^q_{an}$. Each ${\mathbb H}^q_{an}$ is a graded ${\mathbb…
The homology groups of a simplicial complex reveal fundamental properties of the topology of the data or the system and the notion of topological stability naturally poses an important yet not fully investigated question. In the current…
The paper describes an explicit combinatorial formula for a harmonic vector for the Laplacian of a directed graph with arbitrary edge weights. This result was motivated by questions from mathematical economics, and the formula plays a…
In this paper, we characterize all graphs with eigenvectors of the signless Laplacian and adjacency matrices with components equal to $\{- 1, 0, 1\}.$ We extend the graph parameter max $k$-cut to square matrices and prove a general sharp…
We apply the techniques of our previous paper to study joint eigenfunctions of the Laplacian and one Hecke operator on compact congruence surfaces, and joint eigenfunctions of the two partial Laplacians on compact quotients of…
We define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…
We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…
We study higher order tangents and higher order Laplacians on p.c.f. self-similar sets with fully symmetric structures, such as $D3$ or $D4$ symmetric fractals. Firstly, let $x$ be a vertex point in the graphs that approximate the fractal,…
We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…
We show that if a simplicial complex is a near-cone of sufficiently high depth, then the only maximum families of small pairwise intersecting faces are those with a common intersection. Thus, near-cones of sufficiently high depth satisfy…
We study the most general class of eigenfunction expansions for abstract normal operators with pure point spectrum in a complex Hilbert space. We find sufficient conditions for such expansions to be unconditionally convergent in spaces with…
Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…
The goal of this article is to survey various results concerning stochastic completeness of graphs. In particular, we present a variety of formulations of stochastic completeness and discuss how a discrepancy between uniqueness class and…
Our previous multiscale graph basis dictionaries/graph signal transforms -- Generalized Haar-Walsh Transform (GHWT); Hierarchical Graph Laplacian Eigen Transform (HGLET); Natural Graph Wavelet Packets (NGWPs); and their relatives -- were…
The combination of persistent homology and discrete Morse theory has proven very effective in visualizing and analyzing big and heterogeneous data. Indeed, topology provides computable and coarse summaries of data independently from…
In this paper, we obtain a new abstract formula relating eigenvalues of a self-adjoint operator to two families of symmetric and skew-symmetric operators and their commutators. This formula generalizes earlier ones obtained by Harrell,…
We present a method of general applicability for finding exact or accurate approximations to bond percolation thresholds for a wide class of lattices. To every lattice we sytematically associate a polynomial, the root of which in $[0,1]$ is…
Using the notion of order convergent nets, we develop an order-theoretic approach to differentiable functions on Archimedean complex $\Phi$-algebras. Most notably, we improve the Cauchy-Hadamard formulas for universally complete complex…
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in…
Factorization method is developed for a family of discretely spiked harmonic oscillators. Two sets of intertwining and ladder operators are presented to algebraically generate eigenstates with energies isomorphic to those of the ordinary…