skip to main content


Title: Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

Here, we present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We also derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. We obtain accurate estimates of first passage times with an order of magnitude reduction of CPU time and mesh size using the proposed method.
ORCiD logo [1] ; ORCiD logo [1] ; ORCiD logo [1] ; ORCiD logo [1] ; ORCiD logo [1]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Publication Date:
Report Number(s):
Journal ID: ISSN 2470-0045; PLEEE8
Grant/Contract Number:
AC52-06NA25396; 20150763PRD4; 20170103DR
Accepted Manuscript
Journal Name:
Physical Review E
Additional Journal Information:
Journal Volume: 96; Journal Issue: 1; Journal ID: ISSN 2470-0045
American Physical Society (APS)
Research Org:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org:
Country of Publication:
United States
97 MATHEMATICS AND COMPUTING; 54 ENVIRONMENTAL SCIENCES; Earth Sciences; discrete fracture networks, graph theory, shortest paths, flow and transport
OSTI Identifier:
Alternate Identifier(s):
OSTI ID: 1369102