Please use this identifier to cite or link to this item:
Type: Artigo
Title: Large Communities In A Scale-free Network
Author: Alves
Caio; Ribeiro
Rodrigo; Sanchis
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.
Subject: Complex Networks
Preferential Attachment
Concentration Bounds
Editor: Springer
New York
Citation: Journal Of Statistical Physics. Springer, v. 166, p. 137 - 149, 2017.
Rights: fechado
Identifier DOI: 10.1007/s10955-016-1676-8
Date Issue: 2017
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
000392060100008.pdf458.89 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.