Advanced search
Start date
Betweenand

Property testing and estimation of graph parameters

Grant number: 17/02263-0
Support type:Scholarships abroad - Research Internship - Doctorate
Effective date (Start): September 11, 2017
Effective date (End): September 10, 2018
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Computational Mathematics
Principal researcher:Yoshiharu Kohayakawa
Grantee:Henrique Stagni
Supervisor abroad: Asaf Shapira
Home Institution: Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil
Research place: Tel Aviv University, Israel  
Associated to the scholarship:15/15986-4 - Asymptotic Combinatorics with Applications in Property Testing and Parameters Estimation., BP.DR

Abstract

This is the research proposal for Henrique Stagni, doctoral student at the University of São Paulo, for FAPESP's internship abroad program Bolsa de Estágio de Pesquisa no Exterior (BEPE), to be conducted at Tel Aviv University, under the supervision of Professor Asaf Shapira. The goal of this project is the study of property testing and estimation of parameters of combinatorial structures. More specifically, our objective consists of getting better bounds on the number of vertices one needs to sample from a combinatorial structure in order to get a good approximation for a parameter of that structure. Professor Asaf Shapira has obtained striking results in the areas of extremal combinatorics and theoretical computer science, and is a leading expert in the area of property testing, a subject that he has worked on since his PhD thesis. Tel Aviv University (TAU) is a world center for combinatorics and theoretical computer science. Noga Alon, Baumritter Professor of Mathematics and Computer Science at TAU, is the senior member of the area there. Professor Shapira's colleagues include Michael Krivelevich and Wojciech Samotij, highly recognized researchers in the area. We are absolutely certain that the candidate and his doctoral project will greatly benefit from this internship. More broadly speaking, this internship also has the potential of having a substantial impact on the FAPESP Thematic Project Combinatorial structures, optimization, and algorithms in theoretical computer science (Proc. 2013/03447-6). (AU)

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

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)
HAN, J.; KOHAYAKAWA, Y.; SALES, M. T.; STAGNI, H.. ON SOME EXTREMAL RESULTS FOR ORDER TYPES. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, v. 88, n. 3, p. 779-785, . (13/03447-6, 17/02263-0, 15/15986-4)
HOPPEN, CARLOS; KOHAYAKAWA, YOSHIHARU; LANG, RICHARD; LEFMANN, HANNO; STAGNI, HENRIQUE. ON THE QUERY COMPLEXITY OF ESTIMATING THE DISTANCE TO HEREDITARY GRAPH PROPERTIES. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 35, n. 2, p. 1238-1251, . (17/02263-0, 15/15986-4, 18/04876-1)

Please report errors in scientific publications list by writing to: cdi@fapesp.br.