I am a Hale Visiting Assistant professor at GeorgiaTech mentored by Michael Damron.
Contact
School of Mathematics
Georgia Institute of Technology.
686 Cherry Street, Atlanta GA. 30332
email: gbrito3(at)gatech(dot)edu
Currently teaching:
MATH 1553 Introduction to Linear Algebra (link to the master website).
CS 8803 Introduction to Graduate Algorithms(link to GT Online Master of Science).
Upcoming events
 Together with colleagues from UNC, Duke and GT we are organizing the Summer Conference Stochastic Spatial Models, part of the AMS Mathematics Research Communities.
Interested participants can apply here.
Research
Here is a list of publications.

Nonuniversality of ergodic first passage percolation (with Christopher Hoffman).
Preprint.
We exhibit a family of invariant, ergodic measures o Z^2 for which the asymptotic shape is the L_1 ball and with exactly four infinite geodesics starting at the origin a.s. In addition we determine the exponents for the variance and wandering of finite geodesics. We show that the variance and wandering exponents do not satisfy the relationship of χ=2ξ−1 which is expected for independent first passage percolation. 
Spectral gap in random bipartite biregular graphs and applications (with Ioana Dumitriu and Kameron Harris).
Submitted.
We prove an analogue of Alon's spectral gap conjecture for random bipartite, biregular graphs. Our result implies a lower bound on the smaller positive eigenvalue of the adjacency matrix. The proofs uses the IharaBass formula to connect the nonbacktracking spectrum to that of the adjacency matrix, employing a revised moment method developed recently by Bordenave (see [1]) to show there exists a spectral gap for the nonbacktracking matrix. Finally, we give some applications in machine learning and coding theory.
[1] Bordenave, Charles. A new proof of Friedman's second eigenvalue Theorem and its extension to random lifts. Arxiv:1502.04482 
Ewens sampling and invariable generation (with Christopher Fowler, Matthew Junge
and Avi Levy)
Combinatorics, Probability and Computing, 2016.
We study the number of random permutations needed to invariably generate the symmetric group, S_n, when the distribution of cycle counts has the strong αlogarithmic property. The canonical example is the Ewens sampling formula, for which the number of kcycles relates to a conditioned Poisson random variable with mean α/k. The special case α=1 corresponds to uniformly random permutations, for which it was recently shown that exactly four are needed. For strong αlogarithmic measures, and almost every α, we show that precisely ⌈(1−αlog2)−1⌉ permutations are needed to invariably generate Sn. A corollary is that for many other probability measures on Sn no bounded number of permutations will invariably generate Sn with positive probability. Along the way we generalize classic theorems of Erd\H{o}s, Tehran, Pyber, Luczak and Bovey to permutations obtained from the Ewens sampling formula.