In this paper, we deduce Wiener number of some connected subgraphs in tilings (4, 4, 4, 4) and (4, 6, 12), which are in Archimedean tilings. And compute their average distance.
In this paper, we introduce the study of the general form of stochastic Van der Pol equation (SVDP) under an external excitation described by Gaussian white noise. The study involves the use of Wiener-Chaos expansion ...
Standing on a different view point from Anderson, we prove that the extended Wiener process defined by Anderson satisfies the definition of the Wiener process in standard analysis, for example the Wiener process at ti...
The purpose of this paper is to investigate the behavior of a scale factor for Wiener integrals about the unbounded function , where {a1,a2,...,an} is an orthonormal set of elements in L2[0,T] on the Wiener space C0[0...
The purpose of this paper is to investigate the behavior of a Wiener integral along the curve C of the scale factor ρ > 0 for the Wiener integral ∫C0[0,T]F(ρx)dm(x) about the function defined on the Wiener space C0...
We study a random planar honeycomb lattice model, namely the random double hexagonal chains. This is a lattice system with nonperiodic boundary condition. The Wiener number is an important molecular descriptor based o...
In the present paper we investigate the relationship between Wiener number W, hyper-Wiener number R, Wiener vectors WV, hyper-Wiener vectors HWV, Wiener polynomial H, hyper-Wiener polynomial HH and distance distributi...
The reciprocal complementary Wiener number of a connected graph G is defined as where is the vertex set. is the distance between vertices u and v, and d is the diameter of G. A tree is known as a caterpillar if the re...
Let G be simple connected graph with the vertex and edge sets V (G) and E (G), respectively. The Schultz and Modified Schultz indices of a connected graph G are defined as and , where d (u, v) is the distance between ...
Let be a Gaussian process with stationary increments . Let be a nondecreasing function of t with . This paper aims to study the almost sure behaviour of where with and is an increasing sequence diverging to .