Bootstrap percolation in living neural networks

From MaRDI portal
Publication:607750

DOI10.1007/s10955-010-0056-zzbMath1207.82037arXiv0910.0627OpenAlexW2038942686MaRDI QIDQ607750

Hamed Amini

Publication date: 3 December 2010

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.0627




Related Items (31)

Higher order corrections for anisotropic bootstrap percolationThe maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degreeInhomogeneous Financial Networks and Contagious LinksBootstrap percolation in random \(k\)-uniform hypergraphsA phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphsScaling and Inverse Scaling in Anisotropic Bootstrap PercolationThe time of bootstrap percolation with dense initial sets for all thresholdsA Dynamic Contagion Risk Model with Recovery FeaturesSharp metastability threshold for an anisotropic bootstrap percolation modelThe Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity ResultsThe maximum time of 2-neighbor bootstrap percolation: complexity resultsTarget set selection with maximum activation timeA cube dismantling problem related to bootstrap percolationBootstrap percolation in inhomogeneous random graphsThe maximum infection time in the geodesic and monophonic convexitiesBootstrap percolation and the geometry of complex networksThe diameter of the directed configuration modelA central limit theorem for diffusion in sparse random graphsMetastability thresholds for anisotropic bootstrap percolation in three dimensionsBootstrap percolation in random geometric graphsThe P3 infection time is W[1-hard parameterized by the treewidth] ⋮ Bootstrap and diffusion percolation transitions in three-dimensional latticesLine Percolation in Finite Projective PlanesBootstrap percolation in power-law random graphsRESILIENCE TO CONTAGION IN FINANCIAL NETWORKSA sharp threshold for bootstrap percolation in a random hypergraphThe Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized ResultsBest response dynamics on random graphsComputing the probability of getting infected: on the counting complexity of bootstrap percolationThe maximum time of 2-neighbour bootstrap percolation: algorithmic aspectsOn irreversible spread of influence in edge-weighted graphs



Cites Work


This page was built for publication: Bootstrap percolation in living neural networks