Related papers: The Inverse Eigenvalue Problem for Linear Trees

In this article, we propose two kinds of neural networks inspired by power method and inverse power method to solve linear eigenvalue problems. These neural networks share similar ideas with traditional methods, in which the differential…

The eigenvalues of the normalized Laplacian matrix of a network plays an important role in its structural and dynamical aspects associated with the network. In this paper, we study the spectra and their applications of normalized Laplacian…

Let $\mathcal T (n, k)$ be the set of the $k$-uniform supertrees with $n$ vertices and $m$ edges, where $k\geq 3$, $n\geq 5$ and $m=\frac{n-1}{k-1}$. % Let $m$ be the number of the edges of the supertrees in $\mathcal T (n, k)$, where…

The inverse eigenvalue problem for real symmetric matrices of the form 0 0 0 . 0 0 * 0 0 0 . 0 * * 0 0 0 . * * 0 . . . . . . . 0 0 * . 0 0 0 0 * * . 0 0 0 * * 0 . 0 0 0 is solved. The solution is shown to be unique. The problem is also…

In the last decades the Moore-Penrose pseudoinverse has found a wide range of applications in many areas of Science and became a useful tool for physicists dealing, for instance, with optimization problems, with data analysis, with the…

The structure of an evolving network contains information about its past. Extracting this information efficiently, however, is, in general, a difficult challenge. We formulate a fast and efficient method to estimate the most likely history…

For a given $3 \times 3$ real matrix $A$, the eigenvalue complementarity problem relative to the Lorentz cone consists of finding a real number $\lambda$ and a nonzero vector $x \in \mathbb{R}^3$ such that $x^T(A-\lambda I)x=0$ and both $x$…

Two results (together with their relatively elementary proofs) are presented. The first one presents the upper boundary on the number of spanning trees in a finite planar multigraph, proving that the complexity (the number of spanning…

In this paper, inverse spectral problems for Sturm-Liouville operators on a tree (a graph without cycles) are studied. We show that if the potential on an edge is known a priori, then b - 1 spectral sets uniquely determine the potential…

A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…

It is proved that the rectilinear crossing number of every graph with bounded tree-width and bounded degree is linear in the number of vertices. **** This paper has been withdrawn by the author. **** The results have been superseeded by the…

This paper studies the "explanation problem" for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensional tree-ordered case. In this paper, one is given a matrix A whose…

In this chapter we provide a theoretically founded investigation of state-of-the-art learning approaches for inverse problems from the point of view of spectral reconstruction operators. We give an extended definition of regularization…

For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…

We define a search problem on trees that closely captures the backtracking behavior of all current practical graph isomorphism algorithms. Given two trees with colored leaves, the goal is to find two leaves of matching color, one in each of…

A vertex of degree one in a tree is called an end vertex and a vertex of degree at least three is called a branch vertex. For a graph $G$, let $\sigma_2$ be the minimum degree sum of two nonadjacent vertices in $G$. We consider tree…

We show, under natural conditions, that uniform rooted trees with fixed degree sequence converge after renormalization toward inhomogeneous continuum random trees (ICRT). We also provide a sharp upper-bound for the tail of their heights. We…

We prove that the multiplicity of a fixed eigenvalue $\alpha$ in a random recursive tree on $n$ vertices satisfies a central limit theorem with mean and variance asymptotically equal to $\mu_{\alpha} n$ and $\sigma^2_{\alpha} n$…

Thanks to a connection between two completely different topics, the classical eigenvalue problem in a finite dimensional real vector space and the Brouwer degree for maps between oriented differentiable real manifolds, we were able to…

We consider a non-compact Riemannian periodic manifold such that the corresponding Laplacian has a spectral gap. By continuously perturbing the periodic metric locally we can prove the existence of eigenvalues in a gap. A lower bound on the…