Transient flow modeling in fractured media using graphs.

We describe a method to simulate transient fluid flows in fractured media using an approach based on graph theory. Our approach builds on past work where the graph-based approach was successfully used to simulate steady-state fluid flows in fractured media. We find a mean computational speedup of the order of 1400 from an ensemble of a 100 discrete fracture networks in contrast to the O(10^{4}) speedup that was obtained for steady-state flows earlier. However, the transient flows considered here involve an additional degree of complexity that was not present in the steady-state flows considered previously with a graph-based approach, that of time marching and solution of the flow equations within a time-stepping scheme. We verify our method with an analytical test case and demonstrate its use on a practical problem related to fluid flows in hydraulically fractured reservoirs. By enabling the study of transient flows, we create an opportunity for a wide set of possibilities where a steady-state approximation is not sufficient, such as the example motivated by hydraulic fracturing that we present here. This work validates the concept that graphs are able to reliably capture the topological properties of the fracture network and serve as effective surrogates in an uncertainty-quantification framework.

Characterizing the impact of particle behavior at fracture intersections in three-dimensional discrete fracture networks.

We characterize the influence of different intersection mixing rules for particle tracking simulations on transport properties through three-dimensional discrete fracture networks. It is too computationally burdensome to explicitly resolve all fluid dynamics within a large three-dimensional fracture network. In discrete fracture network (DFN) models, mass transport at fracture intersections is modeled as a subgrid scale process based on a local Péclet number. The two most common mass transfer mixing rules are (1) complete mixing, where diffusion dominates mass transfer, and (2) streamline routing, where mass follows pathlines through an intersection. Although it is accepted that mixing rules impact local mass transfer through single intersections, the effect of the mixing rule on transport at the fracture network scale is still unresolved. Through the use of explicit particle tracking simulations, we study transport through a quasi-two-dimensional lattice network and a three-dimensional network whose fracture radii follow a truncated power-law distribution. We find that the impact of the mixing rule is a function of the initial particle injection condition, the heterogeneity of the velocity field, and the geometry of the network. Furthermore, our particle tracking simulations show that the mixing rule can particularly impact concentrations on secondary flow pathways. We relate these local differences in concentration to reactive transport and show that streamline routing increases the average mixing rate in DFN simulations.

Branching of hydraulic cracks enabling permeability of gas or oil shale with closed natural fractures.

While hydraulic fracturing technology, aka fracking (or fraccing, frac), has become highly developed and astonishingly successful, a consistent formulation of the associated fracture mechanics that would not conflict with some observations is still unavailable. It is attempted here. Classical fracture mechanics, as well as current commercial software, predict vertical cracks to propagate without branching from the perforations of the horizontal well casing, which are typically spaced at 10 m or more. However, to explain the gas production rate at the wellhead, the crack spacing would have to be only about 0.1 m, which would increase the overall gas permeability of shale mass about 10,000×. This permeability increase has generally been attributed to a preexisting system of orthogonal natural cracks, whose spacing is about 0.1 m. However, their average age is about 100 million years, and a recent analysis indicated that these cracks must have been completely closed by secondary creep of shale in less than a million years. Here it is considered that the tectonic events that produced the natural cracks in shale must have also created weak layers with nanocracking or microcracking damage. It is numerically demonstrated that seepage forces and a greatly enhanced permeability along the weak layers, with a greatly increased transverse Biot coefficient, must cause the fracking to engender lateral branching and the opening of hydraulic cracks along the weak layers, even if these cracks are initially almost closed. A finite element crack band model, based on a recently developed anisotropic spherocylindrical microplane constitutive law, demonstrates these findings [Rahimi-Aghdam S, et al. (2018) arXiv:1212.11023].

Quantifying Topological Uncertainty in Fractured Systems using Graph Theory and Machine Learning.

Fractured systems are ubiquitous in natural and engineered applications as diverse as hydraulic fracturing, underground nuclear test detection, corrosive damage in materials and brittle failure of metals and ceramics. Microstructural information (fracture size, orientation, etc.) plays a key role in governing the dominant physics for these systems but can only be known statistically. Current models either ignore or idealize microscale information at these larger scales because we lack a framework that efficiently utilizes it in its entirety to predict macroscale behavior in brittle materials. We propose a method that integrates computational physics, machine learning and graph theory to make a paradigm shift from computationally intensive high-fidelity models to coarse-scale graphs without loss of critical structural information. We exploit the underlying discrete structure of fracture networks in systems considering flow through fractures and fracture propagation. We demonstrate that compact graph representations require significantly fewer degrees of freedom (dof) to capture micro-fracture information and further accelerate these models with Machine Learning. Our method has been shown to improve accuracy of predictions with up to four orders of magnitude speedup.

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

We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We 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. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.