The boundary partition has singleton blocks, so no different boundary vertices are identified. Open component counting is the ordinary counting in the finite graph, including isolated vertices. This is the least wired random-cluster boundary condition.

Ancestors (10)

  1. Random-cluster boundary condition
  2. Random-cluster model
  3. Dependent percolation
  4. Site percolation
  5. Percolation theory
  6. Probability theory
  7. Probability and statistics
  8. Area of mathematics
  9. Mathematics
  10. Home

Incoming links (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version