搜索结果: 1-15 共查到“数学 Independence”相关记录18条 . 查询时间(0.734 秒)
昆明理工大学理学院概率论与数理统计课件Chapter 3 Multionariate Random Variables--Independence
昆明理工大学理学院 概率论与数理统计 课件 Chapter 3 Multionariate Random Variables Independence
2017/4/17
昆明理工大学理学院概率论与数理统计课件Chapter 3 Multionariate Random Variables--Independence.
THE NONCOMMUTATIVE WIENER LEMMA,LINEAR INDEPENDENCE,AND SPECTRAL PROPERTIES OF THE ALGEBRA OF TIME-FREQUENCY SHIFT OPERATORS
NONCOMMUTATIVE WIENER LEMMA LINEAR INDEPENDENCE SPECTRAL PROPERTIES OF THE ALGEBRA TIME-FREQUENCY SHIFT OPERATORS
2015/9/29
In this paper we analyze the Banach *-algebra of time-frequency shifts with absolutely summable coefficients. We prove a noncommutative version of the Wiener lemma. We also construct a faithful tracia...
Karp complexity and classes with the independence property
Karp complexity independence property
2015/9/25
A class K of structures is controlled if for all cardinals
λ, the relation of L∞,λ-equivalence partitions K into a set of
equivalence classes (as opposed to a proper class). We prove that
no pseudo...
TESTING FOR INDEPENDENCE IN A TWO-WAY TABLE: NEW INTERPRETATIONS OF THE CHI-SQUARE STATISTIC
Classic chi-square distribution independent statistics dimension
2015/7/14
The classical chi-square test for independence in a two-way contingency
table often rejects the independence hypothesis at an extremely small signif-
icance level, particularly when the sample siz...
Linear independence of time-frequency translates of functions with faster than exponential decay
Gabor system exponential decay HRT conjecture linear independence timefrequency translates analytic zero divisor conjecture
2012/6/29
We establish the linear independence of time-frequency translates for functions $f$ having one sided decay $\lim_{x\to \infty} |f(x)| e^{cx \log x} = 0$ for all $c>0$. We also prove such results for f...
Conditional Sure Independence Screening
False selection rate Generalized linear models Sparsity Sure screening Variable selection
2012/6/21
Independence screening is a powerful method for variable selection for `Big Data' when the number of variables is massive. Commonly used independence screening methods are based on marginal correlatio...
Minimal primes of ideals arising from conditional independence statements
conditional independence statements Commutative Algebra
2011/9/22
Abstract: We consider ideals, arising in the context of conditional independence models, that generalize those considered by Fink [6] in a way distinct from the generalization of [11]. We describe the...
Abstract: We show that, for two non-trivial random variables X and Y under a sublinear expectation space, if X is independent from Y and Y is independent from X, then X and Y must be maximally distrib...
An extremal problem with applications to testing multivariate independence
boundary-value problem Green function multivariate indepen-dence asymptotic efficiency of test statistics
2011/1/18
Some problems of statistics can be reduced to extremal problems of minimiz-ing functionals of smooth functions defined on the cube [0, 1]m, m ≥ 2. In this paper, we study a class of extremal problems ...
Nowhere dense graph classes, stability, and the independence property
Nowhere dense graph classes the independence property
2010/11/23
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorith...
Notes on factor-criticality, extendibility and independence number
Notes on factor-criticality independence number
2010/11/19
In this paper, we give a sufficient and necessary condition for a $k$-extendable graph to be $2k$-factor-critical when $k=\nu/4$, and prove some results on independence numbers in $n$-factor-critical ...
$\ell^2$-Linear Independence for the System of Integer Translates of a Square Integrable Function
Linear Independence Square Integrable Function
2010/11/15
We prove that if the system of integer translates of a square integrable function is $\ell^2$-linear independent then its periodization function is strictly positive almost everywhere. Indeed we show...
In the literature there are two different notions of lovely pairs of a theory T, according to whether T is simple or geometric. We introduce a notion of lovely pairs for an independence relation, whic...
The word problem and the Aharoni-Berger-Ziv conjecture on the connectivity of independence complexes
Graphs independence complexes topological connectivity algorithm
2010/12/9
For each finite simple graph G, Aharoni, Berger and Ziv consider a recur-sively defined number (G) 2 Z [ {+1} which gives a lower bound for the topological connectivity of the independence complex IG...