| Full text | |
| Author(s): |
Alves, Caio
;
Ribeiro, Rodrigo
;
Sanchis, Remy
Total Authors: 3
|
| Document type: | Journal article |
| Source: | Journal of Statistical Physics; v. 166, n. 1, p. 137-149, JAN 2017. |
| Web of Science Citations: | 1 |
| Abstract | |
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. (AU) | |
| FAPESP's process: | 13/24928-2 - Random walks and dependent percolation |
| Grantee: | Caio Teodoro de Magalhães Alves |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |