Displaying 361 – 380 of 449

Showing per page

Monotonic rearrangements of functions with small mean oscillation

Dmitriy M. Stolyarov, Vasily I. Vasyunin, Pavel B. Zatitskiy (2015)

Studia Mathematica

We obtain sharp bounds for the monotonic rearrangement operator from "dyadic-type" classes to "continuous" ones; in particular, for the BMO space and Muckenhoupt classes. The idea is to connect the problem with a simple geometric construction named α-extension.

Monotonicity and comparison results for nonnegative dynamic systems. Part II: Continuous-time case

Nico M. van Dijk, Karel Sladký (2006)

Kybernetika

This second Part II, which follows a first Part I for the discrete-time case (see [DijkSl1]), deals with monotonicity and comparison results, as generalization of the pure stochastic case, for stochastic dynamic systems with arbitrary nonnegative generators in the continuous-time case. In contrast with the discrete-time case the generalization is no longer straightforward. A discrete-time transformation will therefore be developed first. Next, results from Part I can be adopted. The conditions,...

Monotonicity and comparison results for nonnegative dynamic systems. Part I: Discrete-time case

Nico M. van Dijk, Karel Sladký (2006)

Kybernetika

In two subsequent parts, Part I and II, monotonicity and comparison results will be studied, as generalization of the pure stochastic case, for arbitrary dynamic systems governed by nonnegative matrices. Part I covers the discrete-time and Part II the continuous-time case. The research has initially been motivated by a reliability application contained in Part II. In the present Part I it is shown that monotonicity and comparison results, as known for Markov chains, do carry over rather smoothly...

Monotonicity of Bayes estimators

Piotr Bolesław Nowak (2013)

Applicationes Mathematicae

Let X=(X₁,..., Xₙ) be a sample from a distribution with density f(x;θ), θ ∈ Θ ⊂ ℝ. In this article the Bayesian estimation of the parameter θ is considered. We examine whether the Bayes estimators of θ are pointwise ordered when the prior distributions are partially ordered. Various cases of loss function are studied. A lower bound for the survival function of the normal distribution is obtained.

Monotonicity of certain functionals under rearrangement

Adriano Garsia, Eugène Rodemich (1974)

Annales de l'institut Fourier

We show here that a wide class of integral inequalities concerning functions on [ 0 , 1 ] can be obtained by purely combinatorial methods. More precisely, we obtain modulus of continuity or other high order norm estimates for functions satisfying conditions of the type 0 1 0 1 Ψ f ( x ) - f ( y ) p ( x - y ) d x d y < where Ψ ( u ) and p ( u ) are monotone increasing functions of | u | .Several applications are also derived. In particular these methods are shown to yield a new condition for path continuity of general stochastic processes

Monte Carlo Random Walk Simulations Based on Distributed Order Differential Equations with Applications to Cell Biology

Andries, Erik, Umarov, Sabir, Steinberg, Stanly (2006)

Fractional Calculus and Applied Analysis

Mathematics Subject Classification: 65C05, 60G50, 39A10, 92C37In this paper the multi-dimensional Monte-Carlo random walk simulation models governed by distributed fractional order differential equations (DODEs) and multi-term fractional order differential equations are constructed. The construction is based on the discretization leading to a generalized difference scheme (containing a finite number of terms in the time step and infinite number of terms in the space step) of the Cauchy problem for...

Monte Carlo simulation and analytic approximation of epidemic processes on large networks

Noémi Nagy, Péter Simon (2013)

Open Mathematics

Low dimensional ODE approximations that capture the main characteristics of SIS-type epidemic propagation along a cycle graph are derived. Three different methods are shown that can accurately predict the expected number of infected nodes in the graph. The first method is based on the derivation of a master equation for the number of infected nodes. This uses the average number of SI edges for a given number of the infected nodes. The second approach is based on the observation that the epidemic...

Most random walks on nilpotent groups are mixing

R. Rębowski (1992)

Annales Polonici Mathematici

Let G be a second countable locally compact nilpotent group. It is shown that for every norm completely mixing (n.c.m.) random walk μ, αμ + (1-α)ν is n.c.m. for 0 < α ≤ 1, ν ∈ P(G). In particular, a generic stochastic convolution operator on G is n.c.m.

Currently displaying 361 – 380 of 449