Algebraic bounds for heterogeneous site percolation on directed and undirected graphs

We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles through a chosen arc; separate bounds are given on finite and...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2017-05, Vol.222, p.124-142
Hauptverfasser:	Hamilton, Kathleen E., Pryadko, Leonid P.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied mathematics Backtracking Construction sites Graphs Lower bounds Percolation Probability Uniqueness Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!