Percolation Threshold Results on - Graphs: an Empirical Process Approach

12/05/2017
by   Michael Kane, et al.
0

In this paper we define a directed percolation over Erdos-Renyi graphs and derive weak limit results for the resulting stochastic process.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/09/2021

On the Seidel spectrum of threshold graphs

In this paper, we analyse spectral properties of Seidel matrix (denoted ...
research
07/01/2019

On Characterizations for Subclasses of Directed Co-Graphs

Undirected co-graphs are those graphs which can be generated from the si...
research
08/28/2018

On the Continuous Limit of Weak GARCH

We prove that the symmetric weak GARCH limit is a geometric mean-reverti...
research
08/02/2019

A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs

In this document, we introduce a notion of entropy for stochastic proces...
research
06/04/2020

Embedding Directed Graphs in Potential Fields Using FastMap-D

Embedding undirected graphs in a Euclidean space has many computational ...
research
03/17/2021

Locality of Random Digraphs on Expanders

We study random digraphs on sequences of expanders with bounded average ...
research
06/01/2023

Evaluating the "Learning on Graphs" Conference Experience

With machine learning conferences growing ever larger, and reviewing pro...

Please sign up or login with your details

Forgot password? Click here to reset