An α-Wiener bridge is a one-parameter generalization of the usual Wiener bridge, where the parameter α > 0 represents a mean reversion force to zero. We generalize the notion of α-Wiener bridges to continuous functions α : [0, T ) → R. We show that if the limit limt↑T α(t) exists and is positive, then a general α-Wiener bridge is in fact a bridge in the sense that it converges to 0 at time T wi...

Let G be a connected graph and let μ(G) = DD(G) − W (G), where DD(G) and W (G) stand for the detour and Wiener numbers of G, respectively. Nadjafi-Arani et al. [Math. Comput. Model. 55 (2012), 1644– 1648] classified connected graphs whose difference between Szeged and Wiener numbers are n, for n = 4, 5. In this paper, we continue their work to prove that for any positive integer n = 1, 2, 4, 6 ...

In this paper, we address the issue of imperfect fading channel estimation in turbo-coded systems. Since turbo codes are influenced in different ways by different components of channel estimation errors, we develop a simplified model which separates the estimation errors of a Wiener-filtered fading channel into the amplitude error and the phase error. The derivations show that the classical Wie...

Abstract We prove a moment identity on the Wiener space that extends the Skorohod isometry to arbitrary powers of the Skorohod integral on the Wiener space. As simple consequences of this identity we obtain sufficient conditions for the Gaussianity of the law of the Skorohod integral and a recurrence relation for the moments of second order Wiener integrals. We also recover and extend the suffi...

The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. In [1], the tree that minimizes the Wiener index among trees of given maximal degree is studied. We characterize trees that achieve the maxim...

Polynomial interpolation can be used to obtain closed formulas for topological indices of infinite series of molecular graphs. The method is discussed and its advantages and limitations are pointed out. This is illustrated on fullerenes C12k+4 and four topological indices: the Wiener index, the edge Wiener index, the eccentric connectivity index, and the reverse Wiener index. The results for th...

The Wiener index of a graph Gis defined as W(G) =1/2[Sum(d(i,j)] over all pair of elements of V(G), where V (G) is the set of vertices of G and d(i, j) is the distance between vertices i and j. In this paper, we give an algorithm by GAP program that can be compute the Wiener index for any graph also we compute the Wiener index of HAC5C7[p, q] and HAC5C6C7[p, q] nanotubes by this program.