Related papers: Scale-free percolation
We define a statistical ensemble of non-degenerate graphs, i.e. graphs without multiple- and self-connections between nodes. The node degree distribution is arbitrary, but the nodes are assumed to be uncorrelated. This completes our earlier…
We study the asymptotic growth of the diameter of a graph obtained by adding sparse "long" edges to a square box in $\Z^d$. We focus on the cases when an edge between $x$ and $y$ is added with probability decaying with the Euclidean…
A random graph model with prescribed degree distribution and degree dependent edge weights is introduced. Each vertex is independently equipped with a random number of half-edges and each half-edge is assigned an integer valued weight…
Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuum space version of scale-free percolation introduced in [DW18]. This is an undirected inhomogeneous random graph…
In this paper we study a version of (non-Markovian) first passage percolation on graphs, where the transmission time between two connected vertices is non-iid, but increases by a penalty factor polynomial in their expected degrees. Based on…
The properties of the similarity transformation in percolation theory in the complex plane of the percolation probability are studied. It is shown that the percolation problem on a two-dimensional square lattice reduces to the Mandelbrot…
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in- and…
We present a simple method to quantitatively capture the heterogeneity in the degree distribution of a network graph using a single parameter $\sigma$. Using an exponential transformation of the shape parameter of the Weibull distribution,…
In this paper we provide general conditions on a one parameter family of random infinite subsets of Z^d to contain a unique infinite connected component for which the chemical distances are comparable to the Euclidean distances, focusing…
The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynomial decay in the distance between them. Various aspects of…
We consider some problems related to the truncation question in long-range percolation. It is given probabilities that certain long-range oriented bonds are open; assuming that this probabilities are not summable, we ask if the probability…
In this paper, we introduce a new class of models for spatial data obtained from max-convolution processes based on indicator kernels with random shape. We show that this class of models have appealing dependence properties including tail…
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of…
Heavy-tailed distributions naturally occur in many real life problems. Unfortunately, it is typically not possible to compute inference in closed-form in graphical models which involve such heavy-tailed distributions. In this work, we…
We study the critical behavior of the component sizes for the configuration model when the tail of the degree distribution of a randomly chosen vertex is a regularly-varying function with exponent $\tau-1$, where $\tau\in (3,4)$. The…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
Modern risk modelling approaches deal with vectors of multiple components. The components could be, for example, returns of financial instruments or losses within an insurance portfolio concerning different lines of business. One of the…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
We consider the soft Boolean model, a model that interpolates between the Boolean model and long-range percolation, where vertices are given via a stationary Poisson point process. Each vertex carries an independent Pareto-distributed…
There is proposed a model of scale-free random graphs which are locally close to the uncorrelated complex random networks with divergent $\langle k^2 \rangle$ studied in e.g. S. N. Dorogovtsev {\it et al}, Rev. Mod. Phys. {\bf 80}, 1275…