Related papers: On reconstruction of eigenfunctions of Johnson gra…
In this paper, we show that the eigenvalues of certain classes of Cayley graphs are integers. The (n,k,r)-arrangement graph A(n,k,r) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are…
The eigenvalues of the Hamming graph $H(n,q)$ are known to be $\lambda_i(n,q)=(q-1)n-qi$, $0\leq i \leq n$. The characterization of equitable 2-partitions of the Hamming graphs $H(n,q)$ with eigenvalue $\lambda_{1}(n,q)$ was obtained by…
Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edge set by performing as few queries as possible. An algorithm…
In the Graph Reconstruction (GR) problem, the goal is to recover a hidden graph by utilizing some oracle that provides limited access to the structure of the graph. The interest is in characterizing how strong different oracles are when the…
Motivated by problems of mathematical physics (quantum chaos) questions of equidistribution of eigenfunctions of the Laplace operator on a Riemannian manifold have been studied by several authors. We consider here, in analogy with…
We estimate the minimum number of distance queries that is sufficient to reconstruct the binomial random graph $G(n,p)$ with constant diameter with high probability. We get a tight (up to a constant factor) answer for all $p>n^{-1+o(1)}$…
We prove the existence and uniqueness of radial graphs over a given domain of $\mathbb{S}^{n}$ having boundary on the sphere $\mathbb{S}^{n}$ and whose mean curvature at every point equals a prescribed positive function satisfying suitable…
A discrete Schr\"odinger operator of a graph $G$ is a real symmetric matrix whose $i,j$-entry, $i \neq j$, is negative if $\{i,j\}$ is an edge and zero if it is not an edge, while diagonal entries can be any real numbers. The discrete…
In this paper, we investigate three fundamental problems regarding cut complexes of graphs: their realizability, the uniqueness of graph reconstruction from them, and their algorithmic recognition. We define the parameter $m(d,n)$ as the…
We construct, for every even dimensional sphere $S^n$, $n >1$, and every odd integer $k$, a homogeneous polynomial map $f: S^{n}\to S^{n}$ of Brouwer degree $k$ and algebraic degree $2|k|-1$.
We first introduce the percolation problems associated with the graph theoretical concepts of $(k,l)$-sparsity, and make contact with the physical concepts of ordinary and rigidity percolation. We then devise a renormalization…
By utilizing the recently developed hypergraph analogue of Godsil's identity by the second author, we prove that for all $n \geq k \geq 2$, one can reconstruct the matching polynomial of an $n$-vertex $k$-uniform hypergraph from the…
A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We…
In this paper, the theory of functions of one complex variable is explored to study linearly full unramified holomorphic two-spheres with constant curvature in $G(2,n)$ satisfying that the generated harmonic sequence degenerates at position…
For three-body problem, R.Montgomery [3] proved a reconstruction formula which calculates the overall rotation relating two similar triangle configurations if the initial triangular configuration is similar to the configuration formed at…
Using the ideas of supersymmetry and shape invariance we show that the eigenvalues and eigenfunctions of a wide class of noncentral potentials can be obtained in a closed form by the operator method. This generalization considerably extends…
In this study, singular diffusion operator with jump conditions is considered. Integral representations have been derived for solutions that satisfy boundary conditions and jump conditions. Some properties of eigenvalues and eigenfunctions…
In this paper, we study the exact learning problem for weighted graphs, where we are given the vertex set, $V$, of a weighted graph, $G=(V,E,w)$, but we are not given $E$. The problem, which is also known as graph reconstruction, is to…
In the present survey we present some of the recent results concerning the geometry of nodal lines of random Gaussian eigenfunctions (in case of spectral degeneracies) or wavepackets and related issues. The most fundamental example, where…
Graham and Pollak showed that the vertices of any graph $G$ can be addressed with $N$-tuples of three symbols, such that the distance between any two vertices may be easily determined from their addresses. An addressing is optimal if its…