共查询到18条相似文献,搜索用时 78 毫秒
1.
构造了随机自相似分形及其上的记忆函数,并得出了有关结论,在此基础上,我们可以定义一个随机概率测度dΦn(τ)=Kn(τ)dτ,Φn(τ)弱收敛于Φ,进一步可得到强测度序列Ψn(.)=EΦn(.),则{Ψn}弱收敛于Ψ=EΦ. 相似文献
2.
相应于随机自相似分形的记忆函数和分数次积分 总被引:2,自引:0,他引:2
For a physics system which exhibits memory, if memory is preserved only at points of random self-similar fractals, we define random memory functions and give the connection between the expectation of flux and the fractional integral. In particular, when memory sets degenerate to Cantor type fractals or non-random self-similar fractals our results coincide with that of Nigmatullin and Ren et al. . 相似文献
3.
设犡是一完备可分度量空间,犓(ω)为Graf随机模型下的随机递归集.该文构造了一列随机不变测度μ狀(狀≥1),它们是Hutchinson确定模型下不变测度的推广;证明了存在一随机概率测度μ ,使得Suppμ =犓(ω)且μ狀→μ (狀→∞)(弱收敛);得到了μ狀的一些局部性质. 相似文献
4.
本文讨论取位于Banach空间的对称、独立和可控的随机测度的收敛性,Vitali-HahnSake定理,Skorokhod定理以及由Hoffman-Jorgensen-Pisier提出的关于这种测度的中心极限定理. 相似文献
5.
本文讨论了由随机归结构所决定的统计自相似测度的局部性质,证明了统计自相似测度在多重fractal分解的意义为平凡的,作为基推论,得到了随机相似集的packing维数。 相似文献
6.
7.
8.
随机次自相似集的表示 总被引:2,自引:0,他引:2
本文引进了随机次自相似集与随机推移集的概念,讨论了随机次自相似集的结构,并证明了任一随机集是随机次自相似集的充分必要条件是:该随机集可以表为某一个随机推移集的某个像集。 相似文献
9.
徐赐文 《数学年刊A辑(中文版)》2000,(1)
本文构造了一类多型随机递归集K,并利用 Falconer的方法[1]获得了K的重分形分解集Ka(a>0)的Hausdorff维数和Packing维数. 相似文献
10.
多型随机递归集关于统计自相似测度的Multifractal分解 总被引:2,自引:0,他引:2
本文构造了一类多型随机递归集K,并利用Falconer的方法[1]获得了K的重分形分解集Kα(α>0)的Hausdorff维数和Packing维数. 相似文献
11.
Mao Wei 《Applied mathematics and computation》2009,212(2):409-417
We study the following stochastic differential delay equations driven by Poisson random jump measure
12.
Alexander D. Kolesnik 《Journal of Theoretical Probability》2001,14(2):485-494
The weak convergence of the distributions of a symmetrical random evolution in a plane controlled by a continuous-time homogeneous Markov chain with n, n3, states to the distribution of a two-dimensional Brownian motion, as the intensity of transitions tends to infinity, is proved. 相似文献
13.
Sergio Albeverio Yana Gontcharenko Mykola Pratsiovytyi Grygoriy Torbin 《Mathematische Nachrichten》2006,279(15):1619-1633
Formulas are given for the Lebesgue measure and the Hausdorff–Besicovitch dimension of the minimal closed set Sξ supporting the distribution of the random variable ξ = 2–k τk, where τk are independent random variables taking the values 0, 1, 2 with probabilities p 0k , p 1k , p 2k , respectively. A classification of the distributions of the r.v. ξ via the metric‐topological properties of Sξ is given. Necessary and sufficient conditions for superfractality and anomalous fractality of Sξ are found. It is also proven that for any real number a 0 ∈ [0, 1] there exists a distribution of the r.v. ξ such that the Hausdorff–Besicovitch dimension of Sξ is equal to a 0. The results are applied to the study of the metric‐topological properties of the convolutions of random variables with independent binary digits, i.e., random variables ξi = , where ηk are independent random variables taking the values 0 and 1. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
14.
We provide a characterization of compactness in the spaceD of functions of two variables defined on a unit square. The functions fromD have the property that their discontinuity points lie on smooth curves. Conditions for the tightness of probability measures inD and conditions for weak convergence of random fields with trajectories inD are derived. Vilnius Gediminas Technical University, Saulétekio 11; Institute of Mathematics and Informatics, Akademijos 4, 2600 Vilnius, Lithuania. Translated from Lietuvos Matematikos Rinkinys, Vol. 39, No. 2, pp 169–184, April–June, 1999. Translated by R. Banys 相似文献
15.
N. Baba 《Journal of Optimization Theory and Applications》1981,33(4):451-461
Matyas' random optimization method (Ref. 1) is applied to the constrained nonlinear minimization problem, and its convergence properties are studied. It is shown that the global minimum can be found with probability one, even if the performance function is multimodal (has several local minima) and even if its differentiability is not ensured.The author would like to thank Professors Y. Sawaragi (Kyoto University), T. Soeda (Tokushima University), and T. Shoman (Tokushima University) for their kind advice. 相似文献
16.
E. Manstavičius 《Lithuanian Mathematical Journal》1999,39(4):393-407
Using additive functions defined on the combinatorial structure of all mappings of anN set into itself, we define paths in the space
endowed with the Skorokhod topology. Taking a mapping with equal probability, we get a sequence of random processes. Necessary
and sufficient conditions for the weak convergence of this sequence to a stochastic process with independent increments are
established. It is shown that the class of such processes contains all possible limits, provided that, on the components of
a mapping, the additive functions have values small in average.
Partially supported by the Lithuanian State Science and Studies Foundation.
Vilnius University, Naugarduko 24, 2006 Vilnius, Lithuania. Translated from Lietuvos Matematikos Rinkinys, Vol. 39, No. 4,
pp. 498–516, October–December, 1999.
Translated by E. Manstavičius 相似文献
17.
Thomas M. Lewis 《Journal of Theoretical Probability》1992,5(4):629-659
LetX,X
i
,i1, be a sequence of i.i.d. random vectors in
d
. LetS
o=0 and, forn1, letS
n
=X
1+...+X
n
. LetY,Y(),
d
, be i.i.d. -valued random variables which are independent of theX
i
. LetZ
n
=Y(S
o
)+...+Y(S
n
). We will callZ
n arandom walk in random scenery.In this work, we consider the law of the iterated logarithm for random walk in random sceneries. Under fairly general conditions, we obtain arandomly normalized law of the iterated logarithm.Supported in part by NSF Grants DMS-85-21586 and DMS-90-24961. 相似文献