dc.creator | Alves | |
dc.creator | Caio; Ribeiro | |
dc.creator | Rodrigo; Sanchis | |
dc.creator | Remy | |
dc.date | 2017 | |
dc.date | jan | |
dc.date | 2017-11-13T11:32:59Z | |
dc.date | 2017-11-13T11:32:59Z | |
dc.date.accessioned | 2018-03-29T05:47:31Z | |
dc.date.available | 2018-03-29T05:47:31Z | |
dc.identifier | Journal Of Statistical Physics. Springer, v. 166, p. 137 - 149, 2017. | |
dc.identifier | 0022-4715 | |
dc.identifier | 1572-9613 | |
dc.identifier | WOS:000392060100008 | |
dc.identifier | 10.1007/s10955-016-1676-8 | |
dc.identifier | https://link-springer-com.ez88.periodicos.capes.gov.br/article/10.1007/s10955-016-1676-8 | |
dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/326179 | |
dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1363185 | |
dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
dc.description | Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) | |
dc.description | We prove the existence of a large complete subgraph w.h.p. in a preferential attachment random graph process with an edge-step. That is, we consider a dynamic stochastic process for constructing a graph in which at each step we independently decide, with probability , whether the graph receives a new vertex or a new edge between existing vertices. The connections are then made according to a preferential attachment rule. We prove that the random graph produced by this so-called generalized linear preferential (GLP) model at time t contains a complete subgraph whose vertex set cardinality is given by , where , for any small asymptotically almost surely. | |
dc.description | 166 | |
dc.description | 1 | |
dc.description | 137 | |
dc.description | 149 | |
dc.description | Fundacao de Amparo a Pesquisa do Estado de Sao Paulo (FAPESP) [2013/24928-2] | |
dc.description | Conselho Nacional de Desenvolvimento Cientifico e Tecnologico (CNPq) | |
dc.description | FAPEMIG (Programa Pesquisador Mineiro) [PPM 00600/16] | |
dc.description | Coordenacao de Aperfeicoamento de Pessoal de Nivel Superior (CAPES) | |
dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
dc.description | Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) | |
dc.language | English | |
dc.publisher | Springer | |
dc.publisher | New York | |
dc.relation | Journal of Statistical Physics | |
dc.rights | fechado | |
dc.source | WOS | |
dc.subject | Complex Networks | |
dc.subject | Clique | |
dc.subject | Preferential Attachment | |
dc.subject | Concentration Bounds | |
dc.title | Large Communities In A Scale-free Network | |
dc.type | Artículos de revistas | |