Related papers: Approximating Weak Bisimilarity of Basic Parallel …
We continue our investigation on pcf with weak form of choice. Characteristically we assume DC + P(Y) when looking and prod_{s in Y} delta_s. We get more parallel of theorems on pcf.
Recent studies reveal that branching bisimilarity is decidable for both nBPP (normed Basic Parallel Process) and nBPA (normed Basic Process Algebra). These results lead to the question if there are any other models in the hierarchy of PRS…
In this paper we give a criterion that characterizes equivalent weak crossed products. By duality, we obtain a similar result for weak crossed coproducts and, as a consequence, we find the conditions that assures the equivalence between two…
This paper considers binomial approximation of continuous time stochastic processes. It is shown that, under some mild integrability conditions, a process can be approximated in mean square sense and in other strong metrics by binomial…
We prove weak approximation for smooth cubic hypersurfaces of dimension at least 2 defined over the function field of a complex curve.
This paper studies optimal decision rules, including estimators and tests, for weakly identified GMM models. We derive the limit experiment for weakly identified GMM, and propose a theoretically-motivated class of priors which give rise to…
We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail conditional expectation of binomial random variables.
For a sequence of uniformly bounded, degenerate semigroups on a Hilbert space, we compare various types of convergences to a limit semigroup. Among others, we show that convergence of the semigroups, or of the resolvents of the generators,…
We present a new algorithm for solving optimization problems with objective functions that are the sum of a smooth function and a (potentially) nonsmooth regularization function, and nonlinear equality constraints. The algorithm may be…
We prove boundedness and regularity estimates for weak solutions to a class of linear nonlocal equations involving integro-differential operators with almost no order of differentiability. In particular, we show that bounded weak solutions…
We define a weak compatibility condition for the Newest Vertex Bisection algorithm on simplex grids of any dimension and show that using this condition the iterative algorithm terminates successfully. Additionally we provide an O(n)…
The key limitation of the verification performance lies in the ability of error detection. With this intuition we designed several variants of pessimistic verification, which are simple workflows that could significantly improve the…
We show that the weak limit of a quasiminimizing sequence is a quasiminimal set. This generalizes the notion of weak limit of a minimizing sequences introduced by De Lellis, De Philippis, De Rosa, Ghiraldin and Maggi. This result is also…
Burkart, Caucal, Steffen (1995) showed a procedure deciding bisimulation equivalence of processes in Basic Process Algebra (BPA), i.e. of sequential processes generated by context-free grammars. They improved the previous decidability…
The aim of this paper is to give a simpler, more usable sufficient condition to the regularity of generic weakly stationary time series. Also, this condition is used to show how regular processes satisfying these sufficient conditions can…
Variational methods are employed in situations where exact Bayesian inference becomes intractable due to the difficulty in performing certain integrals. Typically, variational methods postulate a tractable posterior and formulate a lower…
Models based on approximation capabilities have recently been studied in the context of Optimal Recovery. These models, however, are not compatible with overparametrization, since model- and data-consistent functions could then be…
We establish a comparison principle for viscosity subsolutions and supersolutions of a broad class of second-order quasilinear, maximally subelliptic PDEs on general manifolds. In fact, we prove the comparison theorem for a larger class of…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
We obtain approximation results for general positive linear operators satisfying mild conditions, when acting on discontinuous functions and absolutely continuous functions having discontinuous derivatives. The upper bounds, given in terms…