Imagen de Portada

Maximum flow and self-avoiding walk on bunkbed graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Tang, Pengfei
Formato:	Preprint
Publicado:	2025
Materias:	Probability Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An elementary proof of the bunkbed conjecture for forests
por: Donderwinkel, Serte, et al.
Publicado: (2025)

Self-avoiding walks on cubic graphs and local transformations
por: Grant, Benjamin, et al.
Publicado: (2026)

Square lattice walks avoiding a quadrant
por: Bousquet-Mélou, Mireille
Publicado: (2015)

Self-avoiding walk is ballistic on graphs with more than one end
por: Lehner, Florian, et al.
Publicado: (2024)

The bunkbed conjecture is not robust to generalisation
por: Hollom, Lawrence
Publicado: (2024)

A lattice point counting approach for the study of the number of self-avoiding walks on $\mathbb{Z}^{d}$
por: Lazar, Youssef
Publicado: (2025)

The bunkbed conjecture still holds for cactus graphs and for graphs with certain biconnected components
por: Denart, Robin
Publicado: (2025)

Color-avoiding percolation on the Erdős-Rényi random graph
por: Lichev, Lyuben, et al.
Publicado: (2022)

A random walk among random graphs
por: Curien, Nicolas
Publicado: (2024)

Note on the trace of random walks on pseudorandom graphs
por: Chen, Yaobin, et al.
Publicado: (2026)

Random walks on edge colored random graphs
por: Cooper, Colin, et al.
Publicado: (2024)

Differential transcendence and walks on self-similar graphs
por: Kahane, Yakob, et al.
Publicado: (2024)

The acyclic directed bunkbed conjecture is false
por: Przybyłowski, Tomasz
Publicado: (2025)

The bunkbed problem and the random cluster model
por: Ayyer, Arvind, et al.
Publicado: (2025)

The bunkbed conjecture is false
por: Gladkov, Nikita, et al.
Publicado: (2024)

Pairwise Negative Correlation for Uniform Spanning Subgraphs of the Complete Graph
por: Tang, Pengfei, et al.
Publicado: (2026)

The feasible regions for consecutive patterns of pattern-avoiding permutations
por: Borga, Jacopo, et al.
Publicado: (2020)

Permuton limits for some permutations avoiding a single pattern
por: Hohmeier, Kaitlyn, et al.
Publicado: (2025)

Faster random walks via infrequent steering
por: Bukh, Boris, et al.
Publicado: (2026)

Hypergraph universality via branching random walks
por: Nenadov, Rajko
Publicado: (2024)

On the finiteness of the group associated with weighted walks in multidimensional orthants
por: Price, Andrew Elvey, et al.
Publicado: (2025)

Maximal entropy random walks and central Markov chains
por: Offret, Yoann, et al.
Publicado: (2025)

Counting graphic sequences via integrated random walks
por: Balister, Paul, et al.
Publicado: (2023)

Counting quadrant walks via Tutte's invariant method
por: Bernardi, Olivier, et al.
Publicado: (2017)

Asymptotics of returns to the coordinate hyperplanes for conditioned simple random walks
por: Garbit, Rodolphe, et al.
Publicado: (2025)

Counting quadrant walks via Tutte's invariant method (extended abstract)
por: Bernardi, O, et al.
Publicado: (2015)

Maximum Agreement Subtrees and Hölder homeomorphisms between Brownian trees
por: Budzinski, Thomas, et al.
Publicado: (2023)

The bunkbed conjecture remains true when gluing along a vertex
por: Meunier, Paul, et al.
Publicado: (2024)

Scaling and local limits of Baxter permutations and bipolar orientations through coalescent-walk processes
por: Borga, Jacopo, et al.
Publicado: (2020)

The random walk on upper triangular matrices over $\mathbb{Z}/m \mathbb{Z}$
por: Nestoridi, Evita, et al.
Publicado: (2020)

Optimally building spanning graphs in semirandom graph processes
por: Anastos, Michael, et al.
Publicado: (2025)

On the importance sampling of self-avoiding walks
por: Bousquet-Mélou, Mireille
Publicado: (2011)

Weakly directed self-avoiding walks
por: Bacher, Axel, et al.
Publicado: (2010)

The speed of random walks on semigroups
por: Blachar, Guy, et al.
Publicado: (2025)

Critical threshold for regular graphs
por: Bhadoo, Ishaan
Publicado: (2024)

Clique packings in random graphs
por: Griffiths, Simon, et al.
Publicado: (2024)

Enumeration of walks in multidimensional orthants and reflection groups
por: Gohier, Léa, et al.
Publicado: (2025)

The Lovász number of random circulant graphs
por: Bandeira, Afonso S., et al.
Publicado: (2025)

The random graph process is globally synchronizing
por: Jain, Vishesh, et al.
Publicado: (2025)

Thresholds for colouring the random Borsuk graph
por: Montero, Álvaro Acitores, et al.
Publicado: (2026)