Related papers: Fracturing ranked surfaces
We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…
The effect of geometry and morphology of superconducting structure on magnetic flux trapping is considered. It is found that the clusters of normal phase, which act as pinning centers, have significant fractal properties. The fractal…
Covering a network with the minimum possible number of boxes can reveal interesting features for the network structure, especially in terms of self-similar or fractal characteristics. Considerable attention has been recently devoted to this…
Fracture paths in quasi-two-dimenisonal (2D) media (e.g thin layers of materials, paper) are analyzed as self-affine graphs $h(x)$ of height $h$ as a function of length $x$. We show that these are multiscaling, in the sense that $n^{th}$…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
Basins generated by a noninvertible mapping formed by two symmetrically coupled logistic maps are studied when the only parameter \lambda of the system is modified. Complex patterns on the plane are visualised as a consequence of basins'…
Starting from the working hypothesis that both physics and the corresponding mathematics have to be described by means of discrete concepts on the Planck-scale, one of the many problems one has to face in this enterprise is to find the…
Hierarchical networks actually have many applications in the real world. Firstly, we propose a new class of hierarchical networks with scale-free and fractal structure, which are the networks with triangles compared to traditional…
We consider a random self-affine carpet $F$ based on an $n\times m$ subdivision of rectangles and a probability $0<p<1$. Starting by dividing $[0,1]^2$ into an $n\times m$ grid of rectangles and selecting these independently with…
The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small world property of real…
A class of simplified measures is constructed to capture the key features of generic spatio-temporally chaotic systems. A combined analytical and numerical investigation allows us to extablish the scaling beahviour of the fractal dimension…
In the presented article, statistical properties regarding the topology and standard percolation on relative neighborhood graphs (RNGs) for planar sets of points, considering the Euclidean metric, are put under scrutiny. RNGs belong to the…
The existence (or not) of infinite clusters is explored for two stochastic models of intersecting line segments in $d \ge 2$ dimensions. Salient features of the phase diagram are established in each case. The models are based on site…
The fractal structure of directed percolation clusters, grown at the percolation threshold inside parabolic-like systems, is studied in two dimensions via Monte Carlo simulations. With a free surface at y=\pm Cx^k and a dynamical exponent…
Although geographic features, such as mountains and coastlines, are fractal, some studies have claimed that the fractal property is not universal. This claim, which is false, is mainly attributed to the strict definition of fractal…
We consider a network, bonds of which are being sequentially removed; that is done at random, but conditioned on the system remaining connected (Self-Repairing Bond Percolation SRBP). This model is the simplest representative of a class of…
The stacked triangular lattice has the shape of a triangular prism. In spite of being considered frequently in solid state physics and materials science, its percolation properties have received few attention. We investigate several…
Recently [L. Lacasa and J. G\'omez-Garde\~nes, Phys. Rev. Lett. {\bf 110}, 168703 (2013)], a fractal dimension has been proposed to characterize the geometric structure of networks. This measure is an extension to graphs of the so called…
We study critical bond percolation on a seven-dimensional (7D) hypercubic lattice with periodic boundary conditions and on the complete graph (CG) of finite volume $V$. We numerically confirm that for both cases, the critical number density…
We propose a statistical model defined on the three-dimensional diamond network where the splitting of randomly selected nodes leads to a spatially disordered network, with decreasing degree of connectivity. The terminal state, that is…