Treffer: Bounded expansion in models of webgraphs
Title:
Bounded expansion in models of webgraphs
Authors:
Contributors:
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV, Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
Publication Year:
2007
Collection:
Universitat Politècnica de Catalunya, BarcelonaTech: UPCommons - Global access to UPC knowledge
Subject Terms:
Combinatorics, Graph theory, Computer science, Probability, bounded expansion, grad, webgraphs, minor closed class, random graphs, Combinacions (Matemàtica), Grafs, Teoria de, Informàtica--Matemàtica, Probabilitats, Classificació AMS::05 Combinatorics, Classificació AMS::05 Combinatorics::05C Graph theory, Classificació AMS::68 Computer science::68R Discrete mathematics in relation to computer science, Classificació AMS::60 Probability theory and stochastic processes::60C05 Combinatorial probability
Document Type:
Fachzeitschrift
article in journal/newspaper
File Description:
application/pdf
Language:
English
Relation:
Availability:
Rights:
Attribution-NonCommercial-NoDerivs 2.5 Spain ; http://creativecommons.org/licenses/by-nc-nd/2.5/es/ ; Open Access
Accession Number:
edsbas.5034A654
Database:
BASE
Weitere Informationen
We study the bounded expansion of several models of web graphs. We show that various deterministic graph models for large complex networks have constant bounded expansion.We study two random models of webgraphs, showing that the model of Bonato has not bounded expansion, and we conjecture that the classical model of Barabási may have also not bounded expansion.