On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence

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$s$-dimensional sequence m$m$, whose elements are vectors obtained by concatenating d$d$-dimensional vectors from a low-discrepancy sequence q$q$ with (s−d)$(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$\epsilon >0$ the difference of the star discrepancies of the first N$N$ points of m$m$ and q$q$ is bounded by ε$\epsilon$ with probability at least 1−2exp(−ε²N/2)$1-2exp(-{\epsilon }^{2}N/2)$ for N$N$ sufficiently large. The authors did not study how large N$N$ actually has to be and if and how this actually depends on the parameters s$s$ and ε$\epsilon$. In this note we derive a lower bound for N$N$, which significantly depends on s$s$ and ε$\epsilon$. Furthermore, we provide a probabilistic bound for the difference of the star discrepancies of the first N$N$ points of m$m$ and q$q$, which holds without any restrictions on N$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$N$. We compare this bound to other known bounds.     

Energy decay for the linear Klein–Gordon equation and boundary control

In this work we study the asymptotic behavior of the solutions of the linear Klein–Gordon equation in R^N${\mathbb{R}}^N$, N?1$N?1$. We prove that local energy of solutions to the Cauchy problem decays polynomially. Afterwards, we use the local decay of energy to study exact boundary controllability for the linear Klein–Gordon equation in general bounded domains of R^N${\mathbb{R}}^N$, N?1$N?1$.     

Asymptotic average shadowing property on compact metric spaces

We prove that if for a continuous map f$f$ on a compact metric space X$X$, the chain recurrent set, R(f)$R\left(f\right)$ has more than one chain component, then f$f$ does not satisfy the asymptotic average shadowing property. We also show that if a continuous map f$f$ on a compact metric space X$X$ has the asymptotic average shadowing property and if A$A$ is an attractor for f$f$, then A$A$ is the single attractor for f$f$ and we have A=R(f)$A=R\left(f\right)$. We also study diffeomorphisms with asymptotic average shadowing property and prove that if M$M$ is a compact manifold which is not finite with dimM=2$dimM=2$, then the C¹$C^1$ interior of the set of all C¹$C^1$ diffeomorphisms with the asymptotic average shadowing property is characterized by the set of Ω$\Omega$-stable diffeomorphisms.     

A note on distance-regular graphs with a small number of vertices compared to the valency

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$\alpha >2$, there are finitely many distance-regular graphs Γ$\Gamma$ with valency k$k$, diameter D≥3$D\ge 3$ and v$v$ vertices satisfying v≤αk$v\le \alpha k$ unless (D=3$D=3$ and Γ$\Gamma$ is imprimitive) or (D=4$D=4$ and Γ$\Gamma$ 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$k\ge 3$, diameter D≥3$D\ge 3$ and _c2≥εk$c_2\ge \epsilon k$ for a given 0<ε<1$0<\epsilon <1$ unless (D=3$D=3$ and Γ$\Gamma$ is imprimitive) or (D=4$D=4$ and Γ$\Gamma$ is antipodal and bipartite).     

Newton’s method and high-order algorithms for the nth root computation

Two modifications of Newton’s method to accelerate the convergence of the n$n$th root computation of a strictly positive real number are revisited. Both modifications lead to methods with prefixed order of convergence p∈N,p≥2$p\in \mathbb{N},p\ge 2$. We consider affine combinations of the two modified p$p$th-order methods which lead to a family of methods of order p$p$ with arbitrarily small asymptotic constants. Moreover the methods are of order p+1$p+1$ for some specific values of a parameter. Then we consider affine combinations of the three methods of order p+1$p+1$ to get methods of order p+1$p+1$ again with arbitrarily small asymptotic constants. The methods can be of order p+2$p+2$ with arbitrarily small asymptotic constants, and also of order p+3$p+3$ for some specific values of the parameters of the affine combination. It is shown that infinitely many p$p$th-order methods exist for the n$n$th root computation of a strictly positive real number for any p≥3$p\ge 3$.     

Modules satisfying the weak Nakayama property

Let R$R$ be a commutative ring with identity. We will say that an R$R$-module M$M$ satisfies the weak Nakayama property, if IM=M$IM=M$, where I$I$ is an ideal of R$R$, implies that for any x∈M$x\in M$ there exists a∈I$a\in I$ such that (a−1)x=0$(a-1)x=0$. In this paper, we will study modules satisfying the weak Nakayama property. It is proved that if R$R$ is a local ring, then R$R$ is a Max ring if and only if J(R)$J\left(R\right)$, the Jacobson radical of R$R$, is T$T$-nilpotent if and only if every R$R$-module satisfies the weak Nakayama property.     

On topological entropy of commuting tree maps

Let T$T$ be a tree with s$s$ ends and f,g$f,g$ be continuous maps from T$T$ to T$T$ with f°g=g°f$f°g=g°f$. In this note we show that if there exists a positive integer m≥2$m\ge 2$ such that gcd(m,l)=1$gcd(m,l)=1$ for any 2≤l≤s$2\le l\le s$ and f,g$f,g$ share a periodic point which is a km$km$-periodic point of f$f$ for some positive integer k$k$, then the topological entropy of f°g$f°g$ is positive.     

Monotonicity properties of multi-dimensional reflected diffusions in random environment and applications

We consider an N$N$-dimensional reflected process, modeling an infinite capacity fluid queues network, of which service and input rates depend on the queue levels as well as on the state of an exterior ergodic stationary process. N$N$ is the number of queues in the network. We prove a monotonicity result for such a process, from which we deduce stability results for networks of queues. Particular attention is paid to the case N=2$N=2$. Next, we give some applications of those stability results.     

An extension of Draghicescu’s fast tree-code algorithm to the vortex method on a sphere

A fast and accurate algorithm to compute interactions between N$N$ point vortices and between N$N$ vortex blobs on a sphere is proposed. It is an extension of the fast tree-code algorithm developed by Draghicescu for the vortex method in the plane. When we choose numerical parameters in the fast algorithm suitably, the computational cost of O(N²)$O\left(N^2\right)$ is reduced to O(N(logN)⁴)$O\left(N{(logN)}^4\right)$ and the approximation error decreases like O(1/N)$O(1/N)$ when N→∞$N\to \infty$, as demonstrated in the present article. We also apply the fast method to long-time evolution of two vortex sheets on the sphere to see the efficiency. A key point is to describe the equation of motion for the N$N$ points in the three-dimensional Cartesian coordinates.     

Nonparametric estimation for stochastic differential equations with random effects

We consider N$N$ independent stochastic processes (_Xj(t),t∈[0,T])$(X_j\left(t\right),t\in [0,T])$, j=1,…,N$j=1,\dots ,N$, defined by a one-dimensional stochastic differential equation with coefficients depending on a random variable _?j${?}_j$ and study the nonparametric estimation of the density of the random effect _?j${?}_j$ in two kinds of mixed models. A multiplicative random effect and an additive random effect are successively considered. In each case, we build kernel and deconvolution estimators and study their L²$L^2$-risk. Asymptotic properties are evaluated as N$N$ tends to infinity for fixed T$T$ or for T=T(N)$T=T\left(N\right)$ tending to infinity with N$N$. For T(N)=N²$T\left(N\right)=N^2$, adaptive estimators are built. Estimators are implemented on simulated data for several examples.     

Critical edges for the assignment problem: Complexity and exact resolution

This paper investigates two problems related to the determination of critical edges for the minimum cost assignment problem. Given a complete bipartite balanced graph with n$n$ vertices on each part and with costs on its edges, k$k$Most Vital Edges Assignment consists of determining a set of k$k$ edges whose removal results in the largest increase in the cost of a minimum cost assignment. A dual problem, Min Edge Blocker Assignment, consists of removing a subset of edges of minimum cardinality such that the cost of a minimum cost assignment in the remaining graph is larger than or equal to a specified threshold. We show that k$k$Most Vital Edges Assignment is NP$NP$-hard to approximate within a factor c<2$c<2$ and Min Edge Blocker Assignment is NP$NP$-hard to approximate within a factor 1.36$1.36$. We also provide an exact algorithm for k$k$Most Vital Edges Assignment that runs in O(n^k+2)$O\left(n^{k+2}\right)$. This algorithm can also be used to solve exactly Min Edge Blocker Assignment.     

Joint temporal and contemporaneous aggregation of random-coefficient AR(1) processes

We discuss joint temporal and contemporaneous aggregation of N$N$ independent copies of AR(1) process with random-coefficient a∈[0,1)$a\in [0,1)$ when N$N$ and time scale n$n$ increase at different rate. Assuming that a$a$ has a density, regularly varying at a=1$a=1$ with exponent −1<β<1$-1<\beta <1$, different joint limits of normalized aggregated partial sums are shown to exist when N^1/(1+β)/n$N^{1/(1+\beta )}/n$ tends to (i) ∞$\infty$, (ii) 0$0$, (iii) 0<μ<∞$0<\mu <\infty$. The limit process arising under (iii) admits a Poisson integral representation on (0,∞)×C(R)$(0,\infty )\times C\left(\mathbb{R}\right)$ and enjoys ‘intermediate’ properties between fractional Brownian motion limit in (i) and sub-Gaussian limit in (ii).     

A note on Schweizer–Smital chaos

In this paper, we consider a continuous map f:X→X$f:X\to X$, where X$X$ is a compact metric space, and prove that for any positive integer N$N$, f$f$ is Schweizer–Smital chaotic if and only if f^N$f^N$ is too.     

On functional limits of short- and long-memory linear processes with GARCH(1,1) noises

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 α$\alpha$ is in (0,2)$(0,2)$, equal to 2, and in (2,∞)$(2,\infty )$, respectively. The partial sum weakly converges to a functional of α$\alpha$-stable process when α<2$\alpha <2$ and converges to a functional of Brownian motion when α≥2$\alpha \ge 2$. When the process is of short-memory and α<4$\alpha <4$, the autocovariances converge to functionals of α/2$\alpha /2$-stable processes; and if α≥4$\alpha \ge 4$, they converge to functionals of Brownian motions. In contrast, when the process is of long-memory, depending on α$\alpha$ and β$\beta$ (the parameter that characterizes the long-memory), the autocovariances converge to either (i) functionals of α/2$\alpha /2$-stable processes; (ii) Rosenblatt processes (indexed by β$\beta$, 1/2<β<3/4$1/2<\beta <3/4$); or (iii) functionals of Brownian motions. The rates of convergence in these limits depend on both the tail index α$\alpha$ 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]$[0,1]$ with either (i) the _J1$J_1$ or the _M1$M_1$ topology (Skorokhod, 1956); or (ii) the weaker form S$S$ topology (Jakubowski, 1997). Some statistical applications are also discussed.     

Partial rigidity of degenerate CR embeddings into spheres

In this paper, we study degenerate CR embeddings f$f$ of a strictly pseudoconvex hypersurface M⊂Cⁿ⁺¹$M\subset {\mathbb{C}}^{n+1}$ into a sphere S$\mathbb{S}$ in a higher dimensional complex space C^N+1${\mathbb{C}}^{N+1}$. The degeneracy of the mapping f$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$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$d$ of the second fundamental form and all of its covariant derivatives is <n$<n$ (here, n$n$ is the CR dimension of M$M$), then f(M)$f\left(M\right)$ is contained in a complex plane of dimension n+d+1$n+d+1$. The converse of this statement is also true, as is easy to see. When the total rank d$d$ exceeds n$n$, it is no longer true, in general, that f(M)$f\left(M\right)$ is contained in a complex plane of dimension n+d+1$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$n$, then partial rigidity may still persist, but there is a “defect” k$k$ that arises from the ranks exceeding n$n$ such that f(M)$f\left(M\right)$ is only contained in a complex plane of dimension n+d+k+1$n+d+k+1$. Moreover, this defect occurs in general, as is illustrated by examples.     

Parametric inference for discretely observed multidimensional diffusions with small diffusion coefficient

We consider a multidimensional diffusion X$X$ with drift coefficient b(α,_Xt)$b(\alpha ,X_t)$ and diffusion coefficient ?σ(β,_Xt)$?\sigma (\beta ,X_t)$. The diffusion sample path is discretely observed at times _tk=kΔ$t_k=k\Delta$ for k=1…n$k=1\dots n$ on a fixed interval [0,T]$[0,T]$. We study minimum contrast estimators derived from the Gaussian process approximating X$X$ for small ?$?$. We obtain consistent and asymptotically normal estimators of α$\alpha$ for fixed Δ$\Delta$ and ?→0$?\to 0$ and of (α,β)$(\alpha ,\beta )$ for Δ→0$\Delta \to 0$ and ?→0$?\to 0$ without any condition linking ?$?$ and Δ$\Delta$. We compare the estimators obtained with various methods and for various magnitudes of Δ$\Delta$ and ?$?$ based on simulation studies. Finally, we investigate the interest of using such methods in an epidemiological framework.     

Matchings in graphs of odd regularity and girth

We establish lower bounds on the matching number of graphs of given odd regularity d$d$ and odd girth g$g$, which are sharp for many values of d$d$ and g$g$. For d=g=5$d=g=5$, we characterize all extremal graphs.