Time homogeneous diffusions with a given marginal at a deterministic time

In this article, it is proved that for any probability law μ$\mu$ over R$\mathbb{R}$ with finite first moment and a given deterministic time t>0$t>0$, there exists a gap diffusion with law μ$\mu$ at the prescribed time t$t$.     

Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs

A semicomplete multipartite or semicomplete c$c$-partite digraph D$D$ is a biorientation of a c$c$-partite graph. A semicomplete multipartite digraph D$D$ is called strongly quasi-Hamiltonian-connected, if for any two distinct vertices x$x$ and y$y$ of D$D$, there is a path P$P$ from x$x$ to y$y$ such that P$P$ contains at least one vertex from each partite set of D$D$.     

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.     

Tournaments associated with multigraphs and a theorem of Hakimi

A tournament of order n$n$ is usually considered as an orientation of the complete graph _Kn$K_n$. In this note, we consider a more general definition of a tournament that we call aC$C$-tournament, where C$C$ is the adjacency matrix of a multigraph G$G$, and a C$C$-tournament is an orientation of G$G$. The score vector of a C$C$-tournament is the vector of outdegrees of its vertices. In 1965 Hakimi obtained necessary and sufficient conditions for the existence of a C$C$-tournament with a prescribed score vector R$R$ and gave an algorithm to construct such a C$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$C$-tournament which works even for weighted graphs.     

The Deodhar decomposition of the Grassmannian and the regularity of KP solitons

Given a point A$A$ in the real Grassmannian, it is well-known that one can construct a soliton solution _uA(x,y,t)$u_A(x,y,t)$ to the KP equation. The contour plot   of such a solution provides a tropical approximation to the solution when the variables x$x$, y$y$, and t$t$ are considered on a large scale and the time t$t$ is fixed. In this paper we use several decompositions of the Grassmannian in order to gain an understanding of the contour plots of the corresponding soliton solutions. First we use the positroid stratification   of the real Grassmannian in order to characterize the unbounded line-solitons in the contour plots at y?0$y?0$ and y?0$y?0$. Next we use the Deodhar decomposition   of the Grassmannian–a refinement of the positroid stratification–to study contour plots at t?0$t?0$. More specifically, we index the components of the Deodhar decomposition of the Grassmannian by certain tableaux which we call Go-diagrams  , and then use these Go-diagrams to characterize the contour plots of solitons solutions when t?0$t?0$. Finally we use these results to show that a soliton solution _uA(x,y,t)$u_A(x,y,t)$ is regular for all times t$t$ if and only if A$A$ comes from the totally non-negative part of the Grassmannian.     

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.     

Quandle cocycles from invariant theory

Let G$G$ be a group. Any G$G$-module M$M$ has an algebraic structure called a G$G$-family of Alexander quandles. Given a 2-cocycle of a cohomology associated with this G$G$-family, topological invariants of (handlebody) knots in the 3-sphere are defined. We develop a simple algorithm to algebraically construct n$n$-cocycles of this G$G$-family from G$G$-invariant group n$n$-cocycles of the abelian group M$M$. We present many examples of 2-cocycles of these G$G$-families using facts from (modular) invariant theory.     

Exponential bounds for convergence of entropy rate approximations in hidden Markov models satisfying a path-mergeability condition

A hidden Markov model (HMM) is said to have path-mergeable states   if for any two states i,j$i,j$ there exist a word w$w$ and state k$k$ such that it is possible to transition from both i$i$ and j$j$ to k$k$ while emitting w$w$. We show that for a finite HMM with path-mergeable states the block estimates of the entropy rate converge exponentially fast. We also show that the path-mergeability property is asymptotically typical in the space of HMM topologies and easily testable.     

Polychromatic 4-coloring of cubic even embeddings on the projective plane

A polychromatic     k$k$-coloring   of a map G$G$ on a surface is a k$k$-coloring such that each face of G$G$ has all k$k$ colors on its boundary vertices. An even embedding     G$G$ on a surface is a map of a simple graph on the surface such that each face of G$G$ is bounded by a cycle of even length. In this paper, we shall prove that a cubic even embedding G$G$ on the projective plane has a polychromatic proper 4-coloring if and only if G$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.     

Presenting higher stacks as simplicial schemes

We show that an n$n$-geometric stack may be regarded as a special kind of simplicial scheme, namely a Duskin n$n$-hypergroupoid in affine schemes, where surjectivity is defined in terms of covering maps, yielding Artin n$n$-stacks, Deligne–Mumford n$n$-stacks and n$n$-schemes as the notion of covering varies. This formulation adapts to all HAG contexts, so in particular works for derived n$n$-stacks (replacing rings with simplicial rings). We exploit this to describe quasi-coherent sheaves and complexes on these stacks, and to draw comparisons with Kontsevich’s dg-schemes. As an application, we show how the cotangent complex controls infinitesimal deformations of higher and derived stacks.     

Fixed point theorem for generalized Φ -pseudocontractive mappings

Let E$E$ be a real Banach space, C$C$ be a nonempty closed convex subset of E$E$ and T:C→C$T:C\to C$ be a continuous generalized Φ$\Phi$-pseudocontractive mapping. It is proved that T$T$ has a unique fixed point in C$C$.     

Oscillation of harmonic functions for subordinate Brownian motion and its applications

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$X$ in a bounded κ$\kappa$-fat open set; if u$u$ is a positive harmonic function with respect to X$X$ in a bounded κ$\kappa$-fat open set D$D$ and h$h$ is a positive harmonic function in D$D$ vanishing on D^c$D^c$, then the non-tangential limit of u/h$u/h$ exists almost everywhere with respect to the Martin-representing measure of h$h$.     

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.     

Every point is critical

We show that, for any compact Alexandrov surface S$S$ (without boundary) and any point y$y$ in S$S$, there exists a point x$x$ in S$S$ for which y$y$ is a critical point. Moreover, we prove that uniqueness characterizes the surfaces homeomorphic to the sphere among smooth orientable surfaces.     

Weak convergence of censored and reflected stable processes

It is shown that if a sequence of open n$n$-sets _Dk$D_k$ increases to an open n$n$-set D$D$ then reflected stable processes in _Dk$D_k$ converge weakly to the reflected stable process in D$D$ for every starting point x$x$ in D$D$. The same result holds for censored α$\alpha$-stable processes for every x$x$ in D$D$ if D$D$ and _Dk$D_k$ 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.     

Constant-factor approximation of the domination number in sparse graphs

The k$k$-domination number   of a graph is the minimum size of a set D$D$ such that every vertex of G$G$ is at distance at most k$k$ from D$D$. We give a linear-time constant-factor algorithm for approximation of the k$k$-domination number in classes of graphs with bounded expansion, which include e.g. proper minor-closed graph classes, proper classes closed on topological minors and classes of graphs that can be drawn on a fixed surface with bounded number of crossings on each edge.     

On prime ideals and radicals of polynomial rings and graded rings

We extend some known results on radicals and prime ideals from polynomial rings and Laurent polynomial rings to Z$\mathbb{Z}$-graded rings, i.e, rings graded by the additive group of integers. The main of them concerns the Brown–McCoy radical G$G$ and the radical S$S$, which for a given ring A$A$ is defined as the intersection of prime ideals I$I$ of A$A$ such that A/I$A/I$ is a ring with a large center. The studies are related to some open problems on the radicals G$G$ and S$S$ of polynomial rings and situated in the context of Koethe’s problem.     

On the complexity of the bondage and reinforcement problems

Let G=(V,E)$G=(V,E)$ be a graph. A subset D⊆V$D\subseteq V$ is a dominating set if every vertex not in D$D$ is adjacent to a vertex in D$D$. A dominating set D$D$ is called a total dominating set if every vertex in D$D$ is adjacent to a vertex in D$D$. The domination (resp. total domination) number of G$G$ is the smallest cardinality of a dominating (resp. total dominating) set of G$G$. The bondage (resp. total bondage) number of a nonempty graph G$G$ is the smallest number of edges whose removal from G$G$ results in a graph with larger domination (resp. total domination) number of G$G$. The reinforcement (resp. total reinforcement) number of G$G$ is the smallest number of edges whose addition to G$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.