Bootstrap percolation and the geometry of complex networks (Q898407): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Nikolaos Fountoulakis / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Nicko G. Gamkrelidze / rank | |||
Normal rank |
Revision as of 17:03, 15 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bootstrap percolation and the geometry of complex networks |
scientific article |
Statements
Bootstrap percolation and the geometry of complex networks (English)
0 references
8 December 2015
0 references
The object of this paper is a geometric framework for complex networks. ``The aim of this work is to shed some light on the evolution of bootstrap percolation process and how this is determined by the geometry of the underlying network.'' The main result of this paper regards the size of the final set \(A_f\) of the bootstrap percolation process with activation threshold \(r\geq1\) on the random graph \(G(N; \alpha, \nu)\), where \(N\) is the number of vertices of the random graph and \(\alpha, \nu\) are some parameters.
0 references
bootstrap percolation
0 references
random geometric graph
0 references
hyperbolic plane
0 references