Algebraic bounds for heterogeneous site percolation on directed and undirected graphs

15 Oct 2016 Hamilton Kathleen E. Pryadko Leonid P.

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 infinite (di)graphs... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • MATHEMATICAL PHYSICS
  • DISORDERED SYSTEMS AND NEURAL NETWORKS
  • MATHEMATICAL PHYSICS