共查询到20条相似文献,搜索用时 15 毫秒
1.
Brooks’ theorem is a fundamental result in the theory of graph coloring. Catlin proved the following strengthening of Brooks’ theorem: Let d be an integer at least 3, and let G be a graph with maximum degree d. If G does not contain Kd+1 as a subgraph, then G has a d-coloring in which one color class has size α(G). Here α(G) denotes the independence number of G. We give a unified proof of Brooks’ theorem and Catlin’s theorem. 相似文献
2.
3.
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. 相似文献
4.
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. 相似文献
5.
In 2011, the fundamental gap conjecture for Schrödinger operators was proven. This can be used to estimate the ground state energy of the time-independent Schrödinger equation with a convex potential and relative error ε. Classical deterministic algorithms solving this problem have cost exponential in the number of its degrees of freedom d. We show a quantum algorithm, that is based on a perturbation method, for estimating the ground state energy with relative error ε. The cost of the algorithm is polynomial in d and ε−1, while the number of qubits is polynomial in d and logε−1. In addition, we present an algorithm for preparing a quantum state that overlaps within 1−δ,δ∈(0,1), with the ground state eigenvector of the discretized Hamiltonian. This algorithm also approximates the ground state with relative error ε. The cost of the algorithm is polynomial in d, ε−1 and δ−1, while the number of qubits is polynomial in d, logε−1 and logδ−1. 相似文献
6.
In this paper, we study degenerate CR embeddings f of a strictly pseudoconvex hypersurface M⊂Cn+1 into a sphere S in a higher dimensional complex space CN+1. The degeneracy of the mapping f will be characterized in terms of the ranks of the CR second fundamental form and its covariant derivatives. In 2004, the author, together with X. Huang and D. Zaitsev, established a rigidity result for CR embeddings f into spheres in low codimensions. A key step in the proof of this result was to show that degenerate mappings are necessarily contained in a complex plane section of the target sphere (partial rigidity). In the 2004 paper, it was shown that if the total rank d of the second fundamental form and all of its covariant derivatives is <n (here, n is the CR dimension of M), then f(M) is contained in a complex plane of dimension n+d+1. The converse of this statement is also true, as is easy to see. When the total rank d exceeds n, it is no longer true, in general, that f(M) is contained in a complex plane of dimension n+d+1, as can be seen by examples. In this paper, we carry out a systematic study of degenerate CR mappings into spheres. We show that when the ranks of the second fundamental form and its covariant derivatives exceed the CR dimension n, then partial rigidity may still persist, but there is a “defect” k that arises from the ranks exceeding n such that f(M) is only contained in a complex plane of dimension n+d+k+1. Moreover, this defect occurs in general, as is illustrated by examples. 相似文献
7.
8.
A d-arc-dominated digraph is a digraph D of minimum out-degree d such that for every arc (x,y) of D, there exists a vertex u of D of out-degree d such that (u,x) and (u,y) are arcs of D. Henning and Yeo [Vertex disjoint cycles of different length in digraphs, SIAM J. Discrete Math. 26 (2012) 687–694] conjectured that a digraph with minimum out-degree at least four contains two vertex-disjoint cycles of different length. In this paper, we verify this conjecture for 4-arc-dominated digraphs. 相似文献
9.
For a Gaussian process X and smooth function f, we consider a Stratonovich integral of f(X), defined as the weak limit, if it exists, of a sequence of Riemann sums. We give covariance conditions on X such that the sequence converges in law. This gives a change-of-variable formula in law with a correction term which is an Itô integral of f? with respect to a Gaussian martingale independent of X. The proof uses Malliavin calculus and a central limit theorem from Nourdin and Nualart (2010) [8]. This formula was known for fBm with H=1/6 Nourdin et al. (2010) [9]. We extend this to a larger class of Gaussian processes. 相似文献
10.
We consider a multidimensional diffusion X with drift coefficient b(α,Xt) and diffusion coefficient ?σ(β,Xt). The diffusion sample path is discretely observed at times tk=kΔ for k=1…n on a fixed interval [0,T]. We study minimum contrast estimators derived from the Gaussian process approximating X for small ?. We obtain consistent and asymptotically normal estimators of α for fixed Δ and ?→0 and of (α,β) for Δ→0 and ?→0 without any condition linking ? and Δ. We compare the estimators obtained with various methods and for various magnitudes of Δ and ? based on simulation studies. Finally, we investigate the interest of using such methods in an epidemiological framework. 相似文献
11.
A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence x over a finite alphabet is ultimately periodic if and only if, for some n, the number of different factors of length n appearing in x is less than n+1. Attempts to extend this fundamental result, for example, to higher dimensions, have been considered during the last fifteen years. Let d≥2. A legitimate extension to a multidimensional setting of the notion of periodicity is to consider sets of Zd definable by a first order formula in the Presburger arithmetic 〈Z;<,+〉. With this latter notion and using a powerful criterion due to Muchnik, we exhibit a complete extension of the Morse–Hedlund theorem to an arbitrary dimension d and characterize sets of Zd definable in 〈Z;<,+〉 in terms of some functions counting recurrent blocks, that is, blocks occurring infinitely often. 相似文献
12.
In the Hammersley harness processes the R-valued height at each site i∈Zd is updated at rate 1 to an average of the neighboring heights plus a centered random variable (the noise). We construct the process “a la Harris” simultaneously for all times and boxes contained in Zd. With this representation we compute covariances and show L2 and almost sure time and space convergence of the process. In particular, the process started from the flat configuration and viewed from the height at the origin converges to an invariant measure. In dimension three and higher, the process itself converges to an invariant measure in L2 at speed t1−d/2 (this extends the convergence established by Hsiao). When the noise is Gaussian the limiting measures are Gaussian fields (harmonic crystals) and are also reversible for the process. 相似文献
13.
14.
In this paper we discuss existence and uniqueness results for BSDEs driven by centered Gaussian processes. Compared to the existing literature on Gaussian BSDEs, which mainly treats fractional Brownian motion with Hurst parameter H>1/2, our main contributions are: (i) Our results cover a wide class of Gaussian processes as driving processes including fractional Brownian motion with arbitrary Hurst parameter H∈(0,1); (ii) the assumptions on the generator f are mild and include e.g. the case when f has (super-)quadratic growth in z; (iii) the proofs are based on transferring the problem to an auxiliary BSDE driven by a Brownian motion. 相似文献
15.
Let R be a commutative ring with identity. We will say that an R-module M satisfies the weak Nakayama property, if IM=M, where I is an ideal of R, implies that for any x∈M there exists a∈I such that (a−1)x=0. In this paper, we will study modules satisfying the weak Nakayama property. It is proved that if R is a local ring, then R is a Max ring if and only if J(R), the Jacobson radical of R, is T-nilpotent if and only if every R-module satisfies the weak Nakayama property. 相似文献
16.
In this note we study distance-regular graphs with a small number of vertices compared to the valency. We show that for a given α>2, there are finitely many distance-regular graphs Γ with valency k, diameter D≥3 and v vertices satisfying v≤αk unless (D=3 and Γ is imprimitive) or (D=4 and Γ is antipodal and bipartite). We also show, as a consequence of this result, that there are finitely many distance-regular graphs with valency k≥3, diameter D≥3 and c2≥εk for a given 0<ε<1 unless (D=3 and Γ is imprimitive) or (D=4 and Γ is antipodal and bipartite). 相似文献
17.
Consider a face-to-face parallelohedral tiling of Rd and a (d−k)-dimensional face F of the tiling. We prove that the valence of F (i.e. the number of tiles containing F as a face) is not greater than 2k. If the tiling is affinely equivalent to a Voronoi tiling for some lattice (the so called Voronoi case), this gives a well-known upper bound for the number of vertices of a Delaunay k-cell. Yet we emphasize that such an affine equivalence is not assumed in the proof. 相似文献
18.
This paper considers the short- and long-memory linear processes with GARCH (1,1) noises. The functional limit distributions of the partial sum and the sample autocovariances are derived when the tail index α is in (0,2), equal to 2, and in (2,∞), respectively. The partial sum weakly converges to a functional of α-stable process when α<2 and converges to a functional of Brownian motion when α≥2. When the process is of short-memory and α<4, the autocovariances converge to functionals of α/2-stable processes; and if α≥4, they converge to functionals of Brownian motions. In contrast, when the process is of long-memory, depending on α and β (the parameter that characterizes the long-memory), the autocovariances converge to either (i) functionals of α/2-stable processes; (ii) Rosenblatt processes (indexed by β, 1/2<β<3/4); or (iii) functionals of Brownian motions. The rates of convergence in these limits depend on both the tail index α and whether or not the linear process is short- or long-memory. Our weak convergence is established on the space of càdlàg functions on [0,1] with either (i) the J1 or the M1 topology (Skorokhod, 1956); or (ii) the weaker form S topology (Jakubowski, 1997). Some statistical applications are also discussed. 相似文献
19.