搜索结果: 1-15 共查到“知识库 概率数论”相关记录18条 . 查询时间(2.265 秒)
On the deletion channel with small deletion probability
Delete channel point-to-point communication small expansion remove probability
font style='font-size:12px;'>
2015/8/21
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Despite significant effort, little is known about its capacity, and even less about...
How to Find Good Finite-Length Codes: From Art Towards Science
LDPC coding transmission binary probability
font style='font-size:12px;'>
2015/8/21
We explain how to optimize finite-length LDPC codes for transmission over the binary erasure channel. Our approach relies on an analytic approximation of the erasure probability. This is in turn...
Symmetry analysis of reversible Markov chains
Reversible markov chain orbital diagram characteristic vector；the mixture of markov chain an arbitrary number
font style='font-size:12px;'>
2015/8/11
We show how to use subgroups of the symmetry group of a reversible Markov chain to give useful bounds on eigenvalues and their multiplicity. We supplement classical representation theoretic tools invo...
Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
ExpectedStochastic CombinatorialProblems
font style='font-size:12px;'>
2012/12/4
We study the stochastic versions of a broad class of combinatorial problems where the weights of the elements in the input dataset are uncertain. The class of problems that we study includes shortest ...
Pseudorandomness for read-once formulas
Pseudorandomness read-once formulas
font style='font-size:12px;'>
2012/12/4
We give an explicit construction of a pseudorandom generator for read-once formulas whose inputs can be read in arbitrary order. For formulas in n inputs and arbitrary gates of fan-in at most d = O(n=...
Computationally Limited Randomness
randomness, limited randomness, probabilistic polynomial time, hierarchy, stack machine.
font style='font-size:12px;'>
2012/12/3
The starting point of this work is the basic question of whether there exists a formal and meaningful way to limit the computational power that a time bounded randomized Turing Machine can employ on i...
Markov链利率下相依风险模型破产概率的上界
相依风险 Markov链利率 离散时间风险模型 破产概率
font style='font-size:12px;'>
2012/11/13
考虑一类离散时间风险模型的破产问题. 模型中假设保费过程和理赔过程都具有一阶自回归结构(AR(1)), 并且利率过程是取值于可数状态空间的齐次Markov链. 针对保费在期初收取和期末收取两种不同的情况, 用鞅方法得到了其各自破产概率的上界.
Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators
Limits Non-adaptive Constructions Pseudo-Random Generators
font style='font-size:12px;'>
2012/12/3
The standard approach for constructing a large-stretch pseudo-randomgenerator given a one-way permutation or given a smallerstretch pseudo-randomgenerator involves repeatedly composing the given primi...
Welfare, Voting and the Constitution of a Federal Assembly
Voting theory expected utility Rawls European Union degressive proportionality
font style='font-size:12px;'>
2011/9/6
Equal and proportional representation are two poles of a continuum of models of representation for the assembly of a federation of states. The choice of a model has repercussions on the welfare distri...
An analytical model for evaluating outage and handover probability of cellular wireless networks
analytical model for evaluating outage handover probability of cellular wireless networks
font style='font-size:12px;'>
2010/11/26
We consider stochastic cellular networks where base stations locations form a homogenous Poisson point process and each mobile is attached to the base station that provides the
best mean signal power...
An Efficient Voting Algorithm for Finding Additive Biclusters with Random Background
additive bicluster,computational biology, gene expression data analysis, polynomialtime algorithm, probability model.
font style='font-size:12px;'>
2012/12/3
The biclustering problem has been extensively studied in many areas, including e-commerce,；data mining, machine learning, pattern recognition, statistics, and, more recently, computational；biology. Gi...
The Complexity of Distinguishing Markov Random Fields
The Complexity Markov Random Fields
font style='font-size:12px;'>
2012/12/3
Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstructing a dependency graph of bou...
利用调整的logit 变换后估计量的渐近正态性对二项分布建立了近似的枢轴方程, 并由此得到了二项分布参数的一种近似信仰分布. 对一样本和两样本情形的数值结果表明, 该近似信仰分布导出的区间估计具有比文献中推荐的区间估计更好的小样本频率性质.
Precise rates in the law of iterated logarithm for the moment of I.I.D. random variables
the law of iterated logarithm strong approximation truncation method i.i.d. random variables
font style='font-size:12px;'>
2007/12/12
Let $\{X, X_n; n\ge 1\}$ be a sequence of i.i.d. random variables, ${\rm E} X=0$, ${\rm E} X^2=\sigma^2<\infty$. Set $S_n=X_1+X_2+\cdots+X_n$, $M_n=\max_{k\le n}|S_k|$, $n\ge 1$. Let $a_n=O(1/\log\log...
Explicit Expressions for the Ruin Probabilities of Erlang Risk Processes with Pareto Individual Claim Distributions
font style='font-size:12px;'>
2007/12/12
In this paper we first consider a risk process in whichclaim inter-arrival times and the time until the first claim havean Erlang (2) distribution. An explicit solution is derived forthe probability o...