Percolation Threshold Results on \Erdos-\Renyi Graphs: an Empirical Process Approach

2017/12/05 by Michael J. Kane, Kane, Michael
Mathematics · #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Probability (math.PR) #Random Matrices and Applications #Statistics Theory (math.ST) #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.1712.01835

openalex publication_date 2017/12/05 · openalex created_date 2017/12/22 · openalex updated_date 2026/07/28

Abstract

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

Citations

• A Stochastic Approximation Method

Related

• Percolation in Random Graphs: A Finite Approach
• H-percolation with a random H
• Scaling limit of dynamical percolation on critical Erdös-Rényi random graphs
• Sharp threshold for K₄-percolation
• Sharp Fuss-Catalan thresholds in graph bootstrap percolation