Image de couverture de livre

Uniqueness of the infinite connected component for the vacant set of random interlacements on amenable transient graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Mu, Yingxin, Sapozhnikov, Artem
Format:	Preprint
Publié:	2023
Sujets:	Probability
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On questions of uniqueness for the vacant set of Wiener sausages and Brownian interlacements
par: Mu, Yingxin, et autres
Publié: (2023)

Indistinguishability of unbounded components in the occupied and vacant sets of Boolean models on symmetric spaces
par: Mu, Yingxin, et autres
Publié: (2025)

Visibility in Brownain interlacements, Poisson cylinders and Boolean models
par: Mu, Yingxin, et autres
Publié: (2023)

On the visibility window for Brownian interlacements, Poisson cylinders and Boolean models
par: Mu, Yingxin, et autres
Publié: (2025)

Sharp connectivity bounds for the vacant set of random interlacements
par: Goswami, Subhajit, et autres
Publié: (2025)

Strong local uniqueness for the vacant set of random interlacements
par: Goswami, Subhajit, et autres
Publié: (2025)

On the shape of the connected components of the complement of two-dimensional Brownian random interlacements
par: Collin, Orphée, et autres
Publié: (2024)

The number of connected components in sub-critical random graph processes
par: Corujo, Josué
Publié: (2024)

Random interlacements on transient weighted graphs: 0-1 laws and FKG inequality
par: Collin, Orphée
Publié: (2026)

Uniqueness of the infinite tree in low-dimensional random forests
par: Halberstam, Noah, et autres
Publié: (2023)

Multipoint connectivity in the branching interlacement process
par: Vanhaelewyn, Louis
Publié: (2026)

Dixie cup problem in an interlacing process
par: Doumas, Aristides V.
Publié: (2025)

Geometric random intersection graphs with general connection probabilities
par: Deijfen, Maria, et autres
Publié: (2023)

Tightness for interlacing geometric random walk bridges
par: Dimitrov, Evgeni
Publié: (2024)

The geometry of the giant component of random geometric graphs
par: Dubin, Karoline, et autres
Publié: (2026)

Inhomogeneous random graphs with infinite-mean fitness variables
par: Avena, Luca, et autres
Publié: (2022)

The connectivity and phase transition in inhomogeneous random graphs of finite types
par: Jung, Hamin
Publié: (2024)

A confined random walk locally looks like tilted random interlacements
par: Bouchot, Nicolas
Publié: (2024)

Optimal factor matchings for point processes on non-amenable unimodular graphs
par: Spinka, Yinon, et autres
Publié: (2026)

Supercritical percolation on finite transitive graphs I: Uniqueness of the giant component
par: Easo, Philip, et autres
Publié: (2021)

Diameters and mixing times for giant components of random graphs with given degrees
par: Addario-Berry, Louigi, et autres
Publié: (2026)

How thin does random interlacement have to be so that a random walk can see through it?
par: Bouchot, Nicolas
Publié: (2025)

The largest $K_r$-free set of vertices in a random graph
par: Bohman, Tom, et autres
Publié: (2026)

Exponential growth of random infinite Fibonacci sequences
par: Goldsheid, Ilya, et autres
Publié: (2025)

Unique continuation on planar graphs
par: Bou-Rabee, Ahmed, et autres
Publié: (2023)

$d$-connectivity of the random graph with restricted budget
par: Lichev, Lyuben
Publié: (2022)

Uniqueness of the infinite cluster for monotone percolation models without insertion tolerance
par: Panagiotis, Christoforos, et autres
Publié: (2026)

k-connectivity threshold for superpositions of Bernoulli random graphs
par: Ardickas, Daumilas, et autres
Publié: (2025)

Intersections of random sets
par: Richey, Jacob, et autres
Publié: (2020)

Geometry of Gaussian free field sign clusters and random interlacements
par: Drewitz, Alexander, et autres
Publié: (2018)

Asymptotics for the percolation threshold of finitary random interlacements in four and higher dimensions
par: Bi, Yijie, et autres
Publié: (2025)

A connection between the random pinning model and random walks in sparse random environments
par: Poisat, Julien
Publié: (2024)

Percolation on random graphs
par: van der Hofstad, Remco
Publié: (2025)

Infinitely many collisions between a recurrent simple random walk and arbitrary many transient random walks in a subballistic random environment
par: Devulder, Alexis
Publié: (2025)

Moderate Deviations for Functionals over infinitely many Rademacher random variables
par: Butzek, Marius, et autres
Publié: (2023)

First passage percolation, local uniqueness for interlacements and capacity of random walk
par: Prévost, Alexis
Publié: (2023)

On the uniqueness of the infinite cluster and the cluster density in the Poisson driven random connection model
par: Chebunin, Mikhail, et autres
Publié: (2024)

The voter model on random regular graphs with random rewiring
par: Avena, Luca, et autres
Publié: (2025)

Subcritical epidemics on random graphs
par: Nguyen, Oanh, et autres
Publié: (2022)

On a planar random motion with asymptotically correlated components
par: Marchione, Manfred Marvin, et autres
Publié: (2024)