Related papers: Fractal percolation on statistically self-affine c…
This study delves into first-passage percolation on random geometric graphs in the supercritical regime, where the graphs exhibit a unique infinite connected component. We investigate properties such as geodesic paths, moderate deviations,…
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
We consider the density at a point z = x + i y of critical percolation clusters that touch the left [P_L(z)], right [P_R(z)], or both [P_{LR}(z)] sides of a rectangular system, with open boundary conditions on the top and bottom. The ratio…
We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…
Fractal structures emerge from statistical and hierarchical processes in urban development or network evolution. In a class of efficient and robust geographical networks, we derive the size distribution of layered areas, and estimate the…
We consider the Erd\"{o}s--R\'{e}nyi random graph $G_{n,p}$ and we analyze the simple irreversible epidemic process on the graph, known in the literature as bootstrap percolation. We give a quantitative version of some results by Janson et…
Some linear dynamical systems over finite fields are studied and the self-similar character of their development is proved. Connections with aperiodic tilings, Delanoy numbers and other topics are also proved. The prime fields F_p have a…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\delta$. We identify the critical percolation threshold as…
In 1999, Zhang proved that, for first passage percolation on the square lattice $\mathbb{Z}^2$ with i.i.d. non-negative edge weights, if the probability that the passage time distribution of an edge $P(t_e = 0) =1/2 $, the critical value…
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…
Self-similar sets with open set condition, the linear objects of fractal geometry, have been considered mainly for crystallographic data. Here we introduce new symmetry classes in the plane, based on rotation by irrational angles. Examples…
In this work we are interested in the self--affine fractals studied by Gatzouras and Lalley and by the author which generalize the famous general Sierpinski carpets studied by Bedford and McMullen. We give a formula for the Hausdorff…
The $4N$ carpets are a class of infinitely ramified self-similar fractals with a large group of symmetries. For a $4N$-carpet $F$, let $\{F_n\}_{n \geq 0}$ be the natural decreasing sequence of compact pre-fractal approximations with…
Accurate segmentation of long and thin tubular structures is required in a wide variety of areas such as biology, medicine, and remote sensing. The complex topology and geometry of such structures often pose significant technical…
For Bernoulli site percolation on an infinite, connected, locally finite graph $G=(V,E)$, we obtain quantitative upper bounds on the supercritical disconnection probability \[ \mathbb{P}_p(S\nleftrightarrow\infty) \] for arbitrary finite or…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
The formation of sintering bridges in amorphous powders affects both flow behavior and perceived material quality. When sintering is driven by surface tension, bridges emerge sequentially, favoring contacts between smaller particles first.…
In this paper, site percolation on random $\Phi^{3}$ planar graphs is studied by Monte-Carlo numerical techniques. The method consists in randomly removing a fraction $q=1-p$ of vertices from graphs generated by Monte-Carlo simulations,…
We consider discrete random fractal surfaces with negative Hurst exponent $H<0$. A random colouring of the lattice is provided by activating the sites at which the surface height is greater than a given level $h$. The set of activated sites…