اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLimit Theorems for Hybridization Reactions on Oligonucleotide Microarrays
305
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We derive herein the limiting laws for certain stationary distributions of birth-and-death processes related to the classical model of chemical adsorption-desorption reactions due to Langmuir. The model has been recently considered in the context of a hybridization reaction on an oligonucleotide DNA microarray. Our results imply that the truncated gamma- and beta- type distributions can be used as approximations to the observed distributions of the fluorescence readings of the oligo-probes on a microarray. These findings might be useful in developing new model-based, probe-specific methods of extracting target concentrations from array fluorescence readings.
قيم البحث
اقرأ أيضاً
The approximation of integral type functionals is studied for discrete observations of a continuous It^o semimartingale. Based on novel approximations in the Fourier domain, central limit theorems are proved for $L^2$-Sobolev functions with fractiona
l smoothness. An explicit $L^2$-lower bound shows that already lower order quadrature rules, such as the trapezoidal rule and the classical Riemann estimator, are rate optimal, but only the trapezoidal rule is efficient, achieving the minimal asymptotic variance.
Marcinkiewicz strong law of large numbers, ${n^{-frac1p}}sum_{k=1}^{n} (d_{k}- d)rightarrow 0 $ almost surely with $pin(1,2)$, are developed for products $d_k=prod_{r=1}^s x_k^{(r)}$, where the $x_k^{(r)} = sum_{l=-infty}^{infty}c_{k-l}^{(r)}xi_l^{(r
)}$ are two-sided linear process with coefficients ${c_l^{(r)}}_{lin mathbb{Z}}$ and i.i.d. zero-mean innovations ${xi_l^{(r)}}_{lin mathbb{Z}}$. The decay of the coefficients $c_l^{(r)}$ as $|l|toinfty$, can be slow enough for ${x_k^{(r)}}$ to have long memory while ${d_k}$ can have heavy tails. The long-range dependence and heavy tails for ${d_k}$ are handled simultaneously and a decoupling property shows the convergence rate is dictated by the worst of long-range dependence and heavy tails, but not their combination. The results provide a means to estimate how much (if any) long-range dependence and heavy tails a sequential data set possesses, which is done for real financial data. All of the stocks we considered had some degree of heavy tails. The majority also had long-range dependence. The Marcinkiewicz strong law of large numbers is also extended to the multivariate linear process case.
An urn contains balls of d colors. At each time, a ball is drawn and then replaced together with a random number of balls of the same color. Assuming that some colors are dominated by others, we prove central limit theorems. Some statistical applications are discussed.
We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn out and balls of different colors can be simultaneously added. More precisely, at each time-step, the conditional distribution of the number of extracte
d balls of a certain color given the past is assumed to be hypergeometric. We prove some central limit theorems in the sense of stable convergence and of almost sure conditional convergence, which are stronger than convergence in distribution. The proven results provide asymptotic confidence intervals for the limit proportion, whose distribution is generally unknown. Moreover, we also consider the case of more urns subjected to some random common factors.
We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting random walks on the simplex of probability measures over a finite set. Due to a reinforcement mechanism, the increments of the walks are correlated, for
cing their convergence to the same, possibly random, limit. Random walks of this form have been introduced in the context of urn models and in stochastic approximation. We also propose an application to opinion dynamics in a random network evolving via preferential attachment. We study, in particular, random walks interacting through a mean-field rule and compare the rate they converge to their limit with the rate of synchronization, i.e. the rate at which their mutual distances converge to zero. Under certain conditions, synchronization is faster than convergence.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
