Related papers: Random fractals and tree-indexed Markov chains
We consider random processes that are history-dependent, in the sense that the distribution of the next step of the process at any time depends upon the entire past history of the process. In general, therefore, the Markov property cannot…
We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…
We review a recent development at the interface between discrete mathematics on one hand and probability theory and statistics on the other, specifically the use of Markov chains and their boundary theory in connection with the asymptotics…
Random percolation can be fully interpreted as a confining pure gauge theory. With numerical high-precision measurements of Polyakov-Polyakov correlators at finite temperature, we could well observe the presence of shape effects due to…
Selfsimilar space-time fractal fluctuations are generic to dynamical systems in nature such as atmospheric flows, heartbeat patterns, population dynamics, etc. The physics of the long-range correlations intrinsic to fractal fluctuations is…
We investigate the geometry of the critical fluctuations for a general system undergoing a thermal second order phase transition. Adopting a generalized effective action for the local description of the fluctuations of the order parameter…
A multifractal model is used to analyze neutron evolution within a reactor. For chain reactions, various characteristics of multifractal neutron behavior have been determined. These include the dimension of the multifractal carrier,…
We show the density theorem for the class of finite oriented trees ordered by the homomorphism order. We also show that every interval of oriented trees, in addition to be dense, is in fact universal. We end by considering the fractal…
The distribution of masses of clusters smaller than the infinite cluster is evaluated at the percolation threshold. The clusters are ranked according to their masses and the distribution $P(M/L^D,r)$ of the scaled masses M for any rank r…
A fractal bears a complex structure that is reflected in a scaling hierarchy, indicating that there are far more small things than large ones. This scaling hierarchy can be effectively derived using head/tail breaks - a clustering and…
For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…
Starting from any graph on $\{1, \ldots, n\}$, consider the Markov chain where at each time-step a uniformly chosen vertex is disconnected from all of its neighbors and reconnected to another uniformly chosen vertex. This Markov chain has a…
This paper presents a review of the fractal approach for describing the large scale distribution of galaxies. We start by presenting a brief, but general, introduction to fractals, which emphasizes their empirical side and applications…
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…
We investigate Benford's law in relation to fractal geometry. Basic fractals, such as the Cantor set and Sierpinski triangle are obtained as the limit of iterative sets, and the unique measures of their components follow a geometric…
We propose a general model of unweighted and undirected networks having the scale-free property and fractal nature. Unlike the existing models of fractal scale-free networks (FSFNs), the present model can systematically and widely change…
We give exact relations for certain types of the hierarchic fractal structures. In the blatant distinction from regular networks of the "small world" (SW) topology [1], regular fractal networks manifests the logarithmic dependence of the…
The extremal characteristics of random structures, including trees, graphs, and networks, are discussed. A statistical physics approach is employed in which extremal properties are obtained through suitably defined rate equations. A variety…
We analyze a general class of reversible aggregate-reorganization processes. These processes are shown to exhibit globally attracting equilibrium distributions, which are \textit{universal}, i.e. identical for large classes of models.…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…