Related papers: Fractal behavior for nodal lines of smooth planar …
Using Monte-Carlo simulations, we determine the scaling form for the probability distribution of the shortest path, $\ell$, between two lines in a 3-dimensional percolation system at criticality; the two lines can have arbitrary positions,…
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…
Fractal structures appear in a vast range of physical systems. A literature survey including all experimental papers on fractals which appeared in the six Physical Review journals (A-E and Letters) during the 1990's shows that experimental…
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…
This paper is studying the critical regime of the planar random-cluster model on $\mathbb Z^2$ with cluster-weight $q\in[1,4)$. More precisely, we prove crossing estimates in quads which are uniform in their boundary conditions and depend…
In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^\chi$, while the transversal fluctuations, known as…
We present a Monte Carlo study of the fractal geometry of clusters formed by discrete-time simple random walks (sRW) of $L^2$ steps on a periodic square $L\times L$ lattice. We verify with high precision that the asymptotic behavior of the…
It is known that the critical probability for the percolation transition is not a sharp threshold, actually it is a region of non-zero width $\Delta p_c$ for systems of finite size. Here we present evidence that for complex networks $\Delta…
Fractal scaling--a power-law behavior of the number of boxes needed to tile a given network with respect to the lateral size of the box--is studied. We introduce a new box-covering algorithm that is a modified version of the original…
For a complete graph of size $n$, assign each edge an i.i.d. exponential variable with mean $n$. For $\lambda>0$, consider the length of the longest path whose average weight is at most $\lambda$. It was shown by Aldous (1998) that the…
First-passage percolation is the study of the metric space $(\mathbb{Z}^d,T)$, where $T$ is a random metric defined as the weighted graph metric using random edge-weights $(t_e)_{e\in \mathcal{E}^d}$ assigned to the nearest-neighbor edges…
Observations of galaxies over large distances reveal the possibility of a fractal distribution of their positions. The source of fractal behavior is the lack of a length scale in the two body gravitational interaction. However, even with…
This work extends the studies on the minimum and extremal process of a supercritical branching random walk outside the boundary case which cannot be reduced to the boundary case. We study here the situation where the log-generating function…
Crossing symmetry asserts that particles are indistinguishable from anti-particles traveling back in time. In quantum field theory, this statement translates to the long-standing conjecture that probabilities for observing the two scenarios…
Many real-world networks exhibit the so-called small-world phenomenon: their typical distances are much smaller than their sizes. One mathematical model for this phenomenon is a long-range percolation graph on a $d$-dimensional box $\{0, 1,…
Gaussian percolation can be seen as the generalization of standard Bernoulli percolation on $\mathbb{Z}^d$. Instead of a random discrete configuration on a lattice, we consider a continuous Gaussian field $f$ and we study the topological…
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…
We prove a Russo-Seymour-Welsch percolation theorem for nodal domains and nodal lines associated to a natural infinite dimensional space of real analytic functions on the real plane. More precisely, let $U$ be a smooth connected bounded…
We consider i.i.d. first-passage percolation (FPP) on the two-dimensional square lattice, in the critical case where edge-weights take the value zero with probability $\tfrac{1}{2}$. Critical FPP is unique in that the Euclidean lengths of…
We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…