Let Fn = (F1,n, ...., Fd,n), n > 1, be a sequence of random vectors such that, for every j = 1, ..., d, the random variable Fj,n belongs to a fixed Wiener chaos of a Gaussian field. We show that, as n → ∞, the components of Fn are asymptotically independent if and only if Cov(F 2 i,n, F 2 j,n) → 0 for every i 6= j. Our findings are based on a novel inequality for vectors of multiple Wiener-Itô ...

In this paper, we study the asymptotic properties of the upper and lower tail probabilities of the maximum local time L∗(t) of Wiener process (Brownian motion), and obtain some precise asymptotics in the law of the iterated logarithm and the Chungs-type laws of the iterated logarithm for the supremum of Wiener local time L(x; t); x∈R; t ∈R+. c © 2003 Elsevier B.V. All rights reserved. MSC: 60F1...

Let G and H be two graphs. The corona product G o H is obtained by taking one copy of G and |V(G)| copies of H; and by joining each vertex of the i-th copy of H to the i-th vertex of G, i = 1, 2, …, |V(G)|. In this paper, we compute PI and hyper–Wiener indices of the corona product of graphs.

We prove sufficient conditions, ensuring that a sequence of multiple Wiener-Itô integrals (with respect to a general Gaussian process) converges stably to a mixture of normal distributions. Our key tool is an asymptotic decomposition of contraction kernels, realized by means of increasing families of projection operators. We also use an infinite-dimensional Clark-Ocone formula, as well as a ver...

The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the elementary properties of this polynomial and compute it for some common graphs. We then find a formula for the Wiener polynomial of a dendrimer, a certain highly...

Network structures are everywhere, including but not limited to applications in biological, physical and social sciences, information technology, and optimization. Network robustness is of crucial importance in all such applications. Research on this topic relies on finding a suitable measure and use this measure to quantify network robustness. A number of distance-based graph invariants, also ...

the wiener index w(g) of a connected graph g is defined as the sum of the distances betweenall unordered pairs of vertices of g. the eccentricity of a vertex v in g is the distance to avertex farthest from v. in this paper we obtain the wiener index of a graph in terms ofeccentricities. further we extend these results to the self-centered graphs.

Complex networks are ubiquitous in biological, physical and social sciences. Network robustness research aims at finding a measure to quantify network robustness. A number of Wiener type indices have recently been incorporated as distance-based descriptors of complex networks. Wiener type indices are known to depend both on the network's number of nodes and topology. The Wiener polarity index i...

The reverse Wiener index of a connected graph G is defined as Λ(G) = 1 2 n(n− 1)d−W (G), where n is the number of vertices, d is the diameter, and W (G) is the Wiener index (the sum of distances between all unordered pairs of vertices) of G. We determine the n-vertex non-starlike trees with the first four largest reverse Wiener indices for n > 8, and the nvertex non-starlike non-caterpillar tre...