Results 1  10
of
400
Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems
 SIAM Rev
, 1989
"... Abstract. A concept called stochastic complementation is an idea which occurs naturally, although not always explicitly, in the theory and application of finite Markov chains. This paper brings this idea to the forefront with an explicit definition and a development of some of its properties. Applic ..."
Abstract

Cited by 98 (7 self)
 Add to MetaCart
Abstract. A concept called stochastic complementation is an idea which occurs naturally, although not always explicitly, in the theory and application of finite Markov chains. This paper brings this idea to the forefront with an explicit definition and a development of some of its properties
Stochastic Complement Analysis of MultiServer Threshold Queues with Hysteresis
 J
, 1996
"... We consider a Kserver thresholdbased queueing system with hysteresis, for which a set of forward thresholds (F 1 ; F 2 ; : : : ; FK \Gamma1 ) and a set of reverse thresholds (R 1 ; R 2 ; : : : ; RK \Gamma1 ) are defined. A simple version of this multiserver queueing system behaves as follows. Whe ..."
Abstract
 Add to MetaCart
We consider a Kserver thresholdbased queueing system with hysteresis, for which a set of forward thresholds (F 1 ; F 2 ; : : : ; FK \Gamma1 ) and a set of reverse thresholds (R 1 ; R 2 ; : : : ; RK \Gamma1 ) are defined. A simple version of this multiserver queueing system behaves as follows. When a customer arrives to an empty system, it is serviced by a single server. Whenever the number of customers exceeds a forward threshold F i , a server is added to the system and server activation is instantaneous. Whenever the number of customer falls below a reverse threshold R i , a server is removed from the system. We consider and solve several variation of this problem, namely: (1) homogeneous servers with Poisson arrivals, (2) homogeneous servers with bulk (Poisson) arrivals, and (3) heterogeneous servers with Poisson arrivals. We place no restrictions on the number of servers or the bulk sizes or the size of the waiting room. In [8], the authors solve a limited form of this problem u...
Stochastic signaling: Information substitutes and complements
, 2012
"... I develop a model of stochastic costly signaling in the presence of exogenous imperfect information, and study whether equilibrium signaling decreases ('information substitutes') or increases ('information complements') if the accuracy of exogenous information increases. A stocha ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
I develop a model of stochastic costly signaling in the presence of exogenous imperfect information, and study whether equilibrium signaling decreases ('information substitutes') or increases ('information complements') if the accuracy of exogenous information increases. A
Preconditioning stochastic Galerkin saddle point systems
 SIAM J. MATRIX ANAL. APPL
, 2009
"... Mixed finite element discretizations of deterministic secondorder elliptic partial differential equations (PDEs) lead to saddle point systems for which the study of iterative solvers and preconditioners is mature. Galerkin approximation of solutions of stochastic secondorder elliptic PDEs, which ..."
Abstract

Cited by 110 (4 self)
 Add to MetaCart
Mixed finite element discretizations of deterministic secondorder elliptic partial differential equations (PDEs) lead to saddle point systems for which the study of iterative solvers and preconditioners is mature. Galerkin approximation of solutions of stochastic secondorder elliptic PDEs
Stochastic Models and Descriptive Statistics for Phylogenetic Trees, from Yule to Today
 STATIST. SCI
, 2001
"... Yule (1924) observed that distributions of number of species per genus were typically longtailed, and proposed a stochastic model to fit this data. Modern taxonomists often prefer to represent relationships between species via phylogenetic trees; the counterpart to Yule's observation is th ..."
Abstract

Cited by 92 (3 self)
 Add to MetaCart
Yule (1924) observed that distributions of number of species per genus were typically longtailed, and proposed a stochastic model to fit this data. Modern taxonomists often prefer to represent relationships between species via phylogenetic trees; the counterpart to Yule's observation
AN AUGMENTED INCOMPLETE FACTORIZATION APPROACH FOR COMPUTING THE SCHUR COMPLEMENT IN STOCHASTIC OPTIMIZATION
"... We present a scalable approach and implementation for solving stochastic optimization problems on highperformance computers. In this work we revisit the sparse linear algebra computations of the parallel solver PIPS with the goal of improving the sharedmemory performance and decreasing the time to ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
We present a scalable approach and implementation for solving stochastic optimization problems on highperformance computers. In this work we revisit the sparse linear algebra computations of the parallel solver PIPS with the goal of improving the sharedmemory performance and decreasing the time
Kinematic Jump Processes For Monocular 3D Human Tracking
 In Int. Conf. Computer Vision & Pattern Recognition
, 2003
"... A major difficulty for 3D human body tracking from monocular image sequences is the near nonobservability of kinematic degrees of freedom that generate motion in depth. For known link (body segment) lengths, the strict nonobservabilities reduce to twofold ‘forwards/backwards flipping ’ ambiguities ..."
Abstract

Cited by 138 (17 self)
 Add to MetaCart
of investigating alternative minima within a group are needed. Previous approaches to this have used generic search methods that do not exploit the specific problem structure. Here, we complement these by using simple kinematic reasoning to enumerate the tree of possible forwards/backwards flips, thus greatly
A preconditioning technique for Schur complement systems arising in stochastic optimization
"... ..."
Codes and Automata Corrections and Complements
, 2010
"... This file contains corrections and complements to the book. 1 Preliminaries • p. 28 ℓ.2: Insert ‘provided the automaton is complete ’ after ‘The matrix M/k is stochastic’. • p. 37 ℓ. 2 of proof of Proposition 1.10.10: remove the last ‘×’. ..."
Abstract
 Add to MetaCart
This file contains corrections and complements to the book. 1 Preliminaries • p. 28 ℓ.2: Insert ‘provided the automaton is complete ’ after ‘The matrix M/k is stochastic’. • p. 37 ℓ. 2 of proof of Proposition 1.10.10: remove the last ‘×’.
Stochastic Processes
"... In this section we recall the basic vocabulary and results of probability theory. A probability space associated with a random experiment is a triple (Ω, F, P) where: (i) Ω is the set of all possible outcomes of the random experiment, and it is called the sample space. (ii) F is a family of subsets ..."
Abstract
 Add to MetaCart
of Ω which has the structure of a σfield: a) ∅ ∈ F b) If A ∈ F, then its complement A c also belongs to F c) A1, A2,... ∈ F = ⇒ ∪ ∞ i=1Ai ∈ F (iii) P is a function which associates a number P (A) to each set A ∈ F with the following properties: a) 0 ≤ P (A) ≤ 1, b) P (Ω) = 1 c) For any sequence
Results 1  10
of
400