Related papers: Fractal percolation on statistically self-affine c…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
We study the diffusion front for a natural two-dimensional model where many particles starting at the origin diffuse independently. It turns out that this model can be described using properties of near-critical percolation, and provides a…
For a spatial characteristic, there exist commonly fat-tail frequency distributions of fragment-size and -mass of glass, areas enclosed by city roads, and pore size/volume in random packings. In order to give a new analytical approach for…
We study a stochastic compartmental susceptible-infected (SI) epidemic process on a configuration model random graph with a given degree distribution over a finite time interval $[0,T],$ for some $ T>0$. In this setting, we split the…
We study here the small-angle scattering structure factor for deterministic fat fractals in the reciprocal space. It is shown that fat fractals are exact self-similar in the range of iterations having the same values of the scaling factor,…
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…
For self-similar fractals, the Minkowski content and fractal curvature have been introduced as a suitable limit of the geometric characteristics of its parallel sets, i.e., of uniformly thin coatings of the fractal. For some self-conformal…
Fractal geometry, defined by self-similar patterns across scales, is crucial for understanding natural structures. This work addresses the fractal inverse problem, which involves extracting fractal codes from images to explain these…
We consider several different models for generating random fractals including random self-similar sets, random self-affine carpets, and fractal percolation. In each setting we compute either the \emph{almost sure} or the \emph{Baire…
We explore a bond percolation model on slabs $\mathbb{S}^+_k=\mathbb{Z}_+\times \mathbb{Z}_+\times\{0,\dots,k\}$ featuring one-dimensional inhomogeneities. In this context, a vertical column on the slab comprises the set of vertical edges…
We develop a multifractal random tilling that fills the square. The multifractal is formed by an arrangement of rectangular blocks of different sizes, areas and number of neighbors. The overall feature of the tilling is an heterogeneous and…
Spectral clustering is discussed from many perspectives, by extending it to rectangular arrays and discrepancy minimization too. Near optimal clusters are obtained with singular value decomposition and with the weighted $k$-means algorithm.…
We introduce a framework for constructing fractal trees via analytic generator fields, replacing discrete affine transformations and symbolic rewriting rules by the integration of smooth vector fields in an internal state space. In this…
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…
An important problem in the analysis of experimental data showing fractal properties, is that such samples are composed by a set of points limited by an upper and a lower cut off. We study how finite size effect due to the discreteness of…
We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…
A pair of complementary algorithms are presented. One of the pair is a fast method for connecting graphs with an edge. The other is a fast method for removing edges from a graph. Both algorithms employ the same tree based graph…
The basic object we consider is a certain model of continuum random tree, called the stable tree. We construct a fragmentation process $(F^-(t), t>=0)$ out of this tree by removing the vertices located under height $t$. Thanks to a…
We compute the almost sure Hausdorff dimension of random self-affine sponges in $\mathbb{R}^d$ without imposing any separation conditions. In this context, randomness arises from the matrices in the defining semigroup, which are random yet…
We consider a class of random self-similar fractals based on code trees which includes random recursive, homogeneous and V-variable fractals and many more. For such random fractals we consider mean values of the Lipschitz-Killing curvatures…