搜索结果: 1-15 共查到“随机数值实验 random”相关记录16条 . 查询时间(0.156 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Learning Quantum Observables of Low Degrees from a Logarithmic Number of Random Queries
对数 随机查询 低次量子 可观察量
2023/4/14
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Large deviations in random interlacements III: Disconnection probabilities for random interlacements
随机交错 大偏差 随机交错 断开概率
2023/5/8
安徽师范大学数学计算机科学学院概率论与数理统计英文课件Chapter3 Random Vectors and their Numerical Characteristics
安徽师范大学数学计算机科学学院 概率论 数理统计 英文课件 Chapter3 Random Vectors Numerical Characteristics
2019/11/26
安徽师范大学数学计算机科学学院概率论与数理统计英文课件Chapter3 Random Vectors and their Numerical Characteristics。
Local Limit Theorems for Random Walks in a 1D Random Environment
RWRE quenched random environments
2015/9/29
We consider random walks (RW) in a one-dimensional i.i.d.
random environment with jumps to the nearest neighbours. For almost
all environments, we prove a quenched Local Limit Theorem (LLT) for
the...
The Set of Solutions of Random XORSAT Formulae
random constraint satisfaction problem clustering of solutions phase transition random graph local weak convergence belief propagation
2015/8/21
The XOR-satisfiability (XORSAT) problem requires finding an assignment of n Boolean variables that satisfy m exclusive OR (XOR) clauses, whereby each clause constrains a subset of the variables. We co...
Counting good truth assignments of random k-SAT formulae
Random k-SAT Correlation Decay Uniqueness Gibbs Distribution
2015/8/21
We present a deterministic approximation algorithm to compute logarithm of the number of ‘good’ truth assignments for a random k-satisfiability (k-SAT) formula in polynomial time (by ‘good’ we m...
Reconstruction for models on random graphs
Random variables algorithms the random sequence diagram
2015/8/21
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Several theoretical results (a...
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes. ...
Gibbs states and the set of solutions of random constraint satisfaction problems
Gibbs random constraints the solution
2015/8/21
Gibbs states and the set of solutions of random constraint satisfaction problems.
Estimating Random Variables from Random Sparse Observations
Discrete random variable random function decoupling principle
2015/8/21
Let X1, . . . ,Xn be a collection of iid discrete random variables, and Y1, . . . , Ym a set of noisy observations of such variables. Assume each observation Ya to be a random function of some a rando...
ESTIMATING AND UNDERSTANDING EXPONENTIAL RANDOM GRAPH MODELS
Assessment understanding index random graph model
2015/7/7
ESTIMATING AND UNDERSTANDING EXPONENTIAL RANDOM GRAPH MODELS。
UNSEPARATED PAIRS AND FIXED POINTS IN RANDOM PERMUTATIONS
Unseparated pairs fixed points random arrangement
2015/7/7
UNSEPARATED PAIRS AND FIXED POINTS IN RANDOM PERMUTATIONS。
On the Spectra and Pseudospectra of a Class of Non-Self-Adjoint Random Matrices and Operators
Pseudospectra Non-Self-Adjoint Random Matrices Operators
2011/8/22
Abstract: In this paper we develop and apply methods for the spectral analysis of non-self-adjoint tridiagonal infinite and finite random matrices, and for the spectral analysis of analogous determini...
Strong disorder in semidirected random polymers
Random walks random potential Lyapunov norms strong disorder lo-calization
2010/12/6
We consider a random walk in a random potential, which models a situ-ation of a random polymer and we study the annealed and quenched costs to perform long crossings from a point to a hyperplane. Thes...
We construct a time-consistent sublinear expectation in the setting of volatility uncertainty. This mapping extends Peng’s G-expectation by allowing the range of the volatility uncertainty to be stoch...