Related papers: Recent Progress on Fractal Percolation
Dimensions of level sets of generic continuous functions and generic H\"older functions defined on a fractal $F$ encode information about the geometry, ``the thickness" of $F$. While in the continuous case this quantity is related to a…
Discretized landscapes can be mapped onto ranked surfaces, where every element (site or bond) has a unique rank associated with its corresponding relative height. By sequentially allocating these elements according to their ranks and…
Consider critical Bernoulli percolation in the plane. We give a new proof of the sharp noise sensitivity theorem shown by Garban, Pete and Schramm. Contrary to the previous approaches, we do not use any spectral tool. We rather study…
There have been several spectral bounds for the percolation transition in networks, using spectrum of matrices associated with the network such as the adjacency matrix and the non-backtracking matrix. However they are far from being tight…
We introduce fractional flat space, described by a continuous geometry with constant non-integer Hausdorff and spectral dimensions. This is the analogue of Euclidean space, but with anomalous scaling and diffusion properties. The basic tool…
Algorithmic fractal dimensions quantify the algorithmic information density of individual points and may be defined in terms of Kolmogorov complexity. This work uses these dimensions to bound the classical Hausdorff and packing dimensions…
How does the percolation transition behave in the absence of quenched randomness? To address this question, we study two nonrandom self-dual quasiperiodic models of square-lattice bond percolation. In both models, the critical point has…
Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be…
We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…
The fractal structure and scaling properties of a 2d slice of the 3d Ising model is studied using Monte Carlo techniques. The percolation transition of geometric spin (GS) clusters is found to occur at the Curie point, reflecting the…
We introduce appropriate definitions of dimensions in order to characterize the fractal properties of complex networks. We compute these dimensions in a hierarchically structured network of particular interest. In spite of the nontrivial…
During the past two decades, percolation has long served as a basic paradigm for network resilience, community formation and so on in complex systems. While the percolation transition is known as one of the most robust continuous…
Dimension interpolation is a novel programme of research which attempts to unify the study of fractal dimension by considering various spectra which live in between well-studied notions of dimension such as Hausdorff, box, Assouad and…
We prove that, the diffusivity and conductivity on $\mathbb{Z}^d$-Bernoulli percolation ($d \geq 2$) are infinitely differentiable in supercritical regime. This extends a result by Kozlov [Uspekhi Mat. Nauk 44 (1989), no. 2(266), pp 79 -…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
Simplicial complexes are increasingly used to understand the topology of complex systems as different as brain networks and social interactions. It is therefore of special interest to extend the study of percolation to simplicial complexes.…
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 fractal oscillatority of solutions of second-order differential equations near infinity is measured by oscillatory and phase dimensions. The phase dimension is defined as a box dimension of the trajectory $(x,\dot{x})$ in $\mathbb{R}^2$…
We develop a transfer matrix formalism to visualize the framing of discrete piecewise linear curves in three dimensional space. Our approach is based on the concept of an intrinsically discrete curve, which enables us to more effectively…
We use the Brascamp--Lieb inequality from functional analysis to prove novel inequalities for the upper box, packing, and Assouad dimensions of fractal sets in terms of the dimensions of certain projections. Analogous inequalities do not…