# Published or Accepted Papers

- Properly coloured copies and rainbow copies of large graphs with small maximum degree
- Böttcher, J., Kohayakawa Y., and Procacci, A. Properly coloured copies and rainbow copies of large graphs with small maximum degree, Random Structures Algorithms 40 (2012), no. 4, 425--436.
- Partially Observed Markov Random Fields Are Variable Neighborhood Random Fields
- Cassandro, M.; Galves, A.; Löcherbach, E. . Partially Observed Markov Random Fields Are Variable Neighborhood Random Fields. Journal of Statistical Physics, v. 147, p. 795-807, 2012.
- Chains of infinite order, chains with memory of variable length, and maps of the interval
- Collet, P.; Galves, A. Chains of infinite order, chains with memory of variable length, and maps of the interval.
- Optimal mean variance control for discrete-time linear systems with Markovian jumps and multiplicative noises
- Costa, O. L.V. ; Oliveira, Alexandre de, Optimal mean variance control for discrete-time linear systems with Markovian jumps and multiplicative noises. Automatica, v. 48, p. 304-315, 2012.
- Singularly Perturbed Discounted Markov Control Processes in a General State Space
- Costa, O. L. V. ; Dufour, François, Singularly Perturbed Discounted Markov Control Processes in a General State Space. SIAM Journal on Control and Optimization, v. 50, p. 720-747, 2012.
- Arbitrage-Free Conditions and Hedging Strategies for Markets with Penalty Costs on Short Positions
- Costa, O. L. V. ; Queiroz Filho, E. V.,Arbitrage-Free Conditions and Hedging Strategies for Markets with Penalty Costs on Short Positions. Mathematical Problems in Engineering, v. 2012, p. 1-20, 2012.
- On the Filtering Problem for Continuous-Time Markov Jump Linear Systems with no Observation of the Markov Chain
- Costa, O. L. V. ; Fragoso, Marcelo Dutra ; Todorov, Marcos Garcia, On the Filtering Problem for Continuous-Time Markov Jump Linear Systems with no Observation of the Markov Chain. European Journal of Control, v. 17, p. 339-354, 2011.
- Regular g-measures are not always Gibbsian
- Fernández, R. ; Gallo, S. ; Maillard, G. Regular g-measures are not always Gibbsian. Electronic Communications in Probability, v. 16, p. 732-740, 2011.
- The phonology of rhythm from Classical to Modern Portuguese
- Frota, S. ; Galves, C. M. C. ; Vigario, M. ; Gonzalez-Lopez, V. ; Abaurre, M. B. M. . The phonology of rhythm from Classical to Modern Portuguese. Journal of Historical Linguistics, 2012.
- Context tree selection and linguistic rhythm retrieval from written texts
- Galves, A.; Galves, Charlotte ; García, Jesús E. ; Garcia, Nancy L. ; Leonardi, F. . Context tree selection and linguistic rhythm retrieval from written texts. The Annals of Applied Statistics, v. 6, p. 186-209, 2012.
- Kalikow-type decomposition for multicolor infinite range particle systems
- Galves, A.; Garcia, N. L. ; Löcherbach, E. ; Orlandi, E. . Kalikow-type decomposition for multicolor infinite range particle systems. The Annals of Applied Probability, no prelo, 2012.
- Joint estimation of intersecting context tree models
- Galves, A.; Garivier, A.; Gassiat, E.. Joint estimation of intersecting context tree models. Scandinavian Journal of Statistics, no prelo, 2012.
- Context tree selection: a unifying view
- Garivier, A.; Leonardi, F. Context tree selection: a unifying view. ArXiv:1011.2424v3. Stochastic processes and their applications 121, pp. 2488-2506, 2011.
- Hypergraphs with many Kneser colorings
- Hoppen, C., Kohayakawa, Y. and Lefmann, H. Hypergraphs with many Kneser colorings, European J. Combin. 33 (2012), no. 5, 816--843.
- Edge colorings of graphs avoiding monochromatic matchings of a given size
- Hoppen, C., Kohayakawa, Y. and Lefmann, H. Edge colorings of graphs avoiding monochromatic matchings of a given size, Combin. Probab. Comput. 21 (2012), no. 1--2, 203--218, special issue dedicated to R. H. Schelp.
- Upper bounds on probability thresholds for asymmetric Ramsey properties
- Kohayakawa, Y., Schacht, M. and Spöhel, R. Upper bounds on probability thresholds for asymmetric Ramsey properties, Random Structures Algorithms, to appear.