اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMatching expectations
122
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The game of memory is played with a deck of n pairs of cards. The cards in each pair are identical. The deck is shuffled and the cards laid face down. A move consists of flipping over first one card then another. The cards are removed from play if they match. Otherwise, they are flipped back over and the next move commences. A game ends when all pairs have been matched. We determine that, when the game is played optimally, as n tends to infinity: 1) The expected number of moves is (3 - 2 ln 2)n + 7/8 - 2 ln 2 (approximately 1.61 n), 2) The expected number of times two matching cards are unwittingly flipped over is ln 2, and 3) The expected number of flips until two matching cards have been seen is asymptotically sqrt{pi n}.
قيم البحث
اقرأ أيضاً
RNA motifs typically consist of short, modular patterns that include base pairs formed within and between modules. Estimating the abundance of these patterns is of fundamental importance for assessing the statistical significance of matches in genome
wide searches, and for predicting whether a given function has evolved many times in different species or arose from a single common ancestor. In this manuscript, we review in an integrated and self-contained manner some basic concepts of automata theory, generating functions and transfer matrix methods that are relevant to pattern analysis in biological sequences. We formalize, in a general framework, the concept of Markov chain embedding to analyze patterns in random strings produced by a memoryless source. This conceptualization, together with the capability of automata to recognize complicated patterns, allows a systematic analysis of problems related to the occurrence and frequency of patterns in random strings. The applications we present focus on the concept of synchronization of automata, as well as automata used to search for a finite number of keywords (including sets of patterns generated according to base pairing rules) in a general text.
We describe a new framework of a sublinear expectation space and the related notions and results of distributions, independence. A new notion of G-distributions is introduced which generalizes our G-normal-distribution in the sense that mean-uncertai
nty can be also described. W present our new result of central limit theorem under sublinear expectation. This theorem can be also regarded as a generalization of the law of large number in the case of mean-uncertainty.
Under the sublinear expectation $mathbb{E}[cdot]:=sup_{thetain Theta} E_theta[cdot]$ for a given set of linear expectations ${E_theta: thetain Theta}$, we establish a new law of large numbers and a new central limit theorem with rate of convergence.
We present some interesting special cases and discuss a related statistical inference problem. We also give an approximation and a representation of the $G$-normal distribution, which was used as the limit in Peng (2007)s central limit theorem, in a probability space.
In this paper, we consider the product space for two processes with independent increments under nonlinear expectations. By introducing a discretization method, we construct a nonlinear expectation under which the given two processes can be seen as a new process with independent increments.
In this paper, we prove the equivalent conditions of complete moment convergence of the maximum for partial weighted sums of independent, identically distributed random variables under sublinear expectations space. As applications, the Baum-Katz type
results for the maximum for partial weighted sums of independent, identically distributed random variables are established under sublinear expectations space. The results obtained in the article are the extensions of the equivalent conditions of complete moment convergence of the maximum under classical linear expectation space.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
