搜索结果: 1-15 共查到“管理学 Complete”相关记录15条 . 查询时间(0.038 秒)
Complete Corrected Diffusion Approximations for the Maximum of a Random Walk
Corrected diffusion approximations random walks ladder heights single-server queue
2015/7/6
Consider a random walk (Sn: n ≥ 0) with drift −μ and S0= 0. Assuming that the increments have exponential moments, negative mean, and are strongly nonlattice, we provide a complete asymptotic ex...
Large deviation principles and complete equivalence and nonequivalence results for pure and mixed ensembles
Statistics turbulent coherent structures mechanical model the model of two-dimensional fluid motion
2014/12/29
We consider a general class of statistical mechanical models of coherent structures in turbulence, which includes models of two-dimensional fluid motion, quasi-geostrophic flows, and dispersive waves....
Complete analysis of phase transitions and ensemble equivalence for the Curie-Weiss-Potts model
Structure rotating model Potts model porter model
2014/12/25
Using the theory of large deviations, we analyze the phase transition structure of the Curie–Weiss–Potts spin model, which is a mean-field approximation to the nearest-neighbor Potts model. It is equi...
Complete Intersections in Toric Ideals
Dimension of codimension eliminate sparse theory Angle of partial differential equations
2014/12/25
We present examples which show that in dimension higher than one or codimension higher than two, there exist toric ideals IA such that no binomial ideal contained in IA and of the same dimension is a ...
Counting solutions to binomial complete intersections
Affine systems algebraically closed field characteristics of zero
2014/12/25
We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in...
Complete intersections in toric ideals
Dimension sparse theory Angle of partial differential equations
2014/12/25
We present examples that show that in dimension higher than one or codimension higher than two, there exist toric ideals such that no binomial ideal contained in and of the same dimension is a complet...
Model selection and clustering in stochastic block models with the exact integrated complete data likelihood
Random graphs stochastic block models integrated classication likelihood
2013/4/27
The stochastic block model (SBM) is a mixture model used for the clustering of nodes in networks. It has now been employed for more than a decade to analyze very different types of networks in many sc...
A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
algebraic statistics contingency table three-way transportation pro-gram
2011/3/24
We give an exponential lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph of arbitrary size. Our result is a generalization of the result by Berstein and Onn (...
The minimal complete class for the vector of variance components
The minimal complete class the vector of variance components
2009/9/23
The minimal complete class for the vector of variance components。
On complete convergence for partial sums of independent identically distributed random variables
complete convergence independent identically distributed random variables
2009/9/23
On complete convergence for partial sums of independent identically distributed random variables。
Complete exact laws
Strong law of large numbers weak law of large numbers complete convergence
2009/9/22
Consider independent and identically distributed random
variables (x,X ,,n, > i ) with xP {X > x ) - a (log x)", where
a: > -1 and P{X < -x) = o(P{X > x)). Even though the mean
does not exist, we ...
Limiting distributions and almost sure limit theorems for the normalized maxima of complete and incomplete samples from Gaussian sequence
complete and incomplete samples limiting distribution maximum stationary Gaussian sequence
2009/9/16
Let ${X_k, kgeqslant 1}$ be a stationary Gaussian sequence with partial maximum $M_n=max{X_{k},1leqslant kleqslant n}$ and sample mean $overline{X}_n=sum_{k=1}^{n}X_{k}/n$. Suppose that some of the ra...
Limit theorems for an epidemic model on the complete graph
Epidemic model random walk complete graph Markov chains Law of Large Numbers Central Limit Theorem
2009/6/12
We study the following random walks system on the complete graph with n vertices.At time zero,there is a number of active and inactive particles living on the vertices.Active particles move as continu...
The edges of the complete graph on n vertices are assigned independent exponentially distributed costs. A k-matching is a set of k edges of which no two have a vertex in common. We obtain explicit bou...
Active Set and EM Algorithms for Log-Concave Densities Based on Complete and Censored Data
Active Set EM Algorithms Log-Concave Densities Complete and Censored Data
2010/4/30
We develop an active set algorithm for the maximum likelihood estimation of a
log–concave density based on complete data. Building on this fast algorithm, we introduce an EM algorithm to treat arbitr...