理学 >>> 数学 >>> 概率论 >>> 随机分析 >>>
搜索结果: 1-15 共查到随机分析 random相关记录37条 . 查询时间(0.198 秒)
In this lecture, I will discuss how tilting and coarse graining, two key ideas in modern probability, come into play in deriving respectively the lower and upper bounds of the asymptotic probability i...
In this lecture, I will talk about the large deviation problems in random interlacements, in particular the LDP of the occupation measure, and discuss its relations to sharp asymptotic probabilities o...
This paper studies the formation of risk-sharing networks through costly social investments, identifying endogenous inequality and a misallocation of resources as possible downsides to such agreemen...
THE SUBGROUP ALGORITHM FOR GENERATING UNIFORM RANDOM VARIABLES.
RANDOM WALKS ARISING IN RANDOM NUMBER GENERATION。
Analysis of Top To Random Shuffles     Analysis  random  upset       2015/7/14
Analysis of Top To Random Shuffles.
RANDOM WALKS AND HYPERPLANE ARRANGEMENTS。
Many Random Number Generators (RNG) are available nowadays; they are divided in two categories, hardware RNG, that provide “true” random numbers, and algorithmic RNG, that generate pseudo random num...
We consider transient random walks in random environment on Z in the positive speed (ballistic) and critical zero speed regimes. A classical result of Kesten, Kozlov and Spitzer proves that the hitti...
The problem of random number generation from an uncorrelated random source (of unknown probability distribution)dates back to von Neumann’s 1951 work.
We construct a conformal welding of two Liouville quantum gravity random surfaces and show that the interface between them is a random fractal curve called the Schramm-Loewner evolution (SLE), thereby...
We consider the interlacement Poisson point process on the space of doubly-infinite Zd-valued trajectories modulo time shift, tending to infinity at positive and negative infinite times. The set of v...
For biased random walk on the infinite cluster in supercritical i.i.d.percolation on Z2, where the bias of the walk is quantified by a parameter > 1,it has been conjectured (and partly proved) that ...
We study the large deviations performance, i.e., the exponential decay rate of the error probability, of distributed detection algorithms over random networks.

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...