Search results for "Bounded"

showing 10 items of 658 documents

Analytic capacity and quasiconformal mappings with $W^{1,2}$ Beltrami coefficient

2008

We show that if $\phi$ is a quasiconformal mapping with compactly supported Beltrami coefficient in the Sobolev space $W^{1,2}$, then $\phi$ preserves sets with vanishing analytic capacity. It then follows that a compact set $E$ is removable for bounded analytic functions if and only if it is removable for bounded quasiregular mappings with compactly supported Beltrami coefficient in $W^{1,2}$.

Sobolev spaceQuasiconformal mappingComputer Science::GraphicsCompact spaceMathematics::Complex VariablesGeneral MathematicsBounded functionMathematical analysisAnalytic capacityAnalytic functionMathematicsMathematical Research Letters
researchProduct

Dynamics and spectra of composition operators on the Schwartz space

2017

[EN] In this paper we study the dynamics of the composition operators defined in the Schwartz space of rapidly decreasing functions. We prove that such an operator is never supercyclic and, for monotonic symbols, it is power bounded only in trivial cases. For a polynomial symbol ¿ of degree greater than one we show that the operator is mean ergodic if and only if it is power bounded and this is the case when ¿ has even degree and lacks fixed points. We also discuss the spectrum of composition operators.

Space of rapidly decreasing functionsMathematics::Functional AnalysisPure mathematicsComposition operator010102 general mathematicsSpectrum (functional analysis)Power bounded operatorMonotonic functionFixed pointMean ergodic composition operator01 natural sciencesFunctional Analysis (math.FA)Mathematics - Functional Analysis010101 applied mathematicsOperator (computer programming)Schwartz spaceBounded functionSpectrumFOS: MathematicsErgodic theory0101 mathematicsMATEMATICA APLICADAAnalysisMathematics
researchProduct

Spline-Based Wavelet Transforms

2018

The Lifting Scheme introduced in (Sweldens, Appl. Comput. Harmon. Anal. 3(2), 186–200 (1996) and Sweldens, SIAM J. Math. Anal. 29(2), 511–546 (1997).) [3, 4] is a method that constructs bi-orthogonal wavelet transforms of signals and provides their efficient implementation. The main feature of the lifting scheme is that all the constructions are derived directly in the spatial domain and therefore can be custom designed to more general and irregular settings such as non-uniformly spaced data samples and bounded intervals. In this chapter, we outline the lifting scheme and describe how to use the local quasi-interpolating splines, introduced in Chap. 6, for the construction of wavelet transf…

Spline (mathematics)Boundary effectsLifting schemeComputer scienceBounded functionWavelet transformSpatial domainAlgorithm
researchProduct

Weighted bounded mean oscillation applied to backward stochastic differential equations

2015

Abstract We deduce conditional L p -estimates for the variation of a solution of a BSDE. Both quadratic and sub-quadratic types of BSDEs are considered, and using the theory of weighted bounded mean oscillation we deduce new tail estimates for the solution ( Y , Z ) on subintervals of [ 0 , T ] . Some new results for the decoupling technique introduced in Geiss and Ylinen (2019) are obtained as well and some applications of the tail estimates are given.

Statistics and ProbabilityApplied MathematicsProbability (math.PR)010102 general mathematicsMathematical analysis01 natural sciencesBSDEsBounded mean oscillationdecoupling010104 statistics & probabilityStochastic differential equationvärähtelytQuadratic equationJohn-Nirenberg theoremtail estimatesModeling and Simulation60H10 60G99FOS: MathematicsDecoupling (probability)weighted bounded mean oscillation0101 mathematicsdifferentiaaliyhtälötMathematics - Probabilitystokastiset prosessitMathematicsStochastic Processes and their Applications
researchProduct

Time-dependent weak rate of convergence for functions of generalized bounded variation

2016

Let $W$ denote the Brownian motion. For any exponentially bounded Borel function $g$ the function $u$ defined by $u(t,x)= \mathbb{E}[g(x{+}\sigma W_{T-t})]$ is the stochastic solution of the backward heat equation with terminal condition $g$. Let $u^n(t,x)$ denote the corresponding approximation generated by a simple symmetric random walk with time steps $2T/n$ and space steps $\pm \sigma \sqrt{T/n}$ where $\sigma > 0$. For quite irregular terminal conditions $g$ (bounded variation on compact intervals, locally H\"older continuous) the rate of convergence of $u^n(t,x)$ to $u(t,x)$ is considered, and also the behavior of the error $u^n(t,x)-u(t,x)$ as $t$ tends to $T$

Statistics and ProbabilityApproximation using simple random walkweak rate of convergence01 natural sciencesStochastic solution41A25 65M15 (Primary) 35K05 60G50 (Secondary)010104 statistics & probabilityExponential growthFOS: Mathematics0101 mathematicsBrownian motionstokastiset prosessitMathematicsosittaisdifferentiaaliyhtälötApplied MathematicsProbability (math.PR)010102 general mathematicsMathematical analysisfinite difference approximation of the heat equationFunction (mathematics)Rate of convergenceBounded functionBounded variationnumeerinen analyysiapproksimointiStatistics Probability and UncertaintyMathematics - ProbabilityStochastic Analysis and Applications
researchProduct

Can the Adaptive Metropolis Algorithm Collapse Without the Covariance Lower Bound?

2011

The Adaptive Metropolis (AM) algorithm is based on the symmetric random-walk Metropolis algorithm. The proposal distribution has the following time-dependent covariance matrix at step $n+1$ \[ S_n = Cov(X_1,...,X_n) + \epsilon I, \] that is, the sample covariance matrix of the history of the chain plus a (small) constant $\epsilon>0$ multiple of the identity matrix $I$. The lower bound on the eigenvalues of $S_n$ induced by the factor $\epsilon I$ is theoretically convenient, but practically cumbersome, as a good value for the parameter $\epsilon$ may not always be easy to choose. This article considers variants of the AM algorithm that do not explicitly bound the eigenvalues of $S_n$ away …

Statistics and ProbabilityFOS: Computer and information sciencesIdentity matrixMathematics - Statistics TheoryStatistics Theory (math.ST)Upper and lower boundsStatistics - Computation93E3593E15Combinatorics60J27Mathematics::ProbabilityLaw of large numbers65C40 60J27 93E15 93E35stochastic approximationFOS: MathematicsEigenvalues and eigenvectorsComputation (stat.CO)Metropolis algorithmMathematicsProbability (math.PR)Zero (complex analysis)CovariancestabilityUniform continuityBounded function65C40Statistics Probability and Uncertaintyadaptive Markov chain Monte CarloMathematics - Probability
researchProduct

Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance

2017

We establish an ordering criterion for the asymptotic variances of two consistent Markov chain Monte Carlo (MCMC) estimators: an importance sampling (IS) estimator, based on an approximate reversible chain and subsequent IS weighting, and a standard MCMC estimator, based on an exact reversible chain. Essentially, we relax the criterion of the Peskun type covariance ordering by considering two different invariant probabilities, and obtain, in place of a strict ordering of asymptotic variances, a bound of the asymptotic variance of IS by that of the direct MCMC. Simple examples show that IS can have arbitrarily better or worse asymptotic variance than Metropolis-Hastings and delayed-acceptanc…

Statistics and ProbabilityFOS: Computer and information sciencesdelayed-acceptanceMarkovin ketjut01 natural sciencesStatistics - Computationasymptotic variance010104 statistics & probabilitysymbols.namesake60J22 65C05unbiased estimatorFOS: MathematicsApplied mathematics0101 mathematicsComputation (stat.CO)stokastiset prosessitestimointiMathematicsnumeeriset menetelmätpseudo-marginal algorithmApplied Mathematics010102 general mathematicsProbability (math.PR)EstimatorMarkov chain Monte CarloCovarianceInfimum and supremumWeightingMarkov chain Monte CarloMonte Carlo -menetelmätDelta methodimportance samplingModeling and SimulationBounded functionsymbolsImportance samplingMathematics - Probability
researchProduct

Gamma Kernel Intensity Estimation in Temporal Point Processes

2011

In this article, we propose a nonparametric approach for estimating the intensity function of temporal point processes based on kernel estimators. In particular, we use asymmetric kernel estimators characterized by the gamma distribution, in order to describe features of observed point patterns adequately. Some characteristics of these estimators are analyzed and discussed both through simulated results and applications to real data from different seismic catalogs.

Statistics and ProbabilityNonparametric statisticsEstimatorKernel principal component analysisPoint processVariable kernel density estimationKernel embedding of distributionsModeling and SimulationKernel (statistics)Bounded domainStatisticsGamma distributionGamma kernel estimatorIntensity functionTemporal point processes.Settore SECS-S/01 - StatisticaMathematicsCommunications in Statistics - Simulation and Computation
researchProduct

Measure differential inclusions: existence results and minimum problems

2020

AbstractWe focus on a very general problem in the theory of dynamic systems, namely that of studying measure differential inclusions with varying measures. The multifunction on the right hand side has compact non-necessarily convex values in a real Euclidean space and satisfies bounded variation hypotheses with respect to the Pompeiu excess (and not to the Hausdorff-Pompeiu distance, as usually in literature). This is possible due to the use of interesting selection principles for excess bounded variation set-valued mappings. Conditions for the minimization of a generic functional with respect to a family of measures generated by equiregulated left-continuous, nondecreasing functions and to…

Statistics and ProbabilityNumerical AnalysisEuclidean spaceApplied MathematicsRegular polygonMeasure (mathematics)Differential inclusionSettore MAT/05 - Analisi MatematicaBounded variationTrajectoryApplied mathematicsGeometry and TopologyMinificationFocus (optics)Measure differential inclusion Bounded variation Pompeiu excess Selection Minimality conditionAnalysisMathematics
researchProduct

Dynamics of the Selkov oscillator.

2018

A classical example of a mathematical model for oscillations in a biological system is the Selkov oscillator, which is a simple description of glycolysis. It is a system of two ordinary differential equations which, when expressed in dimensionless variables, depends on two parameters. Surprisingly it appears that no complete rigorous analysis of the dynamics of this model has ever been given. In this paper several properties of the dynamics of solutions of the model are established. With a view to studying unbounded solutions a thorough analysis of the Poincar\'e compactification of the system is given. It is proved that for any values of the parameters there are solutions which tend to inf…

Statistics and ProbabilityPeriodicityQuantitative Biology - Subcellular ProcessesClassical exampleFOS: Physical sciencesDynamical Systems (math.DS)01 natural sciencesModels BiologicalGeneral Biochemistry Genetics and Molecular Biology010305 fluids & plasmassymbols.namesake0103 physical sciencesFOS: MathematicsPhysics - Biological PhysicsMathematics - Dynamical Systems0101 mathematicsSubcellular Processes (q-bio.SC)MathematicsGeneral Immunology and MicrobiologyCompactification (physics)Applied Mathematics010102 general mathematicsMathematical analysisGeneral MedicineMathematical ConceptsKineticsMonotone polygonBiological Physics (physics.bio-ph)FOS: Biological sciencesModeling and SimulationBounded functionOrdinary differential equationPoincaré conjecturesymbolsGeneral Agricultural and Biological SciencesGlycolysisDimensionless quantityMathematical biosciences
researchProduct