[PDF] Top 20 vol18_pp719-734. 301KB Jun 04 2011 12:06:05 AM

... The problem of characterizing all graphs G with η(G) > 0 was posed in [1] and [10]. This problem is relevant in many disciplines of science (see [2, 3]), and is very difficult. At present, only some particular cases are ... Lihat dokumen lengkap

... Since M −matrices, Dashnic-Zusmanovich matrices, strictly generalized doubly diagonally dominant matrices and strictly or irreducibly diagonally dominant ma- trices are all H −matrices (see, e.g., [1, pp. 132-161], [10], ... Lihat dokumen lengkap

... 11, 12, 13, 14, 15, 17] (we have given here just a few references and we did not mention papers that are concerned with algebraic reflexivity of linear spaces of ... Lihat dokumen lengkap

... LetGbe a connected non-regular graph withnvertices, maximum degree ∆ and minimum degreeδ, and letλ1be the greatest eigenvalue of the adjacency matrix ofG.. In this paper, by studying t[r] ... Lihat dokumen lengkap

... , n, find necessary and sufficient conditions for the existence of an n×n matrix A of the form 1.1, such that λ1j andλjj are respectively, the minimal and maximal eigenvalues of the j×j[r] ... Lihat dokumen lengkap

... Suppose thatAis nonsingular, and compute Zθ :=A+eiθadjA∗ which is a positive scalar multiple of the unitary factor of A corresponding to the positive definite factorH = A∗A1/2 of a un[r] ... Lihat dokumen lengkap

... The problem of finding explicit representations for the Drazin inverse of a general 2 × 2 block matrix in terms of its blocks was posed by Campbell and Meyer in [2]. Since then, special cases of this problem have been ... Lihat dokumen lengkap

... We shall use the following conventions throughout the paper: Let T :Rp →Rn be a nonzero linear operator and let [T] = [tij] denote the matrix representation ofT with respect to the stand[r] ... Lihat dokumen lengkap

... In this paper we consider Moore-Penrose invertible or both Moore-Penrose invertible and group invertible elements in rings with involution to characterize partial isometries, EP and star[r] ... Lihat dokumen lengkap

... Bootstrap percolation has been studied both rigorously and numerically [1; 2; 3; 17], both in its own right and as a tool to analyze other models [5; 6; 7; 8; 9]. An important property is that, asymptotically as p → 0, ... Lihat dokumen lengkap

... Newman, Moore and Watts (12), (13) proposed an idealized version, in which the lattice is replaced by a circle and distance along the circle is the usual arc length, shortcuts now being added between random pairs ... Lihat dokumen lengkap

... ELA ON THE CHARACTERIZATION OF GRAPHS WITH PENDENT VERTICES AND GIVEN NULLITY∗ BOLIAN LIU†, YUFEI HUANG†,AND SIYUAN CHEN† Abstract.. The nullity of G, denoted by ηG, is the multiplic[r] ... Lihat dokumen lengkap

... ELECTRONIC COMMUNICATIONS in PROBABILITY A PROBABILISTIC PROOF OF A WEAK LIMIT LAW FOR THE NUMBER OF CUTS NEEDED TO ISOLATE THE ROOT OF A RANDOM RECURSIVE TREE ALEX IKSANOV National [r] ... Lihat dokumen lengkap

... Hence, fort′l=2q−l 1logml+1, it follows that liml→∞Φrtl′ =0, and behaves asymptotically, asl becomes large, in the same way as for the Poisson occupancy scheme with a single block ofml [r] ... Lihat dokumen lengkap

... ELECTRONIC COMMUNICATIONS in PROBABILITY FIRST-PASSAGE PERCOLATION RATES ON WIDTH-TWO STRETCHES WITH EXPONENTIAL LINK WEIGHTS ECKHARD SCHLEMM Zentrum Mathematik, Technische Universitä[r] ... Lihat dokumen lengkap

... Journal URL http://www.math.washington.edu/~ejpecp/ The maximum of Brownian motion minus a parabola Piet Groeneboom∗ Abstract We derive a simple integral representation for the dist[r] ... Lihat dokumen lengkap

... This means that we can treat the population inBℓN in the time interval [t0,0] as a two-level branching system critical at the family level and subcritical at the individual level with s[r] ... Lihat dokumen lengkap

... These results concern only rough rates of decay of the negative exponential moments of the mass of visited sites, and not specific asymptotic values. The letters c and C which appear in several of the proofs below will be ... Lihat dokumen lengkap

... The results show that our nonparametric estimation method provides an effective solution to the nonlinear filtering problem for reflecting diffusions in random environments.. Appendix: P[r] ... Lihat dokumen lengkap

... In Markov chain Monte Carlo (MCMC) a Markov kernel K is devised in an attempt to sample approximately from its stationary distribution π. Then the rate of convergence to stationarity could determine the Markov chain ... Lihat dokumen lengkap