Related papers: Fractal curves from prime trigonometric series
We derive exact statistical properties of a class of recursive fragmentation processes. We show that introducing a fragmentation probability 0<p<1 leads to a purely algebraic size distribution in one dimension, P(x) ~ x^{-2p}. In d…
Properties of the set $T_s$ of "particularly non-normal numbers" of the unit interval are studied in details ($T_s$ consists of real numbers $x$, some of whose s-adic digits have the asymptotic frequencies in the nonterminating $s-$ adic…
If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…
We numerically investigate the electric potential distribution over a two-dimensional continuum percolation model between the electrodes. The model consists of overlapped conductive particles on the background with an infinitesimal…
A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is…
We generalize the fractional Caputo derivative to the fractional derivative ${^CD^{\alpha,\beta}_{\gamma}}$, which is a convex combination of the left Caputo fractional derivative of order $\alpha$ and the right Caputo fractional derivative…
In this paper we analyse random walk on a fractal structure, specifi- cally fractal curves, using the recently develped calculus for fractal curves. We consider only unbiased random walk on the fractal stucture and find out the…
Let $G$ be a chordal graph and $I(G)$ its edge ideal. Let $\beta (I(G)) = (\beta_0, \beta_1, ..., \beta_p)$ denote the Betti sequence of $I(G)$, where $\beta_i$ stands for the $i$th total Betti number of $I(G)$ and where $p$ is the…
We consider the {\it fractal von Neumann entropy} associated with the {\it fractal distribution function} and we obtain for some {\it universal classes h of fractons} their entropies. We obtain also for each of these classes a {\it…
We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…
We use well resolved numerical simulations with the Lattice Boltzmann Method to study Rayleigh-B\'enard convection in cells with a fractal boundary in two dimensions for $Pr = 1$ and $Ra \in \left[10^7, 10^{10}\right]$. The fractal…
The variability of temporal (or spatial) fluctuations of any variable is represented in conventional statistical theory by the relative dispersion equal to the standard deviation divided by the mean . The Relative Dispersion decreases with…
We determine the scaling properties of geometric operators such as lengths, areas, and volumes in models of higher derivative quantum gravity by renormalizing appropriate composite operators. We use these results to deduce the fractal…
Fractal percolation exhibits a dramatic topological phase transition, changing abruptly from a dust-like set to a system spanning cluster. The transition points are unknown and difficult to estimate. In many classical percolation models the…
In this paper, random and stochastic processes are defined on fractal curves. Fractal calculus is used to define cumulative distribution function, probability density function, moments, variance and correlation function of stochastic…
One of the most well known random fractals is the so-called Fractal percolation set. This is defined as follows: we divide the unique cube in $\mathbb{R}^d$ into $M^d$ congruent sub-cubes. For each of these cubes a certain retention…
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…
For a sequence p=(p(1),p(2), ...) let G(n,p) denote the random graph with vertex set {1,2, ...,n} in which two vertices i, j are adjacent with probability p(|i-j|), independently for each pair. We study how the convergence of probabilities…
This paper is concerned mainly with the macroscopic fractal behavior of various random sets that arise in modern and classical probability theory. Among other things, it is shown here that the macroscopic behavior of Boolean coverage…
Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most $m$ particles per site. We investigate the convergence of weak and strong…