首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
We consider subordinators Xα=(Xα(t))t0 in the domain of attraction at 0 of a stable subordinator (Sα(t))t0 (where α(0,1)); thus, with the property that Π¯α, the tail function of the canonical measure of Xα, is regularly varying of index ?α(?1,0) as x0. We also analyse the boundary case, α=0, when Π¯α is slowly varying at 0. When α(0,1), we show that (tΠ¯α(Xα(t)))?1 converges in distribution, as t0, to the random variable (Sα(1))α. This latter random variable, as a function of α, converges in distribution as α0 to the inverse of an exponential random variable. We prove these convergences, also generalised to functional versions (convergence in D[0,1]), and to trimmed versions, whereby a fixed number of its largest jumps up to a specified time are subtracted from the process. The α=0 case produces convergence to an extremal process constructed from ordered jumps of a Cauchy subordinator. Our results generalise random walk and stable process results of Darling, Cressie, Kasahara, Kotani and Watanabe.  相似文献   

2.
This paper studies the nonlinear stochastic partial differential equation of fractional orders both in space and time variables: ?β+ν2(?Δ)α2u(t,x)=Itγρ(u(t,x))W?(t,x),t>0,xRd,where W? is the space–time white noise, α(0,2], β(0,2), γ0 and ν>0. Fundamental solutions and their properties, in particular the nonnegativity, are derived. The existence and uniqueness of solution together with the moment bounds of the solution are obtained under Dalang’s condition: d<2α+αβmin(2γ?1,0). In some cases, the initial data can be measures. When β(0,1], we prove the sample path regularity of the solution.  相似文献   

3.
Let (Wn(θ))nN0 be Biggins’ martingale associated with a supercritical branching random walk, and let W(θ) be its almost sure limit. Under a natural condition for the offspring point process in the branching random walk, we show that if the law of W1(θ) belongs to the domain of normal attraction of an α-stable distribution for some α(1,2), then, as n, there is weak convergence of the tail process (W(θ)?Wn?k(θ))kN0, properly normalized, to a random scale multiple of a stationary autoregressive process of order one with α-stable marginals.  相似文献   

4.
The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has L requests to transmit and is idle, it tries to access the channel at a rate proportional to log(1+L). A stochastic model of such an algorithm is investigated in the case of the star network, in which J nodes can transmit simultaneously, but interfere with a central node 0 in such a way that node 0 cannot transmit while one of the other nodes does. One studies the impact of the log policy on these J+1 interacting communication nodes. A fluid scaling analysis of the network is derived with the scaling parameter N being the norm of the initial state. It is shown that the asymptotic fluid behavior of the system is a consequence of the evolution of the state of the network on a specific time scale (Nt,t(0,1)). The main result is that, on this time scale and under appropriate conditions, the state of a node with index j1 is of the order of Naj(t), with 0aj(t)<1, where t?aj(t) is a piecewise linear function. Convergence results on the fluid time scale and a stability property are derived as a consequence of this study.  相似文献   

5.
We consider a dynamic random graph on n vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction αn of the edges. We are interested in the mixing time of a random walk without backtracking on this dynamic random graph in the limit as n, when αn is chosen such that limnαn(logn)2=β[0,]. In Avena et al. (2018) we found that, under mild regularity conditions on the degree sequence, the mixing time is of order 1αn when β=. In the present paper we investigate what happens when β[0,). It turns out that the mixing time is of order logn, with the scaled mixing time exhibiting a one-sided cutoff when β(0,) and a two-sided cutoff when β=0. The occurrence of a one-sided cutoff is a rare phenomenon. In our setting it comes from a competition between the time scales of mixing on the static graph, as identified by Ben-Hamou and Salez (2017), and the regeneration time of first stepping across a rewired edge.  相似文献   

6.
7.
The paper concerns a particular example of the Gibbs sampler and its mixing efficiency. Coordinates of a point are rerandomized in the unit square [0,1]2 to approach a stationary distribution with density proportional to exp(?A2(u?v)2) for (u,v)[0,1]2 with some large parameter A.Diaconis conjectured the mixing time of this process to be O(A2) which we confirm in this paper. This improves on the currently known O(exp(A2)) estimate.  相似文献   

8.
As is known, if B=(Bt)t[0,T] is a G-Brownian motion, a process of form 0tηsdBs?0t2G(ηs)ds, ηMG1(0,T), is a non-increasing G-martingale. In this paper, we shall show that a non-increasing G-martingale cannot be form of 0tηsds or 0tγsdBs, η,γMG1(0,T), which implies that the decomposition for generalized G-Itô processes is unique: For arbitrary ζHG1(0,T), ηMG1(0,T) and non-increasing G-martingales K,L, if 0tζsdBs+0tηsds+Kt=Lt,t[0,T],then we have η0, ζ0 andKt=Lt. As an application, we give a characterization to the G-Sobolev spaces introduced in Peng and Song (2015).  相似文献   

9.
Let (Zn)n0 be a branching process in a random environment defined by a Markov chain (Xn)n0 with values in a finite state space X. Let Pi be the probability law generated by the trajectories of Xnn0 starting at X0=iX. We study the asymptotic behaviour of the joint survival probability PiZn>0,Xn=j, jX as n+ in the critical and strongly, intermediate and weakly subcritical cases.  相似文献   

10.
We consider a d-parameter Hermite process with Hurst index H=(H1,..,Hd)12,1d and we study its limit behavior in distribution when the Hurst parameters Hi,i=1,..,d (or a part of them) converge to 12 and/or 1. The limit obtained is Gaussian (when at least one parameter tends to 12) and non-Gaussian (when at least one-parameter tends to 1 and none converges to 12).  相似文献   

11.
12.
13.
14.
We prove the existence of positive solutions of the following singular quasilinear Schrödinger equations at critical growth
?Δu?λc(x)u?κα(Δ(|u|2α))|u|2α?2u=|u|q?2u+|u|2??2u,uD1,2(RN),
via variational methods, where λ0, c:RNR+, κ>0, 0<α<1/2, 2<q<2?. It is interesting that we do not need to add a weight function to control |u|q?2u.  相似文献   

15.
In this paper, we study the existence and concentration behavior of minimizers for iV(c)=infuSc?IV(u), here Sc={uH1(RN)|RNV(x)|u|2<+,|u|2=c>0} and
IV(u)=12RN(a|?u|2+V(x)|u|2)+b4(RN|?u|2)2?1pRN|u|p,
where N=1,2,3 and a,b>0 are constants. By the Gagliardo–Nirenberg inequality, we get the sharp existence of global constraint minimizers of iV(c) for 2<p<2? when V(x)0, V(x)Lloc(RN) and lim|x|+?V(x)=+. For the case p(2,2N+8N)\{4}, we prove that the global constraint minimizers uc of iV(c) behave like
uc(x)c|Qp|2(mcc)N2Qp(mccx?zc),
for some zcRN when c is large, where Qp is, up to translations, the unique positive solution of ?N(p?2)4ΔQp+2N?p(N?2)4Qp=|Qp|p?2Qp in RN and mc=(a2D12?4bD2i0(c)+aD12bD2)12, D1=Np?2N?42N(p?2) and D2=2N+8?Np4N(p?2).  相似文献   

16.
The St. Petersburg paradox (Bernoulli, 1738) concerns the fair entry fee in a game where the winnings are distributed as P(X=2k)=2?k,k=1,2,. The tails of X are not regularly varying and the sequence Sn of accumulated gains has, suitably centered and normalized, a class of semistable laws as subsequential limit distributions (Martin-Löf, 1985; Csörg? and Dodunekova, 1991). This has led to a clarification of the paradox and an interesting and unusual asymptotic theory in past decades. In this paper we prove that Sn can be approximated by a semistable Lévy process {L(n),n1} with a.s. error O(n(logn)1+ε) and, surprisingly, the error term is asymptotically normal, exhibiting an unexpected central limit theorem in St. Petersburg theory.  相似文献   

17.
《Discrete Mathematics》2019,342(4):1159-1169
In this article, we study symmetric (v,k,λ) designs admitting a flag-transitive and point-primitive automorphism group G whose socle is PSU4(q). We prove that there exist eight non-isomorphic such designs for which λ{3,6,18} and G is either PSU4(2), or PSU4(2):2.  相似文献   

18.
19.
20.
Yi Zhang  Mei Lu 《Discrete Mathematics》2019,342(6):1731-1737
A matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. We use E3(2d?1,n?2d+1) to denote the 3-uniform hypergraph whose vertex set can be partitioned into two vertex classes V1 and V2 of size 2d?1 and n?2d+1, respectively, and whose edge set consists of all the triples containing at least two vertices of V1. Let H be a 3-uniform hypergraph of order n13d with no isolated vertex and deg(u)+deg(v)>2(n?12?n?d2) for any two adjacent vertices u,vV(H). In this paper, we show that H contains a matching of size d if and only if H is not a subgraph of E3(2d?1,n?2d+1). This result improves our previous one in Zhang and Lu (2018).  相似文献   

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

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