相关论文: Random fractals and tree-indexed Markov chains
Fractals represent one of the fundamental manifestations of complexity, and fractal networks serve as tools for characterizing and investigating the fractal structures and properties of large-scale systems. Higher-order networks have…
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 calculate the almost sure dimension for a general class of random affine code tree fractals in $\mathbb R^d$. The result is based on a probabilistic version of the Falconer-Sloan condition $C(s)$ introduced in \cite{FS}. We verify that,…
We study random walks on a family of treelike regular fractals with a trap fixed on a central node. We obtain all the eigenvalues and their corresponding multiplicities for the associated stochastic master equation, with the eigenvalues…
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…
We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…
\emph{Fractal percolation} or \emph{Mandelbrot percolation} is one of the most well studied families of random fractals. In this paper we study some of the geometric measure theoretical properties (dimension of projections and structure of…
We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…
Cohesive particles form agglomerates that are usually very porous. Their geometry, particularly their fractal dimension, depends on the agglomeration process (diffusion-limited or ballistic growth by adding single particles or…
Data series generated by complex systems exhibit fluctuations on many time scales and/or broad distributions of the values. In both equilibrium and non-equilibrium situations, the natural fluctuations are often found to follow a scaling…
We take on a Random Matrix theory viewpoint to study the spectrum of certain reversible Markov chains in random environment. As the number of states tends to infinity, we consider the global behavior of the spectrum, and the local behavior…
We show that when the standard techniques for calculating fractal dimensions in empirical data (such as the box counting) are applied on uniformly random structures, apparent fractal behavior is observed in a range between physically…
In this paper, we construct a new family of random series defined on $\R^D$, indexed by one scaling parameter and two Hurst-like exponents. The model is close to Takagi-Knopp functions, save for the fact that the underlying partitions of…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…
We study the porosity properties of fractal percolation sets $E\subset\mathbb{R}^d$. Among other things, for all $0<\varepsilon<\tfrac12$, we obtain dimension bounds for the set of exceptional points where the upper porosity of $E$ is less…
Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…
This is a survey paper about the fractal percolation process, also known as Mandelbrot percolation. It is intended to give a general breadth overview of more recent research in the topic, but also includes some of the more classical…
Dynamical systems in nature exhibit selfsimilar fractal fluctuations and the corresponding power spectra follow inverse power law form signifying long-range space-time correlations identified as self-organized criticality. The physics of…
Random critical branching trees (CBTs) are generated by the multiplicative branching process, where the branching number is determined stochastically, independent of the degree of their ancestor. Here we show analytically that despite this…