<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing with OASIS Tables v3.0 20080202//EN" "journalpub-oasis3.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:oasis="http://docs.oasis-open.org/ns/oasis-exchange/table" xml:lang="en" dtd-version="3.0" article-type="research-article">
  <front>
    <journal-meta><journal-id journal-id-type="publisher">SE</journal-id><journal-title-group>
    <journal-title>Solid Earth</journal-title>
    <abbrev-journal-title abbrev-type="publisher">SE</abbrev-journal-title><abbrev-journal-title abbrev-type="nlm-ta">Solid Earth</abbrev-journal-title>
  </journal-title-group><issn pub-type="epub">1869-9529</issn><publisher>
    <publisher-name>Copernicus Publications</publisher-name>
    <publisher-loc>Göttingen, Germany</publisher-loc>
  </publisher></journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.5194/se-12-2159-2021</article-id><title-group><article-title>Investigating spatial heterogeneity within fracture networks using hierarchical clustering and graph distance metrics</article-title><alt-title>Investigating spatial heterogeneity within fracture networks</alt-title>
      </title-group><?xmltex \runningtitle{Investigating spatial heterogeneity within fracture networks}?><?xmltex \runningauthor{R.~Prabhakaran et~al.}?>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes" rid="aff1 aff2">
          <name><surname>Prabhakaran</surname><given-names>Rahul</given-names></name>
          <email>r.prabhakaran@tudelft.nl</email>
        <ext-link>https://orcid.org/0000-0001-5715-7760</ext-link></contrib>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Bertotti</surname><given-names>Giovanni</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="no" rid="aff3">
          <name><surname>Urai</surname><given-names>Janos</given-names></name>
          
        <ext-link>https://orcid.org/0000-0001-5299-6979</ext-link></contrib>
        <contrib contrib-type="author" corresp="no" rid="aff2">
          <name><surname>Smeulders</surname><given-names>David</given-names></name>
          
        </contrib>
        <aff id="aff1"><label>1</label><institution>Department of Geoscience and Engineering, Delft University of Technology, Delft, the Netherlands</institution>
        </aff>
        <aff id="aff2"><label>2</label><institution>Department of Mechanical Engineering, Eindhoven University of Technology, Eindhoven, the Netherlands</institution>
        </aff>
        <aff id="aff3"><label>3</label><institution>Structural Geology, Tectonics and Geomechanics, RWTH Aachen University, Aachen, Germany</institution>
        </aff>
      </contrib-group>
      <author-notes><corresp id="corr1">Rahul Prabhakaran (r.prabhakaran@tudelft.nl)</corresp></author-notes><pub-date><day>30</day><month>September</month><year>2021</year></pub-date>
      
      <volume>12</volume>
      <issue>10</issue>
      <fpage>2159</fpage><lpage>2209</lpage>
      <history>
        <date date-type="received"><day>19</day><month>April</month><year>2021</year></date>
           <date date-type="accepted"><day>21</day><month>August</month><year>2021</year></date>
           <date date-type="rev-recd"><day>19</day><month>August</month><year>2021</year></date>
           <date date-type="rev-request"><day>21</day><month>April</month><year>2021</year></date>
      </history>
      <permissions>
        <copyright-statement>Copyright: © 2021 Rahul Prabhakaran et al.</copyright-statement>
        <copyright-year>2021</copyright-year>
      <license license-type="open-access"><license-p>This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this licence, visit <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link></license-p></license></permissions><self-uri xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021.html">This article is available from https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021.html</self-uri><self-uri xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021.pdf">The full text article is available as a PDF file from https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021.pdf</self-uri>
      <abstract><title>Abstract</title>
    <p id="d1e122">Rock fractures organize as networks, exhibiting natural variation in their
spatial arrangements. Therefore, identifying, quantifying, and comparing
variations in spatial arrangements within network geometries are of interest
when explicit fracture representations or discrete fracture network models are
chosen to capture the influence of fractures on bulk rock behaviour. Treating
fracture networks as spatial graphs, we introduce a novel approach to quantify
spatial variation. The method combines graph similarity measures with
hierarchical clustering and is applied to investigate the spatial variation
within large-scale 2-D fracture networks digitized from the well-known Lilstock
limestone pavements, Bristol Channel, UK. We consider three large, fractured
regions, comprising nearly 300 000 fractures spread over
14 200 <inline-formula><mml:math id="M1" display="inline"><mml:mrow class="unit"><mml:msup><mml:mi mathvariant="normal">m</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> from the Lilstock pavements.
Using a moving-window sampling approach, we first subsample the large networks
into subgraphs. Four graph similarity measures – fingerprint distance, D-measure,
Network Laplacian spectral descriptor (NetLSD), and portrait
divergence – that encapsulate topological relationships and geometry of fracture
networks are then used to compute pair-wise subgraph distances serving as input
for the statistical hierarchical clustering technique. In the form of hierarchical
dendrograms and derived spatial variation maps, the results indicate spatial
autocorrelation with localized spatial clusters that gradually vary over
distances of tens of metres with visually discernable and quantifiable boundaries.
Fractures within the identified clusters exhibit differences in fracture
orientations and topology. The comparison of graph similarity-derived
clusters with fracture persistence measures indicates an intra-network
spatial variation that is not immediately obvious from the ubiquitous fracture
intensity and density maps. The proposed method provides a quantitative way to
identify spatial variations in fracture networks, guiding stochastic and
geostatistical approaches to fracture network modelling.</p>
  </abstract>
    </article-meta>
  </front>
<body>
      

<sec id="Ch1.S1" sec-type="intro">
  <label>1</label><title>Introduction</title>
      <p id="d1e145">Fracture networks in rocks develop due to loading paths that vary over geological timescale <xref ref-type="bibr" rid="bib1.bibx31" id="paren.1"/>. The evolution of the network exhibits characteristics of a complex system. There is feedback between the evolving spatial structure and the rock substrate in which the networks are positioned <xref ref-type="bibr" rid="bib1.bibx30" id="paren.2"/>. The resulting spatial arrangement that emerges after cumulative network evolution is of considerable interest as it influences flow, transport, and geomechanical stability in multiple anthropogenic subsurface applications such as geothermal energy <xref ref-type="bibr" rid="bib1.bibx60" id="paren.3"/>, nuclear waste disposal <xref ref-type="bibr" rid="bib1.bibx61" id="paren.4"/>, aquifer management <xref ref-type="bibr" rid="bib1.bibx66" id="paren.5"/>, and hydrocarbon exploitation <xref ref-type="bibr" rid="bib1.bibx35" id="paren.6"/>. Systematically documenting near-surface fracture patterns is essential, for example, in mining applications where fracture patterns often provide clues to ore deposit patterns <xref ref-type="bibr" rid="bib1.bibx28" id="paren.7"/>, and in geotechnical engineering, where fractures influence stability in human-made structures such as tunnels <xref ref-type="bibr" rid="bib1.bibx32" id="paren.8"/>.</p>
      <p id="d1e173">An important property of natural fracture networks is that of spatial organization, which means that the arrangements are not random but follow a statistically discernable pattern. One can view the spatial arrangement of fractures as a set of objects within a geographical reference system. Within such<?pagebreak page2160?> a framework, fracture objects are either regularly spaced, irregularly spaced with statistically significant regions of close spacing, and irregularly spaced with statistically insignificant regions of close spacing <xref ref-type="bibr" rid="bib1.bibx30" id="paren.9"/>. An alternate framework is a network, where fracture objects are described in relation to one another (<xref ref-type="bibr" rid="bib1.bibx57 bib1.bibx1 bib1.bibx48" id="altparen.10"/>). Spatial variations in fracture network organization are quite common. The physical phenomena commonly used to explain spatial variation in fracture arrangements are stress shadowing, layer thickness differences, host rock lithology, layered mechanical anisotropy, high-strain events such as faulting/folding, and diagenesis. However, it is generally not easy to associate a type of spatial arrangement to any unique set of input boundary conditions as similar loading paths can lead to diverging patterns, and dissimilar loading paths can lead to converging patterns <xref ref-type="bibr" rid="bib1.bibx31" id="paren.11"/>.</p>
      <p id="d1e185">Quantifying variations in spatial arrangements of fractures involves the sampling of fracture data. Such quantifications can be in the form of 1-D (using scanline methods, borehole sampling), in 2-D (fracture trace maps from outcrop imagery), or 3-D (ground-penetrating radar, microseismic). 1-D scanlines provide a method to quantify arrangements and variation, and several statistical measures have been proposed, such as fracture spacing <xref ref-type="bibr" rid="bib1.bibx45" id="paren.12"/>, fracture intensity <xref ref-type="bibr" rid="bib1.bibx15" id="paren.13"/>, coefficient of variation <xref ref-type="bibr" rid="bib1.bibx23" id="paren.14"/>, normalized correlation count <xref ref-type="bibr" rid="bib1.bibx34" id="paren.15"/>, and cumulative spacing derivative <xref ref-type="bibr" rid="bib1.bibx10" id="paren.16"/>. These measurements, however, only indicate the variation of fracture arrangements on the scanline and fail to depict the variation in directions away from the scanline direction. Scanlines do not provide information on properties such as fracture length, spatial arrangements, and relationships with other fractures.</p>
      <p id="d1e203">2-D fracture trace maps are especially useful, as this type of data combines both geometric and topological information in the form of a network. Recent advances in unmanned aerial vehicle (UAV)-photogrammetry <xref ref-type="bibr" rid="bib1.bibx7 bib1.bibx9" id="paren.17"/> and automated image processing algorithms <xref ref-type="bibr" rid="bib1.bibx42" id="paren.18"/> have led to large datasets of 2-D fracture traces that reveal much more about network attributes than is possible from 1-D sampling. Given such large datasets with rich information, it is pertinent to directly quantify spatial variation from the network structure. Spatial fracture persistence <xref ref-type="bibr" rid="bib1.bibx15" id="paren.19"/> can quantify 2-D spatial variation but only considers some aspects of the network (such as the sum of trace lengths, number of traces, etc., within a sampling region). Thus, there is a need for more advanced techniques specific to 2-D fracture trace data and which can use the combined geometric and topological structure.</p>
      <p id="d1e216">From a geostatistical perspective, the concept of spatial variability describes how a measurable attribute varies across a spatial domain <xref ref-type="bibr" rid="bib1.bibx16" id="paren.20"/>. Quantifying magnitude and directional dependence of the variability can also be done using geostatistical tools, provided there is a means to measure variability across multiple spatial samples. The variability in fracture data has typically been reduced to variability in attributes (such as fracture length by sampling area, number of intersections, number of sets, and orientations), and attribute variability used to make decisions of stationarity. The identification of representative element volumes (REVs) then follows from the choice of stationarity.  However, given that natural fracture networks display spatial heterogeneity, the suitability of such REVs based on stationarity assumptions needs to be re-examined. Therefore, it is interesting to compare network variation (rather than attribute variation) across the spatial domain. Any comparative method must retain topological and geometric structures encoded within the spatial samples.</p>
</sec>
<sec id="Ch1.S2">
  <label>2</label><title>Graph theory in fracture network analysis</title>
<sec id="Ch1.S2.SS1">
  <label>2.1</label><title>Fracture networks as graphs</title>
      <p id="d1e237">Many authors have suggested using graph theory for the characterization of fracture networks (such as  <xref ref-type="bibr" rid="bib1.bibx57 bib1.bibx1 bib1.bibx59 bib1.bibx48 bib1.bibx49" id="altparen.21"/>). In graph theory and network science, graphs are structures that comprise a set of edges and vertices representing relationships between data. In fracture networks, the vertices are intersections between fractures, and the edges represented by fracture segments connecting the vertices <xref ref-type="bibr" rid="bib1.bibx48" id="paren.22"/>. By assigning positional information to the vertices (also called nodes), fractures in the form of graphs encapsulate both topological and spatial information <xref ref-type="bibr" rid="bib1.bibx49" id="paren.23"/>. An alternate graph representation is when fractures from tip to tip are vertices, and intersections with other fractures are edges. <xref ref-type="bibr" rid="bib1.bibx4" id="text.24"/> refers to these types of representations as “primal” and “dual” forms, respectively. Others, such as <xref ref-type="bibr" rid="bib1.bibx17" id="text.25"/>, call the two representations “intersection graphs” and “fracture graphs”.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F1" specific-use="star"><?xmltex \currentcnt{1}?><?xmltex \def\figurename{Figure}?><label>Figure 1</label><caption><p id="d1e257">Comparing primal and dual forms of a fracture network from data published by <xref ref-type="bibr" rid="bib1.bibx44" id="text.26"/>: <bold>(a)</bold> a fracture network depicted in the primal form with dimensions in metres, <bold>(b)</bold> corresponding dual representation of the fracture network with node sizing proportional to dual graph node degree and plotted using a force layout, <bold>(c)</bold> node degree distribution of primal graph, and <bold>(d)</bold> node degree distribution of the dual graph.</p></caption>
          <?xmltex \igopts{width=455.244094pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f01.png"/>

        </fig>

      <p id="d1e281">We depict an example of a fracture network in its primal form (see Fig. <xref ref-type="fig" rid="Ch1.F1"/>a)
and in its dual form (see Fig. <xref ref-type="fig" rid="Ch1.F1"/>b). The degree of a
graph node is simply the number of edges that are incident at a particular
node. As seen in the primal graph in Fig. 1c, the maximum node degree is 6,
with the most common degree value being 3. This type of degree distribution is
typical for a spatial graph in which physical constraints limit the maximum
possible node degree. We may note that node degrees in spatial graph
representations of fracture networks are most likely to be 1, 3, or 4. For fracture networks interpreted from outcrop images as depicted in Fig. <xref ref-type="fig" rid="Ch1.F1"/>a, eroded fractures and enlarged apertures may lead to higher degrees due to issues in resolving closely spaced nodes.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F2" specific-use="star"><?xmltex \currentcnt{2}?><?xmltex \def\figurename{Figure}?><label>Figure 2</label><caption><p id="d1e293"><bold>(a)</bold> An unweighted planar graph with six nodes and seven edges, <bold>(b)</bold> adjacency matrix of unweighted graph, <bold>(c)</bold> a weighted planar graph with edge weights proportional to Euclidean distances between connecting nodes, <bold>(d)</bold> weighted sparse adjacency matrix for weighted planar graph, <bold>(e)</bold> a directed, unweighted graph, and <bold>(f)</bold> adjacency matrix of directed graph.</p></caption>
          <?xmltex \igopts{width=455.244094pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f02.png"/>

        </fig>

      <?pagebreak page2162?><p id="d1e319">In the case of the alternate representation, referred to as dual graphs by <xref ref-type="bibr" rid="bib1.bibx4" id="text.27"/> and depicted in Fig. <xref ref-type="fig" rid="Ch1.F1"/>d, the maximum degree can be much higher, and the longest fractures that have the highest number of intersections also have the highest degree. <xref ref-type="bibr" rid="bib1.bibx1" id="text.28"/> and <xref ref-type="bibr" rid="bib1.bibx59" id="text.29"/> suggested that fracture networks are disassortative in that shorter fractures preferentially attach on to the longer fractures. The property of disassortativity is quantitatively defined using assortativity coefficients <xref ref-type="bibr" rid="bib1.bibx36" id="paren.30"/> with disassortative networks having negative assortativity coefficients. <xref ref-type="bibr" rid="bib1.bibx1" id="text.31"/> and <xref ref-type="bibr" rid="bib1.bibx59" id="text.32"/> report negative assortativity coefficients for fracture networks that are represented in the dual form. <xref ref-type="bibr" rid="bib1.bibx44" id="text.33"/> found such a correlation between dual graph node degree and length.</p>
      <p id="d1e346">In graph representations, weights can be assigned to edges that are proportional to the importance of that edge. In the case of fracture networks in the primal form, this can be the Euclidean distance between the nodes (or fracture edge intersections). The weight may also be the direction cosine of the particular edge that indicates orientation. In the dual graph representation, intersections between fractures represent the edges. Therefore, the edge weight may be specified in terms of intersection angle. Graphs may also be directed with a specific direction to edges. In the case of spatial graphs derived from fracture networks, an undirected but weighted representation is sufficient. Figure <xref ref-type="fig" rid="Ch1.F2"/>a, c, and e depict examples of unweighted, weighted, and directed planar graphs, respectively. The corresponding adjacency matrices are depicted in Fig. <xref ref-type="fig" rid="Ch1.F2"/>b, d, and f.</p>
</sec>
<sec id="Ch1.S2.SS2">
  <label>2.2</label><title>Graph distance measures to quantify network similarity</title>
      <p id="d1e361">Several graph similarity measures exist within the graph theory literature to compare graphs (see <xref ref-type="bibr" rid="bib1.bibx25 bib1.bibx52 bib1.bibx18" id="altparen.34"/>, for recent reviews). Graph comparisons are a challenging, non-trivial problem in terms of computing complexity <xref ref-type="bibr" rid="bib1.bibx50" id="paren.35"/>. Still, various measures exist that can capture and highlight useful aspects of the graph structure that facilitate comparisons. Graph isomorphism between two graphs implies that there exists a series of necessary conditions such as an equal number of nodes, edges, degree sequences, and sufficient conditions such as equal adjacency matrices <xref ref-type="bibr" rid="bib1.bibx58" id="paren.36"/>. An isomorphism test on two graphs, <inline-formula><mml:math id="M2" display="inline"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M3" display="inline"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, can only yield two results, either isomorphic or not. Graph similarity can therefore be differentiated from graph isomorphism in that the latter comparison can only return a binary outcome. Graph similarity on <inline-formula><mml:math id="M4" display="inline"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M5" display="inline"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, on the other hand, returns a real-valued quantity that converges to zero when the two graphs approach isomorphism (or complete similarity).</p>
      <p id="d1e418"><xref ref-type="bibr" rid="bib1.bibx52" id="text.37"/> classify distance measures based on whether the metric is capable of comparing graphs with an unequal number of nodes or not. The metrics may also be classified based on whether they can also handle weighted and directed graphs. Using a graph similarity measure on a fracture network, we can explore spatial variations in network structure by comparing multiple sampling points.</p>
</sec>
<sec id="Ch1.S2.SS3">
  <label>2.3</label><title>Combining dissimilarity measures with clustering algorithms</title>
      <p id="d1e431">Since we are interested in quantifying spatial variability, we may recast the problem as that of identifying clusters within the network. Clustering is also referred to as unsupervised classification and is a process of finding groups within a set of objects with an assigned measurement <xref ref-type="bibr" rid="bib1.bibx20" id="paren.38"/>. If we consider a dataset, <inline-formula><mml:math id="M6" display="inline"><mml:mrow><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:msub><mml:mi>X</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, containing “<inline-formula><mml:math id="M7" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula>” data samples, clustering then implies arranging the elements of <inline-formula><mml:math id="M8" display="inline"><mml:mi>D</mml:mi></mml:math></inline-formula> into “<inline-formula><mml:math id="M9" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula>” distinct subsets, <inline-formula><mml:math id="M10" display="inline"><mml:mrow><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:msub><mml:mi>C</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="M11" display="inline"><mml:mrow><mml:mi>m</mml:mi><mml:mo>≤</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:math></inline-formula>. From a statistical perspective, the clustering task is different from classification because the former is exploratory, whereas the latter is predictive, although both attempt to assign labels. Therefore, clustering must precede classification.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F3" specific-use="star"><?xmltex \currentcnt{3}?><?xmltex \def\figurename{Figure}?><label>Figure 3</label><caption><p id="d1e543">A simple example of hierarchical clustering using Euclidean
distance: <bold>(a)</bold> 10 randomly positioned points in 2-D space and <bold>(b)</bold> a
dendrogram computed from hierarchical clustering using the Euclidean distance
depicting clusters of the 10 individual points at different levels organized
into a hierarchy. The procedure of hierarchical clustering is shown in
Algorithm 1.</p></caption>
          <?xmltex \igopts{width=455.244094pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f03.png"/>

        </fig>

      <p id="d1e558">In the existing literature on fracture networks, assigning labels to specific perceived archetypal networks (or end-members) is standard. These typologies include terms such as orthogonal, nested, ladder-like, conjugated, polygonal, corridors, etc. (<xref ref-type="bibr" rid="bib1.bibx12 bib1.bibx13 bib1.bibx40" id="altparen.39"/>). However, when faced with the reality of outcrop-derived 2-D fracture trace data, it is not easy to assign such labels. Therefore, clustering is a significant and necessary step in exploratory fracture data analysis.</p>
      <p id="d1e565">Hierarchical clustering (HC) is an unsupervised statistical clustering method <xref ref-type="bibr" rid="bib1.bibx29" id="paren.40"/> that can identify clusters within a set of observations given a distance matrix computed by applying a well-defined distance function, pair-wise on each observation. In contrast to other clustering methods such as <inline-formula><mml:math id="M12" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula> means or <inline-formula><mml:math id="M13" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula> medoids, which require an a priori known number of clusters as input arguments, HC re-organizes observations into hierarchical representations from which the user can pick a level of granularity. At the lowest level, there is just one cluster containing all the observations. At the highest level, the number of clusters is equal to the observations. HC algorithms are referred to as “agglomerative” or “divisive” depending upon whether they begin from a lower level or from the highest level. The clustering then organizes the discrete data into a hierarchical dendrogram structure that positions the clusters based on the magnitude of similarity. By combining graph distance computations across spatially distinct samplings with unsupervised HC, cluster detection automatically leads to quantified spatial variation. A simple example of HC is illustrated on a set of randomly distributed points in space (see Fig. <xref ref-type="fig" rid="Ch1.F3"/>a). The result is the hierarchical dendrogram structure depicted in Fig. <xref ref-type="fig" rid="Ch1.F3"/>b.</p><?xmltex \hack{\newpage}?>
</sec>
</sec>
<?pagebreak page2163?><sec id="Ch1.S3">
  <label>3</label><title>Fracture datasets</title>
      <p id="d1e599">To validate the proposed approach based on graph distance metrics and hierarchical clustering, we utilize a 2-D joint fracture dataset from the Lilstock pavement in the Bristol Channel, UK <xref ref-type="bibr" rid="bib1.bibx44" id="paren.41"/>. The dataset consists of fracture joints automatically traced using a technique described in <xref ref-type="bibr" rid="bib1.bibx42" id="text.42"/> from UAV photogrammetric data published by <xref ref-type="bibr" rid="bib1.bibx62" id="text.43"/>. The joint networks correspond to Jurassic limestones with very dense joint networks spread across multiple layers. The joints are stratabound and perpendicular to bedding. We consider three large-scale fracture networks from this dataset, as depicted in Fig. <xref ref-type="fig" rid="Ch1.F4"/>. There is considerable spatial variation in the jointing. From previous literature documenting joints within the Lilstock pavements, the spatial variation is attributed to multiple reasons.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F4" specific-use="star"><?xmltex \currentcnt{4}?><?xmltex \def\figurename{Figure}?><label>Figure 4</label><caption><p id="d1e615">Overview of fracture networks corresponding to the three considered regions. This map is derived from an open image dataset published by <xref ref-type="bibr" rid="bib1.bibx63" id="text.44"/> and available for download with a CC-BY license.</p></caption>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f04.png"/>

      </fig>

      <p id="d1e627">The proposed explanations include proximity and influence of faults explained by fluid-driven radial-jointing emanating from asperities within fault (e.g. <xref ref-type="bibr" rid="bib1.bibx47 bib1.bibx23" id="altparen.45"/>), spatial variation of thicknesses of intercalated limestone and shale layers (e.g. <xref ref-type="bibr" rid="bib1.bibx5" id="altparen.46"/>), proximity to high-deformation features such as folding (e.g. <xref ref-type="bibr" rid="bib1.bibx6" id="altparen.47"/>), the interplay between regional and local stresses resulting in complex stress fields (e.g. <xref ref-type="bibr" rid="bib1.bibx64" id="altparen.48"/>), inheritance from the spatial distribution of pre-existing vein/stylolite networks that influenced later joint network development (e.g. <xref ref-type="bibr" rid="bib1.bibx67 bib1.bibx14" id="altparen.49"/>), and synkinematic cementation in veins affecting later development of joints <xref ref-type="bibr" rid="bib1.bibx27" id="paren.50"/>. Recent work on fractures at the Kilve outcrop <xref ref-type="bibr" rid="bib1.bibx46" id="paren.51"/>, exposing the same geological units as those considered in this work, concludes that anomalous fracture intensity exists in fracturing at various locations and suggest that variability in fracture intensity cannot be fully explained by variations in thickness, compositional, or textural variations.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F5" specific-use="star"><?xmltex \currentcnt{5}?><?xmltex \def\figurename{Figure}?><label>Figure 5</label><caption><p id="d1e655">Comparison of the three regions in terms of networks, orientations, and length distributions. Map dimensions are in metres. This image has been modified from <xref ref-type="bibr" rid="bib1.bibx44" id="text.52"/> with permission.</p></caption>
        <?xmltex \igopts{width=469.470472pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f05.png"/>

      </fig>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T1"><?xmltex \currentcnt{1}?><label>Table 1</label><caption><p id="d1e670">Summary statistics for the three regions.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="5">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:colspec colnum="5" colname="col5" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1">Region</oasis:entry>
         <oasis:entry colname="col2">Approx.</oasis:entry>
         <oasis:entry colname="col3">Fractures</oasis:entry>
         <oasis:entry colname="col4">Edges</oasis:entry>
         <oasis:entry colname="col5">Nodes</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2">area (<inline-formula><mml:math id="M14" display="inline"><mml:mrow class="unit"><mml:msup><mml:mi mathvariant="normal">m</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula>)</oasis:entry>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">Region 1</oasis:entry>
         <oasis:entry colname="col2">6017</oasis:entry>
         <oasis:entry colname="col3">124 006</oasis:entry>
         <oasis:entry colname="col4">364 703</oasis:entry>
         <oasis:entry colname="col5">228 661</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Region 2</oasis:entry>
         <oasis:entry colname="col2">6749</oasis:entry>
         <oasis:entry colname="col3">141 344</oasis:entry>
         <oasis:entry colname="col4">365 333</oasis:entry>
         <oasis:entry colname="col5">235 089</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Region 3</oasis:entry>
         <oasis:entry colname="col2">1473</oasis:entry>
         <oasis:entry colname="col3">28 892</oasis:entry>
         <oasis:entry colname="col4">78 151</oasis:entry>
         <oasis:entry colname="col5">49 771</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d1e792">From this dataset, we utilize fracture networks corresponding to three contiguous regions. Figure <xref ref-type="fig" rid="Ch1.F4"/> depicts the three areas' spatial extent, labelled as Regions 1 to 3. The intensity of fracturing is such that the spatial graphs corresponding to each region have a single connected component. Table <xref ref-type="table" rid="Ch1.T1"/> tabulates summary statistics for the three networks. The number of edges and nodes correspond to the primal graph representation. The “fractures” in Table <xref ref-type="table" rid="Ch1.T1"/> are sequences of graph edges that are clubbed together based on continuity and a strike direction threshold (or number of dual graph nodes). Regions 1 and 2 correspond to a single stratigraphic layer but, due to erosion, they are not contiguous within the outcrop. We treat them separately in our analysis of spatial variation.</p>
      <p id="d1e801">The detailed resolution, topological accuracy, and spatial extent of the
traced networks make the dataset appropriate for a detailed analysis of
spatial variation in fracturing. The networks have significant intra- and
inter-network variability in
fracturing. Figures <xref ref-type="fig" rid="Ch1.F5"/>, <xref ref-type="fig" rid="Ch1.F6"/>, and <xref ref-type="fig" rid="Ch1.F7"/> illustrate these differences. From Fig. <xref ref-type="fig" rid="Ch1.F5"/>, the fracture orientations of Region 1 depict discernable angular bins of fracture orientations. On the other hand, rose plots of Regions 2 and 3 show considerable scatter due to the presence of long and curved fractures. Fracture<?pagebreak page2164?> length distributions are different, with Region 2 having the longest fractures and Region 1 the shortest. The distribution of joints within a particular length bin is also highly variable.  In Fig. <xref ref-type="fig" rid="Ch1.F6"/>, the cumulative variation in the strike along individual fracture edges that comprise a tip-to-tip fracture is plotted as a function of the total length. The slope of the scatter plots gives an indication of the fracture curvature. The slope of the scatter plot is higher in Regions 2 and 3 than in Region 1. We interpret the curvature to therefore be the lowest in Region 1.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F6" specific-use="star"><?xmltex \currentcnt{6}?><?xmltex \def\figurename{Figure}?><label>Figure 6</label><caption><p id="d1e816">Correlation between sum of strike differences of fracture segments constituting tip-to-tip fractures versus total fracture length for the three regions.</p></caption>
        <?xmltex \igopts{width=455.244094pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f06.png"/>

      </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F7" specific-use="star"><?xmltex \currentcnt{7}?><?xmltex \def\figurename{Figure}?><label>Figure 7</label><caption><p id="d1e828">Cutout from Region 2 depicting the detailed resolution of the fracture dataset.</p></caption>
        <?xmltex \igopts{width=426.791339pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f07.png"/>

      </fig>

</sec>
<sec id="Ch1.S4">
  <label>4</label><title>Methods</title>
<sec id="Ch1.S4.SS1">
  <label>4.1</label><title>Subsampling the network data</title>
      <p id="d1e852">We circularly sample the fracture networks on a cartesian grid with a subgraph extracted within a circular region centred at each grid point. The grid spacing to circle diameter is maintained such that neighbouring subgraphs share some portion of the area (see Fig. <xref ref-type="fig" rid="Ch1.F8"/>). Near the networks' boundaries, the subgraphs are either too small or result in disconnected graph components. We neglect these samples so that they do not affect the clustering results. The process of circular sampling creates edge nodes with degree 1, which has the effect of altering node topology by introducing isolated, degree-1 nodes. To prevent this from impacting clustering results, we remove all edges from the subgraphs emanating from degree-1 nodes that contact the periphery of the circular sample. This effect is illustrated in Fig. <xref ref-type="fig" rid="Ch1.F9"/>. Each subgraph can now be compared to every other subgraph using a graph distance metric to compute a pair-wise distance matrix. The distance matrix serves as the input to the hierarchical clustering algorithm.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F8" specific-use="star"><?xmltex \currentcnt{8}?><?xmltex \def\figurename{Figure}?><label>Figure 8</label><caption><p id="d1e861">Subsampling of a fracture graph corresponding to full region into subgraphs of 7.5 <inline-formula><mml:math id="M15" display="inline"><mml:mrow class="unit"><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:math></inline-formula> diameter and spacing of 5 <inline-formula><mml:math id="M16" display="inline"><mml:mrow class="unit"><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:math></inline-formula>.</p></caption>
          <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f08.png"/>

        </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F9" specific-use="star"><?xmltex \currentcnt{9}?><?xmltex \def\figurename{Figure}?><label>Figure 9</label><caption><p id="d1e888">Treating isolated nodes and dangling edges that arise due to circular sampling: <bold>(a)</bold> a circularly sampled subgraph with a diameter of 7.5 <inline-formula><mml:math id="M17" display="inline"><mml:mrow class="unit"><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:math></inline-formula>, <bold>(b)</bold> edges connected to isolated nodes intersected by circle, and <bold>(c)</bold> subgraph after removing isolated nodes and corresponding dangling edges.</p></caption>
          <?xmltex \igopts{width=455.244094pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f09.png"/>

        </fig>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T2"><?xmltex \currentcnt{2}?><label>Table 2</label><caption><p id="d1e918">Number of subgraphs obtained per region.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="2">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:thead>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">Region</oasis:entry>
         <oasis:entry colname="col2">No. of subgraphs</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">Region 1</oasis:entry>
         <oasis:entry colname="col2">219</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Region 2</oasis:entry>
         <oasis:entry colname="col2">212</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Region 3</oasis:entry>
         <oasis:entry colname="col2">117</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <?pagebreak page2165?><p id="d1e972">For <inline-formula><mml:math id="M18" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula> subgraphs, the number of comparisons necessary are <inline-formula><mml:math id="M19" display="inline"><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mrow><mml:mi>N</mml:mi><mml:mo>(</mml:mo><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mn mathvariant="normal">2</mml:mn></mml:mfrac></mml:mstyle></mml:math></inline-formula>. The computational complexity of graph comparison increases polynomially with the size of subgraphs in terms of node sizes. Since the number of comparisons increases quadratically with the number of subgraphs, we seek to balance grid spacing and sampling diameter. For Regions 1 and 2, we choose a spacing of 5 <inline-formula><mml:math id="M20" display="inline"><mml:mrow class="unit"><mml:mi mathvariant="normal">km</mml:mi></mml:mrow></mml:math></inline-formula> for circularly sampled subgraphs with a diameter of 7.5 <inline-formula><mml:math id="M21" display="inline"><mml:mrow class="unit"><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:math></inline-formula>. For Region 3, which is also the smallest region, a spacing of 5 <inline-formula><mml:math id="M22" display="inline"><mml:mrow class="unit"><mml:mi mathvariant="normal">km</mml:mi></mml:mrow></mml:math></inline-formula> would lead to quite a smaller number of subgraphs. Therefore, we use a more dense spacing of 3 <inline-formula><mml:math id="M23" display="inline"><mml:mrow class="unit"><mml:mi mathvariant="normal">km</mml:mi></mml:mrow></mml:math></inline-formula> with a diameter of 7.5 <inline-formula><mml:math id="M24" display="inline"><mml:mrow class="unit"><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:math></inline-formula>.  Table <xref ref-type="table" rid="Ch1.T2"/> tabulates the number of subgraphs pertaining to each region.</p>
</sec>
<sec id="Ch1.S4.SS2">
  <label>4.2</label><title>Graph similarity measures</title>
      <p id="d1e1055">We use the following four graph similarity measures to compare the subgraphs:
<list list-type="bullet"><list-item>
      <p id="d1e1060">fingerprint distance <xref ref-type="bibr" rid="bib1.bibx33" id="paren.53"/>;</p></list-item><list-item>
      <p id="d1e1067">D-measure <xref ref-type="bibr" rid="bib1.bibx50" id="paren.54"/>;</p></list-item><list-item>
      <p id="d1e1074">Network Laplacian spectral descriptor (NetLSD) <xref ref-type="bibr" rid="bib1.bibx55" id="paren.55"/>;</p></list-item><list-item>
      <p id="d1e1081">portrait divergence <xref ref-type="bibr" rid="bib1.bibx2" id="paren.56"/>.</p></list-item></list></p>
      <p id="d1e1087">The performance of these similarity measures have been validated previously by <xref ref-type="bibr" rid="bib1.bibx25" id="text.57"/> and <xref ref-type="bibr" rid="bib1.bibx52" id="text.58"/> for a variety of benchmark graph datasets. Each similarity measure is described briefly in the following subsections. The reader is referred to the references above for further details on the similarity measures.</p>
<?pagebreak page2166?><sec id="Ch1.S4.SS2.SSS1">
  <label>4.2.1</label><title>Fingerprint distance</title>
      <p id="d1e1103">The fingerprint distance introduced by <xref ref-type="bibr" rid="bib1.bibx33" id="text.59"/> is purely geometric and combines statistics of block faces and shape factors in computing a probability distribution of a spatial graph. <xref ref-type="bibr" rid="bib1.bibx33" id="text.60"/> formulated the measure in the context of quantifying differences in street patterns. A “block” denotes the 2-D region enclosed by graph edges. For any given spatial graph, this corresponds<?pagebreak page2167?> to the number of bounded subgraphs or primary cycles. We neglect isolated fractures and those having dead ends when computing these blocks. Given the network intensity in our dataset, such isolated fractures are minimal. Every block has an associated shape factor, “<inline-formula><mml:math id="M25" display="inline"><mml:mi mathvariant="italic">ϕ</mml:mi></mml:math></inline-formula>” which is expressed in terms of block area “<inline-formula><mml:math id="M26" display="inline"><mml:mi>A</mml:mi></mml:math></inline-formula>” and circumscribing circle area, “<inline-formula><mml:math id="M27" display="inline"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi mathvariant="normal">c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>”:

                  <disp-formula id="Ch1.E1" content-type="numbered"><label>1</label><mml:math id="M28" display="block"><mml:mstyle displaystyle="true" class="stylechange"/><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mi>A</mml:mi><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi mathvariant="normal">c</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d1e1161">The value of <inline-formula><mml:math id="M29" display="inline"><mml:mi mathvariant="italic">ϕ</mml:mi></mml:math></inline-formula> is always smaller than 1, with larger values meaning that the block-face shape is closer to that of a regular polygon. Figure <xref ref-type="fig" rid="Ch1.F10"/>a depicts shape factors of regular polygons versus that of polygons derived from spatial networks in Fig. <xref ref-type="fig" rid="Ch1.F10"/>b. No unique correspondence exists between a particular shape and a magnitude of <inline-formula><mml:math id="M30" display="inline"><mml:mi mathvariant="italic">ϕ</mml:mi></mml:math></inline-formula>; however, the overall distribution of <inline-formula><mml:math id="M31" display="inline"><mml:mi mathvariant="italic">ϕ</mml:mi></mml:math></inline-formula> indicates reveals block shape distribution patterns and highlights differences between spatial graphs. The shape factor alone does not fully serve as a similarity measure as blocks can have similar shapes but different face areas. The distribution of the block-face areas is binned logarithmically to integrate information from the shape factor and block area distributions. A conditional probability distribution, <inline-formula><mml:math id="M32" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>|</mml:mo><mml:mi>A</mml:mi><mml:mo>)</mml:mo><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>A</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, is then defined representing the contribution of <inline-formula><mml:math id="M33" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for each area bin and the summation of which yields the fingerprint curve, <inline-formula><mml:math id="M34" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>:

                  <disp-formula id="Ch1.E2" content-type="numbered"><label>2</label><mml:math id="M35" display="block"><mml:mstyle class="stylechange" displaystyle="true"/><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mo movablelimits="false">∑</mml:mo><mml:mi>A</mml:mi></mml:munder><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>|</mml:mo><mml:mi>A</mml:mi><mml:mo>)</mml:mo><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>A</mml:mi><mml:mo>)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d1e1289">An example of a “fingerprint”, so named by
<xref ref-type="bibr" rid="bib1.bibx33" id="text.61"/>, is depicted in Fig. <xref ref-type="fig" rid="Ch1.F11"/>e and j,
with the distribution curves for three area bins, for two fracture networks
derived from image tiles (see Fig. <xref ref-type="fig" rid="Ch1.F11"/>b, c, f, and g)
corresponding to Region 1 (Fig. <xref ref-type="fig" rid="Ch1.F11"/>a). The curves in
Fig. <xref ref-type="fig" rid="Ch1.F11"/>e and j encapsulate information based on
shape factors and block areas (see Fig. <xref ref-type="fig" rid="Ch1.F11"/>d and h), including the proportional contribution from all logarithmic area bins considered.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F10" specific-use="star"><?xmltex \currentcnt{10}?><?xmltex \def\figurename{Figure}?><label>Figure 10</label><caption><p id="d1e1309"><bold>(a)</bold> Shape factors for regular block shapes with equal edge lengths and <bold>(b)</bold> shape factors for polygonal blocks resulting from real fracture networks in Region 1 (dimensions are relative).</p></caption>
            <?xmltex \igopts{width=312.980315pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f10.png"/>

          </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F11" specific-use="star"><?xmltex \currentcnt{11}?><?xmltex \def\figurename{Figure}?><label>Figure 11</label><caption><p id="d1e1325"><bold>(a)</bold> Overview of Region 1 with two selected <inline-formula><mml:math id="M36" display="inline"><mml:mrow><mml:mn mathvariant="normal">1000</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">1000</mml:mn></mml:mrow></mml:math></inline-formula> <inline-formula><mml:math id="M37" display="inline"><mml:mrow class="unit"><mml:mi mathvariant="normal">pixel</mml:mi></mml:mrow></mml:math></inline-formula> image tiles, <bold>(b)</bold> enlarged view of first image tile, <bold>(c)</bold> fracture network corresponding to first tile as a spatial graph with dimensions of <inline-formula><mml:math id="M38" display="inline"><mml:mrow><mml:mn mathvariant="normal">8.6</mml:mn><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mrow class="unit"><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mo>×</mml:mo><mml:mn mathvariant="normal">6.75</mml:mn></mml:mrow></mml:math></inline-formula> <inline-formula><mml:math id="M39" display="inline"><mml:mrow class="unit"><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:math></inline-formula> and having 3583 edges and 2382 nodes, <bold>(d)</bold> block-face areas coloured as per three area bins (0–100, 100–1000, and 1000–10 000 <inline-formula><mml:math id="M40" display="inline"><mml:mrow class="unit"><mml:msup><mml:mi mathvariant="normal">cm</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula>), <bold>(e)</bold> <inline-formula><mml:math id="M41" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> or fingerprint of the subgraph depicting the combined effects of area and shape factor, <inline-formula><mml:math id="M42" display="inline"><mml:mi mathvariant="italic">ϕ</mml:mi></mml:math></inline-formula> pertaining to the three area bins. <bold>(f)</bold> Enlarged view of second image tile, <bold>(g)</bold> fracture network corresponding to second image tile as a spatial graph with 5418 edges and 3539 nodes, <bold>(h)</bold> block-face areas binned logarithmically, and <bold>(i)</bold> fingerprint of second spatial graph. Panels <bold>(a, b)</bold>, and <bold>(f)</bold> are derived from images contained in the open dataset (CC-BY license) published by <xref ref-type="bibr" rid="bib1.bibx63" id="text.62"/>.</p></caption>
            <?xmltex \igopts{width=469.470472pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f11.png"/>

          </fig>

      <p id="d1e1448">Denoting <inline-formula><mml:math id="M43" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> as the ratio of the number of faces with a shape factor “<inline-formula><mml:math id="M44" display="inline"><mml:mi mathvariant="italic">ϕ</mml:mi></mml:math></inline-formula>” that lie in a bin “<inline-formula><mml:math id="M45" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula>” over the total number of faces for that graph, a distance <inline-formula><mml:math id="M46" display="inline"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> between two graphs <inline-formula><mml:math id="M47" display="inline"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M48" display="inline"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mi>b</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is computed by integrating over <inline-formula><mml:math id="M49" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for the two different graphs. The distance based on <inline-formula><mml:math id="M50" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> of the two graphs for a single area bin is defined as

                  <disp-formula id="Ch1.E3" content-type="numbered"><label>3</label><mml:math id="M51" display="block"><mml:mstyle class="stylechange" displaystyle="true"/><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msub><mml:mi>d</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>a</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>b</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∫</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mn mathvariant="normal">1</mml:mn></mml:munderover><mml:msup><mml:mfenced open="|" close="|"><mml:mrow><mml:msubsup><mml:mi>f</mml:mi><mml:mi mathvariant="italic">α</mml:mi><mml:mi>a</mml:mi></mml:msubsup><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:msubsup><mml:mi>f</mml:mi><mml:mi mathvariant="italic">α</mml:mi><mml:mi>b</mml:mi></mml:msubsup><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mfenced><mml:mi>n</mml:mi></mml:msup><mml:mi mathvariant="normal">d</mml:mi><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d1e1627">As per <xref ref-type="bibr" rid="bib1.bibx33" id="text.63"/>, the value of <inline-formula><mml:math id="M52" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> can either be 1 or 2. We choose <inline-formula><mml:math id="M53" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula> in our computation. The global fingerprint distance <inline-formula><mml:math id="M54" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mtext>FP</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> between <inline-formula><mml:math id="M55" display="inline"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>  and <inline-formula><mml:math id="M56" display="inline"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mi>b</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> can then be computed summing over all area bins <inline-formula><mml:math id="M57" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula>:

                  <disp-formula id="Ch1.E4" content-type="numbered"><label>4</label><mml:math id="M58" display="block"><mml:mstyle class="stylechange" displaystyle="true"/><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msub><mml:mi>D</mml:mi><mml:mtext>FP</mml:mtext></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>a</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>b</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mo movablelimits="false">∑</mml:mo><mml:mi mathvariant="italic">α</mml:mi></mml:munder><mml:msub><mml:mi>d</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>a</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>b</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d1e1755">We have attached our MATLAB implementation of the fingerprint distance in the code Supplement. We computed the distance matrix for all subgraphs corresponding to the three regions using this implementation.</p>
</sec>
<sec id="Ch1.S4.SS2.SSS2">
  <label>4.2.2</label><title>D-measure</title>
      <?pagebreak page2168?><p id="d1e1766">The D-measure introduced by <xref ref-type="bibr" rid="bib1.bibx50" id="text.64"/> is a three-component distance metric with weighting constants for each component. The three properties of graphs compared are the network node dispersion (NND), node distance distribution (<inline-formula><mml:math id="M59" display="inline"><mml:mi mathvariant="italic">μ</mml:mi></mml:math></inline-formula>), and the alpha (<inline-formula><mml:math id="M60" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula>) centrality. The dissimilarity measure, <inline-formula><mml:math id="M61" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mtext>DM</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula>, is the weighted sum:

                  <disp-formula specific-use="align" content-type="numbered"><mml:math id="M62" display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msub><mml:mi>D</mml:mi><mml:mtext>DM</mml:mtext></mml:msub><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:msqrt><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mi mathvariant="script">J</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>g</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>h</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>log⁡</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:mfrac></mml:mstyle></mml:msqrt></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mfenced open="|" close="|"><mml:mrow><mml:msqrt><mml:mrow><mml:mtext>NND</mml:mtext><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mo>-</mml:mo><mml:msqrt><mml:mrow><mml:mtext>NND</mml:mtext><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:msqrt></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="true" class="stylechange"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mo>+</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow><mml:mn mathvariant="normal">2</mml:mn></mml:mfrac></mml:mstyle><mml:mfenced open="(" close=""><mml:msqrt><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mi mathvariant="script">J</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>log⁡</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:mfrac></mml:mstyle></mml:msqrt></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mlabeledtr id="Ch1.E5"><mml:mtd><mml:mtext>5</mml:mtext></mml:mtd><mml:mtd><mml:mstyle class="stylechange" displaystyle="true"/></mml:mtd><mml:mtd><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mfenced open="" close=")"><mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mi mathvariant="script">J</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msup><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msup><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mrow><mml:msup><mml:mi>c</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mrow></mml:msup><mml:mo>)</mml:mo><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>log⁡</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:mfrac></mml:mstyle></mml:msqrt></mml:mrow></mml:mfenced><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mlabeledtr></mml:mtable></mml:math></disp-formula>

              <?xmltex \hack{\newpage}?><?xmltex \hack{\noindent}?>where <inline-formula><mml:math id="M63" display="inline"><mml:mi mathvariant="script">J</mml:mi></mml:math></inline-formula> indicates the Jensen–Shannon divergence. The constants <inline-formula><mml:math id="M64" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M65" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M66" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> in Eq. (<xref ref-type="disp-formula" rid="Ch1.E5"/>) are real and non-negative weights such that <inline-formula><mml:math id="M67" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F12" specific-use="star"><?xmltex \currentcnt{12}?><?xmltex \def\figurename{Figure}?><label>Figure 12</label><caption><p id="d1e2101">D-measure components for the two example fracture graphs comparing <inline-formula><mml:math id="M68" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula> centrality of nodes, distributions of <inline-formula><mml:math id="M69" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula> centrality, NND distributions, and node distance distributions.</p></caption>
            <?xmltex \igopts{width=469.470472pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f12.png"/>

          </fig>

      <p id="d1e2124">As per <xref ref-type="bibr" rid="bib1.bibx50" id="text.65"/>, the first term in Eq. (<xref ref-type="disp-formula" rid="Ch1.E5"/>) compares averaged connectivity node's patterns as per node distance distribution. <xref ref-type="bibr" rid="bib1.bibx50" id="text.66"/> define NND, within the second term, as a measure of the heterogeneity of a graph with respect to connectivity distances that capture global topological differences. The NND is computed as

                  <disp-formula id="Ch1.E6" content-type="numbered"><label>6</label><mml:math id="M70" display="block"><mml:mstyle displaystyle="true" class="stylechange"/><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mtext>NND</mml:mtext><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mi mathvariant="script">J</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>N</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>log⁡</mml:mi><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            where the numerator in Eq. (<xref ref-type="disp-formula" rid="Ch1.E6"/>) is the Jensen–Shannon divergence of <inline-formula><mml:math id="M71" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula> connectivity distance distributions [<inline-formula><mml:math id="M72" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mi mathvariant="normal">…</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>]. <inline-formula><mml:math id="M73" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>  is constructed as <inline-formula><mml:math id="M74" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math id="M75" display="inline"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the fraction of nodes connected to node <inline-formula><mml:math id="M76" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> at distance <inline-formula><mml:math id="M77" display="inline"><mml:mi>j</mml:mi></mml:math></inline-formula>. The Jensen–Shannon divergence of [<inline-formula><mml:math id="M78" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mi mathvariant="normal">…</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>] is expressed as

                  <disp-formula id="Ch1.E7" content-type="numbered"><label>7</label><mml:math id="M79" display="block"><mml:mstyle class="stylechange" displaystyle="true"/><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:mi mathvariant="script">J</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>N</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munder><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mi>log⁡</mml:mi><mml:mfenced open="(" close=")"><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfrac></mml:mstyle></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d1e2399"><inline-formula><mml:math id="M80" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> in Eq. (<xref ref-type="disp-formula" rid="Ch1.E7"/>) is the average of <inline-formula><mml:math id="M81" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula> distributions and can be written as

                  <disp-formula id="Ch1.E8" content-type="numbered"><label>8</label><mml:math id="M82" display="block"><mml:mstyle displaystyle="true" class="stylechange"/><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msub><mml:mi mathvariant="italic">μ</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d1e2466">The third term in Eq. (<xref ref-type="disp-formula" rid="Ch1.E5"/>) is based on probability density functions associated with <inline-formula><mml:math id="M83" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula> centrality of graph <inline-formula><mml:math id="M84" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M85" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula> centrality of the graph complement <inline-formula><mml:math id="M86" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi mathvariant="italic">α</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msup><mml:mi>g</mml:mi><mml:mi>c</mml:mi></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. The value of weights was suggested by <xref ref-type="bibr" rid="bib1.bibx50" id="text.67"/> as <inline-formula><mml:math id="M87" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.45</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M88" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0.1</mml:mn></mml:mrow></mml:math></inline-formula>. We use the implementation provided by <xref ref-type="bibr" rid="bib1.bibx50" id="text.68"/> with these sets of weights to build the distance matrices for all subgraphs within the three regions of interest. We depict in Fig. <xref ref-type="fig" rid="Ch1.F12"/>, for the two example fracture networks, the three properties that are used in computing the D-measure.</p>
</sec>
<sec id="Ch1.S4.SS2.SSS3">
  <label>4.2.3</label><title>Portrait divergence</title>
      <?pagebreak page2169?><p id="d1e2577">The portrait divergence similarity score derives from network portraits introduced by <xref ref-type="bibr" rid="bib1.bibx3" id="text.69"/> for unweighted graphs and extended to weighted graphs by <xref ref-type="bibr" rid="bib1.bibx2" id="text.70"/>. For a graph <inline-formula><mml:math id="M89" display="inline"><mml:mi>g</mml:mi></mml:math></inline-formula> with <inline-formula><mml:math id="M90" display="inline"><mml:mi>N</mml:mi></mml:math></inline-formula> nodes, the network portrait is defined as a matrix <inline-formula><mml:math id="M91" display="inline"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, where each entry is the number of nodes with <inline-formula><mml:math id="M92" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula> nodes at <inline-formula><mml:math id="M93" display="inline"><mml:mi>l</mml:mi></mml:math></inline-formula> distance. The limits of <inline-formula><mml:math id="M94" display="inline"><mml:mi>l</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M95" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula> are <inline-formula><mml:math id="M96" display="inline"><mml:mrow><mml:mn mathvariant="normal">0</mml:mn><mml:mo>≤</mml:mo><mml:mi>l</mml:mi><mml:mo>≤</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M97" display="inline"><mml:mrow><mml:mn mathvariant="normal">0</mml:mn><mml:mo>≤</mml:mo><mml:mi>k</mml:mi><mml:mo>≤</mml:mo><mml:mi>N</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, with <inline-formula><mml:math id="M98" display="inline"><mml:mi>d</mml:mi></mml:math></inline-formula> being the diameter of the graph. The row entries of the network matrix <inline-formula><mml:math id="M99" display="inline"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are probability distributions of a random node having <inline-formula><mml:math id="M100" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula> nodes at a distance <inline-formula><mml:math id="M101" display="inline"><mml:mi>l</mml:mi></mml:math></inline-formula>:

                  <disp-formula id="Ch1.E9" content-type="numbered"><label>9</label><mml:math id="M102" display="block"><mml:mstyle displaystyle="true" class="stylechange"/><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi>N</mml:mi></mml:mfrac></mml:mstyle><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

            For a second graph <inline-formula><mml:math id="M103" display="inline"><mml:mi>h</mml:mi></mml:math></inline-formula>, if the network matrix is <inline-formula><mml:math id="M104" display="inline"><mml:mrow><mml:msubsup><mml:mi>B</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mo>′</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> with a corresponding probability distribution of <inline-formula><mml:math id="M105" display="inline"><mml:mrow><mml:mi>Q</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and diameter <inline-formula><mml:math id="M106" display="inline"><mml:mrow><mml:msup><mml:mi>d</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>, the Kullback–Leibler (KL) divergence between <inline-formula><mml:math id="M107" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M108" display="inline"><mml:mrow><mml:mi>Q</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is expressed as

                  <disp-formula id="Ch1.E10" content-type="numbered"><label>10</label><mml:math id="M109" display="block"><mml:mstyle displaystyle="true" class="stylechange"/><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:mtext>KL</mml:mtext><mml:mo>(</mml:mo><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow><mml:mrow><mml:mo>max⁡</mml:mo><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:munderover><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo><mml:mi>log⁡</mml:mi><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>Q</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

            <?xmltex \hack{\newpage}?>The portrait divergence <inline-formula><mml:math id="M110" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mtext>PD</mml:mtext></mml:msub><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is computed by the Jensen–Shannon divergence between <inline-formula><mml:math id="M111" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M112" display="inline"><mml:mrow><mml:mi>Q</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>:

                  <disp-formula id="Ch1.E11" content-type="numbered"><label>11</label><mml:math id="M113" display="block"><mml:mstyle displaystyle="true" class="stylechange"/><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msub><mml:mi>D</mml:mi><mml:mtext>PD</mml:mtext></mml:msub><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mtext>JSD</mml:mtext><mml:mo>(</mml:mo><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:mi>Q</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

            This can be expressed in terms of Kullback–Leibler divergences and mixture distributions as

                  <disp-formula id="Ch1.E12" content-type="numbered"><label>12</label><mml:math id="M114" display="block"><mml:mstyle class="stylechange" displaystyle="true"/><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msub><mml:mi>D</mml:mi><mml:mtext>PD</mml:mtext></mml:msub><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mn mathvariant="normal">2</mml:mn></mml:mfrac></mml:mstyle><mml:mo>(</mml:mo><mml:mtext>KL</mml:mtext><mml:mo>(</mml:mo><mml:mi>P</mml:mi><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mi>M</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:mtext>KL</mml:mtext><mml:mo>(</mml:mo><mml:mi>Q</mml:mi><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:mi>M</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>

            <?xmltex \hack{\newpage}?><?xmltex \hack{\noindent}?>where the mixture distribution <inline-formula><mml:math id="M115" display="inline"><mml:mi>M</mml:mi></mml:math></inline-formula> of <inline-formula><mml:math id="M116" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M117" display="inline"><mml:mrow><mml:mi>Q</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is given by

                  <disp-formula id="Ch1.E13" content-type="numbered"><label>13</label><mml:math id="M118" display="block"><mml:mstyle class="stylechange" displaystyle="true"/><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:mi>M</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mn mathvariant="normal">1</mml:mn><mml:mn mathvariant="normal">2</mml:mn></mml:mfrac></mml:mstyle><mml:mo>(</mml:mo><mml:mi>P</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:mi>Q</mml:mi><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>|</mml:mo><mml:mi>l</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <?pagebreak page2170?><p id="d1e3254">The portrait divergence measure provides a single value <inline-formula><mml:math id="M119" display="inline"><mml:mrow><mml:mn mathvariant="normal">0</mml:mn><mml:mo>≤</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mtext>PD</mml:mtext></mml:msub><mml:mo>(</mml:mo><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>h</mml:mi><mml:mo>)</mml:mo><mml:mo>≤</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula> for any pair of graphs. <xref ref-type="bibr" rid="bib1.bibx2" id="text.71"/> applied the portrait divergence measure to both synthetic and real-world networks. The code implementation of portrait divergence attached with <xref ref-type="bibr" rid="bib1.bibx2" id="text.72"/> is used to construct the distance matrices for all subgraphs within the three regions of interest. The network portrait or the <inline-formula><mml:math id="M120" display="inline"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> matrix for the example fracture graphs are depicted as heatmaps in Fig. <xref ref-type="fig" rid="Ch1.F13"/>.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F13" specific-use="star"><?xmltex \currentcnt{13}?><?xmltex \def\figurename{Figure}?><label>Figure 13</label><caption><p id="d1e3310">Heatmap representations of network portrait sparse matrices (<inline-formula><mml:math id="M121" display="inline"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>) for the two example fracture graphs.</p></caption>
            <?xmltex \igopts{width=455.244094pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f13.png"/>

          </fig>

</sec>
<sec id="Ch1.S4.SS2.SSS4">
  <label>4.2.4</label><title>Laplacian spectral descriptor</title>
      <p id="d1e3341">The NetLSD distance was introduced by <xref ref-type="bibr" rid="bib1.bibx55" id="text.73"/>. It is based on a Frobenius norm computed between heat trace signatures of normalized Laplacian matrices of two graphs. For a graph <inline-formula><mml:math id="M122" display="inline"><mml:mi>g</mml:mi></mml:math></inline-formula> with a normalized Laplacians <inline-formula><mml:math id="M123" display="inline"><mml:mi>L</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M124" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> nodes, a heat kernel matrix is defined as

                  <disp-formula id="Ch1.E14" content-type="numbered"><label>14</label><mml:math id="M125" display="block"><mml:mstyle class="stylechange" displaystyle="true"/><mml:mrow><mml:mstyle class="stylechange" displaystyle="true"/><mml:msub><mml:mi mathvariant="bold">H</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mi>t</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mi>t</mml:mi><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msup><mml:msub><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:msubsup><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mi>j</mml:mi><mml:mi mathvariant="normal">T</mml:mi></mml:msubsup><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

            Using the heat kernel matrix <inline-formula><mml:math id="M126" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold">H</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, a heat trace <inline-formula><mml:math id="M127" display="inline"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is defined as

                  <disp-formula id="Ch1.E15" content-type="numbered"><label>15</label><mml:math id="M128" display="block"><mml:mstyle class="stylechange" displaystyle="true"/><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msub><mml:mi>h</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mi>t</mml:mi><mml:msub><mml:mi mathvariant="italic">λ</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

            For a second graph <inline-formula><mml:math id="M129" display="inline"><mml:mrow><mml:msup><mml:mi>g</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> with a heat trace signature of <inline-formula><mml:math id="M130" display="inline"><mml:mrow><mml:msubsup><mml:mi>h</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mo>′</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula>, the NetLSD distance <inline-formula><mml:math id="M131" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mtext>LSD</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> is then the Frobenius norm of the two heat signatures as

                  <disp-formula id="Ch1.E16" content-type="numbered"><label>16</label><mml:math id="M132" display="block"><mml:mstyle class="stylechange" displaystyle="true"/><mml:mrow><mml:mstyle displaystyle="true" class="stylechange"/><mml:msub><mml:mi>D</mml:mi><mml:mtext>LSD</mml:mtext></mml:msub><mml:mo>=</mml:mo><mml:mo>|</mml:mo><mml:mo>|</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msubsup><mml:mi>h</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mo>′</mml:mo></mml:msubsup><mml:mo>|</mml:mo><mml:msub><mml:mo>|</mml:mo><mml:mtext>Frobenius</mml:mtext></mml:msub><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p id="d1e3576"><?xmltex \hack{\newpage}?>Figure <xref ref-type="fig" rid="Ch1.F14"/> depicts heat trace signatures computed using the NetLSD Python package implemented by <xref ref-type="bibr" rid="bib1.bibx55" id="text.74"/> for the two example fracture graphs. We use this package to populate the distance matrices associated with subgraphs from each region.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F14"><?xmltex \currentcnt{14}?><?xmltex \def\figurename{Figure}?><label>Figure 14</label><caption><p id="d1e3587">Comparing heat trace signature vectors for the two example fracture graphs computed using NetLSD.</p></caption>
            <?xmltex \igopts{width=213.395669pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f14.png"/>

          </fig>

      <p id="d1e3597">The values of graph similarity computed using the four metrics described by Eqs. (<xref ref-type="disp-formula" rid="Ch1.E4"/>), (<xref ref-type="disp-formula" rid="Ch1.E5"/>), (<xref ref-type="disp-formula" rid="Ch1.E12"/>), and (<xref ref-type="disp-formula" rid="Ch1.E16"/>) for the two example fracture graphs depicted in Fig. <xref ref-type="fig" rid="Ch1.F11"/>c and g are summarized in Table <xref ref-type="table" rid="Ch1.T3"/>.</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T3"><?xmltex \currentcnt{3}?><label>Table 3</label><caption><p id="d1e3616">Summary of graph similarities computed for example fracture networks.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="2">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:thead>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">Graph similarity</oasis:entry>
         <oasis:entry colname="col2">Value</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">Fingerprint distance [<inline-formula><mml:math id="M133" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mtext>FP</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col2">0.1414</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">D-measure [<inline-formula><mml:math id="M134" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mtext>DM</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col2">0.1244</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Portrait divergence [<inline-formula><mml:math id="M135" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mtext>PD</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col2">0.2926</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">NetLSD  [<inline-formula><mml:math id="M136" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mtext>LSD</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col2">0.0147</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

<?xmltex \hack{\newpage}?>
</sec>
</sec>
<?pagebreak page2171?><sec id="Ch1.S4.SS3">
  <label>4.3</label><title>Hierarchical clustering</title>
      <p id="d1e3734"><?xmltex \igopts{width=236.157874pt}?><inline-graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-g01.png"/><?xmltex \hack{\newline}?></p>
      <p id="d1e3741"><?xmltex \hack{\noindent}?>After subsampling the fracture networks (see
Sect. <xref ref-type="sec" rid="Ch1.S4.SS1"/>) and using the graph distance metrics described
in Sect. <xref ref-type="sec" rid="Ch1.S4.SS2"/> to construct distance matrices, we apply
hierarchical clustering. HC can be done in an agglomerative versus divisive
manner <xref ref-type="bibr" rid="bib1.bibx26" id="paren.75"/>. We utilize the agglomerative approach, which
generally follows the steps described in Algorithm 1. Based on how linking of
clusters is done as per Algorithm 1(iii), HC can be classified into methods such as single linkage, complete linkage, unweighted pair-group average, weighted pair-group average, unweighted pair-group centroid, weighted pair-group centroid, and Ward's method <xref ref-type="bibr" rid="bib1.bibx65" id="paren.76"/>. Ward's method performs the linkage by minimizing the sum of squares of distances between objects and cluster centres. We use Ward's method implemented within the R statistical programming environment to apply the HC to all the subgraph distance data.</p>
</sec>
</sec>
<sec id="Ch1.S5">
  <label>5</label><title>Results</title>
      <p id="d1e3765">We first show region-wise results of graph property computations. Intra-region spatial clustering resulting from the combined application of graph similarity measures with HC is then discussed. We use the following abbreviations for brevity throughout the section: FP – fingerprint distance, DM  –  D-measure, LSD  –  NetLSD, PD  –  portrait divergence.</p>
<sec id="Ch1.S5.SS1">
  <label>5.1</label><title>Region-wise graph characteristics</title>
      <?pagebreak page2172?><p id="d1e3775">Fingerprints pertaining to the regions are depicted in Fig. <xref ref-type="fig" rid="Ch1.F15"/>a. The peak of the fingerprint plot is highest at a shape factor of 0.4 for Region 1 and increases to above 0.5 for Regions 2 and 3. Histograms in Fig. <xref ref-type="fig" rid="Ch1.F15"/>a depict the number of polygons within each area bin pertaining to fracture networks in each region. The network portraits or <inline-formula><mml:math id="M137" display="inline"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> matrices of each subgraph within the three regions are combined to create ensemble region-wise network portraits depicted as heatmaps in Fig. <xref ref-type="fig" rid="Ch1.F15"/>b. The non-zero entries in the <inline-formula><mml:math id="M138" display="inline"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> matrices, indicated by warmer colours in the heatmaps, have visibly different patterns. Heat traces for the subgraphs in each region are shown in Fig. <xref ref-type="fig" rid="Ch1.F15"/>c. Figure <xref ref-type="fig" rid="Ch1.F16"/> depicts the variation of the network properties that are components of the D-measure distance, i.e. <inline-formula><mml:math id="M139" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula> centrality, NND, and <inline-formula><mml:math id="M140" display="inline"><mml:mi mathvariant="italic">μ</mml:mi></mml:math></inline-formula> for subgraphs for the three regions.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F15" specific-use="star"><?xmltex \currentcnt{15}?><?xmltex \def\figurename{Figure}?><label>Figure 15</label><caption><p id="d1e3833">Region-wise graph properties: <bold>(a)</bold> fingerprints, <bold>(b)</bold> network portrait ensembles, and <bold>(c)</bold> heat trace vectors.</p></caption>
          <?xmltex \igopts{width=455.244094pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f15.png"/>

        </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F16" specific-use="star"><?xmltex \currentcnt{16}?><?xmltex \def\figurename{Figure}?><label>Figure 16</label><caption><p id="d1e3853">Region-wise properties used to compute the D-measure represented as ensemble plots of <inline-formula><mml:math id="M141" display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula> centrality, network node dispersion (NND), and node distance (<inline-formula><mml:math id="M142" display="inline"><mml:mi mathvariant="italic">μ</mml:mi></mml:math></inline-formula>) distributions for subgraphs.</p></caption>
          <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f16.png"/>

        </fig>

</sec>
<sec id="Ch1.S5.SS2">
  <label>5.2</label><title>Intra-region spatial variation</title>
      <p id="d1e3884">Intra-region spatial variation results can be presented as distance matrix heatmaps corresponding to each graph similarity metric. Dendrograms depict the hierarchical organization of the subgraphs corresponding to similarity entries within the distance matrix entries. The intra-regional variation is more intuitively illustrated spatially by showing subgraphs using an appropriate colour scheme that groups similar clusters under colours picked within a linear spectrum. This section presents
the clustering results for all three regions using a combination of dendrograms, spatial cluster maps, and heatmaps.</p>
<sec id="Ch1.S5.SS2.SSS1">
  <label>5.2.1</label><title>Analysis of spatial variation in Region 1</title>
      <p id="d1e3894">The spatial distribution of clusters pertaining to the four distance metrics overlain over the network is shown in Fig. <xref ref-type="fig" rid="Ch1.F17"/>a–d along with the associated dendrograms for the top 10 clusters. The subgraphs are represented by coloured discs that follow a diverging colour scheme. The number of subgraphs within each of the top 10 clusters is also listed under the dendrogram branches. It may be noted that the top 10 clusters are shown to depict, analyse, and compare the spatial variation across distance measures. A complete, uncut dendrogram and associated heatmaps of the similarity measures are depicted in Fig. <xref ref-type="fig" rid="App1.Ch1.S1.F23"/> in the Appendix. We can cut the dendrogram at different heights guided by slope changes in the weighted sum of squares plots shown in Fig. <xref ref-type="fig" rid="App1.Ch1.S1.F23"/>. The boundaries of spatial clusters vary with the dendrogram cut height, with subregions emerging by traversing deeper into the dendrogram. This variation is depicted in Figs. <xref ref-type="fig" rid="App1.Ch1.S2.F26"/>–<xref ref-type="fig" rid="App1.Ch1.S2.F29"/> in the Appendix for a range of clusters varying from 5–10. The number of subsamples for the four similarity measures pertaining to a dendrogram cut of <inline-formula><mml:math id="M143" display="inline"><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula> is tabulated in Table <xref ref-type="table" rid="Ch1.T4"/>.</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T4" specific-use="star"><?xmltex \currentcnt{4}?><label>Table 4</label><caption><p id="d1e3925">Summary of subgraphs within each cluster of Region 1 for <inline-formula><mml:math id="M144" display="inline"><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula>.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="11">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:colspec colnum="5" colname="col5" align="right"/>
     <oasis:colspec colnum="6" colname="col6" align="right"/>
     <oasis:colspec colnum="7" colname="col7" align="right"/>
     <oasis:colspec colnum="8" colname="col8" align="right"/>
     <oasis:colspec colnum="9" colname="col9" align="right"/>
     <oasis:colspec colnum="10" colname="col10" align="right"/>
     <oasis:colspec colnum="11" colname="col11" align="right"/>
     <oasis:thead>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">Metric <inline-formula><mml:math id="M145" display="inline"><mml:mo>↓</mml:mo></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">Cluster 1</oasis:entry>
         <oasis:entry colname="col3">Cluster 2</oasis:entry>
         <oasis:entry colname="col4">Cluster 3</oasis:entry>
         <oasis:entry colname="col5">Cluster 4</oasis:entry>
         <oasis:entry colname="col6">Cluster 5</oasis:entry>
         <oasis:entry colname="col7">Cluster 6</oasis:entry>
         <oasis:entry colname="col8">Cluster 7</oasis:entry>
         <oasis:entry colname="col9">Cluster 8</oasis:entry>
         <oasis:entry colname="col10">Cluster 9</oasis:entry>
         <oasis:entry colname="col11">Cluster 10</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">FP</oasis:entry>
         <oasis:entry colname="col2">3</oasis:entry>
         <oasis:entry colname="col3">36</oasis:entry>
         <oasis:entry colname="col4">24</oasis:entry>
         <oasis:entry colname="col5">47</oasis:entry>
         <oasis:entry colname="col6">2</oasis:entry>
         <oasis:entry colname="col7">24</oasis:entry>
         <oasis:entry colname="col8">41</oasis:entry>
         <oasis:entry colname="col9">16</oasis:entry>
         <oasis:entry colname="col10">20</oasis:entry>
         <oasis:entry colname="col11">6</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">DM</oasis:entry>
         <oasis:entry colname="col2">24</oasis:entry>
         <oasis:entry colname="col3">25</oasis:entry>
         <oasis:entry colname="col4">5</oasis:entry>
         <oasis:entry colname="col5">15</oasis:entry>
         <oasis:entry colname="col6">17</oasis:entry>
         <oasis:entry colname="col7">19</oasis:entry>
         <oasis:entry colname="col8">40</oasis:entry>
         <oasis:entry colname="col9">39</oasis:entry>
         <oasis:entry colname="col10">10</oasis:entry>
         <oasis:entry colname="col11">25</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">LSD</oasis:entry>
         <oasis:entry colname="col2">12</oasis:entry>
         <oasis:entry colname="col3">17</oasis:entry>
         <oasis:entry colname="col4">21</oasis:entry>
         <oasis:entry colname="col5">23</oasis:entry>
         <oasis:entry colname="col6">16</oasis:entry>
         <oasis:entry colname="col7">28</oasis:entry>
         <oasis:entry colname="col8">11</oasis:entry>
         <oasis:entry colname="col9">30</oasis:entry>
         <oasis:entry colname="col10">13</oasis:entry>
         <oasis:entry colname="col11">48</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">PD</oasis:entry>
         <oasis:entry colname="col2">38</oasis:entry>
         <oasis:entry colname="col3">17</oasis:entry>
         <oasis:entry colname="col4">3</oasis:entry>
         <oasis:entry colname="col5">5</oasis:entry>
         <oasis:entry colname="col6">24</oasis:entry>
         <oasis:entry colname="col7">25</oasis:entry>
         <oasis:entry colname="col8">79</oasis:entry>
         <oasis:entry colname="col9">13</oasis:entry>
         <oasis:entry colname="col10">6</oasis:entry>
         <oasis:entry colname="col11">9</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Total</oasis:entry>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6">219</oasis:entry>
         <oasis:entry colname="col7"/>
         <oasis:entry colname="col8"/>
         <oasis:entry colname="col9"/>
         <oasis:entry colname="col10"/>
         <oasis:entry colname="col11"/>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d1e4194">We can observe that spatial autocorrelation exists for the FP (Fig. <xref ref-type="fig" rid="Ch1.F17"/>a), DM (Fig. <xref ref-type="fig" rid="Ch1.F17"/>b), and PD (Fig. <xref ref-type="fig" rid="Ch1.F17"/>d) similarity measures. The LSD yields a speckled pattern with no obvious spatial autocorrelation (Fig. <xref ref-type="fig" rid="Ch1.F17"/>c). In order to compare clustering results derived from the graph similarity measures, the spatial fracture persistence <inline-formula><mml:math id="M146" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">20</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M147" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">21</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> computed using box counting (box size of <inline-formula><mml:math id="M148" display="inline"><mml:mrow><mml:mn mathvariant="normal">0.5</mml:mn><mml:mo>×</mml:mo><mml:mn mathvariant="normal">0.5</mml:mn></mml:mrow></mml:math></inline-formula> <inline-formula><mml:math id="M149" display="inline"><mml:mrow class="unit"><mml:mi mathvariant="normal">m</mml:mi></mml:mrow></mml:math></inline-formula>) is depicted in Fig. <xref ref-type="fig" rid="Ch1.F17"/>e and f, respectively. Comparing clusters derived from graph
similarity measures to the fracture persistence plots reveals boundaries within the network that are not easily discernable from the latter. Since LSD does not show spatial autocorrelation, we do not analyse it further.</p>
      <p id="d1e4251">Figure <xref ref-type="fig" rid="Ch1.F18"/>a–c depict topology histograms and rose plots of the clusters pertaining to the remaining three similarity measures. The orientation rose plots and topological summaries are generated by combining all circular samples identified under a cluster into 10 cluster subgraphs from the larger region fracture graph. It can be observed from the rose plots that the clusters have varying fracture orientations that transitions across the hierarchy identified by the dendrograms. The topological summaries of the clusters do not vary significantly. Figures <xref ref-type="fig" rid="App1.Ch1.S3.F38"/>–<xref ref-type="fig" rid="App1.Ch1.S3.F40"/> in the Appendix depict zoomed-in subgraphs corresponding to each of the top 10 clusters that visually confirm the intra-regional variation.</p>
      <p id="d1e4260">We briefly describe the characteristics of the clustering results prefixing “<inline-formula><mml:math id="M150" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula>” to the number of subsamples within a cluster to refer to a particular cluster at a <inline-formula><mml:math id="M151" display="inline"><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula> dendrogram cut. From Fig. <xref ref-type="fig" rid="Ch1.F17"/>a and the zoomed-in archetypal examples in Fig. <xref ref-type="fig" rid="App1.Ch1.S3.F38"/>, the clustering derived from FP seems to have a N–S variation trend. The trend is corroborated by observing the dendrogram, which splits into a northern branch comprising of clusters <inline-formula><mml:math id="M152" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">36</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M153" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">24</mml:mn><mml:mi>b</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M154" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">47</mml:mn></mml:mrow></mml:math></inline-formula> and a southern branch with clusters <inline-formula><mml:math id="M155" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M156" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">20</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M157" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">41</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M158" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">16</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M159" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M160" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">24</mml:mn><mml:mi>a</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>. An outlier branch <inline-formula><mml:math id="M161" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:math></inline-formula> exists at the boundary between northern and southern branches.</p>
      <p id="d1e4394">A similar variation is observable from the result of DM (see Fig. <xref ref-type="fig" rid="Ch1.F17"/>b). However, the cluster demarcations are less stark than with FP with a notable stippled pattern. A major dendrogram division is a branch consisting of a thin sliver in the NE (clusters <inline-formula><mml:math id="M162" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">24</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M163" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">25</mml:mn><mml:mi>b</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M164" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M165" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">15</mml:mn></mml:mrow></mml:math></inline-formula>) which also include some boundary periphery samplings in the west and south of Region 1. The southwestern sliver is mainly contained in a branch containing cluster <inline-formula><mml:math id="M166" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">17</mml:mn></mml:mrow></mml:math></inline-formula>. The central parts of Region 1 fall under the dendrogram branch containing clusters <inline-formula><mml:math id="M167" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">39</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M168" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M169" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">25</mml:mn><mml:mi>a</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>. The remainder of the Region 1 is covered by branch containing clusters <inline-formula><mml:math id="M170" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">19</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M171" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">40</mml:mn></mml:mrow></mml:math></inline-formula>. Figure <xref ref-type="fig" rid="App1.Ch1.S3.F39"/> depicts archetypal examples of subgraphs relevant to each cluster for DM.</p>
      <p id="d1e4509">The results of PD also depict N–S variation (see Fig. <xref ref-type="fig" rid="Ch1.F17"/>d) in the clustering. Similar to DM, PD is also sensitive to the subgraph completeness with peripheral clusters represented under <inline-formula><mml:math id="M172" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">13</mml:mn></mml:mrow></mml:math></inline-formula>. The branches comprising <inline-formula><mml:math id="M173" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">13</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M174" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M175" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">9</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M176" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">38</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M177" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">17</mml:mn></mml:mrow></mml:math></inline-formula> closely correspond to the trend of high fracture persistence (compare with Fig. <xref ref-type="fig" rid="Ch1.F17"/>e and f). Similar to results from FP and DM, the thin sliver in the NE of Region 1 is captured under the branch with clusters <inline-formula><mml:math id="M178" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M179" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M180" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">24</mml:mn></mml:mrow></mml:math></inline-formula>. The remainder of Region 1 falls under clusters <inline-formula><mml:math id="M181" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">25</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M182" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">79</mml:mn></mml:mrow></mml:math></inline-formula>. Figure <xref ref-type="fig" rid="App1.Ch1.S3.F40"/> depicts archetypal examples of subgraphs corresponding to each cluster for PD.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F17" specific-use="star"><?xmltex \currentcnt{17}?><?xmltex \def\figurename{Figure}?><label>Figure 17</label><caption><p id="d1e4632">Hierarchical clustering results for Region 1 depicting the top 10 clusters using <bold>(a)</bold> fingerprint distance, <bold>(b)</bold> D-measure distance, <bold>(c)</bold> NetLSD distance, <bold>(d)</bold> portrait divergence distance, <bold>(e)</bold> spatial <inline-formula><mml:math id="M183" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">20</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, and <bold>(f)</bold> spatial <inline-formula><mml:math id="M184" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">21</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>.</p></caption>
            <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f17.png"/>

          </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F18" specific-use="star"><?xmltex \currentcnt{18}?><?xmltex \def\figurename{Figure}?><label>Figure 18</label><caption><p id="d1e4685">Variation in fracture orientations and topological summary for Region 1 corresponding to <bold>(a)</bold> fingerprint distance, <bold>(b)</bold> D-measure, and <bold>(c)</bold> portrait divergence.</p></caption>
            <?xmltex \igopts{width=497.923228pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f18.png"/>

          </fig>

</sec>
<sec id="Ch1.S5.SS2.SSS2">
  <label>5.2.2</label><title>Analysis of spatial variation in Region 2</title>
      <?pagebreak page2174?><p id="d1e4711">Spatial distribution along with dendrograms of top 10 clusters pertaining to the four graph similarity measures for Region 2 is depicted in Fig. <xref ref-type="fig" rid="Ch1.F19"/>. The full dendrograms and heatmaps are placed in Fig. <xref ref-type="fig" rid="App1.Ch1.S1.F24"/> in the Appendix. The variation of spatial clusters with different choices of dendrogram cut heights is shown in Figs. <xref ref-type="fig" rid="App1.Ch1.S2.F30"/>–<xref ref-type="fig" rid="App1.Ch1.S2.F33"/> in the Appendix. The number of subsamples for the four similarity measures pertaining to a dendrogram cut of <inline-formula><mml:math id="M185" display="inline"><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula> is tabulated in Table <xref ref-type="table" rid="Ch1.T5"/>. Similar to Region 1, there is marked spatial autocorrelation with FP (Fig. <xref ref-type="fig" rid="Ch1.F19"/>a), DM (Fig. <xref ref-type="fig" rid="Ch1.F19"/>b), and PD (Fig. <xref ref-type="fig" rid="Ch1.F19"/>d), whereas the LSD (Fig. <xref ref-type="fig" rid="Ch1.F19"/>c) shows a speckled pattern. The spatial clustering results can be compared with the fracture persistence plots in Fig. <xref ref-type="fig" rid="Ch1.F19"/>e and f.</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T5" specific-use="star"><?xmltex \currentcnt{5}?><label>Table 5</label><caption><p id="d1e4750">Summary of subgraphs within each cluster of Region 2 for <inline-formula><mml:math id="M186" display="inline"><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula>.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="11">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:colspec colnum="5" colname="col5" align="right"/>
     <oasis:colspec colnum="6" colname="col6" align="right"/>
     <oasis:colspec colnum="7" colname="col7" align="right"/>
     <oasis:colspec colnum="8" colname="col8" align="right"/>
     <oasis:colspec colnum="9" colname="col9" align="right"/>
     <oasis:colspec colnum="10" colname="col10" align="right"/>
     <oasis:colspec colnum="11" colname="col11" align="right"/>
     <oasis:thead>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">Metric <inline-formula><mml:math id="M187" display="inline"><mml:mo>↓</mml:mo></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">Cluster 1</oasis:entry>
         <oasis:entry colname="col3">Cluster 2</oasis:entry>
         <oasis:entry colname="col4">Cluster 3</oasis:entry>
         <oasis:entry colname="col5">Cluster 4</oasis:entry>
         <oasis:entry colname="col6">Cluster 5</oasis:entry>
         <oasis:entry colname="col7">Cluster 6</oasis:entry>
         <oasis:entry colname="col8">Cluster 7</oasis:entry>
         <oasis:entry colname="col9">Cluster 8</oasis:entry>
         <oasis:entry colname="col10">Cluster 9</oasis:entry>
         <oasis:entry colname="col11">Cluster 10</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">FP</oasis:entry>
         <oasis:entry colname="col2">20</oasis:entry>
         <oasis:entry colname="col3">22</oasis:entry>
         <oasis:entry colname="col4">41</oasis:entry>
         <oasis:entry colname="col5">52</oasis:entry>
         <oasis:entry colname="col6">9</oasis:entry>
         <oasis:entry colname="col7">17</oasis:entry>
         <oasis:entry colname="col8">36</oasis:entry>
         <oasis:entry colname="col9">8</oasis:entry>
         <oasis:entry colname="col10">3</oasis:entry>
         <oasis:entry colname="col11">4</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">DM</oasis:entry>
         <oasis:entry colname="col2">19</oasis:entry>
         <oasis:entry colname="col3">20</oasis:entry>
         <oasis:entry colname="col4">14</oasis:entry>
         <oasis:entry colname="col5">25</oasis:entry>
         <oasis:entry colname="col6">10</oasis:entry>
         <oasis:entry colname="col7">16</oasis:entry>
         <oasis:entry colname="col8">23</oasis:entry>
         <oasis:entry colname="col9">38</oasis:entry>
         <oasis:entry colname="col10">23</oasis:entry>
         <oasis:entry colname="col11">24</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">LSD</oasis:entry>
         <oasis:entry colname="col2">2</oasis:entry>
         <oasis:entry colname="col3">6</oasis:entry>
         <oasis:entry colname="col4">31</oasis:entry>
         <oasis:entry colname="col5">28</oasis:entry>
         <oasis:entry colname="col6">53</oasis:entry>
         <oasis:entry colname="col7">9</oasis:entry>
         <oasis:entry colname="col8">15</oasis:entry>
         <oasis:entry colname="col9">38</oasis:entry>
         <oasis:entry colname="col10">5</oasis:entry>
         <oasis:entry colname="col11">25</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">PD</oasis:entry>
         <oasis:entry colname="col2">17</oasis:entry>
         <oasis:entry colname="col3">30</oasis:entry>
         <oasis:entry colname="col4">17</oasis:entry>
         <oasis:entry colname="col5">8</oasis:entry>
         <oasis:entry colname="col6">24</oasis:entry>
         <oasis:entry colname="col7">15</oasis:entry>
         <oasis:entry colname="col8">28</oasis:entry>
         <oasis:entry colname="col9">24</oasis:entry>
         <oasis:entry colname="col10">15</oasis:entry>
         <oasis:entry colname="col11">34</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Total</oasis:entry>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6">212</oasis:entry>
         <oasis:entry colname="col7"/>
         <oasis:entry colname="col8"/>
         <oasis:entry colname="col9"/>
         <oasis:entry colname="col10"/>
         <oasis:entry colname="col11"/>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d1e5019">Node degree histograms and rose plots depict the differences in network topology and fracture orientations between the identified clusters pertaining to FP (Fig. <xref ref-type="fig" rid="Ch1.F20"/>a), DM (Fig. <xref ref-type="fig" rid="Ch1.F20"/>b), and PD (Fig. <xref ref-type="fig" rid="Ch1.F20"/>c). For all three measures, the shape of rose plots indicates a transition of principal orientations smoothly across clusters. For example, in Fig. <xref ref-type="fig" rid="Ch1.F20"/>a for FP, the more complex fracturing in the west of Region 2 is depicted by cluster <inline-formula><mml:math id="M188" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">20</mml:mn></mml:mrow></mml:math></inline-formula> with a very diffuse rose plot, changing orientations to a predominantly orthogonal pattern in cluster <inline-formula><mml:math id="M189" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">03</mml:mn></mml:mrow></mml:math></inline-formula>. The DM (clusters <inline-formula><mml:math id="M190" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">16</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M191" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula> in Fig. <xref ref-type="fig" rid="Ch1.F20"/>b) and PD (clusters <inline-formula><mml:math id="M192" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">08</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M193" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">17</mml:mn><mml:mi>b</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> in Fig. <xref ref-type="fig" rid="Ch1.F20"/>c) also identify this region of orthogonal fracturing. The corresponding topological summaries also depict an increased proportion of degree-4 nodes as compared to the histograms of other clusters.</p>
      <p id="d1e5100">From FP clustering results (see Fig. <xref ref-type="fig" rid="Ch1.F19"/>a), the dendrogram identifies a western branch with clusters <inline-formula><mml:math id="M194" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">20</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M195" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">22</mml:mn></mml:mrow></mml:math></inline-formula>. The branch comprising of clusters <inline-formula><mml:math id="M196" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">8</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M197" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M198" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:math></inline-formula> correspond to the radial fracturing region identified by <xref ref-type="bibr" rid="bib1.bibx23" id="text.77"/> that originates from the fault in the SE of Region 2. Clusters <inline-formula><mml:math id="M199" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">9</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M200" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">17</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M201" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">36</mml:mn></mml:mrow></mml:math></inline-formula> all under a branch covering parts of Region 2 further away from the radial fracturing region. Clusters <inline-formula><mml:math id="M202" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">41</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M203" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">52</mml:mn></mml:mrow></mml:math></inline-formula> originate under a branch forming the northern and eastern boundaries of Region 2. Figure <xref ref-type="fig" rid="App1.Ch1.S3.F41"/> depicts archetypal subgraphs under each cluster in detail for FP. The clustering results of DM (Fig. <xref ref-type="fig" rid="Ch1.F19"/>b) and PD (Fig. <xref ref-type="fig" rid="Ch1.F19"/>d)<?pagebreak page2175?> appear to be similar and with dendrograms roughly splitting into three main branches that correspond to specific portions of Region 1. First is the radial fracturing area represented by branch-forming clusters <inline-formula><mml:math id="M204" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M205" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">16</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M206" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">23</mml:mn><mml:mi>b</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> for D-measure (Fig. <xref ref-type="fig" rid="Ch1.F19"/>b) and branch-forming clusters <inline-formula><mml:math id="M207" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">17</mml:mn><mml:mi>b</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M208" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">8</mml:mn></mml:mrow></mml:math></inline-formula> for the portrait divergence (Fig. <xref ref-type="fig" rid="Ch1.F19"/>d). The area to the NW periphery of Region 2, farthest away from the fault, is represented by branch-forming clusters <inline-formula><mml:math id="M209" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">19</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M210" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">20</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M211" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">14</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M212" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">25</mml:mn></mml:mrow></mml:math></inline-formula> for DM and by branch-forming clusters <inline-formula><mml:math id="M213" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">24</mml:mn><mml:mi>a</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M214" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">15</mml:mn><mml:mi>a</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M215" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">34</mml:mn></mml:mrow></mml:math></inline-formula> for PD. The transition region branch is represented within the DM dendrogram by clusters <inline-formula><mml:math id="M216" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">38</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M217" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">23</mml:mn><mml:mi>a</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M218" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">24</mml:mn></mml:mrow></mml:math></inline-formula> and within the PD dendrogram by clusters <inline-formula><mml:math id="M219" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">24</mml:mn><mml:mi>b</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M220" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">15</mml:mn><mml:mi>b</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M221" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">28</mml:mn></mml:mrow></mml:math></inline-formula>. Figures <xref ref-type="fig" rid="App1.Ch1.S3.F42"/> and <xref ref-type="fig" rid="App1.Ch1.S3.F43"/> depict detailed subgraph examples for DM and PD, respectively.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F19" specific-use="star"><?xmltex \currentcnt{19}?><?xmltex \def\figurename{Figure}?><label>Figure 19</label><caption><p id="d1e5431">Hierarchical clustering results for Region 2 depicting the top 10 clusters using <bold>(a)</bold> fingerprint distance, <bold>(b)</bold> D-measure distance, <bold>(c)</bold> NetLSD distance, <bold>(d)</bold> portrait divergence distance, <bold>(e)</bold> spatial <inline-formula><mml:math id="M222" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">20</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, and <bold>(f)</bold> spatial <inline-formula><mml:math id="M223" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">21</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>.</p></caption>
            <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f19.png"/>

          </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F20" specific-use="star"><?xmltex \currentcnt{20}?><?xmltex \def\figurename{Figure}?><label>Figure 20</label><caption><p id="d1e5483">Variation in fracture orientations and topological summary for Region 2 corresponding to <bold>(a)</bold> fingerprint distance, <bold>(b)</bold> D-measure, and <bold>(c)</bold> portrait divergence.</p></caption>
            <?xmltex \igopts{width=455.244094pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f20.png"/>

          </fig>

</sec>
<?pagebreak page2176?><sec id="Ch1.S5.SS2.SSS3">
  <label>5.2.3</label><title>Analysis of spatial variation in Region 3</title>
      <p id="d1e5509">The spatial distribution along with dendrograms of the top 10 clusters pertaining to the four graph similarity measures for Region 3 is depicted in Fig. <xref ref-type="fig" rid="Ch1.F21"/>. The full dendrograms and heatmaps are placed in Fig. <xref ref-type="fig" rid="App1.Ch1.S1.F25"/> in the Appendix. The variation of spatial clusters with different choices of dendrogram cut heights (and number of clusters) is shown in Figs. <xref ref-type="fig" rid="App1.Ch1.S2.F34"/>–<xref ref-type="fig" rid="App1.Ch1.S2.F37"/> in the Appendix. Similar to the Region 1 and 2 results, there is marked spatial autocorrelation with FP (Fig. <xref ref-type="fig" rid="Ch1.F21"/>a), DM (Fig. <xref ref-type="fig" rid="Ch1.F21"/>b), and PD (Fig. <xref ref-type="fig" rid="Ch1.F21"/>d), whereas the LSD (Fig. <xref ref-type="fig" rid="Ch1.F21"/>c) shows a stippled pattern. The spatial<?pagebreak page2177?> clustering results can be compared with the fracture persistence plots in Fig. <xref ref-type="fig" rid="Ch1.F21"/>e and f. The number of subsamples for the four similarity measures associated with a dendrogram cut of <inline-formula><mml:math id="M224" display="inline"><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula> is tabulated in Table <xref ref-type="table" rid="Ch1.T6"/>.</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T6" specific-use="star"><?xmltex \currentcnt{6}?><label>Table 6</label><caption><p id="d1e5548">Summary of subgraphs within each cluster of Region 3 for <inline-formula><mml:math id="M225" display="inline"><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">10</mml:mn></mml:mrow></mml:math></inline-formula>.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="11">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:colspec colnum="5" colname="col5" align="right"/>
     <oasis:colspec colnum="6" colname="col6" align="right"/>
     <oasis:colspec colnum="7" colname="col7" align="right"/>
     <oasis:colspec colnum="8" colname="col8" align="right"/>
     <oasis:colspec colnum="9" colname="col9" align="right"/>
     <oasis:colspec colnum="10" colname="col10" align="right"/>
     <oasis:colspec colnum="11" colname="col11" align="right"/>
     <oasis:thead>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">Metric <inline-formula><mml:math id="M226" display="inline"><mml:mo>↓</mml:mo></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2">Cluster 1</oasis:entry>
         <oasis:entry colname="col3">Cluster 2</oasis:entry>
         <oasis:entry colname="col4">Cluster 3</oasis:entry>
         <oasis:entry colname="col5">Cluster 4</oasis:entry>
         <oasis:entry colname="col6">Cluster 5</oasis:entry>
         <oasis:entry colname="col7">Cluster 6</oasis:entry>
         <oasis:entry colname="col8">Cluster 7</oasis:entry>
         <oasis:entry colname="col9">Cluster 8</oasis:entry>
         <oasis:entry colname="col10">Cluster 9</oasis:entry>
         <oasis:entry colname="col11">Cluster 10</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">FP</oasis:entry>
         <oasis:entry colname="col2">2</oasis:entry>
         <oasis:entry colname="col3">5</oasis:entry>
         <oasis:entry colname="col4">28</oasis:entry>
         <oasis:entry colname="col5">11</oasis:entry>
         <oasis:entry colname="col6">27</oasis:entry>
         <oasis:entry colname="col7">6</oasis:entry>
         <oasis:entry colname="col8">9</oasis:entry>
         <oasis:entry colname="col9">4</oasis:entry>
         <oasis:entry colname="col10">11</oasis:entry>
         <oasis:entry colname="col11">14</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">DM</oasis:entry>
         <oasis:entry colname="col2">24</oasis:entry>
         <oasis:entry colname="col3">15</oasis:entry>
         <oasis:entry colname="col4">6</oasis:entry>
         <oasis:entry colname="col5">16</oasis:entry>
         <oasis:entry colname="col6">1</oasis:entry>
         <oasis:entry colname="col7">5</oasis:entry>
         <oasis:entry colname="col8">5</oasis:entry>
         <oasis:entry colname="col9">25</oasis:entry>
         <oasis:entry colname="col10">3</oasis:entry>
         <oasis:entry colname="col11">17</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">LSD</oasis:entry>
         <oasis:entry colname="col2">9</oasis:entry>
         <oasis:entry colname="col3">25</oasis:entry>
         <oasis:entry colname="col4">4</oasis:entry>
         <oasis:entry colname="col5">9</oasis:entry>
         <oasis:entry colname="col6">6</oasis:entry>
         <oasis:entry colname="col7">5</oasis:entry>
         <oasis:entry colname="col8">5</oasis:entry>
         <oasis:entry colname="col9">10</oasis:entry>
         <oasis:entry colname="col10">16</oasis:entry>
         <oasis:entry colname="col11">28</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">PD</oasis:entry>
         <oasis:entry colname="col2">7</oasis:entry>
         <oasis:entry colname="col3">23</oasis:entry>
         <oasis:entry colname="col4">25</oasis:entry>
         <oasis:entry colname="col5">1</oasis:entry>
         <oasis:entry colname="col6">5</oasis:entry>
         <oasis:entry colname="col7">21</oasis:entry>
         <oasis:entry colname="col8">4</oasis:entry>
         <oasis:entry colname="col9">16</oasis:entry>
         <oasis:entry colname="col10">3</oasis:entry>
         <oasis:entry colname="col11">12</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Total</oasis:entry>
         <oasis:entry colname="col2"/>
         <oasis:entry colname="col3"/>
         <oasis:entry colname="col4"/>
         <oasis:entry colname="col5"/>
         <oasis:entry colname="col6">117</oasis:entry>
         <oasis:entry colname="col7"/>
         <oasis:entry colname="col8"/>
         <oasis:entry colname="col9"/>
         <oasis:entry colname="col10"/>
         <oasis:entry colname="col11"/>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d1e5817">Node degree histograms and rose plots depict the differences in network topology and fracture orientations between the identified clusters relating to FP (Fig. <xref ref-type="fig" rid="Ch1.F22"/>a), DM (Fig. <xref ref-type="fig" rid="Ch1.F22"/>b), and PD (Fig. <xref ref-type="fig" rid="Ch1.F22"/>c). For all three measures, the shape of rose plots indicates a transition of principal orientations smoothly across clusters. For example, in Fig. <xref ref-type="fig" rid="Ch1.F22"/>a for the fingerprint measure, the cluster <inline-formula><mml:math id="M227" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">06</mml:mn></mml:mrow></mml:math></inline-formula> in the west of Region 3 has three main sets that become orthogonal in cluster <inline-formula><mml:math id="M228" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">09</mml:mn></mml:mrow></mml:math></inline-formula>, the nearest cluster eastwards. Cluster <inline-formula><mml:math id="M229" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">05</mml:mn></mml:mrow></mml:math></inline-formula> at the eastern extremity of Region 3 has an orthogonal pattern that has rotated almost 80<inline-formula><mml:math id="M230" display="inline"><mml:mrow class="unit"><mml:msup><mml:mi/><mml:mo>∘</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> clockwise compared to the western boundary. Orientations of fractures clusters between the eastern-most and western-most clusters show transitions between the extremal archetypes.</p>
      <?pagebreak page2179?><p id="d1e5870">From the FP clustering results (Fig. <xref ref-type="fig" rid="Ch1.F21"/>a), the spatial variation appears to have an E–W trend. From the dendrogram, an eastern branch comprising clusters <inline-formula><mml:math id="M231" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M232" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">9</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M233" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M234" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">11</mml:mn><mml:mi>a</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M235" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">14</mml:mn></mml:mrow></mml:math></inline-formula> and a western branch consisting of clusters <inline-formula><mml:math id="M236" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M237" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">28</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M238" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">11</mml:mn><mml:mi>b</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M239" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">27</mml:mn></mml:mrow></mml:math></inline-formula> can be identified. An outlier branch with cluster <inline-formula><mml:math id="M240" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:math></inline-formula> appears at the interface between the eastern and western branches. Detailed visualization of archetypal subgraphs relating to each of the FP clusters is presented in Fig. <xref ref-type="fig" rid="App1.Ch1.S3.F44"/>. The dendrogram structure and spatial clustering for the DM (Fig. <xref ref-type="fig" rid="Ch1.F21"/>b) depicts a central region represented by a branch containing clusters <inline-formula><mml:math id="M241" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">24</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M242" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">15</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M243" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M244" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">16</mml:mn></mml:mrow></mml:math></inline-formula>. The eastern and western peripheries organize as clusters <inline-formula><mml:math id="M245" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M246" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">5</mml:mn><mml:mi>a</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M247" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">5</mml:mn><mml:mi>b</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M248" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">25</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M249" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M250" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">17</mml:mn></mml:mrow></mml:math></inline-formula> under a second branch. Underneath this branch, clusters <inline-formula><mml:math id="M251" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M252" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">5</mml:mn><mml:mi>a</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M253" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:msup><mml:mn mathvariant="normal">5</mml:mn><mml:mi>b</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> correspond to extremities of the Region 3, which are not fully sampled. The dendrogram structure for the PD (Fig. <xref ref-type="fig" rid="Ch1.F21"/>d) is similar with clusters <inline-formula><mml:math id="M254" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">7</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M255" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">23</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M256" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">25</mml:mn></mml:mrow></mml:math></inline-formula> organizing under the branch representing the central region and clusters <inline-formula><mml:math id="M257" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M258" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M259" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">21</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M260" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M261" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">16</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M262" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:math></inline-formula>, and <inline-formula><mml:math id="M263" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">12</mml:mn></mml:mrow></mml:math></inline-formula> forming the eastern and western peripheral regions. Clusters <inline-formula><mml:math id="M264" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M265" display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:math></inline-formula> pertain to extremities of Region 3, which are not fully sampled. Figures <xref ref-type="fig" rid="App1.Ch1.S3.F45"/> and <xref ref-type="fig" rid="App1.Ch1.S3.F46"/> depict zoomed-in sections of the subgraphs relating to each of the top clusters that confirm the detected intra-regional variation for DM and PD, respectively.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F21" specific-use="star"><?xmltex \currentcnt{21}?><?xmltex \def\figurename{Figure}?><label>Figure 21</label><caption><p id="d1e6261">Hierarchical clustering results for Region 3 depicting the top 10 clusters using <bold>(a)</bold> fingerprint distance, <bold>(b)</bold> D-measure distance, <bold>(c)</bold> NetLSD distance, <bold>(d)</bold> portrait divergence distance, <bold>(e)</bold> spatial <inline-formula><mml:math id="M266" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">20</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, and <bold>(f)</bold> spatial <inline-formula><mml:math id="M267" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">21</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>.</p></caption>
            <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f21.png"/>

          </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F22" specific-use="star"><?xmltex \currentcnt{22}?><?xmltex \def\figurename{Figure}?><label>Figure 22</label><caption><p id="d1e6313">Variation in fracture orientations and topological summary for Region 3 corresponding to <bold>(a)</bold> fingerprint distance, <bold>(b)</bold> D-measure, and <bold>(c)</bold> portrait divergence.</p></caption>
            <?xmltex \igopts{width=455.244094pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f22.png"/>

          </fig>

</sec>
</sec>
</sec>
<sec id="Ch1.S6">
  <label>6</label><title>Discussion</title>
      <p id="d1e6341">Within the structural geology literature, the quantitative fracture persistence measures of <xref ref-type="bibr" rid="bib1.bibx15" id="text.78"/>, the topological approach of <xref ref-type="bibr" rid="bib1.bibx48" id="text.79"/>, and qualitative descriptions are most commonly resorted to for comparing 2-D fracture networks. The lack of quantitative measures for spatial network data is partially due to the lack of extensive 2-D fracture trace data. Using the fully mapped, UAV-derived dataset of an extensive fracture network, it is possible to systematically investigate 2-D fracture network organization variations.</p>
      <p id="d1e6350">In this contribution, we treat 2-D fracture networks as planar graph structures and apply graph similarity measures to quantitatively compare subsampling within large fracture networks and discover clusters of similarity. The statistical technique of HC was used along with graph distance metrics to extract spatial clusters. Subgraphs within a spatial cluster are more similar to each other than other clusters. A hierarchy of patterns is derived based on similarity scores, which can be examined at deeper levels.</p>
      <p id="d1e6353">One can argue that variation exists at multiple length scales, and more granular inquiry would lead to different clusters. While our choices of grid spacing and subsampling of graphs were to keep computational requirements in mind, it is possible to do more dense subsampling than what we have already achieved to further highlight spatial variations within a given network. The clusters that we have depicted are particular to the spacing and sampling diameters that we have chosen. In this section, we discuss some additional perspectives and issues related to our methodology and results.</p>
      <p id="d1e6356"><list list-type="bullet">
          <list-item>

      <p id="d1e6361"><bold>Linking spatial variation patterns to fracturing drivers.</bold>
The results indicate that spatial variation in fracture networks is not always evident from the ubiquitously used fracture persistence measures, such as <inline-formula><mml:math id="M268" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">20</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M269" display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn mathvariant="normal">21</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>. The proposed method highlights variations in network structure which can then help draw inferences into possible drivers for the spatial differences. In the case of Regions 2 and 3, the proximity to the fault influences network development. Such a model has been proposed by <xref ref-type="bibr" rid="bib1.bibx39 bib1.bibx24" id="text.80"/> and <xref ref-type="bibr" rid="bib1.bibx67" id="text.81"/>, where the oldest fractures are long and radial, emanating from local asperities within the fault. These older fractures then influence the development of younger fractures. This is observed in Region 2, where clusters form roughly parallel to the E–NE-striking fault with the direction of variation to the NW. Region 3 is positioned between two such asperity epicentres. There are long, radial fractures on the eastern and western extremities with a transition region in between. The direction of cluster variation trends E–W. Fracture pattern variation in Region 1 is not affected by faulting. Since Regions 1 and 2 pertain to a single layer, the NE regions of Region 1 show visual similarities between the westernmost extremities of Region 2. The intra-regional variations in Region 1 could be due to layer thickness variation, although we do not have sufficient thickness data to confirm this.</p>

      <p id="d1e6394">The analysis of spatial variation can assist in deciphering fracture timing. Given the temporal nature of network formation, it is desirable to delineate network evolution into relative episodes of fracturing. In previous analyses specific to the Lilstock dataset used in this contribution, <xref ref-type="bibr" rid="bib1.bibx38" id="text.82"/> identified jointing sets with timing history based on fracture length, strike, and topological relationships. Although the temporal history is identified from joints that were picked manually but not wholly by <xref ref-type="bibr" rid="bib1.bibx38" id="text.83"/>, there is still a discernable spatial variation where some jointing sets are localized while others occur throughout the outcrop. Identifying spatial clustering in complete networks provides a basis by which joint sets can then be arranged in a hierarchy of temporal development.</p>
          </list-item>
          <list-item>

      <p id="d1e6406"><bold>On the choice of a graph distance metric.</bold>
We have restricted our investigation scope to four state-of-the-art graph similarity distances from the recent graph theory literature. Many more graph distances applicable to spatial graphs exist <xref ref-type="bibr" rid="bib1.bibx25 bib1.bibx52" id="paren.84"/>; furthermore, the best means remain an open problem in network science research. Some novel distance measures are not graph based but derive from persistent homology (such as <xref ref-type="bibr" rid="bib1.bibx21" id="altparen.85"/>). In this approach that considers the shape of data, persistence diagrams are generated from spatial graphs, and bottleneck distances are combined with hierarchical clustering to discover clusters. The results from <xref ref-type="bibr" rid="bib1.bibx21" id="text.86"/> compared favourably to that of <xref ref-type="bibr" rid="bib1.bibx33" id="text.87"/> when applied to patterns of cities.</p>

      <p id="d1e6423">As may be observed from our results, the metrics highlight certain aspects of the fracture network while not considering others. For instance, the fingerprint distance<?pagebreak page2180?> only considers block area and shape factor distributions of the blocks and neglects orientations. The other three distances use graph properties directly, and hence orientation information (or the lack of it) is a consequence of how the spatial graph is defined. We used weighted graphs that incorporate Euclidean distance between nodes as edge weights for the similarity computations. However, each edge also has a striking attribute to completely describe its position in 2-D space (in the case of 3-D, it needs a dip). Ideally, the edge weight should then be a vector, <inline-formula><mml:math id="M270" display="inline"><mml:mrow><mml:mi>w</mml:mi><mml:mo>=</mml:mo><mml:mo>[</mml:mo><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="italic">θ</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> incorporating both lengths, “<inline-formula><mml:math id="M271" display="inline"><mml:mi>l</mml:mi></mml:math></inline-formula>” and orientation, “<inline-formula><mml:math id="M272" display="inline"><mml:mi mathvariant="italic">θ</mml:mi></mml:math></inline-formula>”, but the distance metrics we use do not allow the use of non-scalar weights.</p>
          </list-item>
          <list-item>

      <p id="d1e6463"><bold>Do REVs exist for fracture networks?</bold>
In the context of fractured reservoir modelling, identification of a REV aids continuum-based simulation approaches. However, the complexities of fluid flow and transport through fractured porous media require an explicit representation of fractures. Given the difficulties associated with obtaining realistic network geometries, stochastic-process-based methods derived from sparse fracture data are commonplace. However, these methods are often unable to represent inherent non-stationarity in spatial variation <xref ref-type="bibr" rid="bib1.bibx53" id="paren.88"/>, and work by <xref ref-type="bibr" rid="bib1.bibx1" id="text.89"/> finds that discrete fracture networks (DFNs) from nature exhibit<?pagebreak page2181?> disassortativity, which is not a property of generated networks. Other techniques based on multipoint statistics <xref ref-type="bibr" rid="bib1.bibx13" id="paren.90"/> attempt image-based approaches to modelling non-stationary networks. <xref ref-type="bibr" rid="bib1.bibx19" id="text.91"/> present a different approach in which DFNs are directly generated as spatial graphs (referred to as “random rectangular graphs”). Such a method can incorporate insights from outcrop-derived naturally fractured reservoirs (NFRs).</p>

      <p id="d1e6480">Regardless of the extrapolation method used, stationarity decisions have to be made based on hard data, and this is where our approach is helpful. We can use outcrop-derived networks to define and delineate stationarity's spatial boundaries and assign a particular type of network with due cognition of the inherent graph structure. Much literature exists on linking fracture patterns to high-deformation drivers such as folding, faulting, and diapirism, with the goal being to<?pagebreak page2182?> identify and correlate appropriate outcrop analogues to particular subsurface conditions. As our clustering results indicate, at the dimensional scales of sampling we have used, Tobler's first law of geography applies to fracture networks. Therefore, a representative network based on network similarity can be derived. The method can be applied to analogues for which data already exist. Further work is required to differentiate fluid-flow and transport responses of the identified cluster type.</p>
          </list-item>
          <list-item>

      <p id="d1e6486"><bold>Other clustering methods.</bold>
We have used a combination of HC and graph distance metrics to delineate regions within a spatial graph and arrange them in a hierarchy of similarities. Within the graph theory literature, there are other non-HC methods based on graph properties such as modularity <xref ref-type="bibr" rid="bib1.bibx37 bib1.bibx11 bib1.bibx54" id="paren.92"/> or by graph spectral partitioning <xref ref-type="bibr" rid="bib1.bibx22 bib1.bibx51" id="paren.93"/>. Recent developments using graph neural networks and graph machine learning include modifications on the concept of modularity <xref ref-type="bibr" rid="bib1.bibx56" id="paren.94"/> and spectral methods <xref ref-type="bibr" rid="bib1.bibx8" id="paren.95"/> towards the goal of partitioning graphs into clusters.</p>
          </list-item>
        </list></p>
</sec>
<sec id="Ch1.S7" sec-type="conclusions">
  <label>7</label><title>Conclusions</title>
      <p id="d1e6513">This contribution presents a method to automatically identify spatial clusters and quantify intra-network spatial variation within 2-D fracture networks. We test the technique on 2-D trace data from a prominent limestone outcrop within the Lilstock pavements, located off the southern coast of the Bristol Channel, UK. The fracture network data that span three separate regions and cover over 14 200 <inline-formula><mml:math id="M273" display="inline"><mml:mrow class="unit"><mml:msup><mml:mi mathvariant="normal">m</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> are converted to the form of planar graph structures, spatially sampled into subgraphs, and then compared using four different graph-distance measures. The pair-wise similarities in the form of distance matrices are used to arrange region-wise subgraphs into a hierarchical relationship structure, also referred to as a dendrogram, using the statistical technique of hierarchical clustering. Positional order information from the dendrogram is used to render maps depicting the spatial variation within the fracture networks. The delineations of these intra-network subpatterns provide a way to identify representative elemental volumes that preserve fracture networks' topological and geometric properties. The presence of these subregions can also serve as a guide for making decisions on stationarity with respect to geostatistical modelling. The main findings of the study are summarized as follows:
<?xmltex \hack{\newpage}?>
<list list-type="bullet"><list-item>
      <p id="d1e6531">Representing fracture networks as graphs enables combining hierarchical clustering and graph-distance metrics to reveal interesting intra-network spatial similarity patterns not otherwise discernable from existing global or local fracture network descriptors.</p></list-item><list-item>
      <p id="d1e6535">Organization of fracture network subgraphs based on pair-wise similarities into a hierarchical tree enables identification of spatial clustering at different dendrogram heights with newer and more granular cluster boundaries emerging at successively deeper levels of enquiry.</p></list-item><list-item>
      <p id="d1e6539">Spatial autocorrelation is more apparent with the fingerprint, D-measure, and the portrait divergence distances than the NetLSD, which yields speckled patterns with little or no spatial autocorrelation.</p></list-item><list-item>
      <p id="d1e6543">Spatial variation maps deriving from hierarchical clustering using the D-measure and portrait divergence identify similar spatial clusters and cluster boundaries. However, with the fingerprint distance, the cluster boundaries are different.</p></list-item><list-item>
      <p id="d1e6547">Fracture segment orientations show gradual variation in segment strikes across the identified clusters despite orientation not being explicitly considered and only Euclidean distance being used to weight spatial graph edges.</p></list-item></list></p><?xmltex \hack{\clearpage}?>
</sec>

      
      </body>
    <back><app-group>

<?pagebreak page2183?><app id="App1.Ch1.S1">
  <?xmltex \currentcnt{A}?><label>Appendix A</label><title>Heatmaps and dendrograms</title>

      <?xmltex \floatpos{h!}?><fig id="App1.Ch1.S1.F23"><?xmltex \currentcnt{A1}?><?xmltex \def\figurename{Figure}?><label>Figure A1</label><caption><p id="d1e6564">Combined symmetric heatmap of distance matrix and dendrograms, dendrograms, and sum-of-squares elbow plots for Region 1 <bold>(a)</bold> fingerprint distance, <bold>(b)</bold> D-measure,  <bold>(c)</bold> NetLSD, and <bold>(d)</bold> portrait divergence.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f23.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S1.F24"><?xmltex \currentcnt{A2}?><?xmltex \def\figurename{Figure}?><label>Figure A2</label><caption><p id="d1e6590">Combined symmetric heatmap of distance matrix and dendrograms, dendrograms, and sum-of-squares elbow plots for Region 2 <bold>(a)</bold> fingerprint distance, <bold>(b)</bold> D-measure, <bold>(c)</bold> NetLSD, and <bold>(d)</bold> portrait divergence.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f24.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S1.F25"><?xmltex \currentcnt{A3}?><?xmltex \def\figurename{Figure}?><label>Figure A3</label><caption><p id="d1e6617">Combined symmetric heatmap of distance matrix and dendrograms, dendrograms, and sum-of-squares elbow plots for Region 3 <bold>(a)</bold> fingerprint distance, <bold>(b)</bold> D-measure, <bold>(c)</bold> NetLSD, and <bold>(d)</bold> portrait divergence.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f25.png"/>

      </fig>

<?xmltex \hack{\clearpage}?>
</app>

<?pagebreak page2186?><app id="App1.Ch1.S2">
  <?xmltex \currentcnt{B}?><label>Appendix B</label><title>Spatial variation for different levels of dendrogram cuts</title>

      <?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F26"><?xmltex \currentcnt{B1}?><?xmltex \def\figurename{Figure}?><label>Figure B1</label><caption><p id="d1e6652">Variation in cluster boundaries for “<inline-formula><mml:math id="M274" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 1 using fingerprint distance.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f26.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F27"><?xmltex \currentcnt{B2}?><?xmltex \def\figurename{Figure}?><label>Figure B2</label><caption><p id="d1e6673">Variation in cluster boundaries for “<inline-formula><mml:math id="M275" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 1 using D-measure.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f27.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F28"><?xmltex \currentcnt{B3}?><?xmltex \def\figurename{Figure}?><label>Figure B3</label><caption><p id="d1e6695">Variation in cluster boundaries for “<inline-formula><mml:math id="M276" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 1 using NetLSD.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f28.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F29"><?xmltex \currentcnt{B4}?><?xmltex \def\figurename{Figure}?><label>Figure B4</label><caption><p id="d1e6716">Variation in cluster boundaries for “<inline-formula><mml:math id="M277" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 1 using portrait divergence.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f29.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F30"><?xmltex \currentcnt{B5}?><?xmltex \def\figurename{Figure}?><label>Figure B5</label><caption><p id="d1e6737">Variation in cluster boundaries for “<inline-formula><mml:math id="M278" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 2 using fingerprint distance.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f30.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F31"><?xmltex \currentcnt{B6}?><?xmltex \def\figurename{Figure}?><label>Figure B6</label><caption><p id="d1e6759">Variation in cluster boundaries for “<inline-formula><mml:math id="M279" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 2 using D-measure.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f31.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F32"><?xmltex \currentcnt{B7}?><?xmltex \def\figurename{Figure}?><label>Figure B7</label><caption><p id="d1e6780">Variation in cluster boundaries for “<inline-formula><mml:math id="M280" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 2 using NetLSD.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f32.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F33"><?xmltex \currentcnt{B8}?><?xmltex \def\figurename{Figure}?><label>Figure B8</label><caption><p id="d1e6801">Variation in cluster boundaries for “<inline-formula><mml:math id="M281" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 2 using portrait divergence.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f33.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F34"><?xmltex \currentcnt{B9}?><?xmltex \def\figurename{Figure}?><label>Figure B9</label><caption><p id="d1e6823">Variation in cluster boundaries for “<inline-formula><mml:math id="M282" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 3 using fingerprint distance.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f34.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F35"><?xmltex \currentcnt{B10}?><?xmltex \def\figurename{Figure}?><label>Figure B10</label><caption><p id="d1e6844">Variation in cluster boundaries for “<inline-formula><mml:math id="M283" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 3 using D-measure.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f35.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F36"><?xmltex \currentcnt{B11}?><?xmltex \def\figurename{Figure}?><label>Figure B11</label><caption><p id="d1e6865">Variation in cluster boundaries for “<inline-formula><mml:math id="M284" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 3 using NetLSD.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f36.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S2.F37"><?xmltex \currentcnt{B12}?><?xmltex \def\figurename{Figure}?><label>Figure B12</label><caption><p id="d1e6887">Variation in cluster boundaries for “<inline-formula><mml:math id="M285" display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>” clusters in Region 3 using portrait divergence.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f37.png"/>

      </fig>

<?xmltex \hack{\clearpage}?>
</app>

<?pagebreak page2198?><app id="App1.Ch1.S3">
  <?xmltex \currentcnt{C}?><label>Appendix C</label><title>Detailed spatial heterogeneity maps</title>

      <?xmltex \floatpos{h!}?><fig id="App1.Ch1.S3.F38"><?xmltex \currentcnt{C1}?><?xmltex \def\figurename{Figure}?><label>Figure C1</label><caption><p id="d1e6917">Circular subgraph samples depicting variation in fracturing style as identified in the 10 largest clusters by fingerprint distance in Region 1. Coordinates of circular sample centres are below each subgraph example.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f38.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S3.F39"><?xmltex \currentcnt{C2}?><?xmltex \def\figurename{Figure}?><label>Figure C2</label><caption><p id="d1e6931">Circular subgraph samples depicting variation in fracturing style as identified in the 10 largest clusters by D-measure in Region 1. Coordinates of circular sample centres are below each subgraph example.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f39.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S3.F40"><?xmltex \currentcnt{C3}?><?xmltex \def\figurename{Figure}?><label>Figure C3</label><caption><p id="d1e6946">Circular subgraph samples depicting variation in fracturing style as identified in the 10 largest clusters by portrait divergence in Region 1. Coordinates of circular sample centres are below each subgraph example.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f40.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S3.F41"><?xmltex \currentcnt{C4}?><?xmltex \def\figurename{Figure}?><label>Figure C4</label><caption><p id="d1e6960">Circular subgraph samples depicting variation in fracturing style as identified in the 10 largest clusters by fingerprint distance in Region 2. Coordinates of circular sample centres are below each subgraph example.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f41.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S3.F42"><?xmltex \currentcnt{C5}?><?xmltex \def\figurename{Figure}?><label>Figure C5</label><caption><p id="d1e6974">Circular subgraph samples depicting variation in fracturing style as identified in the 10 largest clusters by D-measure in Region 2. Coordinates of circular sample centres are below each subgraph example.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f42.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S3.F43"><?xmltex \currentcnt{C6}?><?xmltex \def\figurename{Figure}?><label>Figure C6</label><caption><p id="d1e6989">Circular subgraph samples depicting variation in fracturing style as identified in the 10 largest clusters by portrait divergence in Region 2. Coordinates of circular sample centres are below each subgraph example.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f43.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S3.F44"><?xmltex \currentcnt{C7}?><?xmltex \def\figurename{Figure}?><label>Figure C7</label><caption><p id="d1e7003">Circular subgraph samples depicting variation in fracturing style as identified in the 10 largest clusters by fingerprint distance in Region 3. Coordinates of circular sample centres are below each subgraph example.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f44.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S3.F45"><?xmltex \currentcnt{C8}?><?xmltex \def\figurename{Figure}?><label>Figure C8</label><caption><p id="d1e7017">Circular subgraph samples depicting variation in fracturing style as identified in the 10 largest clusters by D-measure in Region 3. Coordinates of circular sample centres are below each subgraph example.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f45.png"/>

      </fig>

<?xmltex \hack{\clearpage}?><?xmltex \floatpos{h!}?><fig id="App1.Ch1.S3.F46"><?xmltex \currentcnt{C9}?><?xmltex \def\figurename{Figure}?><label>Figure C9</label><caption><p id="d1e7032">Circular subgraph samples depicting variation in fracturing style as identified in the 10 largest clusters by portrait divergence in Region 3. Coordinates of circular sample centres are below each subgraph example.</p></caption>
        <?xmltex \hack{\hsize\textwidth}?>
        <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://se.copernicus.org/articles/12/2159/2021/se-12-2159-2021-f46.png"/>

      </fig>

<?xmltex \hack{\clearpage}?>
</app>
  </app-group><notes notes-type="codedataavailability"><title>Code and data availability</title>

      <p id="d1e7049">A MATLAB implementation to compute graph fingerprints and fingerprint distance is available on the GitHub repository <uri>https://github.com/rahulprabhakaran/Fracture_Fingerprint/tree/v.1.0.0</uri> (last access: 19 April 2021; see <ext-link xlink:href="https://doi.org/10.5281/zenodo.4699961" ext-link-type="DOI">10.5281/zenodo.4699961</ext-link>, <xref ref-type="bibr" rid="bib1.bibx41" id="altparen.96"/>). The implementation of the D-measure in the form of an R script is available as supplementary code with <xref ref-type="bibr" rid="bib1.bibx50" id="text.97"/>. The  NetLSD Python package used to compute the LSD distance as described in <xref ref-type="bibr" rid="bib1.bibx55" id="text.98"/> is available at <uri>https://pypi.org/project/NetLSD/</uri> (last access: 30 January 2021). The code implementation for portrait divergence developed by <xref ref-type="bibr" rid="bib1.bibx2" id="text.99"/> can be obtained from <uri>https://github.com/bagrow/network-portrait-divergence/</uri> (last access: 30 January 2021).</p>

      <p id="d1e7077">The circularly sampled fracture subgraphs are derived from the open fracture network dataset published by <xref ref-type="bibr" rid="bib1.bibx41" id="text.100"/>. The circularly sampled subgraphs are available for download as a data supplement to this paper <xref ref-type="bibr" rid="bib1.bibx43" id="paren.101"/>.</p>
  </notes><notes notes-type="authorcontribution"><title>Author contributions</title>

      <p id="d1e7089">RP wrote the code to convert shapefiles to graphs, sample subgraphs, and compute fingerprints and fingerprint distances; did the HC analysis; and wrote the manuscript with inputs from all authors. GB and JU contributed to development of methodology, structure of the manuscript, and discussion of results. DS provided funding and contributed to discussions on the results and methods that are utilized but are not limited to this paper.</p>
  </notes><notes notes-type="competinginterests"><title>Competing interests</title>

      <p id="d1e7095">The contact author has declared that neither they nor their co-authors have any competing interests.</p>
  </notes><notes notes-type="disclaimer"><title>Disclaimer</title>

      <p id="d1e7101">Publisher's note: Copernicus Publications remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.</p>
  </notes><ack><title>Acknowledgements</title><p id="d1e7108">The authors would like to thank Pierre-Olivier Bruna at TU Delft for useful discussions on spatial variation in fracturing. We would also like to thank David Sanderson and one other anonymous reviewer for comments that improved the quality of this contribution.</p></ack><notes notes-type="reviewstatement"><title>Review statement</title>

      <p id="d1e7113">This paper was edited by David Healy and reviewed by David Sanderson and one anonymous referee.</p>
  </notes><ref-list>
    <title>References</title>

      <ref id="bib1.bibx1"><?xmltex \def\ref@label{Andresen et~al.(2013)}?><label>Andresen et al.(2013)</label><?label Andresen2013?><mixed-citation>Andresen, C., Hansen, A., Le Goc, R., Davy, P., and Hope, S.: Topology of fracture networks, AIP Conf. Proc., 1, 7,  <ext-link xlink:href="https://doi.org/10.3389/fphy.2013.00007" ext-link-type="DOI">10.3389/fphy.2013.00007</ext-link>, 2013.</mixed-citation></ref>
      <ref id="bib1.bibx2"><?xmltex \def\ref@label{Bagrow and Bollt(2019)}?><label>Bagrow and Bollt(2019)</label><?label Bagrow2019?><mixed-citation>Bagrow, J. P. and Bollt, E. M.: An information-theoretic, all-scales approach to comparing networks, Applied Network Science, 4, 45,  <ext-link xlink:href="https://doi.org/10.1007/s41109-019-0156-x" ext-link-type="DOI">10.1007/s41109-019-0156-x</ext-link>, 2019.</mixed-citation></ref>
      <ref id="bib1.bibx3"><?xmltex \def\ref@label{Bagrow et~al.(2008)}?><label>Bagrow et al.(2008)</label><?label Bagrow2008?><mixed-citation>Bagrow, J. P., Bollt, E. M., Skufca, J. D., and ben Avraham, D.: Portraits of complex networks, Europhys. Lett., 81, 68004,  <ext-link xlink:href="https://doi.org/10.1209/0295-5075/81/68004" ext-link-type="DOI">10.1209/0295-5075/81/68004</ext-link>, 2008.</mixed-citation></ref>
      <ref id="bib1.bibx4"><?xmltex \def\ref@label{Barthelemy(2018)}?><label>Barthelemy(2018)</label><?label Barthelemy2018?><mixed-citation>Barthelemy, M.: Morphogenesis of Spatial Networks, Lecture Notes in
Morphogenesis, Springer International Publishing, 2018 edn.,
<ext-link xlink:href="https://doi.org/10.1007/978-3-319-20565-6" ext-link-type="DOI">10.1007/978-3-319-20565-6</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bibx5"><?xmltex \def\ref@label{Belayneh(2004)}?><label>Belayneh(2004)</label><?label Belayneh2004b?><mixed-citation>Belayneh, M.: Palaeostress orientation inferred from surface morphology of joints on the southern margin of the Bristol Channel Basin, UK, pp. 243–255, 1, Geol. Soc. Sp., 231, 243–255, <ext-link xlink:href="https://doi.org/10.1144/GSL.SP.2004.231.01.14" ext-link-type="DOI">10.1144/GSL.SP.2004.231.01.14</ext-link>, 2004.</mixed-citation></ref>
      <ref id="bib1.bibx6"><?xmltex \def\ref@label{Belayneh and Cosgrove(2004)}?><label>Belayneh and Cosgrove(2004)</label><?label Belayneh2004?><mixed-citation>Belayneh, M. and Cosgrove, J. W.: Fracture-pattern variations around a major fold and their implications regarding fracture prediction using limited data: an example from the Bristol Channel Basin, Geol. Soc. Sp., 31, 89–102,  <ext-link xlink:href="https://doi.org/10.1144/GSL.SP.2004.231.01.06" ext-link-type="DOI">10.1144/GSL.SP.2004.231.01.06</ext-link>, 2004.</mixed-citation></ref>
      <ref id="bib1.bibx7"><?xmltex \def\ref@label{Bemis et~al.(2014)}?><label>Bemis et al.(2014)</label><?label Bemis2014?><mixed-citation>Bemis, S. P., Micklethwaite, S., Turner, D., James, M. R., Akciz, S., Thiele, S. T., and Bangash, H. A.: Ground-based and UAV-Based photogrammetry: A multi-scale, high-resolution mapping tool for structural geology and paleoseismology, J. Struct. Geol., 69, 163–178,  <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2014.10.007" ext-link-type="DOI">10.1016/j.jsg.2014.10.007</ext-link>, 2014.</mixed-citation></ref>
      <ref id="bib1.bibx8"><?xmltex \def\ref@label{Bianchi et~al.(2020)}?><label>Bianchi et al.(2020)</label><?label Bianchi2020?><mixed-citation>Bianchi, F. M., Grattarola, D., and Alippi, C.: Spectral Clustering with Graph Neural Networks for Graph Pooling, in: Proceedings of the 37th International Conference on Machine Learning, edited by: III, H. D. and Singh, A., vol. 119 of Proceedings of Machine Learning Research, pp. 874–883, PMLR, <uri>http://proceedings.mlr.press/v119/bianchi20a.html</uri> (last access: 30 March 2021), 2020.</mixed-citation></ref>
      <ref id="bib1.bibx9"><?xmltex \def\ref@label{Bisdom et~al.(2017)}?><label>Bisdom et al.(2017)</label><?label Bisdom2017?><mixed-citation>Bisdom, K., Nick, H. M., and Bertotti, G.: An integrated workflow for stress and flow modelling using outcrop-derived discrete fracture networks, Comput. Geosci., 103, 21–35,  <ext-link xlink:href="https://doi.org/10.1016/j.cageo.2017.02.019" ext-link-type="DOI">10.1016/j.cageo.2017.02.019</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bibx10"><?xmltex \def\ref@label{Bistacchi et~al.(2020)}?><label>Bistacchi et al.(2020)</label><?label Bistacchi2020?><mixed-citation>Bistacchi, A., Mittempergher, S., Martinelli, M., and Storti, F.: On a new robust workflow for the statistical and spatial analysis of fracture data collected with scanlines (or the importance of stationarity), Solid Earth, 11, 2535–2547,  <ext-link xlink:href="https://doi.org/10.5194/se-11-2535-2020" ext-link-type="DOI">10.5194/se-11-2535-2020</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bibx11"><?xmltex \def\ref@label{Blondel et~al.(2008)}?><label>Blondel et al.(2008)</label><?label Blondel2008?><mixed-citation>Blondel, V. D., Guillaume, J.-L., Lambiotte, R., and Lefebvre, E.: Fast unfolding of communities in large networks, J. Stat. Mech.-Theory E., 2008, P10008,  <ext-link xlink:href="https://doi.org/10.1088/1742-5468/2008/10/p10008" ext-link-type="DOI">10.1088/1742-5468/2008/10/p10008</ext-link>, 2008.</mixed-citation></ref>
      <ref id="bib1.bibx12"><?xmltex \def\ref@label{Bruna et~al.(2019a)}?><label>Bruna et al.(2019a)</label><?label Bruna2019b?><mixed-citation>Bruna, P., Prabhakaran, R., Bertotti, G., Straubhaar, J., Plateaux, R., Maerten, L., Mariethoz, G., and Meda, M.: The MPS-Based Fracture Network Simulation Method: Application to Subsurface Domain, 81st EAGE Conference and Exhibition, London 2019, 1–5,  <ext-link xlink:href="https://doi.org/10.3997/2214-4609.201901679" ext-link-type="DOI">10.3997/2214-4609.201901679</ext-link>, 2019a.</mixed-citation></ref>
      <ref id="bib1.bibx13"><?xmltex \def\ref@label{Bruna et~al.(2019b)}?><label>Bruna et al.(2019b)</label><?label Bruna2019a?><mixed-citation>Bruna, P.-O., Straubhaar, J., Prabhakaran, R., Bertotti, G., Bisdom, K., Mariethoz, G., and Meda, M.: A new methodology to train fracture network simulation using multiple-point statistics, Solid Earth, 10, 537–559,  <ext-link xlink:href="https://doi.org/10.5194/se-10-537-2019" ext-link-type="DOI">10.5194/se-10-537-2019</ext-link>, 2019b.</mixed-citation></ref>
      <ref id="bib1.bibx14"><?xmltex \def\ref@label{Dart et~al.(1995)}?><label>Dart et al.(1995)</label><?label Dart1995?><mixed-citation>Dart, C. J., McClay, K., and Hollings, P. N.: 3D analysis of inverted extensional fault systems, southern Bristol Channel basin, UK, Geol. Soc. Sp., 8, 393–413,  <ext-link xlink:href="https://doi.org/10.1144/GSL.SP.1995.088.01.21" ext-link-type="DOI">10.1144/GSL.SP.1995.088.01.21</ext-link>, 1995.</mixed-citation></ref>
      <ref id="bib1.bibx15"><?xmltex \def\ref@label{Dershowitz and Herda(1992)}?><label>Dershowitz and Herda(1992)</label><?label Dershowitz1992?><mixed-citation>
Dershowitz, W. S. and Herda, H. H.: Interpretation of fracture spacing and intensity, in: The 33rd U.S Symposium on Rock Mechanics (USRMS), 3–5 June, Santa Fe, New Mexico, ARMA-92-0757, 1992.</mixed-citation></ref>
      <?pagebreak page2208?><ref id="bib1.bibx16"><?xmltex \def\ref@label{Deutsch(2002)}?><label>Deutsch(2002)</label><?label Deutsch2002?><mixed-citation>
Deutsch, C. V.: Geostatistical Reservoir Modeling, Oxford University Press,  1st edn., 2002.</mixed-citation></ref>
      <ref id="bib1.bibx17"><?xmltex \def\ref@label{Doolaeghe et~al.(2020)}?><label>Doolaeghe et al.(2020)</label><?label Doolaeghe2020?><mixed-citation>Doolaeghe, D., Davy, P., Hyman, J., and Darcel, C.: Graph-based flow modeling approach adapted to multiscale discrete-fracture-network models, Phys. Rev. E, 102, 53312,  <ext-link xlink:href="https://doi.org/10.1103/PhysRevE.102.053312" ext-link-type="DOI">10.1103/PhysRevE.102.053312</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bibx18"><?xmltex \def\ref@label{Emmert-Streib et~al.(2016)}?><label>Emmert-Streib et al.(2016)</label><?label Emmert-Streib2016?><mixed-citation>Emmert-Streib, F., Dehmer, M., and Shi, Y.: Fifty years of graph matching, network alignment and network comparison, Inform. Sciences, 346–347, 180–197,  <ext-link xlink:href="https://doi.org/10.1016/j.ins.2016.01.074" ext-link-type="DOI">10.1016/j.ins.2016.01.074</ext-link>, 2016.</mixed-citation></ref>
      <ref id="bib1.bibx19"><?xmltex \def\ref@label{Estrada and Sheerin(2017)}?><label>Estrada and Sheerin(2017)</label><?label Estrada2017?><mixed-citation>Estrada, E. and Sheerin, M.: Random neighborhood graphs as models of fracture networks on rocks: Structural and dynamical analysis, Appl. Math. Comput., 314, 360–379,  <ext-link xlink:href="https://doi.org/10.1016/j.amc.2017.06.018" ext-link-type="DOI">10.1016/j.amc.2017.06.018</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bibx20"><?xmltex \def\ref@label{Everitt et~al.(2011)}?><label>Everitt et al.(2011)</label><?label Everitt2011?><mixed-citation>
Everitt, B., Landau, S., Leese, M., and Stahl, D.: Cluster Analysis, Wiley Series in Probability and Statistics, Wiley, 2011.</mixed-citation></ref>
      <ref id="bib1.bibx21"><?xmltex \def\ref@label{Feng(2020)}?><label>Feng(2020)</label><?label Feng2020?><mixed-citation>Feng, M. H.: Topological tools forunderstanding complex systems, PhD thesis, UCLA, <uri>https://escholarship.org/uc/item/1t32m3z7</uri>, 2020.</mixed-citation></ref>
      <ref id="bib1.bibx22"><?xmltex \def\ref@label{Fiedler(1973)}?><label>Fiedler(1973)</label><?label Fiedler1973?><mixed-citation>Fiedler, M.: Algebraic connectivity of graphs, Czech. Math. J., 23, 298–305,  <ext-link xlink:href="https://doi.org/10.21136/CMJ.1973.101168" ext-link-type="DOI">10.21136/CMJ.1973.101168</ext-link>, 1973.</mixed-citation></ref>
      <ref id="bib1.bibx23"><?xmltex \def\ref@label{Gillespie et~al.(1993)}?><label>Gillespie et al.(1993)</label><?label Gillespie1993?><mixed-citation>Gillespie, P., Howard, C., Walsh, J., and Watterson, J.: Measurement and characterisation of spatial distributions of fractures, Tectonophysics, 226, 113–141,  <ext-link xlink:href="https://doi.org/10.1016/0040-1951(93)90114-Y" ext-link-type="DOI">10.1016/0040-1951(93)90114-Y</ext-link>, 1993.</mixed-citation></ref>
      <ref id="bib1.bibx24"><?xmltex \def\ref@label{Gillespie et~al.(2011)}?><label>Gillespie et al.(2011)</label><?label Gillespie2011?><mixed-citation>Gillespie, P. A., Monsen, E., Maerten, L., Hunt, D. W., Thurmond, J., and Tuck, D.: Fractures in Carbonates: From Digital Outcrops to Mechanical Models, vol. 10, pp. 137–147, SEPM Society for Sedimentary Geology, 2011st edn.,  <ext-link xlink:href="https://doi.org/10.2110/sepmcsp.10.003" ext-link-type="DOI">10.2110/sepmcsp.10.003</ext-link>, 2011.</mixed-citation></ref>
      <ref id="bib1.bibx25"><?xmltex \def\ref@label{Hartle et~al.(2020)}?><label>Hartle et al.(2020)</label><?label Hartle2020?><mixed-citation>Hartle, H., Klein, B., McCabe, S., Daniels, A., St-Onge, G., Murphy, C., and Hébert-Dufresne, L.: Network comparison and the within-ensemble graph distance, P. Roy. Soc. A-Math. Phy., 476, 20190744,  <ext-link xlink:href="https://doi.org/10.1098/rspa.2019.0744" ext-link-type="DOI">10.1098/rspa.2019.0744</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bibx26"><?xmltex \def\ref@label{Hennig et~al.(2016)}?><label>Hennig et al.(2016)</label><?label Hennig2016?><mixed-citation>
Hennig, C., Meila, M., Murtagh, F., and Rocci, R.: Handbook of Cluster Analysis, Handbooks of Modern Statistical Methods, Chapman and Hall, CRC Press, 1st edn., 2016.</mixed-citation></ref>
      <ref id="bib1.bibx27"><?xmltex \def\ref@label{Hooker and Katz(2015)}?><label>Hooker and Katz(2015)</label><?label Hooker2015?><mixed-citation>Hooker, J. N. and Katz, R. F.: Vein spacing in extending, layered rock: The effect of synkinematic cementation, Am. J. Sci., 315, 557–588,  <ext-link xlink:href="https://doi.org/10.2475/06.2015.03" ext-link-type="DOI">10.2475/06.2015.03</ext-link>, 2015.</mixed-citation></ref>
      <ref id="bib1.bibx28"><?xmltex \def\ref@label{Jelsma et~al.(2004)}?><label>Jelsma et al.(2004)</label><?label Jelsma2004?><mixed-citation>Jelsma, H. A., de Wit, M. J., Thiart, C., Dirks, P. H. G. M., Viola, G., Basson, I. J., and Anckar, E.: Preferential distribution along transcontinental corridors of kimberlites and related rocks of Southern Africa, S. Afr. J. Geol., 107, 301–324,  <ext-link xlink:href="https://doi.org/10.2113/107.1-2.301" ext-link-type="DOI">10.2113/107.1-2.301</ext-link>, 2004.</mixed-citation></ref>
      <ref id="bib1.bibx29"><?xmltex \def\ref@label{Kaufman(1990)}?><label>Kaufman(1990)</label><?label Kaufman1990?><mixed-citation>Kaufman, L.: Finding groups in data: an introduction to cluster analysis, Wiley Series in Probability and Statistics, Wiley, New York, 1990 edn.,  <ext-link xlink:href="https://doi.org/10.1002/9780470316801" ext-link-type="DOI">10.1002/9780470316801</ext-link>, 1990.</mixed-citation></ref>
      <ref id="bib1.bibx30"><?xmltex \def\ref@label{Laubach et~al.(2018)}?><label>Laubach et al.(2018)</label><?label Laubach2018a?><mixed-citation>Laubach, S. E., Lamarche, J., Gauthier, B. D. M., Dunne, W. M., and Sanderson, D. J.: Spatial arrangement of faults and opening-mode fractures, J. Struct. Geol., 108, 2–15,  <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2017.08.008" ext-link-type="DOI">10.1016/j.jsg.2017.08.008</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bibx31"><?xmltex \def\ref@label{Laubach et~al.(2019)}?><label>Laubach et al.(2019)</label><?label Laubach2019?><mixed-citation>Laubach, S. E., Lander, R. H., Criscenti, L. J., Anovitz, L. M., Urai, J. L., Pollyea, R. M., Hooker, J. N., Narr, W., Evans, M. A., Kerisit, S. N., Olson, J. E., Dewers, T., Fisher, D., Bodnar, R., Evans, B., Dove, P., Bonnell, L. M., Marder, M. P., and Pyrak-Nolte, L.: The Role of Chemistry in Fracture Pattern Development and Opportunities to Advance Interpretations of Geological Materials, Rev. Geophys., 57, 1065–1111,  <ext-link xlink:href="https://doi.org/10.1029/2019RG000671" ext-link-type="DOI">10.1029/2019RG000671</ext-link>, 2019.</mixed-citation></ref>
      <ref id="bib1.bibx32"><?xmltex \def\ref@label{Lei et~al.(2017)}?><label>Lei et al.(2017)</label><?label Lei2017?><mixed-citation>Lei, Q., Latham, J.-P., Xiang, J., and Tsang, C.-F.: Role of natural fractures in damage evolution around tunnel excavation in fractured rocks, Eng. Geol., 231, 100–113,  <ext-link xlink:href="https://doi.org/10.1016/j.enggeo.2017.10.013" ext-link-type="DOI">10.1016/j.enggeo.2017.10.013</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bibx33"><?xmltex \def\ref@label{Louf and Barthelemy(2014)}?><label>Louf and Barthelemy(2014)</label><?label Louf2014?><mixed-citation>Louf, R. and Barthelemy, M.: A typology of street patterns, J. R. Soc. Interface, 11, 20140924,  <ext-link xlink:href="https://doi.org/10.1098/rsif.2014.0924" ext-link-type="DOI">10.1098/rsif.2014.0924</ext-link>, 2014.</mixed-citation></ref>
      <ref id="bib1.bibx34"><?xmltex \def\ref@label{Marrett et~al.(2018)}?><label>Marrett et al.(2018)</label><?label Marrett2018?><mixed-citation>Marrett, R., Gale, J. F., Gómez, L. A., and Laubach, S. E.: Correlation analysis of fracture arrangement in space, J. Struct. Geol., 108, 16–33,  <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2017.06.012" ext-link-type="DOI">10.1016/j.jsg.2017.06.012</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bibx35"><?xmltex \def\ref@label{Nelson(2001)}?><label>Nelson(2001)</label><?label Nelson2001?><mixed-citation>
Nelson, R.: Geologic Analysis of Naturally Fractured Reservoirs, Gulf Professional Publishing, 2nd edn., 2001.</mixed-citation></ref>
      <ref id="bib1.bibx36"><?xmltex \def\ref@label{Newman(2002)}?><label>Newman(2002)</label><?label Newman2002?><mixed-citation>Newman, M. E. J.: Assortative Mixing in Networks, Phys. Rev. Lett., 89, 208701,  <ext-link xlink:href="https://doi.org/10.1103/PhysRevLett.89.208701" ext-link-type="DOI">10.1103/PhysRevLett.89.208701</ext-link>, 2002.</mixed-citation></ref>
      <ref id="bib1.bibx37"><?xmltex \def\ref@label{Newman and Girvan(2004)}?><label>Newman and Girvan(2004)</label><?label Newman2004?><mixed-citation>Newman, M. E. J. and Girvan, M.: Finding and evaluating community structure in networks, Phys. Rev. E, 69, 026113,  <ext-link xlink:href="https://doi.org/10.1103/PhysRevE.69.026113" ext-link-type="DOI">10.1103/PhysRevE.69.026113</ext-link>, 2004.</mixed-citation></ref>
      <ref id="bib1.bibx38"><?xmltex \def\ref@label{Passchier et~al.(2021)}?><label>Passchier et al.(2021)</label><?label Passchier2021?><mixed-citation>Passchier, M., Passchier, C. W., Weismüller, C., and Urai, J. L.: The joint sets on the Lilstock Benches, U K. Observations based on mapping a full resolution UAV-based image, J. Struct. Geol.,  147, 104332, <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2021.104332" ext-link-type="DOI">10.1016/j.jsg.2021.104332</ext-link>, 2021.</mixed-citation></ref>
      <ref id="bib1.bibx39"><?xmltex \def\ref@label{Peacock and Sanderson(1995)}?><label>Peacock and Sanderson(1995)</label><?label Peacock1995?><mixed-citation>Peacock, D. and Sanderson, D.: Strike-slip relay ramps, J. Struct. Geol., 17, 1351–1360,  <ext-link xlink:href="https://doi.org/10.1016/0191-8141(95)97303-W" ext-link-type="DOI">10.1016/0191-8141(95)97303-W</ext-link>, 1995.</mixed-citation></ref>
      <ref id="bib1.bibx40"><?xmltex \def\ref@label{Peacock et~al.(2018)}?><label>Peacock et al.(2018)</label><?label Peacock2018?><mixed-citation>Peacock, D., Sanderson, D., and Rotevatn, A.: Relationships between fractures, J. Struct. Geol., 106, 41–53,  <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2017.11.010" ext-link-type="DOI">10.1016/j.jsg.2017.11.010</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bibx41"><?xmltex \def\ref@label{Prabhakaran(2021)}?><label>Prabhakaran(2021)</label><?label Prabhakaran2021b?><mixed-citation>Prabhakaran, R.: rahulprabhakaran/Fracture_Fingerprint,  <ext-link xlink:href="https://doi.org/10.5281/zenodo.4699961" ext-link-type="DOI">10.5281/zenodo.4699961</ext-link>, 2021.</mixed-citation></ref>
      <ref id="bib1.bibx42"><?xmltex \def\ref@label{Prabhakaran et~al.(2019)}?><label>Prabhakaran et al.(2019)</label><?label Prabhakaran2019c?><mixed-citation>Prabhakaran, R., Bruna, P.-O., Bertotti, G., and Smeulders, D.: An automated fracture trace detection technique using the complex shearlet transform, Solid Earth, 10, 2137–2166,  <ext-link xlink:href="https://doi.org/10.5194/se-10-2137-2019" ext-link-type="DOI">10.5194/se-10-2137-2019</ext-link>, 2019.</mixed-citation></ref>
      <ref id="bib1.bibx43"><?xmltex \def\ref@label{Prabhakaran et~al.(2021a)}?><label>Prabhakaran et al.(2021a)</label><?label Prabhakaran2021c?><mixed-citation>Prabhakaran, R., Bertotti, G., Urai, J., and Smeulders, D.: Data Supplement: Fracture Subgraphs from the Lilstock Pavement, Bristol Channel, UK, 4TU Centre for Research Data. Dataset,  <ext-link xlink:href="https://doi.org/10.4121/14405783.v1" ext-link-type="DOI">10.4121/14405783.v1</ext-link>, 2021a.</mixed-citation></ref>
      <ref id="bib1.bibx44"><?xmltex \def\ref@label{Prabhakaran et~al.(2021b)}?><label>Prabhakaran et al.(2021b)</label><?label Prabhakaran2021a?><mixed-citation>Prabhakaran, R., Urai, J., Bertotti, G., Weismueller, C., and Smeulders, D.: Large-scale natural fracture network patterns: Insights from automated mapping in the Lilstock (Bristol Channel) limestone outcrops, J. Struct. Geol., 150, 104405, <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2021.104405" ext-link-type="DOI">10.1016/j.jsg.2021.104405</ext-link>, 2021b.</mixed-citation></ref>
      <ref id="bib1.bibx45"><?xmltex \def\ref@label{Priest and Hudson(1976)}?><label>Priest and Hudson(1976)</label><?label Priest1976?><mixed-citation>Priest, S. and Hudson, J.: Discontinuity spacings in rock, Int. J. Rock Mech. Min., 13, 135–148,  <ext-link xlink:href="https://doi.org/10.1016/0148-9062(76)90818-4" ext-link-type="DOI">10.1016/0148-9062(76)90818-4</ext-link>, 1976.</mixed-citation></ref>
      <ref id="bib1.bibx46"><?xmltex \def\ref@label{Procter and Sanderson(2018)}?><label>Procter and Sanderson(2018)</label><?label Procter2018?><mixed-citation>Procter, A. and Sanderson, D. J.: Spatial and layer-controlled variability in fracture networks, J. Struct. Geol., 108, 52–65,  <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2017.07.008" ext-link-type="DOI">10.1016/j.jsg.2017.07.008</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bibx47"><?xmltex \def\ref@label{Rawnsley et~al.(1998)}?><label>Rawnsley et al.(1998)</label><?label Rawnsley1998?><mixed-citation>Rawnsley, K., Peacock, D., Rives, T., and Petit, J.-P.: Joints in the Mesozoic sediments around the Bristol Channel Basin, J. Struct. Geol., 20, 1641–1661,  <ext-link xlink:href="https://doi.org/10.1016/S0191-8141(98)00070-4" ext-link-type="DOI">10.1016/S0191-8141(98)00070-4</ext-link>, 1998.</mixed-citation></ref>
      <ref id="bib1.bibx48"><?xmltex \def\ref@label{Sanderson and Nixon(2015)}?><label>Sanderson and Nixon(2015)</label><?label Sanderson2015?><mixed-citation>Sanderson, D. J. and Nixon, C. W.: The use of topology in fracture network characterization, J. Struct. Geol., 72, 55–66,  <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2015.01.005" ext-link-type="DOI">10.1016/j.jsg.2015.01.005</ext-link>, 2015.</mixed-citation></ref>
      <?pagebreak page2209?><ref id="bib1.bibx49"><?xmltex \def\ref@label{Sanderson et~al.(2019)}?><label>Sanderson et al.(2019)</label><?label Sanderson2019?><mixed-citation>Sanderson, D. J., Peacock, D. C., Nixon, C. W., and Rotevatn, A.: Graph theory and the analysis of fracture networks, J. Struct. Geol., 125, 155–165,  <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2018.04.011" ext-link-type="DOI">10.1016/j.jsg.2018.04.011</ext-link>, back to the future, 2019.</mixed-citation></ref>
      <ref id="bib1.bibx50"><?xmltex \def\ref@label{Schieber et~al.(2017)}?><label>Schieber et al.(2017)</label><?label Schieber2017?><mixed-citation>Schieber, T. A., Carpi, L., Díaz-Guilera, A., Pardalos, P. M., Masoller, C., and Ravetti, M. G.: Quantification of network structural dissimilarities, Nat. Commun., 8, 13928,  <ext-link xlink:href="https://doi.org/10.1038/ncomms13928" ext-link-type="DOI">10.1038/ncomms13928</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bibx51"><?xmltex \def\ref@label{Spielman and Teng(2007)}?><label>Spielman and Teng(2007)</label><?label Spielman2007?><mixed-citation>Spielman, D. A. and Teng, S.-H.: Spectral partitioning works: Planar graphs and finite element meshes, Linear Algebra Appl., 421, 284–305,  <ext-link xlink:href="https://doi.org/10.1016/j.laa.2006.07.020" ext-link-type="DOI">10.1016/j.laa.2006.07.020</ext-link>, 2007.</mixed-citation></ref>
      <ref id="bib1.bibx52"><?xmltex \def\ref@label{Tantardini et~al.(2019)}?><label>Tantardini et al.(2019)</label><?label Tantardini2019?><mixed-citation>Tantardini, M., Ieva, F., Tajoli, L., and Piccardi, C.: Comparing methods for comparing networks, Sci. Rep.-UK, 9, 17557,  <ext-link xlink:href="https://doi.org/10.1038/s41598-019-53708-y" ext-link-type="DOI">10.1038/s41598-019-53708-y</ext-link>, 2019.</mixed-citation></ref>
      <ref id="bib1.bibx53"><?xmltex \def\ref@label{Thovert et~al.(2017)}?><label>Thovert et al.(2017)</label><?label Thovert2017?><mixed-citation>Thovert, J.-F., Mourzenko, V., and Adler, P.: Percolation in three-dimensional fracture networks for arbitrary size and shape distributions, Phys. Rev. E, 95, 042112,  <ext-link xlink:href="https://doi.org/10.1103/PhysRevE.95.042112" ext-link-type="DOI">10.1103/PhysRevE.95.042112</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bibx54"><?xmltex \def\ref@label{Traag et~al.(2019)}?><label>Traag et al.(2019)</label><?label Traag2019?><mixed-citation>Traag, V. A., Waltman, L., and van Eck, N. J.: From Louvain to Leiden: guaranteeing well-connected communities, Sci. Rep.-UK, 9, 5233,  <ext-link xlink:href="https://doi.org/10.1038/s41598-019-41695-z" ext-link-type="DOI">10.1038/s41598-019-41695-z</ext-link>, 2019.</mixed-citation></ref>
      <ref id="bib1.bibx55"><?xmltex \def\ref@label{Tsitsulin et~al.(2018)}?><label>Tsitsulin et al.(2018)</label><?label Tsitsulin2018?><mixed-citation>
Tsitsulin, A., Mottin, D., Karras, P., Bronstein, A., and Müller, E.: NetLSD: Hearing the Shape of a Graph, in: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '18, 2018.</mixed-citation></ref>
      <ref id="bib1.bibx56"><?xmltex \def\ref@label{Tsitsulin et~al.(2020)}?><label>Tsitsulin et al.(2020)</label><?label Tsitsulin2020?><mixed-citation>Tsitsulin, A., Palowitch, J., Perozzi, B., and Müller, E.: Graph Clustering with Graph Neural Networks, <uri>https://arxiv.org/abs/2006.16904</uri> (last access: 15 January 2021), 2020.</mixed-citation></ref>
      <ref id="bib1.bibx57"><?xmltex \def\ref@label{Valentini et~al.(2007)}?><label>Valentini et al.(2007)</label><?label Valentini2007a?><mixed-citation>Valentini, L., Perugini, D., and Poli, G.: The “small-world” topology of rock fracture networks, Physica A, 377, 323–328,  <ext-link xlink:href="https://doi.org/10.1016/j.physa.2006.11.025" ext-link-type="DOI">10.1016/j.physa.2006.11.025</ext-link>, 2007.</mixed-citation></ref>
      <ref id="bib1.bibx58"><?xmltex \def\ref@label{Van~Steen(2010)}?><label>Van Steen(2010)</label><?label VanSteen2010?><mixed-citation>
Van Steen, M.: Graph Theory and Complex Networks: An Introduction, 1st edn.,
2010.</mixed-citation></ref>
      <ref id="bib1.bibx59"><?xmltex \def\ref@label{Vevatne et~al.(2014)}?><label>Vevatne et al.(2014)</label><?label Vevatne2014?><mixed-citation>Vevatne, J. N., Rimstad, E., Hope, S. M., Korsnes, R., and Hansen, A.: Fracture networks in sea ice, AIP Conf. Proc., 2, 21,  <ext-link xlink:href="https://doi.org/10.3389/fphy.2014.00021" ext-link-type="DOI">10.3389/fphy.2014.00021</ext-link>, 2014.
</mixed-citation></ref><?xmltex \hack{\newpage}?>
      <ref id="bib1.bibx60"><?xmltex \def\ref@label{Vidal et~al.(2017)}?><label>Vidal et al.(2017)</label><?label Vidal2017?><mixed-citation>Vidal, J., Genter, A., and Chopin, F.: Permeable fracture zones in the hard rocks of the geothermal reservoir at Rittershoffen, France, J. Geophys. Res.-Sol. Ea., 122, 4864–4887,  <ext-link xlink:href="https://doi.org/10.1002/2017JB014331" ext-link-type="DOI">10.1002/2017JB014331</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bibx61"><?xmltex \def\ref@label{Wang and Hudson(2015)}?><label>Wang and Hudson(2015)</label><?label Wang2015?><mixed-citation>Wang, J. S. Y. and Hudson, J. A.: Fracture Flow and Underground Research Laboratories for Nuclear Waste Disposal and Physics Experiments, chap. 2, pp. 19–41, American Geophysical Union (AGU),  <ext-link xlink:href="https://doi.org/10.1002/9781118877517.ch2" ext-link-type="DOI">10.1002/9781118877517.ch2</ext-link>, 2015.</mixed-citation></ref>
      <ref id="bib1.bibx62"><?xmltex \def\ref@label{Weism\"{u}ller et~al.(2020)}?><label>Weismüller et al.(2020)</label><?label Weismueller2020?><mixed-citation>Weismüller, C., Prabhakaran, R., Passchier, M., Urai, J. L., Bertotti, G., and Reicherter, K.: Mapping the fracture network in the Lilstock pavement, Bristol Channel, UK: manual versus automatic, Solid Earth, 11, 1773–1802,  <ext-link xlink:href="https://doi.org/10.5194/se-11-1773-2020" ext-link-type="DOI">10.5194/se-11-1773-2020</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bibx63"><?xmltex \def\ref@label{Weism{\"{u}}ller et~al.(2020)}?><label>Weismüller et al.(2020)</label><?label Weismueller2020b?><mixed-citation>Weismüller, C., Passchier, M., Urai, J., and Reicherter, K.: The fracture network in the Lilstock pavement, Bristol Channel, UK: digital elevation models and orthorectified mosaics created from unmanned aerial vehicle imagery, RWTH Publications,  <ext-link xlink:href="https://doi.org/10.18154/RWTH-2020-06903" ext-link-type="DOI">10.18154/RWTH-2020-06903</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bibx64"><?xmltex \def\ref@label{Whitaker and Engelder(2005)}?><label>Whitaker and Engelder(2005)</label><?label Whitaker2005?><mixed-citation>Whitaker, A. E. and Engelder, T.: Characterizing stress fields in the upper crust using joint orientation distributions, J. Struct. Geol., 27, 1778–1787,  <ext-link xlink:href="https://doi.org/10.1016/j.jsg.2005.05.016" ext-link-type="DOI">10.1016/j.jsg.2005.05.016</ext-link>, 2005.</mixed-citation></ref>
      <ref id="bib1.bibx65"><?xmltex \def\ref@label{Wierzcho\'{n} and K{\l}opotek(2018)}?><label>Wierzchoń and Kłopotek(2018)</label><?label Wierzchon2018?><mixed-citation>Wierzchoń, S. and Kłopotek, M.: Modern Algorithms of Cluster Analysis, vol. 34 of Studies in Big Data, Springer International Publishing, 1st edn.,  <ext-link xlink:href="https://doi.org/10.1007/978-3-319-69308-8" ext-link-type="DOI">10.1007/978-3-319-69308-8</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bibx66"><?xmltex \def\ref@label{Witherspoon(1986)}?><label>Witherspoon(1986)</label><?label Witherspoon1986?><mixed-citation>Witherspoon, P. A.: Flow of groundwater in fractured rocks, Bulletin of the International Association of Engineering Geology – Bulletin de l'Association Internationale de Géologie de l'Ingénieur, 34, 103–115,  <ext-link xlink:href="https://doi.org/10.1007/BF02590241" ext-link-type="DOI">10.1007/BF02590241</ext-link>, 1986.</mixed-citation></ref>
      <ref id="bib1.bibx67"><?xmltex \def\ref@label{Wyller(2019)}?><label>Wyller(2019)</label><?label Wyller2019?><mixed-citation>Wyller, F. A.: Spatio-temporal development of a joint network and its
properties: a case study from Lilstock, UK, MSc Thesis, <uri>https://hdl.handle.net/1956/20414</uri> (last access: 15 February 2021), 2019.</mixed-citation></ref>

  </ref-list></back>
    <!--<article-title-html>Investigating spatial heterogeneity within fracture networks using hierarchical clustering and graph distance metrics</article-title-html>
<abstract-html><p>Rock fractures organize as networks, exhibiting natural variation in their
spatial arrangements. Therefore, identifying, quantifying, and comparing
variations in spatial arrangements within network geometries are of interest
when explicit fracture representations or discrete fracture network models are
chosen to capture the influence of fractures on bulk rock behaviour. Treating
fracture networks as spatial graphs, we introduce a novel approach to quantify
spatial variation. The method combines graph similarity measures with
hierarchical clustering and is applied to investigate the spatial variation
within large-scale 2-D fracture networks digitized from the well-known Lilstock
limestone pavements, Bristol Channel, UK. We consider three large, fractured
regions, comprising nearly 300&thinsp;000 fractures spread over
14&thinsp;200&thinsp;m<sup>2</sup> from the Lilstock pavements.
Using a moving-window sampling approach, we first subsample the large networks
into subgraphs. Four graph similarity measures – fingerprint distance, D-measure,
Network Laplacian spectral descriptor (NetLSD), and portrait
divergence – that encapsulate topological relationships and geometry of fracture
networks are then used to compute pair-wise subgraph distances serving as input
for the statistical hierarchical clustering technique. In the form of hierarchical
dendrograms and derived spatial variation maps, the results indicate spatial
autocorrelation with localized spatial clusters that gradually vary over
distances of tens of metres with visually discernable and quantifiable boundaries.
Fractures within the identified clusters exhibit differences in fracture
orientations and topology. The comparison of graph similarity-derived
clusters with fracture persistence measures indicates an intra-network
spatial variation that is not immediately obvious from the ubiquitous fracture
intensity and density maps. The proposed method provides a quantitative way to
identify spatial variations in fracture networks, guiding stochastic and
geostatistical approaches to fracture network modelling.</p></abstract-html>
<ref-html id="bib1.bib1"><label>Andresen et al.(2013)</label><mixed-citation>
Andresen, C., Hansen, A., Le Goc, R., Davy, P., and Hope, S.: Topology of fracture networks, AIP Conf. Proc., 1, 7,  <a href="https://doi.org/10.3389/fphy.2013.00007" target="_blank">https://doi.org/10.3389/fphy.2013.00007</a>, 2013.
</mixed-citation></ref-html>
<ref-html id="bib1.bib2"><label>Bagrow and Bollt(2019)</label><mixed-citation>
Bagrow, J. P. and Bollt, E. M.: An information-theoretic, all-scales approach to comparing networks, Applied Network Science, 4, 45,  <a href="https://doi.org/10.1007/s41109-019-0156-x" target="_blank">https://doi.org/10.1007/s41109-019-0156-x</a>, 2019.
</mixed-citation></ref-html>
<ref-html id="bib1.bib3"><label>Bagrow et al.(2008)</label><mixed-citation>
Bagrow, J. P., Bollt, E. M., Skufca, J. D., and ben Avraham, D.: Portraits of complex networks, Europhys. Lett., 81, 68004,  <a href="https://doi.org/10.1209/0295-5075/81/68004" target="_blank">https://doi.org/10.1209/0295-5075/81/68004</a>, 2008.
</mixed-citation></ref-html>
<ref-html id="bib1.bib4"><label>Barthelemy(2018)</label><mixed-citation>
Barthelemy, M.: Morphogenesis of Spatial Networks, Lecture Notes in
Morphogenesis, Springer International Publishing, 2018 edn.,
<a href="https://doi.org/10.1007/978-3-319-20565-6" target="_blank">https://doi.org/10.1007/978-3-319-20565-6</a>, 2018.
</mixed-citation></ref-html>
<ref-html id="bib1.bib5"><label>Belayneh(2004)</label><mixed-citation>
Belayneh, M.: Palaeostress orientation inferred from surface morphology of joints on the southern margin of the Bristol Channel Basin, UK, pp. 243–255, 1, Geol. Soc. Sp., 231, 243–255, <a href="https://doi.org/10.1144/GSL.SP.2004.231.01.14" target="_blank">https://doi.org/10.1144/GSL.SP.2004.231.01.14</a>, 2004.
</mixed-citation></ref-html>
<ref-html id="bib1.bib6"><label>Belayneh and Cosgrove(2004)</label><mixed-citation>
Belayneh, M. and Cosgrove, J. W.: Fracture-pattern variations around a major fold and their implications regarding fracture prediction using limited data: an example from the Bristol Channel Basin, Geol. Soc. Sp., 31, 89–102,  <a href="https://doi.org/10.1144/GSL.SP.2004.231.01.06" target="_blank">https://doi.org/10.1144/GSL.SP.2004.231.01.06</a>, 2004.
</mixed-citation></ref-html>
<ref-html id="bib1.bib7"><label>Bemis et al.(2014)</label><mixed-citation>
Bemis, S. P., Micklethwaite, S., Turner, D., James, M. R., Akciz, S., Thiele, S. T., and Bangash, H. A.: Ground-based and UAV-Based photogrammetry: A multi-scale, high-resolution mapping tool for structural geology and paleoseismology, J. Struct. Geol., 69, 163–178,  <a href="https://doi.org/10.1016/j.jsg.2014.10.007" target="_blank">https://doi.org/10.1016/j.jsg.2014.10.007</a>, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib8"><label>Bianchi et al.(2020)</label><mixed-citation>
Bianchi, F. M., Grattarola, D., and Alippi, C.: Spectral Clustering with Graph Neural Networks for Graph Pooling, in: Proceedings of the 37th International Conference on Machine Learning, edited by: III, H. D. and Singh, A., vol. 119 of Proceedings of Machine Learning Research, pp. 874–883, PMLR, <a href="http://proceedings.mlr.press/v119/bianchi20a.html" target="_blank"/> (last access: 30 March 2021), 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib9"><label>Bisdom et al.(2017)</label><mixed-citation>
Bisdom, K., Nick, H. M., and Bertotti, G.: An integrated workflow for stress and flow modelling using outcrop-derived discrete fracture networks, Comput. Geosci., 103, 21–35,  <a href="https://doi.org/10.1016/j.cageo.2017.02.019" target="_blank">https://doi.org/10.1016/j.cageo.2017.02.019</a>, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib10"><label>Bistacchi et al.(2020)</label><mixed-citation>
Bistacchi, A., Mittempergher, S., Martinelli, M., and Storti, F.: On a new robust workflow for the statistical and spatial analysis of fracture data collected with scanlines (or the importance of stationarity), Solid Earth, 11, 2535–2547,  <a href="https://doi.org/10.5194/se-11-2535-2020" target="_blank">https://doi.org/10.5194/se-11-2535-2020</a>, 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib11"><label>Blondel et al.(2008)</label><mixed-citation>
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., and Lefebvre, E.: Fast unfolding of communities in large networks, J. Stat. Mech.-Theory E., 2008, P10008,  <a href="https://doi.org/10.1088/1742-5468/2008/10/p10008" target="_blank">https://doi.org/10.1088/1742-5468/2008/10/p10008</a>, 2008.
</mixed-citation></ref-html>
<ref-html id="bib1.bib12"><label>Bruna et al.(2019a)</label><mixed-citation>
Bruna, P., Prabhakaran, R., Bertotti, G., Straubhaar, J., Plateaux, R., Maerten, L., Mariethoz, G., and Meda, M.: The MPS-Based Fracture Network Simulation Method: Application to Subsurface Domain, 81st EAGE Conference and Exhibition, London 2019, 1–5,  <a href="https://doi.org/10.3997/2214-4609.201901679" target="_blank">https://doi.org/10.3997/2214-4609.201901679</a>, 2019a.
</mixed-citation></ref-html>
<ref-html id="bib1.bib13"><label>Bruna et al.(2019b)</label><mixed-citation>
Bruna, P.-O., Straubhaar, J., Prabhakaran, R., Bertotti, G., Bisdom, K., Mariethoz, G., and Meda, M.: A new methodology to train fracture network simulation using multiple-point statistics, Solid Earth, 10, 537–559,  <a href="https://doi.org/10.5194/se-10-537-2019" target="_blank">https://doi.org/10.5194/se-10-537-2019</a>, 2019b.
</mixed-citation></ref-html>
<ref-html id="bib1.bib14"><label>Dart et al.(1995)</label><mixed-citation>
Dart, C. J., McClay, K., and Hollings, P. N.: 3D analysis of inverted extensional fault systems, southern Bristol Channel basin, UK, Geol. Soc. Sp., 8, 393–413,  <a href="https://doi.org/10.1144/GSL.SP.1995.088.01.21" target="_blank">https://doi.org/10.1144/GSL.SP.1995.088.01.21</a>, 1995.
</mixed-citation></ref-html>
<ref-html id="bib1.bib15"><label>Dershowitz and Herda(1992)</label><mixed-citation>
Dershowitz, W. S. and Herda, H. H.: Interpretation of fracture spacing and intensity, in: The 33rd U.S Symposium on Rock Mechanics (USRMS), 3–5 June, Santa Fe, New Mexico, ARMA-92-0757, 1992.
</mixed-citation></ref-html>
<ref-html id="bib1.bib16"><label>Deutsch(2002)</label><mixed-citation>
Deutsch, C. V.: Geostatistical Reservoir Modeling, Oxford University Press,  1st edn., 2002.
</mixed-citation></ref-html>
<ref-html id="bib1.bib17"><label>Doolaeghe et al.(2020)</label><mixed-citation>
Doolaeghe, D., Davy, P., Hyman, J., and Darcel, C.: Graph-based flow modeling approach adapted to multiscale discrete-fracture-network models, Phys. Rev. E, 102, 53312,  <a href="https://doi.org/10.1103/PhysRevE.102.053312" target="_blank">https://doi.org/10.1103/PhysRevE.102.053312</a>, 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib18"><label>Emmert-Streib et al.(2016)</label><mixed-citation>
Emmert-Streib, F., Dehmer, M., and Shi, Y.: Fifty years of graph matching, network alignment and network comparison, Inform. Sciences, 346–347, 180–197,  <a href="https://doi.org/10.1016/j.ins.2016.01.074" target="_blank">https://doi.org/10.1016/j.ins.2016.01.074</a>, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib19"><label>Estrada and Sheerin(2017)</label><mixed-citation>
Estrada, E. and Sheerin, M.: Random neighborhood graphs as models of fracture networks on rocks: Structural and dynamical analysis, Appl. Math. Comput., 314, 360–379,  <a href="https://doi.org/10.1016/j.amc.2017.06.018" target="_blank">https://doi.org/10.1016/j.amc.2017.06.018</a>, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib20"><label>Everitt et al.(2011)</label><mixed-citation>
Everitt, B., Landau, S., Leese, M., and Stahl, D.: Cluster Analysis, Wiley Series in Probability and Statistics, Wiley, 2011.
</mixed-citation></ref-html>
<ref-html id="bib1.bib21"><label>Feng(2020)</label><mixed-citation>
Feng, M. H.: Topological tools forunderstanding complex systems, PhD thesis, UCLA, <a href="https://escholarship.org/uc/item/1t32m3z7" target="_blank"/>, 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib22"><label>Fiedler(1973)</label><mixed-citation>
Fiedler, M.: Algebraic connectivity of graphs, Czech. Math. J., 23, 298–305,  <a href="https://doi.org/10.21136/CMJ.1973.101168" target="_blank">https://doi.org/10.21136/CMJ.1973.101168</a>, 1973.
</mixed-citation></ref-html>
<ref-html id="bib1.bib23"><label>Gillespie et al.(1993)</label><mixed-citation>
Gillespie, P., Howard, C., Walsh, J., and Watterson, J.: Measurement and characterisation of spatial distributions of fractures, Tectonophysics, 226, 113–141,  <a href="https://doi.org/10.1016/0040-1951(93)90114-Y" target="_blank">https://doi.org/10.1016/0040-1951(93)90114-Y</a>, 1993.
</mixed-citation></ref-html>
<ref-html id="bib1.bib24"><label>Gillespie et al.(2011)</label><mixed-citation>
Gillespie, P. A., Monsen, E., Maerten, L., Hunt, D. W., Thurmond, J., and Tuck, D.: Fractures in Carbonates: From Digital Outcrops to Mechanical Models, vol. 10, pp. 137–147, SEPM Society for Sedimentary Geology, 2011st edn.,  <a href="https://doi.org/10.2110/sepmcsp.10.003" target="_blank">https://doi.org/10.2110/sepmcsp.10.003</a>, 2011.
</mixed-citation></ref-html>
<ref-html id="bib1.bib25"><label>Hartle et al.(2020)</label><mixed-citation>
Hartle, H., Klein, B., McCabe, S., Daniels, A., St-Onge, G., Murphy, C., and Hébert-Dufresne, L.: Network comparison and the within-ensemble graph distance, P. Roy. Soc. A-Math. Phy., 476, 20190744,  <a href="https://doi.org/10.1098/rspa.2019.0744" target="_blank">https://doi.org/10.1098/rspa.2019.0744</a>, 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib26"><label>Hennig et al.(2016)</label><mixed-citation>
Hennig, C., Meila, M., Murtagh, F., and Rocci, R.: Handbook of Cluster Analysis, Handbooks of Modern Statistical Methods, Chapman and Hall, CRC Press, 1st edn., 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib27"><label>Hooker and Katz(2015)</label><mixed-citation>
Hooker, J. N. and Katz, R. F.: Vein spacing in extending, layered rock: The effect of synkinematic cementation, Am. J. Sci., 315, 557–588,  <a href="https://doi.org/10.2475/06.2015.03" target="_blank">https://doi.org/10.2475/06.2015.03</a>, 2015.
</mixed-citation></ref-html>
<ref-html id="bib1.bib28"><label>Jelsma et al.(2004)</label><mixed-citation>
Jelsma, H. A., de Wit, M. J., Thiart, C., Dirks, P. H. G. M., Viola, G., Basson, I. J., and Anckar, E.: Preferential distribution along transcontinental corridors of kimberlites and related rocks of Southern Africa, S. Afr. J. Geol., 107, 301–324,  <a href="https://doi.org/10.2113/107.1-2.301" target="_blank">https://doi.org/10.2113/107.1-2.301</a>, 2004.
</mixed-citation></ref-html>
<ref-html id="bib1.bib29"><label>Kaufman(1990)</label><mixed-citation>
Kaufman, L.: Finding groups in data: an introduction to cluster analysis, Wiley Series in Probability and Statistics, Wiley, New York, 1990 edn.,  <a href="https://doi.org/10.1002/9780470316801" target="_blank">https://doi.org/10.1002/9780470316801</a>, 1990.
</mixed-citation></ref-html>
<ref-html id="bib1.bib30"><label>Laubach et al.(2018)</label><mixed-citation>
Laubach, S. E., Lamarche, J., Gauthier, B. D. M., Dunne, W. M., and Sanderson, D. J.: Spatial arrangement of faults and opening-mode fractures, J. Struct. Geol., 108, 2–15,  <a href="https://doi.org/10.1016/j.jsg.2017.08.008" target="_blank">https://doi.org/10.1016/j.jsg.2017.08.008</a>, 2018.
</mixed-citation></ref-html>
<ref-html id="bib1.bib31"><label>Laubach et al.(2019)</label><mixed-citation>
Laubach, S. E., Lander, R. H., Criscenti, L. J., Anovitz, L. M., Urai, J. L., Pollyea, R. M., Hooker, J. N., Narr, W., Evans, M. A., Kerisit, S. N., Olson, J. E., Dewers, T., Fisher, D., Bodnar, R., Evans, B., Dove, P., Bonnell, L. M., Marder, M. P., and Pyrak-Nolte, L.: The Role of Chemistry in Fracture Pattern Development and Opportunities to Advance Interpretations of Geological Materials, Rev. Geophys., 57, 1065–1111,  <a href="https://doi.org/10.1029/2019RG000671" target="_blank">https://doi.org/10.1029/2019RG000671</a>, 2019.
</mixed-citation></ref-html>
<ref-html id="bib1.bib32"><label>Lei et al.(2017)</label><mixed-citation>
Lei, Q., Latham, J.-P., Xiang, J., and Tsang, C.-F.: Role of natural fractures in damage evolution around tunnel excavation in fractured rocks, Eng. Geol., 231, 100–113,  <a href="https://doi.org/10.1016/j.enggeo.2017.10.013" target="_blank">https://doi.org/10.1016/j.enggeo.2017.10.013</a>, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib33"><label>Louf and Barthelemy(2014)</label><mixed-citation>
Louf, R. and Barthelemy, M.: A typology of street patterns, J. R. Soc. Interface, 11, 20140924,  <a href="https://doi.org/10.1098/rsif.2014.0924" target="_blank">https://doi.org/10.1098/rsif.2014.0924</a>, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib34"><label>Marrett et al.(2018)</label><mixed-citation>
Marrett, R., Gale, J. F., Gómez, L. A., and Laubach, S. E.: Correlation analysis of fracture arrangement in space, J. Struct. Geol., 108, 16–33,  <a href="https://doi.org/10.1016/j.jsg.2017.06.012" target="_blank">https://doi.org/10.1016/j.jsg.2017.06.012</a>, 2018.
</mixed-citation></ref-html>
<ref-html id="bib1.bib35"><label>Nelson(2001)</label><mixed-citation>
Nelson, R.: Geologic Analysis of Naturally Fractured Reservoirs, Gulf Professional Publishing, 2nd edn., 2001.
</mixed-citation></ref-html>
<ref-html id="bib1.bib36"><label>Newman(2002)</label><mixed-citation>
Newman, M. E. J.: Assortative Mixing in Networks, Phys. Rev. Lett., 89, 208701,  <a href="https://doi.org/10.1103/PhysRevLett.89.208701" target="_blank">https://doi.org/10.1103/PhysRevLett.89.208701</a>, 2002.
</mixed-citation></ref-html>
<ref-html id="bib1.bib37"><label>Newman and Girvan(2004)</label><mixed-citation>
Newman, M. E. J. and Girvan, M.: Finding and evaluating community structure in networks, Phys. Rev. E, 69, 026113,  <a href="https://doi.org/10.1103/PhysRevE.69.026113" target="_blank">https://doi.org/10.1103/PhysRevE.69.026113</a>, 2004.
</mixed-citation></ref-html>
<ref-html id="bib1.bib38"><label>Passchier et al.(2021)</label><mixed-citation>
Passchier, M., Passchier, C. W., Weismüller, C., and Urai, J. L.: The joint sets on the Lilstock Benches, U K. Observations based on mapping a full resolution UAV-based image, J. Struct. Geol.,  147, 104332, <a href="https://doi.org/10.1016/j.jsg.2021.104332" target="_blank">https://doi.org/10.1016/j.jsg.2021.104332</a>, 2021.
</mixed-citation></ref-html>
<ref-html id="bib1.bib39"><label>Peacock and Sanderson(1995)</label><mixed-citation>
Peacock, D. and Sanderson, D.: Strike-slip relay ramps, J. Struct. Geol., 17, 1351–1360,  <a href="https://doi.org/10.1016/0191-8141(95)97303-W" target="_blank">https://doi.org/10.1016/0191-8141(95)97303-W</a>, 1995.
</mixed-citation></ref-html>
<ref-html id="bib1.bib40"><label>Peacock et al.(2018)</label><mixed-citation>
Peacock, D., Sanderson, D., and Rotevatn, A.: Relationships between fractures, J. Struct. Geol., 106, 41–53,  <a href="https://doi.org/10.1016/j.jsg.2017.11.010" target="_blank">https://doi.org/10.1016/j.jsg.2017.11.010</a>, 2018.
</mixed-citation></ref-html>
<ref-html id="bib1.bib41"><label>Prabhakaran(2021)</label><mixed-citation>
Prabhakaran, R.: rahulprabhakaran/Fracture_Fingerprint,  <a href="https://doi.org/10.5281/zenodo.4699961" target="_blank">https://doi.org/10.5281/zenodo.4699961</a>, 2021.
</mixed-citation></ref-html>
<ref-html id="bib1.bib42"><label>Prabhakaran et al.(2019)</label><mixed-citation>
Prabhakaran, R., Bruna, P.-O., Bertotti, G., and Smeulders, D.: An automated fracture trace detection technique using the complex shearlet transform, Solid Earth, 10, 2137–2166,  <a href="https://doi.org/10.5194/se-10-2137-2019" target="_blank">https://doi.org/10.5194/se-10-2137-2019</a>, 2019.
</mixed-citation></ref-html>
<ref-html id="bib1.bib43"><label>Prabhakaran et al.(2021a)</label><mixed-citation>
Prabhakaran, R., Bertotti, G., Urai, J., and Smeulders, D.: Data Supplement: Fracture Subgraphs from the Lilstock Pavement, Bristol Channel, UK, 4TU Centre for Research Data. Dataset,  <a href="https://doi.org/10.4121/14405783.v1" target="_blank">https://doi.org/10.4121/14405783.v1</a>, 2021a.
</mixed-citation></ref-html>
<ref-html id="bib1.bib44"><label>Prabhakaran et al.(2021b)</label><mixed-citation>
Prabhakaran, R., Urai, J., Bertotti, G., Weismueller, C., and Smeulders, D.: Large-scale natural fracture network patterns: Insights from automated mapping in the Lilstock (Bristol Channel) limestone outcrops, J. Struct. Geol., 150, 104405, <a href="https://doi.org/10.1016/j.jsg.2021.104405" target="_blank">https://doi.org/10.1016/j.jsg.2021.104405</a>, 2021b.
</mixed-citation></ref-html>
<ref-html id="bib1.bib45"><label>Priest and Hudson(1976)</label><mixed-citation>
Priest, S. and Hudson, J.: Discontinuity spacings in rock, Int. J. Rock Mech. Min., 13, 135–148,  <a href="https://doi.org/10.1016/0148-9062(76)90818-4" target="_blank">https://doi.org/10.1016/0148-9062(76)90818-4</a>, 1976.
</mixed-citation></ref-html>
<ref-html id="bib1.bib46"><label>Procter and Sanderson(2018)</label><mixed-citation>
Procter, A. and Sanderson, D. J.: Spatial and layer-controlled variability in fracture networks, J. Struct. Geol., 108, 52–65,  <a href="https://doi.org/10.1016/j.jsg.2017.07.008" target="_blank">https://doi.org/10.1016/j.jsg.2017.07.008</a>, 2018.
</mixed-citation></ref-html>
<ref-html id="bib1.bib47"><label>Rawnsley et al.(1998)</label><mixed-citation>
Rawnsley, K., Peacock, D., Rives, T., and Petit, J.-P.: Joints in the Mesozoic sediments around the Bristol Channel Basin, J. Struct. Geol., 20, 1641–1661,  <a href="https://doi.org/10.1016/S0191-8141(98)00070-4" target="_blank">https://doi.org/10.1016/S0191-8141(98)00070-4</a>, 1998.
</mixed-citation></ref-html>
<ref-html id="bib1.bib48"><label>Sanderson and Nixon(2015)</label><mixed-citation>
Sanderson, D. J. and Nixon, C. W.: The use of topology in fracture network characterization, J. Struct. Geol., 72, 55–66,  <a href="https://doi.org/10.1016/j.jsg.2015.01.005" target="_blank">https://doi.org/10.1016/j.jsg.2015.01.005</a>, 2015.
</mixed-citation></ref-html>
<ref-html id="bib1.bib49"><label>Sanderson et al.(2019)</label><mixed-citation>
Sanderson, D. J., Peacock, D. C., Nixon, C. W., and Rotevatn, A.: Graph theory and the analysis of fracture networks, J. Struct. Geol., 125, 155–165,  <a href="https://doi.org/10.1016/j.jsg.2018.04.011" target="_blank">https://doi.org/10.1016/j.jsg.2018.04.011</a>, back to the future, 2019.
</mixed-citation></ref-html>
<ref-html id="bib1.bib50"><label>Schieber et al.(2017)</label><mixed-citation>
Schieber, T. A., Carpi, L., Díaz-Guilera, A., Pardalos, P. M., Masoller, C., and Ravetti, M. G.: Quantification of network structural dissimilarities, Nat. Commun., 8, 13928,  <a href="https://doi.org/10.1038/ncomms13928" target="_blank">https://doi.org/10.1038/ncomms13928</a>, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib51"><label>Spielman and Teng(2007)</label><mixed-citation>
Spielman, D. A. and Teng, S.-H.: Spectral partitioning works: Planar graphs and finite element meshes, Linear Algebra Appl., 421, 284–305,  <a href="https://doi.org/10.1016/j.laa.2006.07.020" target="_blank">https://doi.org/10.1016/j.laa.2006.07.020</a>, 2007.
</mixed-citation></ref-html>
<ref-html id="bib1.bib52"><label>Tantardini et al.(2019)</label><mixed-citation>
Tantardini, M., Ieva, F., Tajoli, L., and Piccardi, C.: Comparing methods for comparing networks, Sci. Rep.-UK, 9, 17557,  <a href="https://doi.org/10.1038/s41598-019-53708-y" target="_blank">https://doi.org/10.1038/s41598-019-53708-y</a>, 2019.
</mixed-citation></ref-html>
<ref-html id="bib1.bib53"><label>Thovert et al.(2017)</label><mixed-citation>
Thovert, J.-F., Mourzenko, V., and Adler, P.: Percolation in three-dimensional fracture networks for arbitrary size and shape distributions, Phys. Rev. E, 95, 042112,  <a href="https://doi.org/10.1103/PhysRevE.95.042112" target="_blank">https://doi.org/10.1103/PhysRevE.95.042112</a>, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib54"><label>Traag et al.(2019)</label><mixed-citation>
Traag, V. A., Waltman, L., and van Eck, N. J.: From Louvain to Leiden: guaranteeing well-connected communities, Sci. Rep.-UK, 9, 5233,  <a href="https://doi.org/10.1038/s41598-019-41695-z" target="_blank">https://doi.org/10.1038/s41598-019-41695-z</a>, 2019.
</mixed-citation></ref-html>
<ref-html id="bib1.bib55"><label>Tsitsulin et al.(2018)</label><mixed-citation>
Tsitsulin, A., Mottin, D., Karras, P., Bronstein, A., and Müller, E.: NetLSD: Hearing the Shape of a Graph, in: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '18, 2018.
</mixed-citation></ref-html>
<ref-html id="bib1.bib56"><label>Tsitsulin et al.(2020)</label><mixed-citation>
Tsitsulin, A., Palowitch, J., Perozzi, B., and Müller, E.: Graph Clustering with Graph Neural Networks, <a href="https://arxiv.org/abs/2006.16904" target="_blank"/> (last access: 15 January 2021), 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib57"><label>Valentini et al.(2007)</label><mixed-citation>
Valentini, L., Perugini, D., and Poli, G.: The “small-world” topology of rock fracture networks, Physica A, 377, 323–328,  <a href="https://doi.org/10.1016/j.physa.2006.11.025" target="_blank">https://doi.org/10.1016/j.physa.2006.11.025</a>, 2007.
</mixed-citation></ref-html>
<ref-html id="bib1.bib58"><label>Van Steen(2010)</label><mixed-citation>
Van Steen, M.: Graph Theory and Complex Networks: An Introduction, 1st edn.,
2010.
</mixed-citation></ref-html>
<ref-html id="bib1.bib59"><label>Vevatne et al.(2014)</label><mixed-citation>
Vevatne, J. N., Rimstad, E., Hope, S. M., Korsnes, R., and Hansen, A.: Fracture networks in sea ice, AIP Conf. Proc., 2, 21,  <a href="https://doi.org/10.3389/fphy.2014.00021" target="_blank">https://doi.org/10.3389/fphy.2014.00021</a>, 2014.

</mixed-citation></ref-html>
<ref-html id="bib1.bib60"><label>Vidal et al.(2017)</label><mixed-citation>
Vidal, J., Genter, A., and Chopin, F.: Permeable fracture zones in the hard rocks of the geothermal reservoir at Rittershoffen, France, J. Geophys. Res.-Sol. Ea., 122, 4864–4887,  <a href="https://doi.org/10.1002/2017JB014331" target="_blank">https://doi.org/10.1002/2017JB014331</a>, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib61"><label>Wang and Hudson(2015)</label><mixed-citation>
Wang, J. S. Y. and Hudson, J. A.: Fracture Flow and Underground Research Laboratories for Nuclear Waste Disposal and Physics Experiments, chap. 2, pp. 19–41, American Geophysical Union (AGU),  <a href="https://doi.org/10.1002/9781118877517.ch2" target="_blank">https://doi.org/10.1002/9781118877517.ch2</a>, 2015.
</mixed-citation></ref-html>
<ref-html id="bib1.bib62"><label>Weismüller et al.(2020)</label><mixed-citation>
Weismüller, C., Prabhakaran, R., Passchier, M., Urai, J. L., Bertotti, G., and Reicherter, K.: Mapping the fracture network in the Lilstock pavement, Bristol Channel, UK: manual versus automatic, Solid Earth, 11, 1773–1802,  <a href="https://doi.org/10.5194/se-11-1773-2020" target="_blank">https://doi.org/10.5194/se-11-1773-2020</a>, 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib63"><label>Weismüller et al.(2020)</label><mixed-citation>
Weismüller, C., Passchier, M., Urai, J., and Reicherter, K.: The fracture network in the Lilstock pavement, Bristol Channel, UK: digital elevation models and orthorectified mosaics created from unmanned aerial vehicle imagery, RWTH Publications,  <a href="https://doi.org/10.18154/RWTH-2020-06903" target="_blank">https://doi.org/10.18154/RWTH-2020-06903</a>, 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib64"><label>Whitaker and Engelder(2005)</label><mixed-citation>
Whitaker, A. E. and Engelder, T.: Characterizing stress fields in the upper crust using joint orientation distributions, J. Struct. Geol., 27, 1778–1787,  <a href="https://doi.org/10.1016/j.jsg.2005.05.016" target="_blank">https://doi.org/10.1016/j.jsg.2005.05.016</a>, 2005.
</mixed-citation></ref-html>
<ref-html id="bib1.bib65"><label>Wierzchoń and Kłopotek(2018)</label><mixed-citation>
Wierzchoń, S. and Kłopotek, M.: Modern Algorithms of Cluster Analysis, vol. 34 of Studies in Big Data, Springer International Publishing, 1st edn.,  <a href="https://doi.org/10.1007/978-3-319-69308-8" target="_blank">https://doi.org/10.1007/978-3-319-69308-8</a>, 2018.
</mixed-citation></ref-html>
<ref-html id="bib1.bib66"><label>Witherspoon(1986)</label><mixed-citation>
Witherspoon, P. A.: Flow of groundwater in fractured rocks, Bulletin of the International Association of Engineering Geology – Bulletin de l'Association Internationale de Géologie de l'Ingénieur, 34, 103–115,  <a href="https://doi.org/10.1007/BF02590241" target="_blank">https://doi.org/10.1007/BF02590241</a>, 1986.
</mixed-citation></ref-html>
<ref-html id="bib1.bib67"><label>Wyller(2019)</label><mixed-citation>
Wyller, F. A.: Spatio-temporal development of a joint network and its
properties: a case study from Lilstock, UK, MSc Thesis, <a href="https://hdl.handle.net/1956/20414" target="_blank"/> (last access: 15 February 2021), 2019.
</mixed-citation></ref-html>--></article>
