Search

23 Mar 2016: Sensitivity of mixing times in Eulerian digraphs. Lucas Boczkowski Yuval Peres† Perla Sousi‡. Abstract. Let X be a lazy random walk on a graph G. If G is undirected, then the mixing time isupper bounded by the maximum hitting time of the graph.

19 Nov 2010: Let T := Tj = {ti (j )} = 2j Z, j Z, be a bi-infinite sequence of equally spaced knots,ti := ti (j ). A function S is a spline of order r , or ... Nj,k,r (x) := Nk,r (2j x) = N0,r (2j x k).By the Curry–Schoenberg theorem, any S Sr (Tj ) can be uniquely

6 Nov 2023: Advanced Probability. Perla Sousi. November 6, 2023. Contents. 1 Conditional expectation 3. 1.1 Discrete case. 4. 1.2 Existence and uniqueness. 5. 1.3 Product measure and Fubini’s theorem. 11. 1.4 Examples of conditional expectation. 11. 1.4.1

9 Jun 2016: Journal of Machine Learning Research? (?)? -? Submitted 11/13; Revised 3/16; Published? /? Modelling Interactions in High-dimensional Data withBacktracking. Rajen D. Shah r.shah@statslab.cam.ac.ukStatistical Laboratory. University of Cambridge.

22 Jan 2024: f(t) =k. j=0. f(j)(0). j!tj. t0. f(k1)(s). k!(t s)kds. For j = 0,1,.

15 Aug 2012: n,(c) if ti = tj , then (ti, zi) / (tj , zj ) in {ti} Zd, for 0 i < j n.

14 Nov 2013: Tutorial. Bandit Processes and Index Policies. Richard Weber, University of Cambridge. Young European Queueing Theorists (YEQT VII) workshop on. Scheduling and priorities in queueing systems,. Eindhoven, November 4–5–6, 2013. 1 / 52. 2 / 52. 3 /

15 Sep 2011: N o t e that A is symmetric in i and j , since the operators Ti and Tj commute.

1 May 2006: Tj (yj ) = yj D′j (yj ). Then µj is the generalized cost of using link j, definedas the sum of the toll and the delay, and λs is theminimum generalized cost

28 Aug 2007: 2/d , then, with v defined by. (4.8), and tj = νj1 {ν/k2(ν)}.