An example of application of discrete Hardy s inequalities
|
|
- Miles Nicholson
- 5 years ago
- Views:
Transcription
1 An example of application of discrete Hardy s inequalities Laurent Miclo Laboratoire de Statistique et Probabilités, UMR C5583 Université PaulSabatieretCNRS 8, route de Narbonne 3062 Toulouse cedex, France miclo@cict.fr Summary : After having given a short proof of weighted Hardy s inequalities on IN, adapted from the continuous case, we will show how to use them to evaluate, up to an universal factor, spectral gaps and logarithmic Sobolev constants of birth and death processes on Z. We will illustrate this method by calculations on an example. Abbreviated title : Discrete Hardy s inequalities. American Mathematical Society 99 subject classifications : Primary 60J80 and 39A2 ; secondary 26D5 and 5A60. Key words and phrases : Birth and death Markov processes, spectral gaps,weightedhardy sinequalities on discrete intervals.
2 Introduction Weighted discrete Hardy s inequalities are a simple and very efficient way to evaluate spectral gaps on trees, since theoretically this method enables one to get an estimation up to a factor 32 (or 8 if, as below, the tree is the usual one on Z). The purpose of this note is to present this approach and to give an example of such a calculation. The birth and death Markov kernels under study were considered by C. Meise, who wanted to know the order of their spectral gap, to evaluate the speed of convergence to equilibrium of an other Markov chain on the n-uples, n IN \{}, ofelementsoftheadditivegroup Z 3,whoseunionsetisgenerating(formore details about this problem, see [8], where Meise gets its needed estimation by using a method due to Zeifman [3, 5]). In fact, there is already a lot of methods to evaluate the spectral gap of a birth and death process, for instance: nonnegative matrix approach ([2]), Zeifman s method([3, 5]), optimal path considerations ([6]), Chen s coupling and distance arguments ([7]), variants of Cheeger s inequalities ([2])... But in each of these approachs, there is a good choice to be made: one has to find a function in [2] or [3, 5], a length function in [6], a distance in [7], a renormalisation in [2], and there is no universal way to make such a suitable guess, one has to try and see on the specific examples at hand. The main advantage of the Hardy s inequalities is that they do not depend on yours prediction skills, they gives you a (relatively) explicit estimation of the spectral gap in terms of yours data (birth and death rates and the associated reversible probability). Sure, this evaluation is only good up to an universal factor 8, so in particular examplesthepreviousmethodscanbemore efficient, nevertheless in practice this factor is not a crucial point (see for instance the consequences of the estimation needed by Meise), and the robustess aspect of the Hardy s inequalities seems more important. Furthermore, this approach is also valid for the estimation of the Sobolev-logarithmic constant (see the third section below), and for the latter, there is no other general method. Indeed, the Hardy s inequalities give criteria for the existence of positive spectral gap and Sobolev-logarithmic constant for birth and death processes, in the spirit of the work of Bobkov and Götze for diffusions on IR (see []). But the serious drawback of the discrete Hardy s inequalities is that they can only be applied to Markov processes whose underlying graph is a tree (nevertheless subtrees can be useful for general finite Markov processes, see for instance [9]). Let us first recall the weighted discrete Hardy s inequalities on IN, with a short proof of these bounds, directly adapted from the one given by Muckenhoupt [0] for the similar continuous result on IR +.ForthegeneralcaseofweighteddiscreteHardy sinequalitiesonrootedtrees,see the appendice of [9], where these inequalities are deduced from those given by Evans, Harris and Pick in [4] for continuous trees (whose proof was itself inspired by the approach considered by Sawyer in [] for IR + ). So let µ and ν be two positive functions on IN,whichwillbeseenasmeasures,weare interested in the smallest constant A IR + {+ } such that the following inequalities are satisfied for all functions f : IN IR, µ(x) x IN 0<yx 2 f(y) A x IN ν(x)f 2 (x) 2
3 () To estimate A, letusintroducetheconstantb defined by B = sup x>0 x µ(y) ν(y) yx Then the weighted (by µ and ν) discretehardy sinequalitiesonin just say y= Proposition The constant B is a good approximation of A, inthesensethatwearealways assured of B A 4B Proof: We begin by proving that A 4B: letf be any function of IL 2 (IN, ν), we have to see that For x IN,denote x IN 0<yx 2 f(y) µ(x) 4B x IN f 2 (x) ν(x) N(x) = x y= ν(y) We start from the left hand side of (), for which we use a Cauchy-Schwarz inequality, to obtain the following upper bound µ(x) x IN 0<yx f 2 (y)ν(y)n 2 (y) 0<zx ν(z) N 2 (z) To deal with the last sum, we use the concavity inequality saying that for all a, b > 0, b 2 a 2 2 (b a) so we are assured that for all z>0(withtheconventionthatn(0) = 0), b 2 ν(z) N 2 (z) 2(N 2 (z) N 2 (z )) Thus we get 0<zx ν(z) N 2 (z) 2 2N 2 (x) ( B µ([x, + [) ) 2 We now have to consider 2 B f 2 (y)ν(y)n 2 (y) µ(x) y IN xy µ 2 ([x, + [) 3
4 and to do so we use again the previous convexity inequality, to obtain µ(x) xy µ 2 ([x, + [) 2 µ 2 ([x, + [) µ 2 ([x +, + [) xy = 2µ 2 ([y, + [) ( ) B 2 2 N(y) Putting together all these calculations, we end up with (). To prove the simpler lower bound A B, itisenoughtoapplytheinequality 2 f(y) µ(x) A f 2 (x) ν(x) x IN 0<yx x IN with well chosen functions f. More precisely, for x 0 IN fixed, let f be defined by { y IN /ν(y), if 0 <y x0, f(y) = 0, otherwise we get therefore A 0<yx 0 ν(y) f(y) x IN 0<yx xx 0 0<yx ν(y) from where we deduce that A µ([x 0, + [) 0<yx 0 /ν(y). To get the result we want, it remains to take the supremum in x 0 IN. Now let us see how this result can be applied to get an evaluation of the spectral gap for birth and death processes on Z: solet(a(i)) i Z and (b(i)) i Z be two sequences of positive numbers, which will respectively stand for the birth and death rates. Up to a multiplicative constant, there is an unique associated reversible measure µ, i.e.satisfyingforalli Z, µ(i)a(i) =µ(i+)b(i+). Let us assume that µ is in fact of finite weight, so from now on we can restrict ourselves to the case where it is a probability. The spectral gap of this birth and death process is the ergodic constant defined by E(f,f) λ = inf f IL 2 (µ)\vect(i) µ((f µ(f)) 2 ) where the Dirichlet form E is given for all functions f IL 2 (µ) by µ(x) µ(x) E(f,f) = i Z(f(i +) f(i)) 2 µ(i)a(i) For i Z, letusdefine B + (i) = sup x>i B (i) = sup x<i x y=i+ ( i y=x µ(y) µ(y)b(y) yx ) µ(y) µ(y)a(y) yx 4
5 Let m denote a median of µ (i.e. an integer m Z such that µ(],m[) /2 and µ(]m, + [) /2), and let B = B + (m) B (m) Its interest appears in the following estimation: Proposition 2 With the previous notations, we have 4B λ 2 B Proof: We first prove the lower bound on the spectral gap: let f IL 2 (µ) \ Vect(I) be given, we consider the two functions defined by and x Z, We have for them f (x) = (f(x) f(m))i ],m] (x) f + (x) = (f(x) f(m))i [m,+ [ (x) E(f,f) = E(f f(m)i,f f(m)i) = E(f,f )+E(f +,f + ) µ((f µ(f)) 2 ) µ((f f(m)i) 2 ) = µ(f 2 )+µ(f 2 +) so E(f,f) µ((f µ(f)) 2 ) min ( E(f,f ) µ(f 2 ) (A + A ) ; E(f ) +,f + ) µ(f+) 2 where A + (respectively A )isthebestconstantsuchthatthefollowing inequalities are satisfied for all functions g : IN IR, µ(m + x) x IN 0<yx 2 g(y) A + µ(m +x)a(m +x)g 2 (x) x IN = A + µ(m + x)b(m + x)g 2 (x) x IN (resp. x IN µ(m x) ( 0<yx g(y) ) 2 A x IN µ(m x)a(m x)g2 (x)). This fact shows that the bound λ /(4B) followsfromthehardy sinequalities. For the reversed inequality λ 2/B, bysymmetryoftheproblemwecanassumeforinstance that B = B + (m), and we begin by treating the case where B<+. Let 0 < ɛ <B + (m) be 5
6 given and consider a function g : IN IR (without any restriction, we could assume that g is taking values in IR + )suchthat (2) x IN µ(m + x) ( 0<yx g(y) ) 2 x IN µ(m + x)b(m + x)g2 (x) where the numerator can be supposed to be finite and non-zero. We define a non-constant function f : Z IR by setting x Z, f(x) = A + ɛ { 0, if x m g() + + g(x m), if x>m As µ({f =0}) µ(],m]) /2, we get by a Cauchy-Schwarz inequality that µ(f) 2 µ({f >0})µ(f 2 ) µ(f 2 )/2, so µ((f µ(f)) 2 ) = µ(f 2 ) µ(f) 2 µ(f 2 )/2 (A + ɛ)e(f,f)/2 (B + ɛ)e(f,f)/2 (B + ɛ)λµ((f µ(f)) 2 )/2 from which we get λ 2(B + ɛ).lettingɛ go to 0 +,weobtaintheexpectedresult. IfB =+, we proceed in same manner, but we have to consider functions g such that the left hand side of (2) is finite but very large. In practice, it can be difficult to find exactly a median, and sometimes it is better to consider the constant B = inf i Z (B +(i) B (i)) because we are still assured of the same bounds (which also show that B and B are of the same order). Proposition 3 As before, we can approximate λ by /B : λ 2 4B B Proof: The first part of the proof of the proposition 2 shows in fact that for all i Z (cut the function f f(i)i ini instead of cutting f f(m)i inm), we are assured of λ (4(B + (i) B (i))). On the other hand, the bound λ 2/B follows from the trivial inequality B B. This result shows that if one wants to get a good lower bound of the spectral gap (which is often the critical point), one only need to guess an adequate choice of x and to apply the estimate λ 4(B + (x) B (x)) 6
7 Of course, the previous considerations are still valid if Z is replaced by a infinite or finite discrete interval (this situation has to be considered for instance if the a(i) or the b(i), i Z, are only assumed to be non-negative), as it will be the case below. In fact, when the interval is not the whole Z, but the rates of birth and death are positive on this interval(except on the frontier for one of them), we have furthermore unicity, up to a multiplicative constant, for the invariant measure µ, which is then reversible. This was not necessarily true for Z. 2 The example It is now time to introduce the example of Meise: it is a familly of birth and death processes indexed by n IN \{}, takingvaluesin{,,n}. More precisely, for all n IN \{}, the birth and death rates are respectively given by i<n, a n (i) = <i n, b n (i) = i(n i) n(n ) i(i ) pn(n ) where p>0isafixedparameter. Meise was interested in showing that the spectral gaps λ n of these chains are of order /n: there exists two constants 0 <c <c 2 < + such that for all n 2, we have the bounds (3) c n λ n c 2 n (in fact Meise has got a more precise result, as he can show that lim n nλ n =,notethat such equivalences are out of reach by using only Hardy s bounds, but the goal of the following calculations is only to illustrate this method because they have some interesting features, maybe should we have chosen a more terrible example!). In order to prove them, let us denote by µ n the associated reversible probability on {,,n}. It is quite immediate to calculate that it is given by i n, µ n (i) = ((+p) n ) p i ( n i ) = p i n! (( + p) n )i!(n i)! For n>+ /p, letusdefinem n as z n +,where z n =(pn )/( + p) (and denote the integer part), it is an interesting point in {,,n} because µ n is non-decreasing (respectively decreasing) on {,,m n } (resp. {m n,,n}). More precisely, as we have for all i<n, µ n (i +) µ n (i) = a n (i) b n (i +) = p(n i) i + this ratio is decreasing on {,,n} and take the value only for the real number i = z n. Using this remark, making the convention that =0forx {,,n}, anddefining l n =2 n +3,weseethatforalln>+ /p, µ n (m n + l n ) µ n (m n ) = ρ ( p(n zn n) z n + n ( ) n p/ n +/ n ) n 7
8 where ρ =exp( p /2) < (wehavemadeuseoftheconcavityinequalitiesx/(x +) ln( + x) x, validforallx> ). With a similar calculation, we see that n>+ /p, µ n (m n l n ) µ n (m n ) ρ 2 with ρ 2 =exp( p/( + p)) < (infact,itcouldbepossibletobenumericallymoreprecise here, and via Stirling formula, one can explicit the limit values, as n tends to infinity, of the previous ratios). We deduce from these bounds that we have for n>+ /p, m n x n, x m n, µ n (x + l n ) µ n (x l n ) ρ ρ 2 But these estimations are only good near m n (this is related to the fact that if by an affine transformation, we repace [,n]by[ m n / n, (n m n )/ n], then the image of µ n looks like a centered Gaussian distribution with variance p/( + p) 2 ), and as we are away from this point with a distance of order n, itiseasytogetbetterestimates: forinstance,as µ n (k n ) µ n (k n ) 2 with k n = p(n +)/(2 + p), wehave x k n, µ n (x ) 2 In fact these informations are mainly the only ones needed to get a lower bound on λ n by using the Hardy s inequalities from the point m n. The heuristic reason is the following one: on {m n,,n} and on {k n,,m n } (in reverse order), in a space scale n, µ n decreases somewhat faster than power laws (whose parameters ρ and ρ 2 do not depend on n)andtheratesoftransition in the direction of m n are bounded below by a constant which does not depend on n, andthis contributes to an estimate of the spectral gap of order /n. On the other hand, on the interval {,,k n } (also looked at in reverse order), in a space scale, µ n decreases in some sense faster than a power law (of parameter /2), but the rates of transition toward k n are at least /n (which reduce the speed of escape from by the same factor), so this also gives an estimation of the spectral gap of order /n. Herearethemoredetailedcalculations:webeginbyevaluating B n,+ = max x>m n x y=m n+ µ n ([x, n]) µ n (y)b n (y) It is easy to explicit a n 0 + /p large enough such that for all n n 0 and all m n <y n, b(y) p/(2(p +) 2 ). Let x be fixed in {m n,,n}, thenwehave p 2(p +) 2 x y=m n+ µ n (y)b n (y) x y=m n+ = µ n (y) i IN m n (x (i+)l n)<ym n (x il n) µ n (y) 8
9 while so we end up with Then we look at µ n ([x, n]) B n,+ B n, = max x<m n l n i IN : x il nm n µ n (x il n ) l n ρ i i IN : x il nm n l n ρ i IN n (x+il n)y<n (x+(i+)l n) i IN : x+il nn i IN : x il nn l n ρ 2(p +)2 p ( mn y=x l n µ n (x + il n ) l n ρ i µ n(x) ( ln ρ ) 2 µ n (y) ) µ n ([,x]) µ n (y)a n (y) and we first consider the case of x {k n,,m n }, becauseitisthenpossibletofindexplicitly a n n 0 large enough such that for all n n,weareassuredofinf kny<m n a n (y) p/(2(2+p) 2 ), and thus we have as before, for n n, p m n 2(p +2) 2 y=x µ n (y)a n (y) l n ρ 2 so max k nx<m n ( mn y=x µ n ([,x]) ) µ n ([,x]) µ n (y)a n (y) l n ρ 2 2(p +2)2 p ( ln ρ 2 ) 2 For x {,,k n },weusethefollowingbounds,whichareprovedinsameway k n y=x µ n (y) µ n ([,x]) /2 /2 µ n(x) to obtain, via the inequality a n (y) /n, satisfiedforall y<n, k n max x<k n y=x µ n (y)a n (y) µ n([,x]) 4n 9
10 but we are also assured of m n max x<k n y=k n µ n (y)a n (y) µ n([,x]) m n y=k n 2(p +2)2 p µ n (y)a n (y) µ n([,k n ]) ( ln ρ 2 ) 2 so in the end B n, 4n + 2(p +2)2 p ( ln ρ 2 from where we easily get the existence of a constant C > 0suchthat B n, B n,+ C n i.e. the above mentionned lower bound for λ n is proved with c =/(4C ), at least for n n. To prove a related upper bound, just use the definition of λ n with the particular function I {}, it gives λ n (n[ pn/(( + p) n )]) /n, forn large. ) 2 3 Logarithmic-Sobolev inequalities The weighted Hardy s inequalities are also an efficient method to evaluate logarithmic Sobolev constants on trees. By using some ideas and results of Bobkov and Götze [], who have seen logarithmic Sobolev inequalities as Poincaré s inequalities in the Orlicz space associated to the Young function Ψ : IR + x x ln( + x), we have presented this approach for the discrete setting in [9]. Let us give these estimations in the special case of Z endowed with its natural tree structure. So we come back to the general birth and death process of positive rates (a(i)) i Z and (b(i)) i Z,reversiblewithrespecttoprobabilityµ. The associated logarithmic Sobolev constant is defined by E(f,f) α = inf f IL 2 (µ)\vect(i) Ent(f 2,µ) where the entropy of the function f 2 with respect to µ is the quantity Ent(f 2,µ)= f 2 ln(f 2 / f 2 IL 2 (µ) ) dµ. To give an approximation of this ergodic constant α, we introduce for all i Z, the numbers and we consider C + (i) = sup x>i C (i) = sup x<i Then it can be shown that x y=i+ ( i y=x µ([x, + [) ln(µ([x, + [)) µ(y)b(y) ) µ(],x]) ln(µ(],x])) µ(y)a(y) C = inf i Z (C (i) C + (i)) 0
11 Proposition 4 The constant C is of the same order as α, sincethefollowingboundsarealways satisfied 20 C α 4 ( ) C If we restrict ourselves to the case of a finite interval, one deduces from the lower bound that α λ 40 ln(µ ) where µ is the minimum value taken by µ on the finite interval. But there is a better result in this direction, due to Diaconis and Saloff-Coste [3], saying that for all finite and irreducible Markov kernels (without assumptions on the underlying graph), α 2µ ln(µ ) λ where λ, α and µ are respectively the spectral gap, the logarithmic Sobolev constant and the minimum value of the invariant probability. Of course, there is not a related upper bound (up toanuniversalconstant,butweareassured of α λ/2), nevertheless, in the example of Meise, this gives the right order of the logarithmic Sobolev constants α n :therearetwoconstants0<c 3 <c 4 < +, suchthatforalln IN \{}, c 3 n 2 α n c 4 n 2 To get the lower bound, just note that µ n, = µ n () µ(n) =(pn p n )/(( + p) n ), and the upper bound can be obtained by considering the function I {} in the definition of α n. References [] S.G. Bobkov and F. Götze. Exponential integrability and transportation cost related to logarithmic Sobolev inequalities. Preprint, July 997. [2] M.-F. Chen and F.-Y Wang. Cheeger s inequalities for general symmetric forms and existence criteria for spectral gap. Preprint from the Beijing Normal University, 998. [3] P. Diaconis and L. Saloff-Coste. Logarithmic Sobolev inequalities for finite Markov chains. The Annals of Applied Probability, 6(3): ,996. [4] W.D. Evans, D.J. Harris, and L. Pick. Weighted Hardy and Poincaré inequalities on trees. Journal of the London Mathematical Society, 52(2):2 36,995. [5] B.L. Granovsky and A.I. Zeifman. The N-limit of spectral gap of random walks associated with complete graphs. Preprint, 998. [6] N. Kahale. A semidefinite bound for mixing rates of Markov chains. Preprint, September 995.
12 [7] C. Meise. On spectral gap estimates of a Markov chain via hitting times and coupling. Preprint, 998. [8] C. Meise. Spectral gap estimates via distance arguments. Preprint, 998. [9] L. Miclo. Relations entre isopérimétrie et trou spectral pour les chaînes de Markov finies. Preprint, 998. [0] B. Muckenhoupt. Hardy s inequality with weights. Studia Mathematica, XLIV:3 38, 972. [] E. Sawyer. Weighted Lebesgue and Lorentz norm inequalities for the Hardy operator. Transactions of the American Mathematical Society, 28(): ,984. [2] E. Seneta. Non-negative Matrices and Markov Chains. SpringerSeriesinStatistics. Springer- Verlag, 98. [3] A.I. Zeifman. Some estimates of the rate of convergence for birth and death processes. J. Appl. Prob., 28: ,99. 2
Capacitary inequalities in discrete setting and application to metastable Markov chains. André Schlichting
Capacitary inequalities in discrete setting and application to metastable Markov chains André Schlichting Institute for Applied Mathematics, University of Bonn joint work with M. Slowik (TU Berlin) 12
More informationA note on the convex infimum convolution inequality
A note on the convex infimum convolution inequality Naomi Feldheim, Arnaud Marsiglietti, Piotr Nayar, Jing Wang Abstract We characterize the symmetric measures which satisfy the one dimensional convex
More informationON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS
Bendikov, A. and Saloff-Coste, L. Osaka J. Math. 4 (5), 677 7 ON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS ALEXANDER BENDIKOV and LAURENT SALOFF-COSTE (Received March 4, 4)
More informationLecture 7. µ(x)f(x). When µ is a probability measure, we say µ is a stationary distribution.
Lecture 7 1 Stationary measures of a Markov chain We now study the long time behavior of a Markov Chain: in particular, the existence and uniqueness of stationary measures, and the convergence of the distribution
More informationConvex decay of Entropy for interacting systems
Convex decay of Entropy for interacting systems Paolo Dai Pra Università degli Studi di Padova Cambridge March 30, 2011 Paolo Dai Pra Convex decay of Entropy for interacting systems Cambridge, 03/11 1
More informationExpansion and Isoperimetric Constants for Product Graphs
Expansion and Isoperimetric Constants for Product Graphs C. Houdré and T. Stoyanov May 4, 2004 Abstract Vertex and edge isoperimetric constants of graphs are studied. Using a functional-analytic approach,
More informationON THE DEFINITION OF RELATIVE PRESSURE FOR FACTOR MAPS ON SHIFTS OF FINITE TYPE. 1. Introduction
ON THE DEFINITION OF RELATIVE PRESSURE FOR FACTOR MAPS ON SHIFTS OF FINITE TYPE KARL PETERSEN AND SUJIN SHIN Abstract. We show that two natural definitions of the relative pressure function for a locally
More informationX n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2)
14:17 11/16/2 TOPIC. Convergence in distribution and related notions. This section studies the notion of the so-called convergence in distribution of real random variables. This is the kind of convergence
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationDiscrete Ricci curvature: Open problems
Discrete Ricci curvature: Open problems Yann Ollivier, May 2008 Abstract This document lists some open problems related to the notion of discrete Ricci curvature defined in [Oll09, Oll07]. Do not hesitate
More informationConvergence to equilibrium of Markov processes (eventually piecewise deterministic)
Convergence to equilibrium of Markov processes (eventually piecewise deterministic) A. Guillin Université Blaise Pascal and IUF Rennes joint works with D. Bakry, F. Barthe, F. Bolley, P. Cattiaux, R. Douc,
More information215 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that
15 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that µ ν tv = (1/) x S µ(x) ν(x) = x S(µ(x) ν(x)) + where a + = max(a, 0). Show that
More informationBERNARD HOST AND BRYNA KRA
UIFORMITY SEMIORMS O l AD A IVERSE THEOREM SUMMARY OF RESULTS BERARD HOST AD BRYA KRA Abstract. For each integer k, we define seminorms on l (Z), analogous to the seminorms defined by the authors on bounded
More informationLogarithmic Sobolev, Isoperimetry and Transport Inequalities on Graphs
Acta Mathematica Sinica, English Series Oct., 016, Vol. 3, No. 10, pp. 11 136 Published online: September 15, 016 DOI: 10.1007/s10114-016-5330-9 Http://www.ActaMath.com Acta Mathematica Sinica, English
More informationMean-field dual of cooperative reproduction
The mean-field dual of systems with cooperative reproduction joint with Tibor Mach (Prague) A. Sturm (Göttingen) Friday, July 6th, 2018 Poisson construction of Markov processes Let (X t ) t 0 be a continuous-time
More informationON EXPONENTIAL GROWTH RATES FOR FREE GROUPS
Publicacions Matemàtiques, Vol 42 (1998), 499 507. ON EXPONENTIAL GROWTH RATES FOR FREE GROUPS Malik Koubi Abstract Let F p be a free group of rank p 2. It is well-known that, with respect to a p-element
More informationGeometric ρ-mixing property of the interarrival times of a stationary Markovian Arrival Process
Author manuscript, published in "Journal of Applied Probability 50, 2 (2013) 598-601" Geometric ρ-mixing property of the interarrival times of a stationary Markovian Arrival Process L. Hervé and J. Ledoux
More information3 Integration and Expectation
3 Integration and Expectation 3.1 Construction of the Lebesgue Integral Let (, F, µ) be a measure space (not necessarily a probability space). Our objective will be to define the Lebesgue integral R fdµ
More informationFunctional inequalities for heavy tailed distributions and application to isoperimetry
E l e c t r o n i c J o u r n a l o f P r o b a b i l i t y Vol. 5 (200), Paper no. 3, pages 346 385. Journal URL http://www.math.washington.edu/~ejpecp/ Functional inequalities for heavy tailed distributions
More informationON A MAXIMAL OPERATOR IN REARRANGEMENT INVARIANT BANACH FUNCTION SPACES ON METRIC SPACES
Vasile Alecsandri University of Bacău Faculty of Sciences Scientific Studies and Research Series Mathematics and Informatics Vol. 27207), No., 49-60 ON A MAXIMAL OPRATOR IN RARRANGMNT INVARIANT BANACH
More informationA Note on the Central Limit Theorem for a Class of Linear Systems 1
A Note on the Central Limit Theorem for a Class of Linear Systems 1 Contents Yukio Nagahata Department of Mathematics, Graduate School of Engineering Science Osaka University, Toyonaka 560-8531, Japan.
More informationLecture 4 Lebesgue spaces and inequalities
Lecture 4: Lebesgue spaces and inequalities 1 of 10 Course: Theory of Probability I Term: Fall 2013 Instructor: Gordan Zitkovic Lecture 4 Lebesgue spaces and inequalities Lebesgue spaces We have seen how
More informationLARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011
LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS S. G. Bobkov and F. L. Nazarov September 25, 20 Abstract We study large deviations of linear functionals on an isotropic
More informationClass 2 & 3 Overfitting & Regularization
Class 2 & 3 Overfitting & Regularization Carlo Ciliberto Department of Computer Science, UCL October 18, 2017 Last Class The goal of Statistical Learning Theory is to find a good estimator f n : X Y, approximating
More informationprocess on the hierarchical group
Intertwining of Markov processes and the contact process on the hierarchical group April 27, 2010 Outline Intertwining of Markov processes Outline Intertwining of Markov processes First passage times of
More informationL p Functions. Given a measure space (X, µ) and a real number p [1, ), recall that the L p -norm of a measurable function f : X R is defined by
L p Functions Given a measure space (, µ) and a real number p [, ), recall that the L p -norm of a measurable function f : R is defined by f p = ( ) /p f p dµ Note that the L p -norm of a function f may
More informationConvex functions. Definition. f : R n! R is convex if dom f is a convex set and. f ( x +(1 )y) < f (x)+(1 )f (y) f ( x +(1 )y) apple f (x)+(1 )f (y)
Convex functions I basic properties and I operations that preserve convexity I quasiconvex functions I log-concave and log-convex functions IOE 611: Nonlinear Programming, Fall 2017 3. Convex functions
More informationChapter 5. Measurable Functions
Chapter 5. Measurable Functions 1. Measurable Functions Let X be a nonempty set, and let S be a σ-algebra of subsets of X. Then (X, S) is a measurable space. A subset E of X is said to be measurable if
More informationCLOSED RANGE POSITIVE OPERATORS ON BANACH SPACES
Acta Math. Hungar., 142 (2) (2014), 494 501 DOI: 10.1007/s10474-013-0380-2 First published online December 11, 2013 CLOSED RANGE POSITIVE OPERATORS ON BANACH SPACES ZS. TARCSAY Department of Applied Analysis,
More informationL p Spaces and Convexity
L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function
More informationcurvature, mixing, and entropic interpolation Simons Feb-2016 and CSE 599s Lecture 13
curvature, mixing, and entropic interpolation Simons Feb-2016 and CSE 599s Lecture 13 James R. Lee University of Washington Joint with Ronen Eldan (Weizmann) and Joseph Lehec (Paris-Dauphine) Markov chain
More informationLecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is
MARKOV CHAINS What I will talk about in class is pretty close to Durrett Chapter 5 sections 1-5. We stick to the countable state case, except where otherwise mentioned. Lecture 7. We can regard (p(i, j))
More informationMath 328 Course Notes
Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the
More informationSEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE
SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE FRANÇOIS BOLLEY Abstract. In this note we prove in an elementary way that the Wasserstein distances, which play a basic role in optimal transportation
More informationRandom Process Lecture 1. Fundamentals of Probability
Random Process Lecture 1. Fundamentals of Probability Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/43 Outline 2/43 1 Syllabus
More informationLogarithmic Sobolev inequalities in discrete product spaces: proof by a transportation cost distance
Logarithmic Sobolev inequalities in discrete product spaces: proof by a transportation cost distance Katalin Marton Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences Relative entropy
More informationNEW FUNCTIONAL INEQUALITIES
1 / 29 NEW FUNCTIONAL INEQUALITIES VIA STEIN S METHOD Giovanni Peccati (Luxembourg University) IMA, Minneapolis: April 28, 2015 2 / 29 INTRODUCTION Based on two joint works: (1) Nourdin, Peccati and Swan
More informationOberwolfach workshop on Combinatorics and Probability
Apr 2009 Oberwolfach workshop on Combinatorics and Probability 1 Describes a sharp transition in the convergence of finite ergodic Markov chains to stationarity. Steady convergence it takes a while to
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10
More informationMixing in Product Spaces. Elchanan Mossel
Poincaré Recurrence Theorem Theorem (Poincaré, 1890) Let f : X X be a measure preserving transformation. Let E X measurable. Then P[x E : f n (x) / E, n > N(x)] = 0 Poincaré Recurrence Theorem Theorem
More informationWeighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing
Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 8, Number 2, pp. 401 412 (2013) http://campus.mst.edu/adsa Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes
More informationA concentration theorem for the equilibrium measure of Markov chains with nonnegative coarse Ricci curvature
A concentration theorem for the equilibrium measure of Markov chains with nonnegative coarse Ricci curvature arxiv:103.897v1 math.pr] 13 Mar 01 Laurent Veysseire Abstract In this article, we prove a concentration
More information3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions
3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions log-concave and log-convex functions
More informationInvariant measures for iterated function systems
ANNALES POLONICI MATHEMATICI LXXV.1(2000) Invariant measures for iterated function systems by Tomasz Szarek (Katowice and Rzeszów) Abstract. A new criterion for the existence of an invariant distribution
More information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationA dual form of the sharp Nash inequality and its weighted generalization
A dual form of the sharp Nash inequality and its weighted generalization Elliott Lieb Princeton University Joint work with Eric Carlen, arxiv: 1704.08720 Kato conference, University of Tokyo September
More informationIntegration on Measure Spaces
Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of
More informationRandom Bernstein-Markov factors
Random Bernstein-Markov factors Igor Pritsker and Koushik Ramachandran October 20, 208 Abstract For a polynomial P n of degree n, Bernstein s inequality states that P n n P n for all L p norms on the unit
More informationDiscussion of Hypothesis testing by convex optimization
Electronic Journal of Statistics Vol. 9 (2015) 1 6 ISSN: 1935-7524 DOI: 10.1214/15-EJS990 Discussion of Hypothesis testing by convex optimization Fabienne Comte, Céline Duval and Valentine Genon-Catalot
More informationXVI International Congress on Mathematical Physics
Aug 2009 XVI International Congress on Mathematical Physics Underlying geometry: finite graph G=(V,E ). Set of possible configurations: V (assignments of +/- spins to the vertices). Probability of a configuration
More informationhal , version 1-22 Nov 2009
Author manuscript, published in "Kinet. Relat. Models 1, 3 8) 355-368" PROPAGATION OF GEVREY REGULARITY FOR SOLUTIONS OF LANDAU EQUATIONS HUA CHEN, WEI-XI LI AND CHAO-JIANG XU Abstract. By using the energy-type
More informationUPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES
Applied Probability Trust 7 May 22 UPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES HAMED AMINI, AND MARC LELARGE, ENS-INRIA Abstract Upper deviation results are obtained for the split time of a
More informationConcentration inequalities: basics and some new challenges
Concentration inequalities: basics and some new challenges M. Ledoux University of Toulouse, France & Institut Universitaire de France Measure concentration geometric functional analysis, probability theory,
More informationThe Logarithmic Sobolev Constant of Some Finite Markov Chains. Wai Wai Liu
CORNELL UNIVERSITY MATHEMATICS DEPARTMENT SENIOR THESIS The Logarithmic Sobolev Constant of Some Finite Markov Chains A THESIS PRESENTED IN PARTIAL FULFILLMENT OF CRITERIA FOR HONORS IN MATHEMATICS Wai
More informationMeasurable functions are approximately nice, even if look terrible.
Tel Aviv University, 2015 Functions of real variables 74 7 Approximation 7a A terrible integrable function........... 74 7b Approximation of sets................ 76 7c Approximation of functions............
More informationA Spectral Gap for the Brownian Bridge measure on hyperbolic spaces
1 A Spectral Gap for the Brownian Bridge measure on hyperbolic spaces X. Chen, X.-M. Li, and B. Wu Mathemtics Institute, University of Warwick,Coventry CV4 7AL, U.K. 1. Introduction Let N be a finite or
More informationMATH 202B - Problem Set 5
MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there
More informationProblem 3. Give an example of a sequence of continuous functions on a compact domain converging pointwise but not uniformly to a continuous function
Problem 3. Give an example of a sequence of continuous functions on a compact domain converging pointwise but not uniformly to a continuous function Solution. If we does not need the pointwise limit of
More informationContraction properties of Feynman-Kac semigroups
Journées de Statistique Marne La Vallée, January 2005 Contraction properties of Feynman-Kac semigroups Pierre DEL MORAL, Laurent MICLO Lab. J. Dieudonné, Nice Univ., LATP Univ. Provence, Marseille 1 Notations
More informationM. Ledoux Université de Toulouse, France
ON MANIFOLDS WITH NON-NEGATIVE RICCI CURVATURE AND SOBOLEV INEQUALITIES M. Ledoux Université de Toulouse, France Abstract. Let M be a complete n-dimensional Riemanian manifold with non-negative Ricci curvature
More informationModern Discrete Probability Spectral Techniques
Modern Discrete Probability VI - Spectral Techniques Background Sébastien Roch UW Madison Mathematics December 22, 2014 1 Review 2 3 4 Mixing time I Theorem (Convergence to stationarity) Consider a finite
More informationLecture 1 Measure concentration
CSE 29: Learning Theory Fall 2006 Lecture Measure concentration Lecturer: Sanjoy Dasgupta Scribe: Nakul Verma, Aaron Arvey, and Paul Ruvolo. Concentration of measure: examples We start with some examples
More informationStochastic relations of random variables and processes
Stochastic relations of random variables and processes Lasse Leskelä Helsinki University of Technology 7th World Congress in Probability and Statistics Singapore, 18 July 2008 Fundamental problem of applied
More informationThe Gaussian free field, Gibbs measures and NLS on planar domains
The Gaussian free field, Gibbs measures and on planar domains N. Burq, joint with L. Thomann (Nantes) and N. Tzvetkov (Cergy) Université Paris Sud, Laboratoire de Mathématiques d Orsay, CNRS UMR 8628 LAGA,
More informationarxiv: v2 [math.ds] 24 Apr 2018
CONSTRUCTION OF SOME CHOWLA SEQUENCES RUXI SHI arxiv:1804.03851v2 [math.ds] 24 Apr 2018 Abstract. For numerical sequences taking values 0 or complex numbers of modulus 1, we define Chowla property and
More informationWeak and strong moments of l r -norms of log-concave vectors
Weak and strong moments of l r -norms of log-concave vectors Rafał Latała based on the joint work with Marta Strzelecka) University of Warsaw Minneapolis, April 14 2015 Log-concave measures/vectors A measure
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationChapter 7. Markov chain background. 7.1 Finite state space
Chapter 7 Markov chain background A stochastic process is a family of random variables {X t } indexed by a varaible t which we will think of as time. Time can be discrete or continuous. We will only consider
More informationSampling Contingency Tables
Sampling Contingency Tables Martin Dyer Ravi Kannan John Mount February 3, 995 Introduction Given positive integers and, let be the set of arrays with nonnegative integer entries and row sums respectively
More informationReducing subspaces. Rowan Killip 1 and Christian Remling 2 January 16, (to appear in J. Funct. Anal.)
Reducing subspaces Rowan Killip 1 and Christian Remling 2 January 16, 2001 (to appear in J. Funct. Anal.) 1. University of Pennsylvania, 209 South 33rd Street, Philadelphia PA 19104-6395, USA. On leave
More informationHeat Flows, Geometric and Functional Inequalities
Heat Flows, Geometric and Functional Inequalities M. Ledoux Institut de Mathématiques de Toulouse, France heat flow and semigroup interpolations Duhamel formula (19th century) pde, probability, dynamics
More informationMath 117: Infinite Sequences
Math 7: Infinite Sequences John Douglas Moore November, 008 The three main theorems in the theory of infinite sequences are the Monotone Convergence Theorem, the Cauchy Sequence Theorem and the Subsequence
More informationSOLUTION OF THE DIRICHLET PROBLEM WITH L p BOUNDARY CONDITION. Dagmar Medková
29 Kragujevac J. Math. 31 (2008) 29 42. SOLUTION OF THE DIRICHLET PROBLEM WITH L p BOUNDARY CONDITION Dagmar Medková Czech Technical University, Faculty of Mechanical Engineering, Department of Technical
More informationWhen Cauchy and Hölder Met Minkowski: A Tour through Well-Known Inequalities
202 MATHEMATICS MAGAZINE When Cauchy and Hölder Met Minkowski: A Tour through Well-Known Inequalities GERHARD J. WOEGINGER Department of Mathematics TU Eindhoven The Netherlands gwoegi@win.tue.nl Many
More informationConcentration Properties of Restricted Measures with Applications to Non-Lipschitz Functions
Concentration Properties of Restricted Measures with Applications to Non-Lipschitz Functions S G Bobkov, P Nayar, and P Tetali April 4, 6 Mathematics Subject Classification Primary 6Gxx Keywords and phrases
More informationConvex inequalities, isoperimetry and spectral gap III
Convex inequalities, isoperimetry and spectral gap III Jesús Bastero (Universidad de Zaragoza) CIDAMA Antequera, September 11, 2014 Part III. K-L-S spectral gap conjecture KLS estimate, through Milman's
More informationMath 5051 Measure Theory and Functional Analysis I Homework Assignment 3
Math 551 Measure Theory and Functional Analysis I Homework Assignment 3 Prof. Wickerhauser Due Monday, October 12th, 215 Please do Exercises 3*, 4, 5, 6, 8*, 11*, 17, 2, 21, 22, 27*. Exercises marked with
More informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More information3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions
3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions log-concave and log-convex functions
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationKLS-TYPE ISOPERIMETRIC BOUNDS FOR LOG-CONCAVE PROBABILITY MEASURES. December, 2014
KLS-TYPE ISOPERIMETRIC BOUNDS FOR LOG-CONCAVE PROBABILITY MEASURES Sergey G. Bobkov and Dario Cordero-Erausquin December, 04 Abstract The paper considers geometric lower bounds on the isoperimetric constant
More informationarxiv:math/ v1 [math.pr] 31 Jan 2001
Chin. Sci. Bulletin, 1999, 44(23), 2465 2470 (Chinese Ed.); 2000, 45:9 (English Ed.), 769 774 Eigenvalues, inequalities and ergodic theory arxiv:math/0101257v1 [math.pr] 31 Jan 2001 Mu-Fa Chen (Beijing
More informationInverse Brascamp-Lieb inequalities along the Heat equation
Inverse Brascamp-Lieb inequalities along the Heat equation Franck Barthe and Dario Cordero-Erausquin October 8, 003 Abstract Adapting Borell s proof of Ehrhard s inequality for general sets, we provide
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 2
MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 2. Countable Markov Chains I started Chapter 2 which talks about Markov chains with a countably infinite number of states. I did my favorite example which is on
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
More informationMath 104: Homework 7 solutions
Math 04: Homework 7 solutions. (a) The derivative of f () = is f () = 2 which is unbounded as 0. Since f () is continuous on [0, ], it is uniformly continous on this interval by Theorem 9.2. Hence for
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More informationON PARABOLIC HARNACK INEQUALITY
ON PARABOLIC HARNACK INEQUALITY JIAXIN HU Abstract. We show that the parabolic Harnack inequality is equivalent to the near-diagonal lower bound of the Dirichlet heat kernel on any ball in a metric measure-energy
More informationApplied Stochastic Processes
Applied Stochastic Processes Jochen Geiger last update: July 18, 2007) Contents 1 Discrete Markov chains........................................ 1 1.1 Basic properties and examples................................
More informationNash Type Inequalities for Fractional Powers of Non-Negative Self-adjoint Operators. ( Wroclaw 2006) P.Maheux (Orléans. France)
Nash Type Inequalities for Fractional Powers of Non-Negative Self-adjoint Operators ( Wroclaw 006) P.Maheux (Orléans. France) joint work with A.Bendikov. European Network (HARP) (to appear in T.A.M.S)
More informationSPECTRAL GAP FOR ZERO-RANGE DYNAMICS. By C. Landim, S. Sethuraman and S. Varadhan 1 IMPA and CNRS, Courant Institute and Courant Institute
The Annals of Probability 996, Vol. 24, No. 4, 87 902 SPECTRAL GAP FOR ZERO-RANGE DYNAMICS By C. Landim, S. Sethuraman and S. Varadhan IMPA and CNRS, Courant Institute and Courant Institute We give a lower
More informationAsymptotic efficiency of simple decisions for the compound decision problem
Asymptotic efficiency of simple decisions for the compound decision problem Eitan Greenshtein and Ya acov Ritov Department of Statistical Sciences Duke University Durham, NC 27708-0251, USA e-mail: eitan.greenshtein@gmail.com
More informationLebesgue-Radon-Nikodym Theorem
Lebesgue-Radon-Nikodym Theorem Matt Rosenzweig 1 Lebesgue-Radon-Nikodym Theorem In what follows, (, A) will denote a measurable space. We begin with a review of signed measures. 1.1 Signed Measures Definition
More informationMAGIC010 Ergodic Theory Lecture Entropy
7. Entropy 7. Introduction A natural question in mathematics is the so-called isomorphism problem : when are two mathematical objects of the same class the same (in some appropriately defined sense of
More informationFACTORS OF GIBBS MEASURES FOR FULL SHIFTS
FACTORS OF GIBBS MEASURES FOR FULL SHIFTS M. POLLICOTT AND T. KEMPTON Abstract. We study the images of Gibbs measures under one block factor maps on full shifts, and the changes in the variations of the
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
More information3 Measurable Functions
3 Measurable Functions Notation A pair (X, F) where F is a σ-field of subsets of X is a measurable space. If µ is a measure on F then (X, F, µ) is a measure space. If µ(x) < then (X, F, µ) is a probability
More informationProjections, Radon-Nikodym, and conditioning
Projections, Radon-Nikodym, and conditioning 1 Projections in L 2......................... 1 2 Radon-Nikodym theorem.................... 3 3 Conditioning........................... 5 3.1 Properties of
More information1 Continuous-time chains, finite state space
Université Paris Diderot 208 Markov chains Exercises 3 Continuous-time chains, finite state space Exercise Consider a continuous-time taking values in {, 2, 3}, with generator 2 2. 2 2 0. Draw the diagramm
More information