相关论文: On the evolution of random graphs on spaces of neg…

We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic…

We study the hyperbolic random geometric graph introduced in Krioukov et al. For a sequence $R_n \to \infty$, we define these graphs to have the vertex set as Poisson points distributed uniformly in balls $B(0,R_n) \subset B_d^{\alpha}$,…

A bootstrap percolation process on a graph with infection threshold $r\ge 1$ is a dissemination process that evolves in time steps. The process begins with a subset of infected vertices and in each subsequent step every uninfected vertex…

We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…

We describe the asymptotic behaviour of large degrees in random hyperbolic graphs, for all values of the curvature parameter $ \alpha$. We prove that, with high probability, the node degrees satisfy the following ordering property: the…

Let $X_1,..., X_n$ be independent, uniformly random points from $[0,1]^2$. We prove that if we add edges between these points one by one by order of increasing edge length then, with probability tending to 1 as the number of points $n$…

Random hyperbolic graphs were recently introduced by Krioukov et. al. [KPKVB10] as a model for large networks. Gugelmann, Panagiotou, and Peter [GPP12] then initiated the rigorous study of random hyperbolic graphs using the following model:…

We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…

Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…

We consider random hyperbolic graphs in hyperbolic spaces of any dimension $d+1\geq 2$. We present a rescaling of model parameters that casts the random hyperbolic graph model of any dimension to a unified mathematical framework, leaving…

In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…

In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…

Motivated by the Beck-Fiala conjecture, we study the discrepancy problem in two related models of random hypergraphs on $n$ vertices and $m$ edges. In the first (edge-independent) model, a random hypergraph $H_1$ is constructed by fixing a…

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 analyze the component evolution in inhomogeneous random intersection graphs when the average degree is close to 1. As the average degree increases, the size of the largest component in the random intersection graph goes through a phase…

We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…

In Chung-Lu random graphs, a classic model for real-world networks, each vertex is equipped with a weight drawn from a power-law distribution, and two vertices form an edge independently with probability proportional to the product of their…

We study inhomogeneous Bernoulli bond percolation on the graph $G \times \mathbb{Z}$, where $G$ is a connected quasi-transitive graph. The inhomogeneity is introduced through a random region $R$ around the origin axis…

Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…

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…