- Representing Topology
- Storage of Topological Connections
- Performing Network Queries
- Manipulating and Altering Topology
As the name suggests, pore network modeling borrows significantly from the fields of network and graph theory. During the development of OpenPNM, it was debated whether existing Python graph theory packages (such as graph-tool and NetworkX) should be used to store the network topology. It was decided that network property data should be simply stored as Numpy ND-arrays). This format makes the data storage would be very transparent and familiar since all engineers are used to working with arrays (i.e. vectors), and also very efficiently since this allows code vectorization. Fortuitously, around the same time as this discussion, Scipy introduced the compressed sparse graph library, which contains numerous graph theory algorithms that take Numpy arrays as arguments.
The only topology definitions required by OpenPNM are:
- A throat connects exactly two pores, no more and no less
- Throats are non-directional, meaning that flow in either direction is equal (note that this restriction might be worth relaxing in a future release)
Other general, but non-essential rules are:
- Pores can have an arbitrary number of throats, including zero; however, pores with zero throats lead to singular matrices and other problems so should be avoided.
- Two pores are generally connected by no more than one throat, unless there is some real physical reason for this. Unintentional duplicate connections impact the rate of mass exchange between pores.
The GenericNetwork class has a
check_network_health method that scans the network for the above criteria as well as a few others and returns a HealthDict which lists if any problems were founds, and where.
In OpenPNM network topology (or connectivity) is stored as an adjacency matrix. An adjacency matrix is a Np-by-Np 2D matrix. A non-zero value at location (i, j) indicates that pores i and j are connected. Describing the network in this general fashion allows OpenPNM to be agnostic to the type of network it describes. Another important feature of the adjacency matrix is that it is highly sparse and can be stored with a variety of sparse storage schemes. OpenPNM stores the adjacency matrix in the ‘COO’ or ‘IJV’ format, which essentially stores the coordinates (I,J) and values (V) of the nonzero elements in three separate lists. This approach results in a property which OpenPNM calls
'throat.conns'; it is an Nt-by-2 array that gives the ID number of the two pores on either end of a given throat. The representation of an arbitrary network is shown in the following figure. It has 5 pores and 7 throats, and the
'throat.conns' array contains the (I,J,V) information to describes the adjacency matrix.
- In pore networks there is generally no difference between traversing from pore i to pore j or from pore j to pore i, so a 1 is also found at location (j, i) and the matrix is symmetrical.
- A symmetrical matrix means that determining which pores are connected directly to a given pore (say i) can be accomplished by finding the locations of non-zeros in row i.
- Since the adjacency matrix is symmetric, it is redundant to store the entire matrix when only the upper triangular part is necessary. The
'throat.conns'array only stores the upper triangular information, and i is always less than j.
- Although this storage scheme is widely known as IJV, the
scipy.sparsemodule calls this the Coordinate or COO storage scheme.
- Some tasks are best performed on other types of storages scheme, such as CSR or LIL. OpenPNM converts between these internally as necessary, but users can generate a desired format using the
create_adjacency_matrixmethod which accepts the storage type as an argument (i.e.
'lil', etc). For a discussion of sparse storage schemes and the respective merits, see this Wikipedia article.
Querying and inspecting the pores and throats in the Network is an important tool for working with networks. The various functions that are included on the GenericNetwork class will be demonstrated below on the following cubic network:
>>> import OpenPNM as op >>> pn = op.Network.Cubic(shape=[10, 10, 10])
Given a pore i, it possible to find which pores (or throats) are directly connected to it:
>>> pn.find_neighbor_pores(pores=1) array([ 0, 2, 11, 101]) >>> pn.find_neighbor_throats(pores=1) array([ 0, 1, 901, 1801])
The above queries can be more complex if a list of pores is sent, and the
`mode` argument is specified. This is useful for finding neighbors surrounding a set of pores such as the fringes around an invading fluid cluster, or all throats within a cluster
>>> pn.find_neighbor_pores(pores=[2, 3, 4], mode='union') # 'union' is default array([ 1, 5, 12, 13, 14, 102, 103, 104]) >>> pn.find_neighbor_throats(pores=[2, 3, 4], mode='intersection') array([2, 3]) >>> pn.find_neighbor_throats(pores=[2, 3, 4], mode='not_intersection') array([ 1, 4, 902, 903, 904, 1802, 1803, 1804])
`mode` argument limits the returned results using set-theory type logic. Consider the following two queries:
>>> pn.find_neighbor_throats(pores=2) array([ 1, 2, 902, 1802]) >>> pn.find_neighbor_throats(pores=3) array([ 2, 3, 903, 1803])
The union is a single set of unique values obtained by combining the two sets, while the intersection of these two sets includes only the values present in both (i.e. 2) The difference of these sets is all the values except those found common to both initial sets. It’s possible to specify as many pores as desired, and the set-logic is bit less obvious. More generally:
'union'returns a list of unique locations neighboring any input pores
'intersection'returns a list of locations that are neighbors to at least two inputs pores
'difference'returns a list of locations that are only neighbors to one of the input pores
Given a throat or list of throats, it’s possible to find all the pores they connect:
>>> pn.find_connected_pores(throats=[1, 2, 3]) array([[1, 2], [2, 3], [3, 4]]) >>> pn.find_connected_pores(throats=[1, 2, 3], flatten=True) array([1, 2, 3, 4])
The first call above returns a n-by-2 array of pores found on each end of the given throats. The order of the results corresponds to the order of the received throats. Note that when
flatten is True in the second call, the method returns a single array containing all the unique values of the pores which are connected. This function also has a
mode argument that applies set-theory type filtering of the results, but this only applies when
flatten is True.
It is also possible to find the throat that connect given pairs of pores:
>>> pn.find_connecting_throat(P1=0, P2=1) [] >>> pn.find_connecting_throat(P1=[0, 1, 2], P2=[1, 2, 5]) [, , ]
When two lists of pores (
P2) are received, the returned is a list of throat numbers in the same order as the received list. In the second call above throat 0 connects pores 0 & 1, throat 2 connects pores 1 & 2, and pores 2 and 5 are not directly connected hence an empty array is returned.