Invasion percolation through minimum-weight spanning trees

Roland Glantz, Markus Hilpert

Research output: Contribution to journalArticle

Abstract

Invasion percolation is often used to simulate capillary-dominated drainage and imbibition in pore networks. More than a decade ago it was observed that the part of a pore network that is involved in an invasion bond percolation is a minimum-weight spanning tree of the network, where the weights indicate resistances associated with the bonds. Thus, one can determine a minimum-weight spanning tree first and then run the invasion bond percolation on the minimum-weight spanning tree. The time complexities of the two steps are O (mα (m,n)) and O (n), respectively, where m is the number of edges, n is the number of vertices, and α (â,â) denotes the inverse Ackermann function. In this paper we (1) formulate the property of minimum-weight spanning trees that justifies the two-step approach to invasion bond percolation, (2) extend the two-step approach to invasion site percolation, and (3) further extend it to simulations of drainage (imbibition) that include trapping of the wetting (nonwetting) phase. In case of imbibition we also take snap-off into account. As a consequence, all these simulations can now be done in O (mα (m,n)).

Original languageEnglish (US)
Article number031128
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume77
Issue number3
DOIs
StatePublished - Mar 25 2008

Fingerprint

Invasion Percolation
Spanning tree
Invasion
drainage
porosity
takeoff
Inverse function
Wetting
Trapping
Justify
Time Complexity
wetting
apexes
Simulation
simulation
trapping
Denote

ASJC Scopus subject areas

  • Physics and Astronomy(all)
  • Condensed Matter Physics
  • Statistical and Nonlinear Physics
  • Mathematical Physics

Cite this

Invasion percolation through minimum-weight spanning trees. / Glantz, Roland; Hilpert, Markus.

In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, Vol. 77, No. 3, 031128, 25.03.2008.

Research output: Contribution to journalArticle

@article{b74953092d5e4ef1b46ea78e546fd330,
title = "Invasion percolation through minimum-weight spanning trees",
abstract = "Invasion percolation is often used to simulate capillary-dominated drainage and imbibition in pore networks. More than a decade ago it was observed that the part of a pore network that is involved in an invasion bond percolation is a minimum-weight spanning tree of the network, where the weights indicate resistances associated with the bonds. Thus, one can determine a minimum-weight spanning tree first and then run the invasion bond percolation on the minimum-weight spanning tree. The time complexities of the two steps are O (m{\^I}± (m,n)) and O (n), respectively, where m is the number of edges, n is the number of vertices, and {\^I}± ({\^a},{\^a}) denotes the inverse Ackermann function. In this paper we (1) formulate the property of minimum-weight spanning trees that justifies the two-step approach to invasion bond percolation, (2) extend the two-step approach to invasion site percolation, and (3) further extend it to simulations of drainage (imbibition) that include trapping of the wetting (nonwetting) phase. In case of imbibition we also take snap-off into account. As a consequence, all these simulations can now be done in O (m{\^I}± (m,n)).",
author = "Roland Glantz and Markus Hilpert",
year = "2008",
month = "3",
day = "25",
doi = "10.1103/PhysRevE.77.031128",
language = "English (US)",
volume = "77",
journal = "Physical review. E",
issn = "2470-0045",
publisher = "American Physical Society",
number = "3",

}

TY - JOUR

T1 - Invasion percolation through minimum-weight spanning trees

AU - Glantz, Roland

AU - Hilpert, Markus

PY - 2008/3/25

Y1 - 2008/3/25

N2 - Invasion percolation is often used to simulate capillary-dominated drainage and imbibition in pore networks. More than a decade ago it was observed that the part of a pore network that is involved in an invasion bond percolation is a minimum-weight spanning tree of the network, where the weights indicate resistances associated with the bonds. Thus, one can determine a minimum-weight spanning tree first and then run the invasion bond percolation on the minimum-weight spanning tree. The time complexities of the two steps are O (mα (m,n)) and O (n), respectively, where m is the number of edges, n is the number of vertices, and α (â,â) denotes the inverse Ackermann function. In this paper we (1) formulate the property of minimum-weight spanning trees that justifies the two-step approach to invasion bond percolation, (2) extend the two-step approach to invasion site percolation, and (3) further extend it to simulations of drainage (imbibition) that include trapping of the wetting (nonwetting) phase. In case of imbibition we also take snap-off into account. As a consequence, all these simulations can now be done in O (mα (m,n)).

AB - Invasion percolation is often used to simulate capillary-dominated drainage and imbibition in pore networks. More than a decade ago it was observed that the part of a pore network that is involved in an invasion bond percolation is a minimum-weight spanning tree of the network, where the weights indicate resistances associated with the bonds. Thus, one can determine a minimum-weight spanning tree first and then run the invasion bond percolation on the minimum-weight spanning tree. The time complexities of the two steps are O (mα (m,n)) and O (n), respectively, where m is the number of edges, n is the number of vertices, and α (â,â) denotes the inverse Ackermann function. In this paper we (1) formulate the property of minimum-weight spanning trees that justifies the two-step approach to invasion bond percolation, (2) extend the two-step approach to invasion site percolation, and (3) further extend it to simulations of drainage (imbibition) that include trapping of the wetting (nonwetting) phase. In case of imbibition we also take snap-off into account. As a consequence, all these simulations can now be done in O (mα (m,n)).

UR - http://www.scopus.com/inward/record.url?scp=41549132209&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=41549132209&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.77.031128

DO - 10.1103/PhysRevE.77.031128

M3 - Article

C2 - 18517350

AN - SCOPUS:41549132209

VL - 77

JO - Physical review. E

JF - Physical review. E

SN - 2470-0045

IS - 3

M1 - 031128

ER -