It is proved that the Green’s function of the simple random walk on a surface group of large genus decays exponentially in distance at the (inverse) spectral radius. It is also shown that Ancona’s inequalities extend to the spectral radius R, and therefore that the Martin boundary for R−potentials coincides with the natural geometric boundary S. This implies that the Green’s function obeys a po...

We relate some minimax functions of matrices to some spectral functions of matrices. If A is a nonnegative n X n matrix, v(A) is the gametheoretic value of A, and p(A) is the spectral radius of A, then v(A) < p(A). Necessary and sufficient conditions for v(A) = p(A) are given. It follows that if A is nonnegative and irreducible and n > 1, then v(A) < p(A). Also, if, for a real matrix A and a po...

We study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that of all the connected graphs with n vertices and k cut edges, the maximal spectral radius is obtained uniquely at Kk n , where K k n is a graph obtained by joining k independent vertices to one vertex of Kn−k . We also discuss the limit point of the maximal spectral radius. © 2004 Elsevier Inc. Al...

We introduce a new spectral method for the retrieval of optical thickness and effective radius from cloud transmittance that relies on the spectral slope of the normalized transmittance between 1565 nm and 1634 nm, and on cloud transmittance at a visible wavelength. The standard dual-wavelength technique, which is traditionally used in reflectance-based retrievals, is ill-suited for transmittan...

We consider a multidimensional optimization problem in the framework of tropical mathematics. The problem is formulated to minimize a nonlinear objective function that is defined on vectors in a finitedimensional semimodule over an idempotent semifield and calculated by means of multiplicative conjugate transposition. We offer two complete direct solutions to the problem. The first solution con...

For decades considerable efforts have been exerted to resolve the inverse eigenvalue problem for nonnegative matrices. Yet fundamental issues such as the theory of existence and the practice of computation remain open. Recently it has been proved that, given an arbitrary (n − 1)-tuple L = (λ2, . . . , λn) ∈ C n−1 whose components are closed under complex conjugation, there exists a unique posit...

In 1962, Erdős gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number, and minimum degree of graphs which generalized Ore’s theorem. One year later, Moon and Moser gave an analogous result for Hamilton cycles in balanced bipartite graphs. In this paper we present the spectral analogues of Erdős’ theorem and Moon-Moser’s theorem, respectively. Let Gk n be the ...

In this paper we use preferred and quasi-preferred bases of generalized eigenspaces associated with the spectral radius of nonnegative matrices to analyze the existence and uniqueness of a variant of the Jordan canonical form which we call FrobeniusJordan form. It is a combination of the classical Jordan canonical form in the part associated with the eigenvalues that are different from the spec...

The spectral radius of the adjacency matrix can impact both algorithmic efficiency as well as the stability of solutions to an underlying dynamical process. Although much research has considered the distribution of the spectral radius for undirected random graph models, as symmetric adjacency matrices are amenable to spectral analysis, very little work has focused on directed graphs. Consequent...