共查询到20条相似文献,搜索用时 733 毫秒
1.
Let (Ut,Vt) be a bivariate Lévy process, where Vt is a subordinator and Ut is a Lévy process formed by randomly weighting each jump of Vt by an independent random variable Xt having cdf F. We investigate the asymptotic distribution of the self-normalized Lévy process Ut/Vt at 0 and at ∞. We show that all subsequential limits of this ratio at 0 (∞) are continuous for any nondegenerate F with finite expectation if and only if Vt belongs to the centered Feller class at 0 (∞). We also characterize when Ut/Vt has a non-degenerate limit distribution at 0 and ∞. 相似文献
2.
3.
Let I=[0,1] and let P be a partition of I into a finite number of intervals. Let τ1, τ2; I→I be two piecewise expanding maps on P . Let G⊂I×I be the region between the boundaries of the graphs of τ1 and τ2. Any map τ:I→I that takes values in G is called a selection of the multivalued map defined by G . There are many results devoted to the study of the existence of selections with specified topological properties. However, there are no results concerning the existence of selection with measure-theoretic properties. In this paper we prove the existence of selections which have absolutely continuous invariant measures (acim). By our assumptions we know that τ1 and τ2 possess acims preserving the distribution functions F(1) and F(2). The main result shows that for any convex combination F of F(1) and F(2) we can find a map η with values between the graphs of τ1 and τ2 (that is, a selection) such that F is the η-invariant distribution function. Examples are presented. We also study the relationship of the dynamics of our multivalued maps to random maps. 相似文献
4.
It is shown that if a sequence of open n-sets Dk increases to an open n-set D then reflected stable processes in Dk converge weakly to the reflected stable process in D for every starting point x in D. The same result holds for censored α-stable processes for every x in D if D and Dk satisfy the uniform Hardy inequality. Using the method in the proof of the above results, we also prove the weak convergence of reflected Brownian motions in unbounded domains. 相似文献
5.
We consider the Mosco convergence of the sets of fixed points for one-parameter strongly continuous semigroups of nonexpansive mappings. One of our main results is the following: Let C be a closed convex subset of a Hilbert space E. Let {T(t):t≥0} be a strongly continuous semigroup of nonexpansive mappings on C. The set of all fixed points of T(t) is denoted by F(T(t)) for each t≥0. Let τ be a nonnegative real number and let {tn} be a sequence in R satisfying τ+tn≥0 and tn≠0 for n∈N, and limntn=0. Then {F(T(τ+tn))} converges to ?t≥0F(T(t)) in the sense of Mosco. 相似文献
6.
7.
8.
9.
Consider a graph G with a minimal edge cut F and let G1, G2 be the two (augmented) components of G−F. A long-open question asks under which conditions the crossing number of G is (greater than or) equal to the sum of the crossing numbers of G1 and G2—which would allow us to consider those graphs separately. It is known that crossing number is additive for |F|∈{0,1,2} and that there exist graphs violating this property with |F|≥4. In this paper, we show that crossing number is additive for |F|=3, thus closing the final gap in the question. 相似文献
10.
11.
12.
13.
A tournament of order n is usually considered as an orientation of the complete graph Kn. In this note, we consider a more general definition of a tournament that we call aC-tournament, where C is the adjacency matrix of a multigraph G, and a C-tournament is an orientation of G. The score vector of a C-tournament is the vector of outdegrees of its vertices. In 1965 Hakimi obtained necessary and sufficient conditions for the existence of a C-tournament with a prescribed score vector R and gave an algorithm to construct such a C-tournament which required, however, some backtracking. We give a simpler and more transparent proof of Hakimi’s theorem, and then provide a direct construction of such a C-tournament which works even for weighted graphs. 相似文献
14.
A set of vertices in a hypergraph which meets all the edges is called a transversal. The transversal number τ(H) of a hypergraph H is the minimum cardinality of a transversal in H. A classical greedy algorithm for constructing a transversal of small size selects in each step a vertex which has the largest degree in the hypergraph formed by the edges not met yet. The analysis of this algorithm (by Chvátal and McDiarmid (1992) [3]) gave some upper bounds for τ(H) in a uniform hypergraph H with a given number of vertices and edges. We discuss a variation of this greedy algorithm. Analyzing this new algorithm, we obtain upper bounds for τ(H) which improve the bounds by Chvátal and McDiarmid. 相似文献
15.
16.
17.
Let ηt be a Poisson point process of intensity t≥1 on some state space Y and let f be a non-negative symmetric function on Yk for some k≥1. Applying f to all k-tuples of distinct points of ηt generates a point process ξt on the positive real half-axis. The scaling limit of ξt as t tends to infinity is shown to be a Poisson point process with explicitly known intensity measure. From this, a limit theorem for the m-th smallest point of ξt is concluded. This is strengthened by providing a rate of convergence. The technical background includes Wiener–Itô chaos decompositions and the Malliavin calculus of variations on the Poisson space as well as the Chen–Stein method for Poisson approximation. The general result is accompanied by a number of examples from geometric probability and stochastic geometry, such as k-flats, random polytopes, random geometric graphs and random simplices. They are obtained by combining the general limit theorem with tools from convex and integral geometry. 相似文献
18.
In the context of statistics for random processes, we prove a law of large numbers and a functional central limit theorem for multivariate Hawkes processes observed over a time interval [0,T] when T→∞. We further exhibit the asymptotic behaviour of the covariation of the increments of the components of a multivariate Hawkes process, when the observations are imposed by a discrete scheme with mesh Δ over [0,T] up to some further time shift τ. The behaviour of this functional depends on the relative size of Δ and τ with respect to T and enables to give a full account of the second-order structure. As an application, we develop our results in the context of financial statistics. We introduced in Bacry et al. (2013) [7] a microscopic stochastic model for the variations of a multivariate financial asset, based on Hawkes processes and that is confined to live on a tick grid. We derive and characterise the exact macroscopic diffusion limit of this model and show in particular its ability to reproduce the important empirical stylised fact such as the Epps effect and the lead–lag effect. Moreover, our approach enables to track these effects across scales in rigorous mathematical terms. 相似文献
19.
It is proved that the cookie-cutter set in R is structurally instable in C1 topology, that means for the invariant set E of the IFS {fi}i, we can always perturb {fi}i arbitrarily small in C1 topology to provide an IFS {gi}i with its invariant set F, such that dimHE=dimHF and E,F are not Lipschitz equivalent. 相似文献
20.
Let k be any field, G be a finite group acting on the rational function field k(xg:g∈G) by h⋅xg=xhg for any h,g∈G. Define k(G)=k(xg:g∈G)G. Noether’s problem asks whether k(G) is rational (= purely transcendental) over k. A weaker notion, retract rationality introduced by Saltman, is also very useful for the study of Noether’s problem. We prove that, if G is a Frobenius group with abelian Frobenius kernel, then k(G) is retract k-rational for any field k satisfying some mild conditions. As an application, we show that, for any algebraic number field k, for any Frobenius group G with Frobenius complement isomorphic to SL2(F5), there is a Galois extension field K over k whose Galois group is isomorphic to G, i.e. the inverse Galois problem is valid for the pair (G,k). The same result is true for any non-solvable Frobenius group if k(ζ8) is a cyclic extension of k. 相似文献