An approximation method for strictly pseudocontractive mappings

Let K$K$ be a closed convex subset of a q$q$-uniformly smooth separable Banach space, T:K→K$T:K\to K$ a strictly pseudocontractive mapping, and f:K→K$f:K\to K$ an L$L$-Lispschitzian strongly pseudocontractive mapping. For any t∈(0,1)$t\in (0,1)$, let _xt$x_t$ be the unique fixed point of tf+(1-t)T$\mathit{tf}+(1-t)T$. We prove that if T$T$ has a fixed point, then {_xt}$\{x_t\}$ converges to a fixed point of T$T$ as t$t$ approaches to 0.     

Transformation formulas for fractional Brownian motion

We derive a Molchan–Golosov-type integral transform which changes fractional Brownian motion of arbitrary Hurst index K$K$ into fractional Brownian motion of index H$H$. Integration is carried out over [0,t]$[0,t]$, t>0$t>0$. The formula is derived in the time domain. Based on this transform, we construct a prelimit which converges in L²(P)$L^2\left(\mathbb{P}\right)$-sense to an analogous, already known Mandelbrot–Van Ness-type integral transform, where integration is over (−∞,t]$(-\infty ,t]$, t>0$t>0$.     

Iterative approximation of solutions of nonlinear equations of Hammerstein type

Suppose X$X$ is a real q$q$-uniformly smooth Banach space and F,K:X→X$F,K:X\to X$ are Lipschitz ?$?$-strongly accretive maps with D(K)=F(X)=X$D\left(K\right)=F\left(X\right)=X$. Let u^∗$u^{\ast }$ denote the unique solution of the Hammerstein equation u+KFu=0$u+KFu=0$. An iteration process recently introduced by Chidume and Zegeye is shown to converge strongly to u^∗$u^{\ast }$. No invertibility assumption is imposed on K$K$ and the operators K$K$ and F$F$ need not be defined on compact subsets of X$X$. Furthermore, our new technique of proof is of independent interest. Finally, some interesting open questions are included.     

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.     

Stable orbit equivalence of Bernoulli actions of free groups and isomorphism of some of their factor actions

We give an elementary proof for Lewis Bowen’s theorem saying that two Bernoulli actions of two free groups, each having arbitrary base probability spaces, are stably orbit equivalent. Our methods also show that for all compact groups K$K$ and every free product Γ$\Gamma$ of infinite amenable groups, the factor Γ?K^Γ/K$\Gamma ?K^{\Gamma }/K$ of the Bernoulli action Γ?K^Γ$\Gamma ?K^{\Gamma }$ by the diagonal K$K$-action is isomorphic with a Bernoulli action of Γ$\Gamma$.     

Approximation of solutions of Hammerstein equations with bounded strongly accretive nonlinear operators

Suppose X$X$ is a real q$q$-uniformly smooth Banach space and F,K:X→X$F,K:X\to X$ are bounded strongly accretive maps with D(K)=F(X)=X$D\left(K\right)=F\left(X\right)=X$. Let u^∗$u^{\ast }$ denote the unique solution of the Hammerstein equation u+KFu=0$u+KFu=0$. A new explicit coupled iteration process is shown to converge strongly to u^∗$u^{\ast }$. No invertibility assumption is imposed on K$K$ and the operators K$K$ and F$F$ need not be defined on compact subsets of X$X$. Furthermore, our new technique of proof is of independent interest. Finally, some interesting open questions are included.     

A unified proof of Brooks’ theorem and Catlin’s theorem

Brooks’ theorem is a fundamental result in the theory of graph coloring. Catlin proved the following strengthening of Brooks’ theorem: Let d$d$ be an integer at least 3, and let G$G$ be a graph with maximum degree d$d$. If G$G$ does not contain _Kd+1$K_{d+1}$ as a subgraph, then G$G$ has a d$d$-coloring in which one color class has size α(G)$\alpha \left(G\right)$. Here α(G)$\alpha \left(G\right)$ denotes the independence number of G$G$. We give a unified proof of Brooks’ theorem and Catlin’s theorem.     

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.     

Disjoint cycles with different length in 4-arc-dominated digraphs

A d$d$-arc-dominated digraph is a digraph D$D$ of minimum out-degree d$d$ such that for every arc (x,y)$(x,y)$ of D$D$, there exists a vertex u$u$ of D$D$ of out-degree d$d$ such that (u,x)$(u,x)$ and (u,y)$(u,y)$ are arcs of D$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.     

Comment on “Kirchhoff index in line,subdivision and total graphs of a regular graph”

Let G$G$ be a connected regular graph. Denoted by t(G)$t\left(G\right)$ and Kf(G)$Kf\left(G\right)$ the total graph and Kirchhoff index of G$G$, respectively. This paper is to point out that Theorem 3.7 and Corollary 3.8 from “Kirchhoff index in line, subdivision and total graphs of a regular graph” [X. Gao, Y.F. Luo, W.W. Liu, Kirchhoff index in line, subdivision and total graphs of a regular graph, Discrete Appl. Math. 160(2012) 560–565] are incorrect, since the conclusion of a lemma is essentially wrong. Moreover, we first show the Laplacian characteristic polynomial of t(G)$t\left(G\right)$, where G$G$ is a regular graph. Consequently, by using Kf(G)$Kf\left(G\right)$, we give an expression on Kf(t(G))$Kf\left(t\left(G\right)\right)$ and a lower bound on Kf(t(G))$Kf\left(t\left(G\right)\right)$ of a regular graph G$G$, which correct Theorem 3.7 and Corollary 3.8 in Gao et al. (2012)  [2].     

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.     

[1, 2]-sets in graphs

A subset S⊆V$S\subseteq V$ in a graph G=(V,E)$G=(V,E)$ is a [j,k]$[j,k]$-set if, for every vertex v∈V?S$v\in V?S$, j≤|N(v)∩S|≤k$j\le |N\left(v\right)\cap S|\le k$ for non-negative integers j$j$ and k$k$, that is, every vertex v∈V?S$v\in V?S$ is adjacent to at least j$j$ but not more than k$k$ vertices in S$S$. In this paper, we focus on small j$j$ and k$k$, and relate the concept of [j,k]$[j,k]$-sets to a host of other concepts in domination theory, including perfect domination, efficient domination, nearly perfect sets, 2-packings, and k$k$-dependent sets. We also determine bounds on the cardinality of minimum [1, 2]-sets, and investigate extremal graphs achieving these bounds. This study has implications for restrained domination as well. Using a result for [1, 3]-sets, we show that, for any grid graph G$G$, the restrained domination number is equal to the domination number of G$G$.     

Cone monotone mappings: Continuity and differentiability

We generalize some results of Borwein, Burke, Lewis, and Wang to mappings with values in metric (resp. ordered normed linear) spaces, and we define two classes of monotone mappings between an ordered linear space and a metric space (resp. ordered linear space): K$K$-monotone dominated and cone-to-cone monotone mappings. K$K$-monotone dominated mappings naturally generalize mappings with finite variation (in the classical sense) and K$K$-monotone functions defined by Borwein, Burke and Lewis to mappings with domains and ranges of higher dimensions. First, using results of Veselý and Zají?ek, we show some relationships between these classes. Then, we show that every K$K$-monotone function f:X→R$f:X\to \mathbb{R}$, where X$X$ is any Banach space, is continuous outside of a set which can be covered by countably many Lipschitz hypersurfaces. This sharpens a result due to Borwein and Wang. As a consequence, we obtain a similar result for K$K$-monotone dominated and cone-to-cone monotone mappings. Finally, we prove several results concerning almost everywhere differentiability (also in metric and w^∗$w^{\ast }$-senses) of these mappings.     

The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs

Let R(G)$R\left(G\right)$ be the graph obtained from G$G$ by adding a new vertex corresponding to each edge of G$G$ and by joining each new vertex to the end vertices of the corresponding edge, and Q(G)$Q\left(G\right)$ be the graph obtained from G$G$ by inserting a new vertex into every edge of G$G$ and by joining by edges those pairs of these new vertices which lie on adjacent edges of G$G$. In this paper, we determine the Laplacian polynomials of R(G)$R\left(G\right)$ and Q(G)$Q\left(G\right)$ of a regular graph G$G$; on the other hand, we derive formulae and lower bounds of the Kirchhoff index of these graphs.     

The scaling limit of Poisson-driven order statistics with applications in geometric probability

Let _ηt${\eta }_t$ be a Poisson point process of intensity t≥1$t\ge 1$ on some state space Y$\mathbb{Y}$ and let f$f$ be a non-negative symmetric function on Y^k${\mathbb{Y}}^k$ for some k≥1$k\ge 1$. Applying f$f$ to all k$k$-tuples of distinct points of _ηt${\eta }_t$ generates a point process _ξt${\xi }_t$ on the positive real half-axis. The scaling limit of _ξt${\xi }_t$ as t$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$m$-th smallest point of _ξt${\xi }_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$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.     

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.