Abstract



We present a network toy model that is driven exclusively by the network?s topology. Starting from a single node, the network grows by adding randomly a new node (with a single link) at each time step. The criticality appears due to a topological stability condition: A node is stable, if and only if its degree is less than or equal to the average degree of its neighbors plus a global constant, C. This local condition is related to a neighborhood?s assortativity: the tendency of a node to belong to a community (its neighborhood) showing an average property similar to its own. When a node becomes unstable, one of its links is randomly removed and the smallest subnet is deleted. Then the stability conditions of the node and its neighbors are checked iteratively until every node in the network is stable. When all the nodes are stable, a new time step starts. The set of removals performed until every node in the network is stable represents an avalanche. The size of the avalanche s can be defined as the total number of nodes removed from the network.  
International

No 
Congress

XXI Congreso de Física Estadística (FisEs17) [https://fises17.gefenol.es/] 

970 
Place

Sevilla, España 
Reviewers

Si 
ISBN/ISSN

CDP08UPM 


Start Date

30/03/2017 
End Date

01/04/2017 
From page

64 
To page

64 

FisEs17  XXI Congreso de Física Estadística LIBRO DE RESÚMENES [https://fises17.gefenol.es/media/uploads/editor/2017/03/28/libro_resumenes_fises17.pdf] 