CV Lattes
ResearcherID
ORCID
Google Scholar Citations
Universidade de São Paulo (USP). Escola de Artes, Ciências e Humanidades (EACH) (Institutional affiliation from the last research proposal) Birthplace: Brazil
Holds a BSc degree in physics from University of São Paulo (1993), a MSc in physics (emphasis on condensed matter physics) from University of São Paulo (1996), and a PhD in statistical physics from Federal University of São Carlos (2000). He has experience in physics, focusing on statistical mechanics, mainly in the subfields of stochastic processes, interacting particle systems, and statistical simulations, with interests in cellular automata and random walks. He also has professional experience in project management, small and medium business consulting, entrepreneurship, and business incubators. Since 2013 he is associate professor at School of Arts, Sciences and Humanities (EACH) of the University of São Paulo (USP) at São Paulo, Brazil. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
The goal of this project is to continue the study of the longest increasing sequences (LIS) of random walks initiated in the scope of the FAPESP grant BPE 2017/22166-9. Previous results suggest some questions about the universality of the distribution of the LIS of simple (step increments -1, +1) and lazy (step increments -1, 0, +1) random walks as well as the possible existence of a phas…
The goal of this project is to investigate some mathematical and statistical properties of random walks and exclusion processes on graphs using analytical and numerical techniques. Specifically, we intend (i) to investigate the probability distribution function of the cover time of planar (e.g., the square and the hexagonal lattices) and random graphs, in particular of the Kleinberg graph…
The problem of the longest increasing subsequence (LIS) is to find an increasing subsequence of maximum length of a given finite sequence of elements drawn from a partially ordered set. The most classic problem of this kind is to determine the LIS of a random permutation. The complete resolution of this problem combined various approaches from different areas of mathematics and physics, c…
| 2 / 2 | Completed research grants |
| 2 / 0 | Completed scholarships in Brazil |
| 1 / 1 | Completed scholarships abroad |
| 5 / 3 | All research grants and scholarships |
| Associated processes | |