in this paper, we present an efficient method for determining the solution of the stochastic second kind volterra integral equations (svie) by using the taylor expansion method. this method transforms the svie to a linear stochastic ordinary differential equation which needs specified boundary conditions. for determining boundary conditions, we use the integration technique. this technique give...

In the present article, we focus on the numerical approximation of stochastic partial differential equations of Itˆo type with space-time white noise process, in particular, parabolic equations. For each case of additive and multiplicative noise, the numerical solution of stochastic diffusion equations is approximated using two stochastic finite difference schemes and the stability and consiste...

In this paper, we present an efficient method for determining the solution of the stochastic second kind Volterra integral equations (SVIE) by using the Taylor expansion method. This method transforms the SVIE to a linear stochastic ordinary differential equation which needs specified boundary conditions. For determining boundary conditions, we use the integration technique. This technique give...

This paper is concerned with the parameter estimation problem for a class of diffusion process from discrete observations. The approximate likelihood function given by using Riemann sum and an Itˆo to integrals in continuous-time function. consistency maximum estimator asymptotic normality error are proved applying martingale moment inequality, Holder’s Chebyshev B-D-G inequality uniform ergodi...

in the present article, we focus on the numerical approximation of stochastic partial differential equations of itˆo type with space-time white noise process, in particular, parabolic equations. for each case of additive andmultiplicative noise, the numerical solution of stochastic diffusion equations is approximated using two stochastic finite difference schemes and the stability and consisten...

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...