Related papers: Percolation on an infinitely generated group
Some examples of translation invariant site percolation processes on the $\Z^2$ lattice are constructed, the most far-reaching example being one that satisfies uniform finite energy (meaning that the probability that a site is open given…
We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message passing approach to evaluate heterogeneous, node dependent probabilities of belonging to the giant or…
The percolation threshold for flow or conduction through voids surrounding randomly placed spheres is rigorously calculated. With large scale Monte Carlo simulations, we give a rigorous continuum treatment to the geometry of the…
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some…
Let G be a planar graph with polynomial growth and isoperimetric dimension bigger than 1. Then the critical p for Bernoulli percolation on G satisfies p<1.
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
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 study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…
The study of random graphs has become very popular for real-life network modeling such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice $\mathbb Z^d$, $d\ge1$, is a…
We consider a version of continuum long-range percolation on finite boxes of $\mathbb{R}^d$ in which the vertex set is given by the points of a Poisson point process and each pair of two vertices at distance $r$ is connected with…
We define a growing model of random graphs. Given a sequence of nonnegative integers $\{d_n\}_{n=0}^\infty$ with the property that $d_i\leq i$, we construct a random graph on countably infinitely many vertices $v_0,v_1\ldots$ by the…
We consider the Bernoulli Boolean discrete percolation model on the d-dimensional integer lattice. We study sufficient conditions on the distribution of the radii of balls placed at the points of a Bernoulli point process for the absence of…
This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…
Initial steps are presented towards understanding which finitely generated groups are almost surely generated as semigroups by the path of a random walk on the group.
We analyze a semi-infinite one-dimensional random walk process with a biased motion that is incremental in one direction and long-range in the other. On a network with a fixed hierarchy of long-range jumps, we find with exact…
We study the bond percolation problem in random graphs of $N$ weighted vertices, where each vertex $i$ has a prescribed weight $P_i$ and an edge can connect vertices $i$ and $j$ with rate $P_iP_j$. The problem is solved by the $q\to 1$…
We prove that critical percolation has no infinite clusters almost surely on any unimodular quasi-transitive graph satisfying a return probability upper bound of the form $p_n(v,v) \leq \exp\left[-\Omega(n^\gamma)\right]$ for some…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
We study the evolution of percolation with freezing. Specifically, we consider cluster formation via two competing processes: irreversible aggregation and freezing. We find that when the freezing rate exceeds a certain threshold, the…
We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the…