Estimação do número de comunidades no modelo estocástico de blocos com correção de grau

• Ano de defesa: 2022
• Autor(a) principal: Tapia, Cristel Ecaterin Vera
• Orientador(a): Gallo, Alexsandro Giacomo Grimbert
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de São Carlos; Câmpus São Carlos
• Programa de Pós-Graduação: Programa Interinstitucional de Pós-Graduação em Estatística - PIPGEs
• Palavras-chave em Português: Modelo estocástico de blocos de Poisson; Modelo estocástico de blocos com correção de grau; Estimação do número de comunidades; regime semi-esparso
• Palavras-chave em Inglês: Poisson stochastic block model; Degree corrected stochastic block model; Estimation of the number of communities; semi-sparse regime
• Área do conhecimento CNPq: CIENCIAS EXATAS E DA TERRA::PROBABILIDADE E ESTATISTICA::ESTATISTICA; CIENCIAS EXATAS E DA TERRA::PROBABILIDADE E ESTATISTICA::PROBABILIDADE
• Link de acesso: https://repositorio.ufscar.br/handle/ufscar/17431

The stochastic block model (SBM) is a random graph model that splits the set of vertices into blocks, and the probability connection between each pair of vertices depends on the blocks to which the vertices belong. The SBM was introduced by Holland et al. (1983) and it is traditionally applied to simple graphs, with each entry in the adjacency matrix following the Bernoulli distribution. Karrer and Newman (2011) extended the model in two directions: they defined the multigraph model (Poisson SBM), in which the entries of the adjacency matrix follow the Poisson distribution, and introduced the degree corrected stochastic block model (DCSBM) that allows the degree distribution of vertices also depend on the vertices, and not just on the blocks they belong to. This thesis is devoted to the problem of estimating the number of communities in the Poisson SBM and DCSBM. We consider the dense regime, in which the probability of connection between pairs of vertices does not depend on the size of the graph, or even the semi-sparse regime, in which the probability of connection between pairs of vertices can decay to 0 (at a certain rate) with the size of the graph. In this general context, we prove that the estimator of the number of communities introduced by Cerqueira and Leonardi (2020) (with the necessary changes) is still strongly consistent.