The relaxed Newton method derivative: Its dynamics and non-linear properties

The dynamic behaviour of the one-dimensional family of maps f(x)=_c2[(a−1)x+_c1]^{−λ/(α−1)}$f\left(x\right)=c_2{[(a-1)x+c_1]}^{-\lambda /(\alpha -1)}$ is examined, for representative values of the control parameters a,_c1$a,c_1$, _c2$c_2$ and λ$\lambda$. The maps under consideration are of special interest, since they are solutions of the relaxed Newton method derivative being equal to a constant a$a$. The maps f(x)$f\left(x\right)$ are also proved to be solutions of a non-linear differential equation with outstanding applications in the field of power electronics. The recurrent form of these maps, after excessive iterations, shows, in an _xn$x_n$ versus λ$\lambda$ plot, an initial exponential decay followed by a bifurcation. The value of λ$\lambda$ at which this bifurcation takes place depends on the values of the parameters a,_c1$a,c_1$ and _c2$c_2$. This corresponds to a switch to an oscillatory behaviour with amplitudes of f(x)$f\left(x\right)$ undergoing a period doubling. For values of a$a$ higher than 1 and at higher values of λ$\lambda$ a reverse bifurcation occurs. The corresponding branches converge and a bleb is formed for values of the parameter _c1$c_1$ between 1 and 1.20. This behaviour is confirmed by calculating the corresponding Lyapunov exponents.     

Regularity for the fractional Gelfand problem up to dimension 7

We study the problem (−Δ)^su=λe^u${(-\mathrm{\Delta })}^{s}u=\lambda e^u$ in a bounded domain Ω⊂Rⁿ$\Omega \subset {\mathbb{R}}^n$, where λ   is a positive parameter. More precisely, we study the regularity of the extremal solution to this problem. Our main result yields the boundedness of the extremal solution in dimensions n≤7$n\le 7$ for all s∈(0,1)$s\in (0,1)$ whenever Ω   is, for every i=1,...,n$i=1,...,n$, convex in the _xi$x_i$-direction and symmetric with respect to {_xi=0}$\{x_i=0\}$. The same holds if n=8$n=8$ and s?0.28206...$s?0.28206...$, or if n=9$n=9$ and s?0.63237...$s?0.63237...$. These results are new even in the unit ball Ω=_B1$\Omega =B_1$.     

Structural instability of cookie-cutter sets

It is proved that the cookie-cutter set in R$\mathbb{R}$ is structurally instable in C¹$C^1$ topology, that means for the invariant set E$E$ of the IFS _{fi}i${\left\{f_i\right\}}_i$, we can always perturb _{fi}i${\left\{f_i\right\}}_i$ arbitrarily small in C¹$C^1$ topology to provide an IFS _{gi}i${\left\{g_i\right\}}_i$ with its invariant set F$F$, such that _dimHE=_dimHF${dim}_{H}E={dim}_{H}F$ and E,F$E,F$ are not Lipschitz equivalent.     

Blow-up and propagation of disturbances for fast diffusion equations

This paper is concerned with the Cauchy problem for the fast diffusion equation _ut−Δu^m=αu^_p1$u_t-\Delta u^m=\alpha u^{p_1}$ in R^N${\mathbb{R}}^N$ (N≥1$N\ge 1$), where m∈(0,1)$m\in (0,1)$, _p1>1$p_1>1$ and α>0$\alpha >0$. The initial condition _u0$u_0$ is assumed to be continuous, nonnegative and bounded. Using a technique of subsolutions, we set up sufficient conditions on the initial value _u0$u_0$ so that u(t,x)$u(t,x)$ blows up in finite time, and we show how to get estimates on the profile of u(t,x)$u(t,x)$ for small enough values of t>0$t>0$.     

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.     

Nonparametric estimation of the stationary density and the transition density of a Markov chain

In this paper, we study first the problem of nonparametric estimation of the stationary density f$f$ of a discrete-time Markov chain (_Xi)$\left(X_i\right)$. We consider a collection of projection estimators on finite dimensional linear spaces. We select an estimator among the collection by minimizing a penalized contrast. The same technique enables us to estimate the density g$g$ of (_Xi,_Xi+1)$(X_i,X_{i+1})$ and so to provide an adaptive estimator of the transition density π=g/f$\pi =g/f$. We give bounds in L²$L^2$ norm for these estimators and we show that they are adaptive in the minimax sense over a large class of Besov spaces. Some examples and simulations are also provided.     

Disjoint paths in tournaments

Given k   pairs of vertices (_si,_ti)$(s_i,t_i)$(1≤i≤k)$(1\le i\le k)$ of a digraph G, how can we test whether there exist k   vertex-disjoint directed paths from _si$s_i$ to _ti$t_i$ for 1≤i≤k$1\le i\le k$? This is NP-complete in general digraphs, even for k=2$k=2$ [2], but for k=2$k=2$ there is a polynomial-time algorithm when G is a tournament (or more generally, a semicomplete digraph), due to Bang-Jensen and Thomassen [1]. Here we prove that for all fixed k there is a polynomial-time algorithm to solve the problem when G is semicomplete.     

Crossing number additivity over edge cuts

Consider a graph G$G$ with a minimal edge cut F$F$ and let _G1$G_1$, _G2$G_2$ be the two (augmented) components of G−F$G-F$. A long-open question asks under which conditions the crossing number of G$G$ is (greater than or) equal to the sum of the crossing numbers of _G1$G_1$ and _G2$G_2$—which would allow us to consider those graphs separately. It is known that crossing number is additive for |F|∈{0,1,2}$\left|F\right|\in \{0,1,2\}$ and that there exist graphs violating this property with |F|≥4$\left|F\right|\ge 4$. In this paper, we show that crossing number is additive for |F|=3$\left|F\right|=3$, thus closing the final gap in the question.     

Large scale properties of the IIIC for 2D percolation

We reinvestigate the 2D problem of the inhomogeneous incipient infinite cluster   where, in an independent percolation model, the density decays to _pc$p_c$ with an inverse power, λ$\lambda$, of the distance to the origin. Assuming the existence of critical exponents (as is known in the case of the triangular site lattice) if the power is less than 1/ν$1/\nu$, with ν$\nu$ the correlation length exponent, we demonstrate an infinite cluster with scale dimension given by _DH=2−βλ$D_H=2-\beta \lambda$. Further, we investigate the critical case _λc=1/ν${\lambda }_c=1/\nu$ and show that iterated logarithmic corrections will tip the balance between the possibility and impossibility of an infinite cluster.     

The homotopy type of the polyhedral product for shifted complexes

We prove a conjecture of Bahri, Bendersky, Cohen and Gitler: if K$K$ is a shifted simplicial complex on n$n$ vertices, _X1,…,_Xn$X_1,\dots ,X_n$ are pointed connected CW$CW$-complexes and C_Xi$C{X}_i$ is the cone on  _Xi$X_i$, then the polyhedral product determined by K$K$ and the pairs (C_Xi,_Xi)$(C{X}_i,X_i)$ is homotopy equivalent to a wedge of suspensions of smashes of the _Xi$X_i$’s. Earlier work of the authors dealt with the special case where each _Xi$X_i$ is a loop space. New techniques are introduced to prove the general case. These have the advantage of simplifying the earlier results and of being sufficiently general to show that the conjecture holds for a substantially larger class of simplicial complexes. We discuss connections between polyhedral products and toric topology, combinatorics, and classical homotopy theory.     

On the general excess bound for binary codes with covering radius one

Let K(n,1)$K(n,1)$ denote the minimal cardinality of a binary code of length n$n$ and covering radius one. Fundamental for the theory of lower bounds for K(n,1)$K(n,1)$ is the covering excess method introduced by Johnson and van Wee. Let _δi${\delta }_i$ denote the covering excess on a sphere of radius i$i$, 0≤i≤n$0\le i\le n$. Generalizing an earlier result of van Wee, Habsieger and Honkala showed _δp−1≥p−1${\delta }_{p-1}\ge p-1$ whenever n≡−1$n\equiv -1$ (mod p$p$) for an odd prime p$p$ and _δ0=_δ1=?=_δp−2=0${\delta }_0={\delta }_1=?={\delta }_{p-2}=0$ holds. In the present paper we give the new estimation _δp−1≥(p−2)p−1${\delta }_{p-1}\ge (p-2)p-1$ instead. This answers a question of Habsieger and yields a “general improvement of the general excess bound” for binary codes with covering radius one. The proof uses a classification theorem for certain subset systems as well as new congruence properties for the δ$\delta$-function, which were conjectured by Habsieger.     

Mosco convergence of the sets of fixed points for one-parameter nonexpansive semigroups

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$C$ be a closed convex subset of a Hilbert space E$E$. Let {T(t):t≥0}$\{T\left(t\right):t\ge 0\}$ be a strongly continuous semigroup of nonexpansive mappings on C$C$. The set of all fixed points of T(t)$T\left(t\right)$ is denoted by F(T(t))$F\left(T\left(t\right)\right)$ for each t≥0$t\ge 0$. Let τ$\tau$ be a nonnegative real number and let {_tn}$\left\{t_n\right\}$ be a sequence in R$\mathbb{R}$ satisfying τ+_tn≥0$\tau +t_n\ge 0$ and _tn≠0$t_n\ne 0$ for n∈N$n\in \mathbb{N}$, and _limntn=0${lim}_n{t}_n=0$. Then {F(T(τ+_tn))}$\left\{F\left(T(\tau +t_n)\right)\right\}$ converges to _?t≥0F(T(t))${?}_{t\ge 0}F\left(T\left(t\right)\right)$ in the sense of Mosco.     

A boundary blow-up elliptic problem with an inhomogeneous term

By a perturbation method and constructing comparison functions, we reveal how the inhomogeneous term h$h$ affects the exact asymptotic behaviour of solutions near the boundary to the problem △u=b(x)g(u)+λh(x)$△u=b\left(x\right)g\left(u\right)+\lambda h\left(x\right)$, u>0$u>0$ in Ω$\Omega$, u_|∂Ω=∞$u{|}_{\partial \Omega }=\infty$, where Ω$\Omega$ is a bounded domain with smooth boundary in R^N${\mathbb{R}}^N$, λ>0$\lambda >0$, g∈C¹[0,∞)$g\in C^1[0,\infty )$ is increasing on [0,∞)$[0,\infty )$, g(0)=0$g\left(0\right)=0$, g^′$g^{\prime }$ is regularly varying at infinity with positive index ρ$\rho$, the weight b$b$, which is non-trivial and non-negative in Ω$\Omega$, may be vanishing on the boundary, and the inhomogeneous term h$h$ is non-negative in Ω$\Omega$ and may be singular on the boundary.     

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.     

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).     

On a family of differential operators with the coupling parameter in the boundary condition

We study a family of differential operators _Lα${\mathbf{L}}_{\alpha }$ in two variables, depending on the coupling parameter α?0$\alpha ?0$ that appears only in the boundary conditions. Our main concern is the spectral properties of _Lα${\mathbf{L}}_{\alpha }$, which turn out to be quite different for α<1$\alpha <1$ and for α>1$\alpha >1$. In particular, _Lα${\mathbf{L}}_{\alpha }$ has a unique self-adjoint realization for α<1$\alpha <1$ and many such realizations for α>1$\alpha >1$. In the more difficult case α>1$\alpha >1$ an analysis of non-elliptic pseudodifferential operators in dimension one is involved.