Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis
From MaRDI portal
Publication:1740109
DOI10.1016/j.amc.2017.06.018zbMath1426.74222arXiv1607.06678OpenAlexW2485049930MaRDI QIDQ1740109
Matthew Sheerin, Ernesto Estrada
Publication date: 29 April 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.06678
Random graphs (graph-theoretic aspects) (05C80) Brittle fracture (74R10) Soil and rock mechanics (74L10)
Cites Work
- Unnamed Item
- Unnamed Item
- The communicability distance in graphs
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Discrete fracture model for coupled flow and geomechanics
- Spektren endlicher Grafen
- Stochastic fracture propagation modelling for enhanced geothermal systems
- The relative neighbourhood graph of a finite planar set
- Eigenvalues, diameter, and mean distance in graphs
- Flow control of fluids through porous media
- Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case
- Communicability Angle and the Spatial Efficiency of Networks
- Geometry and topology of fracture systems
- Collective dynamics of ‘small-world’ networks
This page was built for publication: Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis