Related papers: Random geometric graph description of connectednes…
Nanofiller particles, such as carbon nanotubes or metal wires, are used in functional polymer composites to make them conduct electricity. They are often not perfectly straight cylinders, but may be tortuous or exhibit kinks. Therefore we…
The mathematical analysis of robustness and error-tolerance of complex networks has been in the center of research interest. On the other hand, little work has been done when the attack-tolerance of the vertices or edges are not independent…
The properties of polymer composites with nanofiller particles change drastically above a critical filler density known as the percolation threshold. Real nanofillers, such as graphene flakes and cellulose nanocrystals, are not idealized…
For a given permutation $\pi_n$ in $S_n$, a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (\pi_n(i) - \pi_n (j)) < 0$. In this paper, we study various statistics of random…
We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where…
We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…
The event graph representation of temporal networks suggests that the connectivity of temporal structures can be mapped to a directed percolation problem. However, similar to percolation theory on static networks, this mapping is valid…
In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…
A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…
We determine to within a constant factor the threshold for the property that two random k-uniform hypergraphs with edge probability p have an edge-disjoint packing into the same vertex set. More generally, we allow the hypergraphs to have…
Recently, random graphs in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices have attracted much attention. Here, we present a specific realization of a class of random…
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…
We consider soft random geometric graphs, constructed by distributing points (nodes) randomly according to a Poisson Point Process, and forming links between pairs of nodes with a probability that depends on their mutual distance, the…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
In the classical Erd\"os-R\'enyi random graph G(n,p) there are n vertices and each of the possible edges is independently present with probability p. The random graph G(n,p) is homogeneous in the sense that all vertices have the same…
Consider a graph on $n$ uniform random points in the unit square, each pair being connected by an edge with probability $p$ if the inter-point distance is at most $r$. We show that as $n\to\infty$ the probability of full connectivity is…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…