### Table 1. Parameter Values for the Calibrated Deterministic Stationary State

2003

"... In PAGE 31: ... Mendoza (2002) calibrates the liquidity requirements model to Mexican data and produces numerical simulations to examine the effects of the borrowing constraint on macroeconomic dynamics and welfare. The calibration parameters are reproduced in Table1 . Figure 4 plots the ergodic distributions of foreign bond holdings with and without the liquidity requirement.... ..."

Cited by 4

### Table 6. Transition matrix and stationary probabilities for the algorithms of Table 4

"... In PAGE 20: ...Table 6. Transition matrix and stationary probabilities for the algorithms of Table 4 can then write down the transition matrix for these symbols, which is given in the rst three columns of Table6 . The transition probabilities in Table 6 determine the symbolic dynamics of the chain.... In PAGE 21: ...Table6 , and the following simple expression for the ergodic log-rate: = ? log r = 2m?1 1 + 2m?1 log 2: This formula shows how large m should be in order to achieve a given ap- proximation of the optimal log-rate log 2. An important feature of the above consideration is that all the ergodic arguments remain true when the objec- tive function f(:) is locally symmetric around x , in particular if f(:) satis es condition (11).... ..."

### Table 2: Comparing ergodic and non ergodic topologies for posterior estimation

2005

"... In PAGE 8: ... The same decoder was applied to the estimated posteriors in both cases. Table2 shows the results of the experiment. The system which uses phone gammas estimated through the non ergodic topology performs signi cantly better.... ..."

Cited by 2

### Table 4. Hamiltonian cycle

"... In PAGE 7: ... As for computing Hamiltonian cycles on complete graphs, lookahead cannot reduce the depth of the search tree while bringing on extra constraint propagations. The experimental results ( Table4 ) show smodels can be several hundred times slower than smodels without lookahead. For the above two problems, A-smodels works largely as smodels without lookahead.... In PAGE 7: ... A-smodels turned off lookahead perma- nently after some literals are assigned during the process of solving this problem. For the Hamiltonian cycle problem, the performance of A-smodels is in between smodels and smodels without lookahead - it is about 20 to 30 times faster than smodels and 2 to 10 times slower than smodels without lookahead ( Table4 ). We notice that if the parameter look score is set to be 2 and ratio 0.... ..."

### Table 7: Ergodic Moments of the Model Economy

"... In PAGE 22: ... Given that agents live only for two periods, the model apos;s cyclical behavior does not relate very closely standard notions of cyclical behavior in the data. Table7 shows the rst and second ergodic moments of the most relevant variables. Note that these are economy wide variables, and they are statistics computed from aggregate data, that include the behavior of all agents.... In PAGE 33: ... Note that the previously established continuity a.e. of the set of prices as a function of implies that it is enough that this condition holds for 0( apos;t), and 1( apos;t). 6 Table7 reports the average values for some of these key variables.... ..."

### Table 2: Eigenvalues of Hamiltonian pencils

"... In PAGE 36: ... Nevertheless we will call our form Hamilto- nian Kronecker canonical form in order to avoid confusion when generalizing these results at a later stage to singular Hamiltonian pencils. As shown in Table2 for a regular Hamiltonian pencil Mh ? Lh we have similar sym- metries in the nite spectrum. So most of the analysis in this section has to be devoted to the part of the canonical form associated with in nite eigenvalues.... ..."

### Table 3. Hamiltonian Path tests

in reachability

"... In PAGE 10: ... 3. Ham 22:A path from 1 to 22 visiting 4 7 10 16 18 21 Table3 is a summary of the tests that we have performed. Notice that Ham 52Order b has no solution.... In PAGE 12: ... { Using Ham and Reachability (column \Ham+R+CN+BE quot;). As it can be observed in Table3 , we were not able to get a solution for Ham 22 in less than 30 minutes without using Reachability. In fact, we did not even try to solve Ham 52b without it.... ..."

### Table 7. The stationary probability.

2000

Cited by 3

### Table 2. Stationary FAM

2000