共查询到20条相似文献,搜索用时 15 毫秒
1.
In many applications it has been observed that hybrid-Monte Carlo sequences perform better than Monte Carlo and quasi-Monte Carlo sequences, especially in difficult problems. For a mixed s-dimensional sequence m, whose elements are vectors obtained by concatenating d-dimensional vectors from a low-discrepancy sequence q with (s−d)-dimensional random vectors, probabilistic upper bounds for its star discrepancy have been provided. In a paper of G. Ökten, B. Tuffin and V. Burago [G. Ökten, B. Tuffin, V. Burago, J. Complexity 22 (2006), 435–458] it was shown that for arbitrary ε>0 the difference of the star discrepancies of the first N points of m and q is bounded by ε with probability at least 1−2exp(−ε2N/2) for N sufficiently large. The authors did not study how large N actually has to be and if and how this actually depends on the parameters s and ε. In this note we derive a lower bound for N, which significantly depends on s and ε. Furthermore, we provide a probabilistic bound for the difference of the star discrepancies of the first N points of m and q, which holds without any restrictions on N. In this sense it improves on the bound of Ökten, Tuffin and Burago and is more helpful in practice, especially for small sample sizes N. We compare this bound to other known bounds. 相似文献
2.
A semicomplete multipartite or semicomplete c-partite digraph D is a biorientation of a c-partite graph. A semicomplete multipartite digraph D is called strongly quasi-Hamiltonian-connected, if for any two distinct vertices x and y of D, there is a path P from x to y such that P contains at least one vertex from each partite set of D. 相似文献
3.
4.
In this paper, we consider a continuous map f:X→X, where X is a compact metric space, and prove that for any positive integer N, f is Schweizer–Smital chaotic if and only if fN is too. 相似文献
5.
We show that, for any compact Alexandrov surface S (without boundary) and any point y in S, there exists a point x in S for which y is a critical point. Moreover, we prove that uniqueness characterizes the surfaces homeomorphic to the sphere among smooth orientable surfaces. 相似文献
6.
In this paper, new classes of nondifferentiable functions constituting multiobjective programming problems are introduced. Namely, the classes of d-r-type I objective and constraint functions and, moreover, the various classes of generalized d-r-type I objective and constraint functions are defined for directionally differentiable multiobjective programming problems. Sufficient optimality conditions and various Mond–Weir duality results are proved for nondifferentiable multiobjective programming problems involving functions of such type. Finally, it is showed that the introduced d-r-type I notion with r≠0 is not a sufficient condition for Wolfe weak duality to hold. These results are illustrated in the paper by suitable examples. 相似文献
7.
Let G be a group. Any G-module M has an algebraic structure called a G-family of Alexander quandles. Given a 2-cocycle of a cohomology associated with this G-family, topological invariants of (handlebody) knots in the 3-sphere are defined. We develop a simple algorithm to algebraically construct n-cocycles of this G-family from G-invariant group n-cocycles of the abelian group M. We present many examples of 2-cocycles of these G-families using facts from (modular) invariant theory. 相似文献
8.
For finite complex reflection groups, we consider the graded W-modules of diagonally harmonic polynomials in r sets of variables, and show that associated Hilbert series may be described in a global manner, independent of the value of r. 相似文献
9.
We prove that if for a continuous map f on a compact metric space X, the chain recurrent set, R(f) has more than one chain component, then f does not satisfy the asymptotic average shadowing property. We also show that if a continuous map f on a compact metric space X has the asymptotic average shadowing property and if A is an attractor for f, then A is the single attractor for f and we have A=R(f). We also study diffeomorphisms with asymptotic average shadowing property and prove that if M is a compact manifold which is not finite with dimM=2, then the C1 interior of the set of all C1 diffeomorphisms with the asymptotic average shadowing property is characterized by the set of Ω-stable diffeomorphisms. 相似文献
10.
The sensitivity set of a Boolean function at a particular input is the set of input positions where changing that one bit changes the output. Analogously we define the sensitivity set of a Boolean formula in a conjunctive normal form at a particular truth assignment, it is the set of positions where changing that one bit of the truth assignment changes the evaluation of at least one of the conjunct in the formula. We consider Boolean formulas in a generalized conjunctive normal form. Given a set ? of Boolean functions, an ?-constraint is an application of a function from ? to a tuple of literals built upon distinct variables, an ?-formula is then a conjunction of ?-constraints. In this framework, given a truth assignment I and a set of positions S, we are able to enumerate all ?-formulas that are satisfied by I and that have S as the sensitivity set at I. We prove that this number depends on the cardinality of S only, and can be expressed according to the sensitivity of the Boolean functions in ?. 相似文献
11.
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. 相似文献
12.
Let E be a real Banach space, C be a nonempty closed convex subset of E and T:C→C be a continuous generalized Φ-pseudocontractive mapping. It is proved that T has a unique fixed point in C. 相似文献
13.
We prove the Arad–Herzog conjecture for various families of finite simple groups — if A and B are nontrivial conjugacy classes, then AB is not a conjugacy class. We also prove that if G is a finite simple group of Lie type and A and B are nontrivial conjugacy classes, either both semisimple or both unipotent, then AB is not a conjugacy class. We also prove a strong version of the Arad–Herzog conjecture for simple algebraic groups and in particular show that almost always the product of two conjugacy classes in a simple algebraic group consists of infinitely many conjugacy classes. As a consequence we obtain a complete classification of pairs of centralizers in a simple algebraic group which have dense product. A special case of this has been used by Prasad to prove a uniqueness result for Tits systems in quasi-reductive groups. Our final result is a generalization of the Baer–Suzuki theorem for p-elements with p≥5. 相似文献
14.
15.
In this paper, we establish an oscillation estimate of nonnegative harmonic functions for a pure-jump subordinate Brownian motion. The infinitesimal generator of such subordinate Brownian motion is an integro-differential operator. As an application, we give a probabilistic proof of the following form of relative Fatou theorem for such subordinate Brownian motion X in a bounded κ-fat open set; if u is a positive harmonic function with respect to X in a bounded κ-fat open set D and h is a positive harmonic function in D vanishing on Dc, then the non-tangential limit of u/h exists almost everywhere with respect to the Martin-representing measure of h. 相似文献
16.
A polychromatic k-coloring of a map G on a surface is a k-coloring such that each face of G has all k colors on its boundary vertices. An even embedding G on a surface is a map of a simple graph on the surface such that each face of G is bounded by a cycle of even length. In this paper, we shall prove that a cubic even embedding G on the projective plane has a polychromatic proper 4-coloring if and only if G is not isomorphic to a Möbius ladder with an odd number of rungs. For proving the theorem, we establish a generating theorem for 3-connected Eulerian multi-triangulations on the projective plane. 相似文献
17.
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. 相似文献
18.
We extend some known results on radicals and prime ideals from polynomial rings and Laurent polynomial rings to Z-graded rings, i.e, rings graded by the additive group of integers. The main of them concerns the Brown–McCoy radical G and the radical S, which for a given ring A is defined as the intersection of prime ideals I of A such that A/I is a ring with a large center. The studies are related to some open problems on the radicals G and S of polynomial rings and situated in the context of Koethe’s problem. 相似文献
19.
Let G=(V,E) be a graph. A subset D⊆V is a dominating set if every vertex not in D is adjacent to a vertex in D. A dominating set D is called a total dominating set if every vertex in D is adjacent to a vertex in D. The domination (resp. total domination) number of G is the smallest cardinality of a dominating (resp. total dominating) set of G. The bondage (resp. total bondage) number of a nonempty graph G is the smallest number of edges whose removal from G results in a graph with larger domination (resp. total domination) number of G. The reinforcement (resp. total reinforcement) number of G is the smallest number of edges whose addition to G results in a graph with smaller domination (resp. total domination) number. This paper shows that the decision problems for the bondage, total bondage, reinforcement and total reinforcement numbers are all NP-hard. 相似文献