Fixed point theorems for hybrid mappings.
Ontology highlight
ABSTRACT:
SUBMITTER: Samreen M
PROVIDER: S-EPMC4300029 | biostudies-other | 2015
REPOSITORIES: biostudies-other
Similar Datasets
Project description:We extend the notion of generalized weakly contraction mappings due to Choudhury et al. (2011) to generalized α-β-weakly contraction mappings. We show with examples that our new class of mappings is a real generalization of several known classes of mappings. We also establish fixed point results for such mappings in metric spaces. Applying our new results, we obtain fixed point results on ordinary metric spaces, metric spaces endowed with an arbitrary binary relation, and metric spaces endowed with graph.
| S-EPMC4034443 | biostudies-other
Project description:The purpose of this paper is to introduce the concept of partial rectangular metric spaces as a generalization of rectangular metric and partial metric spaces. Some properties of partial rectangular metric spaces and some fixed point results for quasitype contraction in partial rectangular metric spaces are proved. Some examples are given to illustrate the observed results.
| S-EPMC3926289 | biostudies-other
Project description:We define the concept of βℱL-admissible for a pair of L-fuzzy mappings and establish the existence of common L-fuzzy fixed point theorem. Our result generalizes some useful results in the literature. We provide an example to support our result.
| S-EPMC3932639 | biostudies-other
Project description:We introduce the concept of triangular αc-admissible mappings (pair of mappings) with respect to ηc nonself-mappings and establish the existence of PPF dependent fixed (coincidence) point theorems for contraction mappings involving triangular αc-admissible mappings (pair of mappings) with respect to ηc nonself-mappings in Razumikhin class. Several interesting consequences of our theorems are also given.
| S-EPMC3930129 | biostudies-other
Project description:Azam et al. (2011), introduce the notion of complex valued metric spaces and obtained common fixed point result for mappings in the context of complex valued metric spaces. Rao et al. (2013) introduce the notion of complex valued b-metric spaces. In this paper, we generalize the results of Azam et al. (2011), and Bhatt et al. (2011), by improving the conditions of contraction to establish the existence and uniqueness of common fixed point for two self-mappings on complex valued b-metric spaces. Some examples are given to illustrate the main results.
| S-EPMC4058227 | biostudies-other
Project description:We prove a common fixed point theorem for a hybrid pair of occasionally coincidentally idempotent mappings via common limit range property. Our result improves some results from the existing literature, especially the ones contained in Sintunavarat and Kumam (2009). Some illustrative and interesting examples to highlight the realized improvements are also furnished.
| S-EPMC3921952 | biostudies-other
Project description:In this paper we consider a class of split feasibility problem by focusing on the solution sets of two important problems in the setting of Hilbert spaces. One of them is the set of zero points of the sum of two monotone operators and the other is the set of fixed points of mappings. By using the modified forward–backward splitting method, we propose a viscosity iterative algorithm. Under suitable conditions, some strong convergence theorems of the sequence generated by the algorithm to a common solution of the problem are proved. At the end of the paper, some applications and the constructed algorithm are also discussed.
| S-EPMC6208615 | biostudies-other
Project description:In a 2-alternative forced-choice (2AFC) discrimination task, observers choose which of two stimuli has the higher value. The psychometric function for this task gives the probability of a correct response for a given stimulus difference, ?x. This paper proves four theorems about the psychometric function. Assuming the observer applies a transducer and adds noise, Theorem 1 derives a convenient general expression for the psychometric function. Discrimination data are often fitted with a Weibull function. Theorem 2 proves that the Weibull "slope" parameter, ?, can be approximated by ?(Noise) x ?(Transducer), where ?(Noise) is the ? of the Weibull function that fits best to the cumulative noise distribution, and ?(Transducer) depends on the transducer. We derive general expressions for ?(Noise) and ?(Transducer), from which we derive expressions for specific cases. One case that follows naturally from our general analysis is Pelli's finding that, when d' ? (?x)(b), ? ? ?(Noise) x b. We also consider two limiting cases. Theorem 3 proves that, as sensitivity improves, 2AFC performance will usually approach that for a linear transducer, whatever the actual transducer; we show that this does not apply at signal levels where the transducer gradient is zero, which explains why it does not apply to contrast detection. Theorem 4 proves that, when the exponent of a power-function transducer approaches zero, 2AFC performance approaches that of a logarithmic transducer. We show that the power-function exponents of 0.4-0.5 fitted to suprathreshold contrast discrimination data are close enough to zero for the fitted psychometric function to be practically indistinguishable from that of a log transducer. Finally, Weibull ? reflects the shape of the noise distribution, and we used our results to assess the recent claim that internal noise has higher kurtosis than a Gaussian. Our analysis of ? for contrast discrimination suggests that, if internal noise is stimulus-independent, it has lower kurtosis than a Gaussian.
| S-EPMC3790801 | biostudies-literature
Project description:Additive deformations of statistical systems arise in various areas of physics. Classical central limit theory is then no longer applicable, even when standard independence assumptions are preserved. This paper investigates ways in which deformed algebraic operations lead to distinctive central limit theory. We establish some general central limit results that are applicable to a range of examples arising in nonextensive statistical mechanics, including the addition of momenta and velocities via Kaniadakis addition, and Tsallis addition. We also investigate extensions to random additive deformations, and find evidence (based on simulation studies) for a universal limit specific to each statistical system.
| S-EPMC4972458 | biostudies-literature
Project description:Continuous-time Markov chains are frequently used as stochastic models for chemical reaction networks, especially in the growing field of systems biology. A fundamental problem for these Stochastic Chemical Reaction Networks (SCRNs) is to understand the dependence of the stochastic behavior of these systems on the chemical reaction rate parameters. Towards solving this problem, in this paper we develop theoretical tools called comparison theorems that provide stochastic ordering results for SCRNs. These theorems give sufficient conditions for monotonic dependence on parameters in these network models, which allow us to obtain, under suitable conditions, information about transient and steady-state behavior. These theorems exploit structural properties of SCRNs, beyond those of general continuous-time Markov chains. Furthermore, we derive two theorems to compare stationary distributions and mean first passage times for SCRNs with different parameter values, or with the same parameters and different initial conditions. These tools are developed for SCRNs taking values in a generic (finite or countably infinite) state space and can also be applied for non-mass-action kinetics models. When propensity functions are bounded, our method of proof gives an explicit method for coupling two comparable SCRNs, which can be used to simultaneously simulate their sample paths in a comparable manner. We illustrate our results with applications to models of enzymatic kinetics and epigenetic regulation by chromatin modifications.
| S-EPMC10066174 | biostudies-literature