88 citations found. Retrieving documents...
S. Karlin and H. M. Taylor, A Second Course in Stochastic Processes. Academic Press, 1981.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Replication and Mutation on Neutral Networks - Reidys, Forst, Schuster (1999)   (3 citations)  (Correct)

....process is a Markovian process in continuous time which is completely described by the transition rates, P ; 1 , P ; and P ; Gamma1 . The replicationdeletion process with the approximations adopted above, and with a finite population of constant size N , is a birth and death process [25, 35, 36] that converges to a stationary distribution, defined by: dP =dt = 0 8 . The time axis can be transformed such that the probability for a replication deletion event becomes independent of the population average. This reactor time t is defined by d t = dt (oe Gamma 1) N = dt ( ....

S. Karlin and H. M. Taylor. A Second Course in Stochastic Processes. Academic Press, New York, 1981.


Selfish Routing - Roughgarden (2002)   (3 citations)  (Correct)

....functions. Recall that if a queue service distribution (specifying the number of customers served in a time step) has expectation and standard deviation # (both of which we assume to be finite) then the expected waiting time under Poisson arrivals with rate # is #(1 # 2( see [80] or [94] for a derivation. To rephrase this formula in our usual notation, we view the parameter as the edge capacity u and the Poisson rate # as the amount of tra#c assigned to an edge; we are then interested in latency functions # of the following form: #(x) x(1 # 2u(u . As in the ....

S. Karlin and H. M. Taylor. A Second Course in Stochastic Processes. Academic Press, 1981.


A Packet Marking Algorithm for Congestion Pricing - Aleksi Penttinen And   (Correct)

.... h) X(t) X(t) x] 18) which are called the drift parameter and the infinitesimal variance, respectively. For our purposes it is sufficient to consider the time homogenous processes for which the infinitesimal parameters depend only on the state x and not on t. Following the procedure in [17], we now set the state 0 and the predefined overflow limit c as absorbing barriers. The problem is to find the probability of absorption into c when starting from the position X(0) x,0 x c. Denote this probability by u(x) and select a small time duration h,sosmall that the absorption ....

....zero, we get a differential equation for the desired probability. 0 = x) du (x) 0 x c, u(0) 0, u(c) 1. 20) Assume that s (x) 0 and define the scale function of the process as S(x) exp 2(h) h) dh dt. 21) Then the general solution of (20) can be written [17] as S(x) S(c) 0 1. 22) The result given here can be easily applied to provide results for all time homogenous diffusion processes. For the simplest model, we follow the example of Harrison and Patel [18] and shed light on a GI GI 1 queuing model with independent inter arrival time ....

Samuel Karlin and Howard M. Taylor, A Second Course in Stochastic Processes, Academic Press, San Diego, 1981.


The Price of Anarchy is Independent of the Network Topology - Roughgarden (2002)   (10 citations)  (Correct)

....of allowable latency functions. Recall that if a queue service distribution (specifying the number of customers served in a time step) has finite expectation and finite standard deviation #, then the expected waiting time with Poisson arrivals with rate # is #(1 # 2( see [8] or [9] for a derivation. To rephrase this formula in our usual notation, we view the parameter as the edge capacity u and the Poisson rate # as the amount of tra#c assigned to an edge; we are then interested in latency functions # of the following form: #(x) x(1 # 2u(u x) As in the ....

S. Karlin and H. M. Taylor. A Second Course in Stochastic Processes. Academic Press, 1981.


Locally Optimal Pumping and Treatment Rates in Uncertain.. - Kern, Westman, Hanson   (Correct)

....noise in the form of a Wiener or Gaussian process. The addition of random jumps and later Poisson processes became possible through the original work of theorists such as Florentin [ It6 [13] Kushner [16] and Gihman and Skorohod [8] and continued by people such as Karlin and Taylor [14], Ryan and Hanson [19] Marlton [18] and Westman and Hanson[20, 22] One general approach is to use stochastic dynamic programming, but this requires a large amount of memory. Large random jumps can be especially troublesome, even when finite elements are used, in part due to the Curse of ....

S. Karlin and H. M. Taylor, A Second Course in Stochastic Processes, Academic Press, New York, 1981.


Stochastic Models for Cell Motion and Taxis - Ionides, Fang, Isseroff, Oster (2003)   (Correct)

....v t v x v y is supposed to follow the stochastic infinitesimal equation (M1) dv t av t dt for positive constants a and b and a two dimensional Brownian motion W t . An introduction to SDEs can be found in [43] and an elegant treatment of one dimensional diffusions is given in [31]. The coefficient av t is called the infinitesimal drift and b the infinitesimal variance. Heuristically, a gives the rate at which the velocity regresses to zero and b gives the magnitude of the random innovations which tend to push the velocity away from zero. The root mean square speed ....

....of the bacterium up an increasing gradient of a ligand, and f : is a convex function, then the expected value E f x t is monotone increasing with time. This would also be true if x t were an unbiased random walk, or a martingale. Comparing the Ito and Stratonovich solutions [31] to the SDEs introduced in Section 3 gives a new insight into the controversy. Kinesis may be modeled in a simple but instructive way by considering a stochastic process x t , taking values in 0 , defined by the infinitesimal equation dx t sx t dW t This is a particular case of (M4) ....

S. Karlin and H. M. Taylor. A Second Course in Stochastic Processes. Academic Press, New York, 1981.


A Death Process Model for Randomized Elections in Trees - Métivier, Saheb-Djahromi, al. (2001)   (Correct)

....q distribution) on the set of vertices does not seem to be of simple nature and no substantial properties are known. Here we consider an extension of the second approach which is easily implementable by distributed algorithms. The idea is based on the assumptions linked to Poisson processes, see [4]. Each vertex which has become a leaf, has lifetime which is a real valued random variable exponentially distributed. The leaf is removed once its lifetime has expired (if the tree is not reduced at that time to a unique vertex) The process continues until the tree is reduced to a vertex; the ....

....are functions of the initial one and the communicated values ineherited from the removed adjacent leaves. 4 Simple Properties of the General Model According to the previous section, the general model (Algorithm 2) may be regarded as a continueoustime pure death stochastic process on a tree, see [4]. Once a vertex v has become a leaf, its death happens according to a Poisson process with a given parameter (v) which is supposed to have been determined by some speci c rules detailed in the sequel. Each leaf v of the residual tree behaves independently and, under the assumption that it is ....

[Article contains additional citation context not shown here]

S. Karlin and H. M. Taylor. A second course in stochastic processes. Academic Press, 1981.


A Stochastic Control Problem for a Firm With Internal Competition.. - Guo (2001)   (Correct)

....di usion term and bounded drift and with re ected barrier hits any point in a compact set in nite time with probability one, we have: Corollary 13 When 6= 0, under the optimal play U (x) Pf 1g = 1. 2.3. 2 Ruin probability for = 0 Adopting the terminology in Section 6, Chapter 15 of [9], we start by checking S(x) for x x , where S(x) Z x 0 s(y)dy = Z x 0 exp 2 Z y U (y) U (y) 2 ( U (y) 2 dy: 32) If S(x) 1 for some x x , then the ruin probability is zero. Otherwise, it means that zero is an attracting point, and we need to ....

.... ( 2 s( d = lim l 0 C Z x l 2 6 6 4 Z l exp 2 2 exp 2 2 1 2 2 2 2r 2 3 7 7 5 exp 2 2 exp 2 2 1 2 2 2 2 2r 2 d = A lim l 0 ln exp 2 l 2 1 = 1 Here A is bounded. Hence by Lemma 6. 2 ([9], page 230) we have Corollary 14 When = 0, Pf 1g = 0 under the optimal strategy U (x) In particular, zero is an attractive and unattainable point when 2 2r 2 . It is worth pointing out that in [10] and [12] the statement that a company goes bankrupt in nite time with ....

S. Karlin and H. Taylor (1981): A Second Course in Stochastic Processes. Academic Press.


Northwest Corner and Banded Matrix Approximations to a.. - Zhao, Braun, Li (1999)   (Correct)

....k=1 g n;k b k;0 : Remark 1 i) As a generalization, we can define a i;j and b j;i for all i and j. Then for any fixed i, a i;j and b j;i will play the same role as a 0;i and b i;0 . ii) a = u Q 1. When the Markov chain is recurrent, this result can also be found in Section 3 of Chapter 11 of [8] or Theorem 3.3 of [1] If the Markov chain is transient, then P 1 k=0 P k 1 (for example, see the last equation on page 107 in Ross [16] This means that the expected number of visits to state n starting from 0 is finite. Therefore, the expected number of visits to state n before hitting ....

....Markov chain, ergodic or nonergodic, the convergence of (n) b to b in Theorem 4 is also in the sense of l 1 . For any ergodic Markov chain, the convergence of (n) a to a in Theorem 4 is also in the sense of l 1 . When the Markov chain P is ergodic, then 0 a 0;j = j according to Theorem 3. 3 of [8]. Using a similar argument (also see Remark 1) we can show that i a i;j = j . Remark 2 i) When the Markov chain P is ergodic, then a is proportional to the stationary probability vector ( 1 ; 2 ; and (a 0;0 ; a 0;1 ; a 0;2 ; with a 0;0 = 1 is one of the regular measures of P . ....

Karlin, S.K. and Taylor, H.M. (1981) A Second Course in Stochastic Processes. Academic Press, New York.


Optimal Importance Sampling in Markov Process Simulation - Esa Hyyti And (2001)   (Correct)

No context found.

S. Karlin and H. M. Taylor, A Second Course in Stochastic Processes. Academic Press, 1981.


Fractional Integral Equations and State Space Transforms - Buchmann, Klüppelberg (2004)   (1 citation)  (Correct)

No context found.

Karlin, S. and Taylor, H. M. (1991) A Second Course in Stochastic Processes. Academic Press, Inc., New York.


Optimal Importance Sampling in Markov Process Simulation - Hyytiä, Virtamo (2001)   (Correct)

No context found.

S. Karlin and H. M. Taylor, A Second Course in Stochastic Processes. Academic Press, 1981.


The AURORA Financial Management System: Model and.. - Pflug, Dockner.. (1999)   (Correct)

No context found.

S. Karlin and H. Taylor. A second course in stochastic processes. Academic Press, Boston, 1993.


Delay and Capacity Trade-offs for Wireless Ad Hoc Networks.. - Sharma, Mazumdar   (Correct)

No context found.

S. Karlin and H.M. Taylor. A Second Course in Stochastic Processes. Academic, New York, 1981.


Stochastic Models for Cell Motion and Taxis - Edward Ionides Kathy   (Correct)

No context found.

S. Karlin and H. M. Taylor. A Second Course in Stochastic Processes. Academic Press, New York, 1981.


The Maximality Principle Revisited: On Certain Optimal Stopping.. - Obloj (2004)   (Correct)

No context found.

S. Karlin and H. M. Taylor. A second course in stochastic processes. Academic Press Inc. [Harcourt Brace Jovanovich Publishers], New York, 1981.


On Achievable Delay/Capacity Trade-offs in Mobile Ad Hoc.. - Sharma, Mazumdar   (Correct)

No context found.

S. Karlin and H.M. Taylor. A Second Course in Stochastic Processes, Academic, New York, 1981.


Properties of the reflected Ornstein-Uhlenbeck process - Ward, Glynn (2002)   (Correct)

No context found.

Karlin, S. and H. Taylor: 1976, A Second Course in Stochastic Processes. New York: Academic Press.


The Price of Anarchy is Independent of the Network Topology - Roughgarden (2002)   (10 citations)  (Correct)

No context found.

S. Karlin and H. M. Taylor. A Second Course in Stochastic Processes. Academic Press, 1981.


Maximum Likelihood Estimation of a Stochastic.. - Pillow, Paninski.. (2003)   (Correct)

No context found.

S. Karlin and H. Taylor. A Second Course in Stochastic Processes. Academic Press, New York, 1981.


The Patched Brownian Motion Distribution - Amir Dembo And   (Correct)

No context found.

S. Karlin and H. Taylor (1981): A Second Course in stochastic Processes. Academic Press.


A General Approach to the Stochastic Rotation Problem with - Amenity Valuation Luis   (Correct)

No context found.

Karlin, S. and Taylor, H. A second course in stochastic processes, 1981, Academic Press, Orlando.


Annuities with Controlled Random Interest Rates - Perry, Stadje, Yosef   (Correct)

No context found.

Karlin, S, Taylor, H. (1975) A Second Course in Stochastic Processes. Academic Press, New York.


A Probabilistic Analysis - Ramudhin, Bartholdi, III, Calvin.. (2003)   (Correct)

No context found.

Karlin S. and Taylor H.M. 1981. A Second Course in Stochastic processes, Academic Press Inc. 32


Dynamic analysis of some Relational Data Bases.. - Danièle.. (1994)   (3 citations)  (Correct)

No context found.

KARLIN, S. and TAYLOR, H.M.: A second Course in Stochastic Processes. Acad. Press 1981.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC