Perfect simulation of Markov random fields on graphs

• Grant number: 15/12595-4
• Support Opportunities: Scholarships abroad - Research Internship - Doctorate
• Start date: September 01, 2015
• End date: August 31, 2016
• Field of knowledge: Physical Sciences and Mathematics - Probability and Statistics - Probability
• Principal Investigator: Florencia Graciela Leonardi
• Grantee: Andressa Cerqueira
• Supervisor: Aurelien Garivier
• Host Institution: Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil
• Institution abroad: Université Paul Sabatier - Toulouse III, France
• Associated to the scholarship: 14/23526-0 - Perfect simulation of probabilistic networks, BP.DR

Abstract

The main goal of this research project is the development of perfect simulation algorithms for Markov random fields defined on graphs, taking values on a finite alphabet. In order to achieve these goals, we will adapt some techniques from the literature and we will study the theoretical properties of the algorithms proposed. In particular we will focus our attention on the Coupling form the past method, the technique of mixture of variable range distributions and the identification of regenerative times. (AU)

Scientific publications

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

CERQUEIRA, ANDRESSA; LEONARDI, FLORENCIA. Estimation of the Number of Communities in the Stochastic Block Model. IEEE TRANSACTIONS ON INFORMATION THEORY, v. 66, n. 10, p. 10-pg., 2020-10-01. (19/17734-3, 13/07699-0, 15/12595-4)

CERQUEIRA, ANDRESSA; GARIVIER, AURELIEN; LEONARDI, FLORENCIA. A note on perfect simulation for Exponential Random Graph Models. ESAIM-PROBABILITY AND STATISTICS, v. 24, p. 138-147, MAR 3 2020. (19/17734-3, 13/07699-0, 15/12595-4)