Percolation on random 2-lifts

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Drouvillé, Paul
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910980354605056
author Drouvillé, Paul
author_facet Drouvillé, Paul
contents Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a random $2$-lift of $G$ that may not be transitive but still probabilistically exhibit many properties of transitive graphs. Studying percolation in this context can help us test the reliability and robustness of our proofs methods in percolation theory. Our three main results on this model are the continuity of the critical parameter $p_c(G_q)$, for $q\in(0,1)$, the strict monotonicity $p_c(G_q)< p_c(G)$ and the exponential decay of the cluster size in the subcritical regime at $q=1/2$.
format Preprint
id arxiv_https___arxiv_org_abs_2506_01612
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Percolation on random 2-lifts
Drouvillé, Paul
Probability
Combinatorics
60K35
Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a random $2$-lift of $G$ that may not be transitive but still probabilistically exhibit many properties of transitive graphs. Studying percolation in this context can help us test the reliability and robustness of our proofs methods in percolation theory. Our three main results on this model are the continuity of the critical parameter $p_c(G_q)$, for $q\in(0,1)$, the strict monotonicity $p_c(G_q)< p_c(G)$ and the exponential decay of the cluster size in the subcritical regime at $q=1/2$.
title Percolation on random 2-lifts
topic Probability
Combinatorics
60K35
url https://arxiv.org/abs/2506.01612