Related papers: Inhomogeneous percolation on the hierarchical conf…
We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…
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 define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…
We formulate and study a model for inhomogeneous long-range percolation on $\Zbold^d$. Each vertex $x\in\Zbold^d$ is assigned a non-negative weight $W_x$, where $(W_x)_{x\in\Zbold^d}$ are i.i.d.\ random variables. Conditionally on the…
We consider bond percolation on random graphs with given degrees and bounded average degree. In particular, we consider the order of the largest component after the random deletion of the edges of such a random graph. We give a rough…
Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
We consider a class of scale-free inhomogeneous random graphs, which includes some long-range percolation models. We study the maximum degree in such graphs in a growing observation window and show that its limiting distribution is Frechet.…
We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…
We introduce a class of random graphs with a community structure, which we call the hierarchical configuration model. On the inter-community level, the graph is a configuration model, and on the intra-community level, every vertex in the…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, Random graphs with a given degree distribution, in a way that admits a…
We study cluster sizes in supercritical $d$-dimensional inhomogeneous percolation models with long-range edges -- such as long-range percolation -- and/or heavy-tailed degree distributions -- such as geometric inhomogeneous random graphs…
We study first-passage percolation where edges in the left and right half-planes are assigned values according to different distributions. We show that the asymptotic growth of the resulting inhomogeneous first-passage process obeys a shape…
In many systems consisting of interacting subsystems, the complex interactions between elements can be represented using multilayer networks. However percolation, key to understanding connectivity and robustness, is not trivially…
We introduce a correlated static model and investigate a percolation transition. The model is a modification of the static model and is characterized by assortative degree-degree correlation. As one varies the edge density, the network…
We study subcritical two-dimensional oriented percolation seen from its rightmost point on the set of infinite configurations which are bounded above. This a Feller process whose state space is not compact and has no invariant measures. We…
We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…