Related papers: Fracturing ranked surfaces
The Rauzy fractal is a domain in the two-dimensional plane constructed by the Rauzy substitution, a substitution rule on three letters. The Rauzy fractal has a fractal-like boundary, and the currently known its constructions is not only for…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
Analysis and modeling of networked objects are fundamental pieces of modern data mining. Most real-world networks, from biological to social ones, are known to have common structural properties. These properties allow us to model the growth…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
We study site percolation on uniform quadrangulations of the upper half plane. The main contribution is a method for applying Angel's peeling process, in particular for analyzing an evolving boundary condition during the peeling. Our method…
Road networks are characterised by several structural and geometric properties. Their topological structure determines partially its hierarchical arrangement, but since these are networks that are spatially situated and, therefore,…
Fractal geometries, characterized by self-similar patterns and non-integer dimensions, provide an intriguing platform for exploring topological phases of matter. In this work, we introduce a theoretical framework that leverages isospectral…
We study loop erased random walk (LERW) on the percolation cluster, with occupation probability $p\geq p_c$, in two and three dimensions. We find that the fractal dimensions of LERW$_p$ is close to normal LERW in Euclidean lattice, for all…
The fractal and self-similarity properties are revealed in many real complex networks. However, the classical information dimension of complex networks is not practical for real complex networks. In this paper, a new information dimension…
In this brief report, we present a disordered version of recursive networks. Depending on the structural parameters $u$ and $v$, the networks are either fractals with a finite fractal dimension $d_{f}$ or transfinite fractals (transfractal)…
This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, the adjacent sites are not equidistant. Starting with an undistorted lattice, the position of the lattice sites are shifted through a tunable…
A numerical study of the transfer across random fractal surfaces shows that their responses are very close to the response of deterministic model geometries with the same fractal dimension. The simulations of several interfaces with…
Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…
In this paper we define and study self-similar ranked fragmentations. We first show that any ranked fragmentation is the image of some partition-valued fragmentation, and that there is in fact a one-to-one correspondence between the laws of…
We introduce bridge trisections of knotted surfaces in the four-sphere. This description is inspired by the work of Gay and Kirby on trisections of four-manifolds and extends the classical concept of bridge splittings of links in the…
The urban networks of London and New York City are investigated as directed graphs within the paradigm of graph percolation. It has been recently observed that urban networks show a critical percolation transition when a fraction of edges…
Multilayer infrastructure is often interdependent, with nodes in one layer depending on nearby nodes in another layer to function. The links in each layer are often of limited length, due to the construction cost of longer links. Here, we…
The spatial coverage produced by a single discrete-time random walk, with asymmetric jump probability $p\neq 1/2$ and non-uniform steps, moving on an infinite one-dimensional lattice is investigated. Analytical calculations are complemented…
Fractal percolation has been introduced by Mandelbrot in 1974. We study the two-dimensional case, with integer subdivision index M and survival probability p. It is well known that there exists a non-trivial critical value p_c(M) such that…
In the parameter spaces of nonlinear dynamical systems, we investigate the boundaries between periodicity and chaos and unveil the existence of fractal sets characterized by a singular fractal dimension. This dimension stands out from the…