Related papers: Fracturing ranked surfaces
This paper proposes a new method to analyze the spatial structure of urban systems using ideas from fractals. Regarding a system of cities as a set of "particles" distributed randomly on a triangular lattice, we construct a spatial…
Based on a large dataset containing thousands of real-world networks ranging from genetic, protein interaction, and metabolic networks to brain, language, ecology, and social networks we search for defining structural measures of the…
Non-integer dimensionality is central to fractal and complex systems, yet it is rarely represented as an explicit lattice on which classical statistical-mechanical models can be directly simulated. Here we introduce random-h fractional…
Hausdorff dimension of level sets of generic continuous functions defined on fractals can give information about the "thickness/narrow cross-sections" "network" corresponding to a fractal set, $F$. This lead to the definition of the…
We study the effect of heterogeneous load sharing in the fiber bundle models of fracture. The system is divided into two groups of fibers (fraction $p$ and $1-p$) in which one group follow the completely local load sharing mechanism and the…
Multiple resolution analysis of two dimensional structures composed of randomly adsorbed penetrable rods, for densities below the percolation threshold, has been carried out using box-counting functions. It is found that at relevant…
We show that a length scale xi can be extracted from the spatial correlations of the "steep cliffs" that appear on fracture surface. Above xi, the slope amplitudes are uncorrelated and the fracture surface is mono-affine. Below xi,…
The critical behaviour of correlation functions near a boundary is modified from that in the bulk. When the boundary is smooth this is known to be characterised by the surface scaling dimension $\xt$. We consider the case when the boundary…
Formation and fragmentation of networks is typically studied using percolation theory, but most previous research has been restricted to studying a phase transition in cluster size, examining the emergence of a giant component. This…
We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…
We consider the fragmentation process with mass loss and discuss self-similar properties of the arising structure both in time and space, focusing on dimensional analysis. This exhibits a spectrum of mass exponents $\theta$, whose exact…
Models of percolation processes on networks currently assume locally tree-like structures at low densities, and are derived exactly only in the thermodynamic limit. Finite size effects and the presence of short loops in real systems however…
The model of random interlacements on Z^d, d bigger or equal to 3, was recently introduced in arXiv:0704.2560. A non-negative parameter u parametrizes the density of random interlacements on Z^d. In the present note we investigate the…
We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…
Geodesic coalescence, or the tendency of geodesics to merge together, is a hallmark phenomenon observed in a variety of planar random geometries involving a random distortion of the Euclidean metric. As a result of this, the union of…
The fractal dimension of domain walls produced by changing the boundary conditions from periodic to anti-periodic in one spatial direction is studied using both the strong-disorder renormalization group and the greedy algorithm for the…
Self-similarity is a property of fractal structures, a concept introduced by Mandelbrot and one of the fundamental mathematical results of the 20th century. The importance of fractal geometry stems from the fact that these structures were…
Motivated by a $2$-dimensional (unsupervised) image segmentation task whereby local regions of pixels are clustered via edge detection methods, a more general probabilistic mathematical framework is devised. Critical thresholds are…
We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…
In this paper we define a new class of weighted complex networks sharing several properties with fractal sets, and whose topology can be completely analytically characterized in terms of the involved parameters and of the fractal dimension.…