We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between source and target node directed weighted network. The does not require any matrix inversion, it takes as only input transition probabilities into node. It is derived from calculation average resolvent deformed ensemble sub-stochastic matrices $H=\langle H\rangle +\delta H$, with $\langle H\r...

An attractive candidate for the geometric mean of m positive definite matrices A1, . . . , Am is their Riemannian barycentre G. One of its important properties, monotonicity in the m arguments, has been established recently by J. Lawson and Y. Lim. We give a much simpler proof of this result, and prove some other inequalities. One of these says that, for every unitarily invariant norm, |||G||| ...

Let G = (V, E) be simple graphs, as graphs which have no loops or parallel edges such that V is a finite set of vertices and E is a set of edges. A weighted graph is a graph each edge of which has been assigned to a square matrix called the weight of the edge. All the weightmatrices are assumed to be of same order and to be positive matrix. In this paper, by “weighted graph” we mean “a weighted...

In the present paper, the ne spectrum of the Zweier matrix as anoperator over the weighted sequence space `p(w); have been examined.

This paper deals with the application of the weighted mixed regression estimation of the coe cients in a linear model when some values of some of the regressors are missing Taking the weight factor as an arbitrary scalar the performance of weighted mixed regression estimator in relation to the conventional least squares and mixed regression estimators is analyzed and the choice of scalar is dis...