首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let {X(t):tRd} be a multivariate operator-self-similar random field with values in Rm. Such fields were introduced in [22] and satisfy the scaling property {X(cEt):tRd}=d{cDX(t):tRd} for all c>0, where E is a d×d real matrix and D is an m×m real matrix. We solve an open problem in [22] by calculating the Hausdorff dimension of the range and graph of a trajectory over the unit cube K=[0,1]d in the Gaussian case. In particular, we enlighten the property that the Hausdorff dimension is determined by the real parts of the eigenvalues of E and D as well as the multiplicity of the eigenvalues of E and D.  相似文献   

2.
For a martingale M starting at x with final variance σ2, and an interval (a,b), let Δ=b?aσ be the normalized length of the interval and let δ=|x?a|σ be the normalized distance from the initial point to the lower endpoint of the interval. The expected number of upcrossings of (a,b) by M is at most 1+δ2?δ2Δ if Δ21+δ2 and at most 11+(Δ+δ)2 otherwise. Both bounds are sharp, attained by Standard Brownian Motion stopped at appropriate stopping times. Both bounds also attain the Doob upper bound on the expected number of upcrossings of (a,b) for submartingales with the corresponding final distribution. Each of these two bounds is at most σ2(b?a), with equality in the first bound for δ=0. The upper bound σ2 on the length covered by M during upcrossings of an interval restricts the possible variability of a martingale in terms of its final variance. This is in the same spirit as the Dubins & Schwarz sharp upper bound σ on the expected maximum of M above x, the Dubins & Schwarz sharp upper bound σ2 on the expected maximal distance of M from x, and the Dubins, Gilat & Meilijson sharp upper bound σ3 on the expected diameter of M.  相似文献   

3.
This article considers equations of Kolmogorov Petrovskii Piscunov type in one space dimension, with stochastic perturbation:
?tu=κ2uxx+u(1?u)dt+?u?tζu0(x)=1(?,?1Nlog2)(x)+12e?Nx1[?1Nlog2,+)(x)
where the stochastic differential is taken in the sense of Itô and ζ is a Gaussian random field satisfying Eζ=0 and Eζ(s,x)ζ(t,y)=(st)Γ(x?y). Two situations are considered: firstly, ζ is simply a standard Wiener process (i.e. Γ1): secondly, ΓC(R) with lim|z|+|Γ(z)|=0.The results are as follows: in the first situation (standard Wiener process: i.e. Γ(x)1), there is a non-degenerate travelling wave front if and only if ?22<1, with asymptotic wave speed max2κ(1??22),1N(1??22)+κN21{N<2κ(1??22)}; the noise slows the wave speed. If the stochastic integral is taken instead in the sense of Stratonovich, then the asymptotic wave speed is the classical McKean wave speed and does not depend on ?.In the second situation (noise with spatial covariance which decays to 0 at ±, stochastic integral taken in the sense of Itô), a travelling front can be defined for all ?>0. Its average asymptotic speed does not depend on ? and is the classical wave speed of the unperturbed KPP equation.  相似文献   

4.
5.
A sharp version of the Balian–Low theorem is proven for the generators of finitely generated shift-invariant spaces. If generators {fk}k=1K?L2(Rd) are translated along a lattice to form a frame or Riesz basis for a shift-invariant space V, and if V has extra invariance by a suitable finer lattice, then one of the generators fk must satisfy Rd|x||fk(x)|2dx=, namely, fk??H1/2(Rd). Similar results are proven for frames of translates that are not Riesz bases without the assumption of extra lattice invariance. The best previously existing results in the literature give a notably weaker conclusion using the Sobolev space Hd/2+?(Rd); our results provide an absolutely sharp improvement with H1/2(Rd). Our results are sharp in the sense that H1/2(Rd) cannot be replaced by Hs(Rd) for any s<1/2.  相似文献   

6.
《Applied Mathematics Letters》2005,18(11):1286-1292
First a general model for two-step projection methods is introduced and second it has been applied to the approximation solvability of a system of nonlinear variational inequality problems in a Hilbert space setting. Let H be a real Hilbert space and K be a nonempty closed convex subset of H. For arbitrarily chosen initial points x0,y0K, compute sequences {xk} and {yk} such that xk+1=(1ak)xk+akPK[ykρT(yk)]for ρ>0yk=(1bk)xk+bkPK[xkηT(xk)]for η>0, where T:KH is a nonlinear mapping on K,PK is the projection of H onto K, and 0ak,bk1. The two-step model is applied to some variational inequality problems.  相似文献   

7.
For any polynomial f of F2n[x] we introduce the following characteristic of the distribution of its second order derivative, which extends the differential uniformity notion:
δ2(f):=maxαF2n?,αF2n?,βF2nαα??{xF2n|Dα,α2f(x)=β}
where Dα,α2f(x):=Dα(Dαf(x))=f(x)+f(x+α)+f(x+α)+f(x+α+α) is the second order derivative. Our purpose is to prove a density theorem relative to this quantity, which is an analogue of a density theorem proved by Voloch for the differential uniformity.  相似文献   

8.
This paper addresses the exponential stability of the trivial solution of some types of evolution equations driven by Hölder continuous functions with Hölder index greater than 1/2. The results can be applied to the case of equations whose noisy inputs are given by a fractional Brownian motion BH with covariance operator Q, provided that H(1/2,1) and tr(Q) is sufficiently small.  相似文献   

9.
10.
The k-restricted arc connectivity of digraphs is a common generalization of the arc connectivity and the restricted arc connectivity. An arc subset S of a strong digraph D is a k-restricted arc cut if D?S has a strong component D with order at least k such that D?V(D) contains a connected subdigraph with order at least k. The k-restricted arc connectivity λk(D) of a digraph D is the minimum cardinality over all k-restricted arc cuts of D.Let D be a strong digraph with order n6 and minimum degree δ(D). In this paper, we first show that λ3(D) exists if δ(D)3 and, furthermore, λ3(D)ξ3(D) if δ(D)4, where ξ3(D) is the minimum 3-degree of D. Next, we prove that λ3(D)=ξ3(D) if δ(D)n+32. Finally, we give examples showing that these results are best possible in some sense.  相似文献   

11.
12.
In this article, we study the nonexistence of solution with finite Morse index for the following Choquard type equation-△u=∫RN|u(y)|p|x-y|αdy|u(x)|p-2u(x) in RN where N ≥ 3, 0 α min{4, N}. Suppose that 2 p (2 N-α)/(N-2),we will show that this problem does not possess nontrivial solution with finite Morse index. While for p=(2 N-α)/(N-2),if i(u) ∞, then we have ∫_RN∫_RN|u(x)p(u)(y)~p/|x-y|~α dxdy ∞ and ∫_RN|▽u|~2 dx=∫_RN∫_RN|u(x)p(u)(y)~p/|x-y|~αdxdy.  相似文献   

13.
14.
This paper develops systematically the stochastic calculus via regularization in the case of jump processes. In particular one continues the analysis of real-valued càdlàg weak Dirichlet processes with respect to a given filtration. Such a process is the sum of a local martingale and an adapted process A such that [N,A]=0, for any continuous local martingale N. Given a function u:[0,T]×RR, which is of class C0,1 (or sometimes less), we provide a chain rule type expansion for u(t,Xt) which stands in applications for a chain Itô type rule.  相似文献   

15.
16.
In this work, we prove the existence of convex solutions to the following k-Hessian equation
Sk[u]=K(y)g(y,u,Du)
in the neighborhood of a point (y0,u0,p0)Rn×R×Rn, where gC,g(y0,u0,p0)>0, KC is nonnegative near y0, K(y0)=0 and Rank(Dy2K)(y0)n?k+1.  相似文献   

17.
18.
19.
In this paper, we study the classification and evolution of bifurcation curves of positive solutions for the one-dimensional Minkowski-curvature problem
{?(u/1?u2)=λf(u), in (?L,L),u(?L)=u(L)=0,
where λ,L>0, fC[0,)C2(0,) and f(u)>0 for u0. Furthermore, we show that, for sufficiently large L>0, the bifurcation curve SL may have arbitrarily many turning points. Finally, we apply these results to obtain the global bifurcation diagrams for Ambrosetti–Brezis–Cerami problem, Liouville–Bratu–Gelfand problem and perturbed Gelfand problem with the Minkowski-curvature operator, respectively. Moreover, we will make two lists which show the different properties of bifurcation curves for Minkowski-curvature problems, corresponding semilinear problems and corresponding prescribed curvature problems.  相似文献   

20.
Very recently, Thomassé et al. (2017) have given an FPT algorithm for Weighted Independent Set in bull-free graphs parameterized by the weight of the solution, running in time 2O(k5)?n9. In this article we improve this running time to 2O(k2)?n7. As a byproduct, we also improve the previous Turing-kernel for this problem from O(k5) to O(k2). Furthermore, for the subclass of bull-free graphs without holes of length at most 2p?1 for p3, we speed up the running time to 2O(k?k1p?1)?n7. As p grows, this running time is asymptotically tight in terms of k, since we prove that for each integer p3, Weighted Independent Set cannot be solved in time 2o(k)?nO(1) in the class of {bull,C4,,C2p?1}-free graphs unless the ETH fails.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号