Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Eigenvector centrality for geometric and topological characterization of porous media

Joaquin Jimenez-Martinez and Christian F. A. Negre
Phys. Rev. E 96, 013310 – Published 13 July 2017
PDFHTMLExport Citation
Abstract
Authors
Article Text
  • INTRODUCTION
  • METHODS
  • RESULTS AND DISCUSSION
  • CONCLUSION
  • ACKNOWLEDGMENTS
  • APPENDICES
    • References

    Abstract

    Solving flow and transport through complex geometries such as porous media is computationally difficult. Such calculations usually involve the solution of a system of discretized differential equations, which could lead to extreme computational cost depending on the size of the domain and the accuracy of the model. Geometric simplifications like pore networks, where the pores are represented by nodes and the pore throats by edges connecting pores, have been proposed. These models, despite their ability to preserve the connectivity of the medium, have difficulties capturing preferential paths (high velocity) and stagnation zones (low velocity), as they do not consider the specific relations between nodes. Nonetheless, network theory approaches, where a complex network is a graph, can help to simplify and better understand fluid dynamics and transport in porous media. Here we present an alternative method to address these issues based on eigenvector centrality, which has been corrected to overcome the centralization problem and modified to introduce a bias in the centrality distribution along a particular direction to address the flow and transport anisotropy in porous media. We compare the model predictions with millifluidic transport experiments, which shows that, albeit simple, this technique is computationally efficient and has potential for predicting preferential paths and stagnation zones for flow and transport in porous media. We propose to use the eigenvector centrality probability distribution to compute the entropy as an indicator of the “mixing capacity” of the system.

    • Figure
    • Figure
    • Figure
    • Figure
    • Figure
    • Figure
    • Figure
    6 More
    • Received 19 January 2017
    • Revised 16 June 2017

    DOI:https://doi.org/10.1103/PhysRevE.96.013310

    ©2017 American Physical Society

    Physics Subject Headings (PhySH)

    1. Research Areas
    Flows in porous mediaMultiphase flows
    Fluid Dynamics

    Authors & Affiliations

    Joaquin Jimenez-Martinez*

    • Department of Water Resources and Drinking Water, EAWAG, 8600 Dubendorf, Switzerland; Department of Civil, Environmental and Geomatic Engineering, ETH Zurich, 8093 Zurich, Switzerland; and Earth and Environmental Sciences Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545, United States

    Christian F. A. Negre†

    • Theoretical Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545, United States

    • *joaquin.jimenez@eawag.ch; jjimenez@ethz.ch
    • †cnegre@lanl.gov

    Article Text (Subscription Required)

    Click to Expand

    References (Subscription Required)

    Click to Expand
    Issue

    Vol. 96, Iss. 1 — July 2017

    Reuse & Permissions
    Access Options
    Author publication services for translation and copyediting assistance advertisement

    Authorization Required

    Log In
    Other Options
    ×

    Images

    • Figure 1
      Figure 1

      (a) Binary image of the 2D porous medium, with pores or voids in black and grains in white. (b) Distances to nearest objects (DNO function) inside the pore space. (c) Pore network composed of edges connecting nodes (centroid of the pore) determined by the local maxima of the DNO function. (d) Corresponding graph for the defined pore network. The minimum distance normal to the edge (i.e., pore-throat size) provides the weight. The termination of a path, both in the pore network and in the graph, is called a dead-end.

      Reuse & Permissions
    • Figure 2
      Figure 2

      Left: Millifluidic transport experiments under variably saturated conditions [26]. Area of the wetting phase reached by the tracer (flowing from left to right; entering across the entire y/ɛ width at x/ɛ=0) over the duration of the experiment (red areas), for different water saturation Sw values: (a) 1.00, (b) 0.83, (c) 0.77, and (d) 0.71. Areas without tracer present are shown in blue. Grains are depicted in gray, and air clusters in black. Right: Two-dimensional maps showing the x-biased SPEC function [c(r)] for each water saturation value. Warm colors (red and yellow) represent nodes and regions of the pore network with high eigenvector centrality values, i.e., high relative importance for flow and transport. Cold colors (green and blue) represent nodes and regions of the wetting phase with low eigenvector centrality values, i.e., low relative importance in the network. The pore network, including edges and nodes, defined for the wetting phase is plotted with black lines.

      Reuse & Permissions
    • Figure 3
      Figure 3

      Eigenvector centrality (ci) probability density functions for different water saturation values Sw.

      Reuse & Permissions
    • Figure 4
      Figure 4

      (a) Transport experiment and SPEC function [c(r)≥5.2×10−3] superimposed on the same image (for Sw=0.83). The brown area has been invaded by the tracer and falls above the c(r) threshold considered; the purple area has not been invaded by the tracer and falls below the c(r) threshold; the red area has been invaded in the experiment but falls below the c(r) threshold; and the blue area has not been invaded in the experiment but falls above the c(r) threshold. (b) Variation of ξ with Sw. Comparison between the fraction of the wetting phase with a low eigenvector centrality value (gray region defined from centrality thresholds, c(r)≥4×10−3 and c(r)≥5.2×10−3) and the fraction of the wetting phase not involved in the solute transport process for the duration of the experiments (red circles) [26].

      Reuse & Permissions
    • Figure 5
      Figure 5

      Different degrees of connectivity. Connectivity is limited to (a) first, (b) second, (c) third, and (d) fourth nearest neighbors. Weights wij are chosen at random between 0.5 and 1.0.

      Reuse & Permissions
    • Figure 6
      Figure 6

      λN as a function of the lattice connectivity (number of neighbors).

      Reuse & Permissions
    • Figure 7
      Figure 7

      Comparison between (a) a pristine first-neighbor-connected lattice and (b) a regular graph with randomized weights where 0.5≤wij≤1.0.

      Reuse & Permissions
    • Figure 8
      Figure 8

      (a) Original compared to (b) corrected weights for a network where 0.5≤wij≤1.0 and with δ=10−4.

      Reuse & Permissions
    • Figure 9
      Figure 9

      Correction of the centrality where 0.5≤wij≤1.0 and with δ=10−4.

      Reuse & Permissions
    • Figure 10
      Figure 10

      Histogram of edge weights wij computed for the pore network with Sw=0.83 (see the text). A medium value of w≃0.9 is shown.

      Reuse & Permissions
    • Figure 11
      Figure 11

      Lorentzian fit of a normalized histogram of the deviation of node position. The Lorentzian (red curve) with Γ=10.8 adjusts very well to the normalized histogram. This distribution can be seen as the probability of finding node i at position ri.

      Reuse & Permissions
    • Figure 12
      Figure 12

      (a) Unbiased and (b) x-biased spatially projected eigenvector centrality (SPEC) function for a random weighted graph where 0.5≤wij≤1.0 and with δ=10−4.

      Reuse & Permissions
    • Figure 13
      Figure 13

      (a) Centrality measure of each node of the pore network and (b) spatially projected eigenvector centrality (SPEC) function for the saturation degree Sw=1.00. Note that the scales are different because the SPEC function smooths out very high and low values.

      Reuse & Permissions
    ×

    Sign up to receive regular email alerts from Physical Review E

    Log In

    Cancel
    ×

    Search

    Article Lookup

    Paste a citation or DOI
    Enter a citation
    ×