相关论文: On reconstruction of eigenfunctions of Johnson gra…
An eigenvalue of a graph $G$ is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. It is well known that a graph $G$ has exactly two main eigenvalues if and only if there exists a unique pair of…
How efficiently can we find an unknown graph using distance queries between its vertices? We assume that the unknown graph is connected, unweighted, and has bounded degree. The goal is to find every edge in the graph. This problem admits a…
We propose an algorithm for robust recovery of the spherical harmonic expansion of functions defined on the d-dimensional unit sphere $\mathbb{S}^{d-1}$ using a near-optimal number of function evaluations. We show that for any $f \in…
The graph projection of a hypergraph is a simple graph with the same vertex set and with an edge between each pair of vertices that appear in a hyperedge. We consider the problem of reconstructing a random $d$-uniform hypergraph from its…
We describe the eigenvalues and the eigenspaces of the adjacency matrices of subgraphs of the Hamming cube induced by Hamming balls, and more generally, by a union of adjacent concentric Hamming spheres. As a corollary, we extend the range…
In this short note we extend an estimate due to J. Simons on the first stability eigenvalue of minimal hypersurfaces in spheres to the singular setting. Specifically, we show that any singular minimal hypersurface in $S^{n+1}$, which is not…
For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…
We obtain new inversion formulas for the Funk type transforms of two kinds associated to spherical sections by hyperplanes passing through a common point $A$ which lies inside the n-dimensional unit sphere or on the sphere itself.…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
We study signals that are sparse in graph spectral domain and develop explicit algorithms to reconstruct the support set as well as partial components from samples on few vertices of the graph. The number of required samples is independent…
The purpose of the present paper is to show that the components of the unit normal of any minimal surface with free boundary in the unit ball, are eigenfunctions associated with the eigenvalue $-2$, for some (new) natural eigenvalue problem…
Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed…
Recently Takens' Reconstruction Theorem was studied in the complex analytic setting by Forn{\ae}ss and Peters \cite{FP}. They studied the real orbits of complex polynomials, and proved that for non-exceptional polynomials ergodic properties…
The Johnson graph $J(n,i)$ is defined to the graph whose vertex set is the set of all $i$-element subsets of $\{1,\ldots,n\}$, and two vertices are joined whenever the cardinality of their intersection is equal to $i-1$. In Ramras and…
We establish $C^{1,1}$-regularity and uniqueness of the first eigenfunction of the complex Hessian operator on strongly $m$-pseudoconvex manifolds, along with a variational formula for the first eigenvalue. From these results, we derive a…
Jakobson and Nadirashvili \cite{JN} constructed a sequence of eigenfunctions on $T^2$ with a bounded number of critical points, answering in the negative the question raised by Yau \cite{Yau1} which asks that whether the number of the…
For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…
For any graph $G$ on $n$ vertices and for any {\em symmetric} subgraph $J$ of $K_{n,n}$, we construct an infinite sequence of graphs based on the pair $(G,J)$. The First graph in the sequence is $G$, then at each stage replacing every…
In this article we pose the problem of existence and uniqueness of convex body for which the projection curvature radius function coincides with given function. We find a necessary and sufficient condition that ensures a positive answer to…
We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…