This paper is devoted to the nonparametric goodness-of-fit test for integrated diffusion processes. Firstly, a nonparametric test is constructed for testing whether the drift function of a integrated diffusion process is of a known parametric form with unknown parameters. Secondly, a test statistic for goodness-of-fit test is obtained by applying the empirical likelihood technique. And finally, the asymptotic distribution of the test statistic is established, and then the proposed test method is applied to an example to verify its effectiveness.
In the resource scheduling network, the availability of resource scheduling is equivalent to the existence of the fractional factor in the corresponding network graph. The study on the existence of fractional factors in specific graph structure can help engineers design and construct the network with efficient use of resources. A graph $G$ is called an all fractional $(g,f,n',m)$-critical deleted graph if after removing any $n'$ vertices from $G$ the remaining graph is still an all fractional $(g,f,m)$-deleted graph. In this paper, we present two binding number conditions for a graph to be an all fractional $(g,f,n',m)$-critical deleted graph, and illustrate the results are sharp with examples.
For a simple graph $G$ with edge set $E(G)$, the exponential inverse forgotten index of $G$ is defined as ~$e^{\frac{1}{\mathcal{F}}}(G)=\sum_{uv\in E(G)}e^{\left(\frac{1}{{d_G^2(u)}}+\frac{1}{{d_G^2(v)}}\right)}$, where $d_G(u)$ is the degree of the vertex $u$ in $G$. In this paper, firstly, we give the minimum value of exponential inverse forgotten index of a tree and determine its corresponding extremal graph. Then, we investigate the maximum value of the exponential inverse forgotten index and describe the structural characteristics of the extremal graph.