Related papers: Fracturing ranked surfaces
Fractal dimension is central to understanding dynamical processes occurring on networks; however, the relation between fractal dimension and random walks on fractal scale-free networks has been rarely addressed, despite the fact that such…
The fractal dimension of minimal spanning trees on percolation clusters is estimated for dimensions $d$ up to $d=5$. A robust analysis technique is developed for correlated data, as seen in such trees. This should be a robust method…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
The main goal of this paper has a double purpose. On the one hand, we propose a new definition in order to compute the fractal dimension of a subset respect to any fractal structure, which completes the theory of classical box-counting…
We are interested in the cycles obtained by slicing at all heights random Boltzmann triangulations with a simple boundary. We establish a functional invariance principle for the lengths of these cycles, appropriately rescaled, as the size…
In this article, we present a novel box-covering algorithm for analyzing the fractal properties of complex networks. Unlike traditional algorithms that impose a predetermined box size, our approach assigns nodes to boxes identified by their…
A single protein molecule is regarded as a contact network of amino-acid residues. Some studies have indicated that this network is a small world network (SWN), while other results have implied that this is a fractal network (FN). However,…
We define a class of random measures, spatially independent martingales, which we view as a natural generalisation of the canonical random discrete set, and which includes as special cases many variants of fractal percolation and Poissonian…
The fractal nature of complex networks has received a great deal of research interest in the last two decades. Similarly to geometric fractals, the fractality of networks can also be defined with the so-called box-covering method. A network…
We study the mutual percolation of two interdependent lattice networks ranging from two to seven dimensions, denoted as $D$. We impose that the length of interdependent links connecting nodes in the two lattices be less than or equal to a…
The fractal properties of four-dimensional Euclidean simplicial manifold generated by the dynamical triangulation are analyzed on the geodesic distance D between two vertices instead of the usual scale between two simplices. In order to…
Several fundamental properties of real complex networks, such as the small-world effect, the scale-free degree distribution, and recently discovered topological fractal structure, have presented the possibility of a unique growth mechanism…
This article presents a Monte Carlo study on bond percolation in distorted square and triangular lattices. The distorted lattices are generated by dislocating the sites from their regular positions. The amount and direction of the…
Real world networks have, for a long time, been modelled by scale-free networks, which have many sparsely connected nodes and a few highly connected ones (the hubs). However, both in society and in biology, a new structure must be…
We use a new algorithm to find the stress-carrying backbone of ``generic'' site-diluted triangular lattices of up to 10^6 sites. Generic lattices can be made by randomly displacing the sites of a regular lattice. The percolation threshold…
Topological Data Analysis (TDA) uses insights from topology to create representations of data able to capture global and local geometric and topological properties. Its methods have successfully been used to develop estimations of fractal…
We analyze the connectivity of an $M$-layer network over a common set of nodes that are active only in a fraction of the layers. Each layer is assumed to be a subgraph (of an underlying connectivity graph $G$) induced by each node being…
Real networks can be classified into two categories: fractal networks and non-fractal networks. Here we introduce a unifying model for the two types of networks. Our model network is governed by a parameter $q$. We obtain the topological…
This paper provides a new model to compute the fractal dimension of a subset on a generalized-fractal space. Recall that fractal structures are a perfect place where a new definition of fractal dimension can be given, so we perform a…
We introduce a simple geometric model which describes the kinetics of fragmentation of d-dimensional objects. In one dimension our model coincides with the random scission model and show a simple scaling behavior in the long-time limit. For…