关于PageRank的广义二级分裂迭代方法

本文研究计算PageRank的迭代法,在Gleich等人提出的内/外迭代方法的基础上,提出了具有三个参数的广义二级分裂迭代法,该方法包含了内/外迭代法和幂迭代法,并研究了该方法的收敛性.基于该方法的收缩因子的计算公式,讨论了迭代参数可能的选择,通过参数的选择能有效提高内/外迭代法的收敛效率.     

Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs

Let be graphs. The multicolor Ramsey number is the minimum integer r such that in every edge‐coloring of by k colors, there is a monochromatic copy of in color i for some . In this paper, we investigate the multicolor Ramsey number , determining the asymptotic behavior up to a polylogarithmic factor for almost all ranges of t and m. Several different constructions are used for the lower bounds, including the random graph and explicit graphs built from finite fields. A technique of Alon and Rödl using the probabilistic method and spectral arguments is employed to supply tight lower bounds. A sample result is for any t and m, where c₁ and c₂ are absolute constants.     

Self-adjointness of unbounded tridiagonal operators and spectra of their finite truncations

This paper addresses two different but related questions regarding an unbounded symmetric tridiagonal operator: its self-adjointness and the approximation of its spectrum by the eigenvalues of its finite truncations. The sufficient conditions given in both cases improve and generalize previously known results. It turns out that, not only self-adjointness helps to study limit points of eigenvalues of truncated operators, but the analysis of such limit points is a key help to prove self-adjointness. Several examples show the advantages of these new results compared with previous ones. Besides, an application to the theory of continued fractions is pointed out.     

Comparison theorems for self‐adjoint linear Hamiltonian eigenvalue problems

In this work we derive new comparison results for (finite) eigenvalues of two self‐adjoint linear Hamiltonian eigenvalue problems. The coefficient matrices depend on the spectral parameter nonlinearly and the spectral parameter is present also in the boundary conditions. We do not impose any controllability or strict normality assumptions. Our method is based on a generalization of the Sturmian comparison theorem for such systems. The results are new even for the Dirichlet boundary conditions, for linear Hamiltonian systems depending linearly on the spectral parameter, and for Sturm–Liouville eigenvalue problems with nonlinear dependence on the spectral parameter.     

Graphs with at most one signless Laplacian eigenvalue exceeding three

We determine all connected graphs with at most one signless Laplacian eigenvalue exceeding three.     

Sign patterns that allow diagonalizability revisited

Characterization of sign patterns that allow diagonalizability has been a long-standing open problem. In this article, necessary and sufficient conditions for a sign pattern to allow diagonalizability are obtained, in terms of allowing related properties. Some properties of normal sign patterns are considered. In particular, it is shown that normal sign patterns of order up to 3 allow diagonalizability. Two combinatorial necessary conditions for a sign pattern to allow diagonalizability are also presented.     

Efimov's Effect in a Model of Perturbation Theory of the Essential Spectrum

A model operator similar to the energy operator of a system with a nonconserved number of particles is studied. The essential spectrum of the operator is described, and under some natural conditions on the parameters it is shown that there are infinitely many eigenvalues lying below the bottom of the essential spectrum.     

Condition of extremum for eigenvalues of elliptic boundary-value problems

In this paper, we consider problems of eigenvalue optimization for elliptic boundary-value problems. The coefficients of the higher derivatives are determined by the internal characteristics of the medium and play the role of control. The necessary conditions of the first and second order for problems of the first eigenvalue maximization are presented. In the case where the maximum is reached on a simple eigenvalue, the second-order condition is formulated as completeness condition for a system of functions in Banach space. If the maximum is reached on a double eigenvalue, the necessary condition is presented in the form of linear dependence for a system of functions. In both cases, the system is comprised of the eigenfunctions of the initial-boundary value problem. As an example, we consider the problem of maximization of the first eigenvalue of a buckling column that lies on an elastic foundation.     

Estimates for the Eigenvalues of Matrices

For matrices whose eigenvalues are real (such as Hermitian or real symmetric matrices), we derive simple explicit estimates for the maximal (λ_max) and the minimal (λ_min) eigenvalues in terms of determinants of order less than 3. For 3 × 3 matrices, we derive sharper estimates, which use det A but do not require to solve cubic equations.