A General Dependency Structure for Random Graphs and Its Effect on Monotone Properties

12/03/2020
by   Zohre Ranjbar-Mojaveri, et al.
0

We consider random graphs in which the edges are allowed to be dependent. In our model the edge dependence is quite general, we call it p-robust random graph. It means that every edge is present with probability at least p, regardless of the presence/absence of other edges. This is more general than independent edges with probability p, as we illustrate with examples. Our main result is that for any monotone graph property, the p-robust random graph has at least as high probability to have the property as an Erdos-Renyi random graph with edge probability p. This is very useful, as it allows the adaptation of many results from classical Erdos-Renyi random graphs to a non-independent setting, as lower bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2020

Tight Bounds for Connectivity of Random K-out Graphs

Random K-out graphs are used in several applications including modeling ...
research
03/22/2016

Edge-exchangeable graphs and sparsity

A known failing of many popular random graph models is that the Aldous-H...
research
12/08/2021

On anti-stochastic properties of unlabeled graphs

We study vulnerability of a uniformly distributed random graph to an att...
research
05/09/2023

Random processes for generating task-dependency graphs

We investigate random processes for generating task-dependency graphs of...
research
08/28/2021

How likely is a random graph shift-enabled?

The shift-enabled property of an underlying graph is essential in design...
research
08/03/2022

Common Pairs of Graphs

A graph H is said to be common if the number of monochromatic labelled c...
research
09/11/2017

Coin-flipping, ball-dropping, and grass-hopping for generating random graphs from matrices of edge probabilities

Common models for random graphs, such as Erdős-Rényi and Kronecker graph...

Please sign up or login with your details

Forgot password? Click here to reset