• Conectividade do grafo aleatório de Erdös-Rényi e uma variante com conexões locais 

      Bedia, Elizbeth Chipa; http://lattes.cnpq.br/9970354479209758 (Universidade Federal de São CarlosUFSCarPrograma de Pós-graduação em Estatística UFSCar/USPCâmpus São Carlos, 2016-03-24)
      We say that a graph is connected if there is a path edges between any pair of vertices. Random graph Erd os-R enyi with n vertices is obtained by connecting each pair of vertex with probability pn 2 (0; 1) independently ...
    • Cadeias estocásticas de memória ilimitada com aplicação na neurociência 

      Ferreira, Ricardo Felipe; http://lattes.cnpq.br/2355076087945221 (Universidade Federal de São CarlosUFSCarPrograma de Pós-graduação em Estatística UFSCar/USPCâmpus São Carlos, 2019-03-21)
      Stochastic chains with unbounded memory are a natural generalization of Markov chains, in the sense that the transition probabilities may depend on the whole past. These process, introduced independently by Onicescu and ...