Cover Image

Probabilistic Zero Forcing with Vertex Reversion

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Brennan, Zachary
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Probability 15B51, 60J10, 60G50, 05C15, 05C81, 60J20, 60J22, 60C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Cutoff for Rewiring Dynamics on Perfect Matchings
by: Olesker-Taylor, Sam
Published: (2021)

The multi-level friendship paradox for sparse random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Cutoff phenomenon for the warp-transpose top with random shuffle
by: Ghosh, Subhajit
Published: (2021)

Cutoff for random walks on dihedral groups
by: Huang, Xiangying, et al.
Published: (2025)

Geometric Bounds on the Fastest Mixing Markov Chain
by: Olesker-Taylor, Sam, et al.
Published: (2021)

The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational
by: Sylvester, John
Published: (2021)

Random rotor walks and i.i.d. sandpiles on Sierpinski graphs
by: Kaiser, Robin, et al.
Published: (2022)

On the structure of the sandpile identity element on Sierpinski gasket graphs
by: Kaiser, Robin, et al.
Published: (2026)

Average height for Abelian sandpiles and the looping constant on Sierpinski graphs
by: Heizmann, Nico, et al.
Published: (2023)

Limit Profiles for Separation Distance
by: Francis, Peter E., et al.
Published: (2026)

Clumsy and Careless: Stationary-Entry Flux in Non-monotone Coupon Collectors
by: Long, Christopher D.
Published: (2026)

Scaling limit for the cover time of the $λ$-biased random walk on a binary tree with $λ<1$
by: Croydon, David A.
Published: (2024)

Cutoff for random Cayley graphs of nilpotent groups
by: Hermon, Jonathan, et al.
Published: (2024)

Cutoff for Almost All Random Walks on Abelian Groups
by: Hermon, Jonathan, et al.
Published: (2021)

Diameter and mixing time of the giant component in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Tournaments and random walks
by: Donderwinkel, Serte, et al.
Published: (2024)

Collisions of random walks on comb graphs with a planar base
by: De Ambroggio, Umberto, et al.
Published: (2025)

On the Game of Moksha-Patam
by: Nanda, Aninda Kumar, et al.
Published: (2024)

Simulating Simple Random Walks With a Deck of Cards
by: Alves, Raphael, et al.
Published: (2024)

A Nordhaus--Gaddum problem for the spectral gap of a graph
by: Kim, Sooyeong, et al.
Published: (2024)

Critical beta-splitting, via contraction
by: Kolesnik, Brett
Published: (2024)

Burnside process on parking functions and Dyck paths
by: Feng, Ivan Z., et al.
Published: (2026)

Mixing times of a Burnside process Markov chain on set partitions
by: Paguyo, J. E.
Published: (2022)

The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)

Time-Biased Random Walks and Robustness of Expanders
by: Olesker-Taylor, Sam, et al.
Published: (2024)

Sampling schemes of multitype continuous-time Bienaymé-Galton-Watson trees and limiting critical genealogies
by: Hernández, Osvaldo Angtuncio, et al.
Published: (2025)

Triple collisions on a comb graph
by: Croydon, David A., et al.
Published: (2024)

Genealogies of records of stochastic processes with stationary increments as unimodular trees
by: Baccelli, François, et al.
Published: (2024)

The $k$-Plancherel measure and a Finite Markov Chain
by: Linusson, Svante, et al.
Published: (2025)

Solving Poisson's equation for Wasserstein contractive Markov chains
by: Hofstadler, Julian
Published: (2026)

Convergence to equilibrium for density dependent Markov jump processes
by: Barbour, Andrew, et al.
Published: (2025)

Randomized Zero Forcing
by: Geneson, Jesse, et al.
Published: (2026)

The record statistic and forward stability of Schubert products
by: Hardt, Andrew, et al.
Published: (2026)

Meeting times of Markov chains via singular value decomposition
by: van Belle, Thomas, et al.
Published: (2024)

A Framework for Blockchain Architecture Design
by: Dey, Partha S., et al.
Published: (2022)

Multitype Lévy trees as scaling limits of multitype Bienaymé-Galton-Watson trees
by: Hernández, Osvaldo Angtuncio, et al.
Published: (2025)

The global and local limit of the continuous-time Mallows process
by: Adamczak, Radosław, et al.
Published: (2024)

Tight universal bounds on the height times the width of random trees
by: Donderwinkel, Serte, et al.
Published: (2024)

Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023)

A Limit in Law for the Cover Time and Last Visited Vertex of Wired Planar Domains
by: Louidor, Oren, et al.
Published: (2026)