Image de couverture de livre

Strategies in a misère two-player tree searching game

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Andrews, Ben
Format:	Preprint
Publié:	2024
Sujets:	Probability Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A noisy min-max game on trees
par: Angel, Omer, et autres
Publié: (2026)

Combinatorial games on Galton-Watson trees involving several-generation-jump moves
par: Podder, Moumanti, et autres
Publié: (2022)

Relationship between misère NIM and two-player GOISHI HIROI
par: Abuku, Tomoaki, et autres
Publié: (2024)

The Maker-Breaker percolation game on a random board
par: Dvořák, Vojtěch, et autres
Publié: (2024)

On cases where Litt's game is fair
par: Basdevant, Anne-Laure, et autres
Publié: (2024)

Large fringe trees for random trees with given vertex degrees
par: Ojeda, Gabriel Berzunza, et autres
Publié: (2026)

Partial sampling of a random spanning tree
par: Jan, Yves Le
Publié: (2025)

On Sibuya trees and forests
par: Huillet, Thierry E
Publié: (2025)

Random choice spanning trees
par: Archer, Eleanor, et autres
Publié: (2024)

Majority dynamics on finite trees
par: Benjamini, Itai, et autres
Publié: (2025)

Phase transition for tree-rooted maps
par: Albenque, Marie, et autres
Publié: (2024)

On exponentially height-penalized random trees
par: Addario-Berry, Louigi, et autres
Publié: (2025)

Probabilistic enumeration and equivalence of nonisomorphic trees
par: Stufler, Benedikt
Publié: (2023)

Universality for catalytic equations and fully parked trees
par: Contat, Alice, et autres
Publié: (2025)

On the number of spanning trees in random regular graphs
par: Greenhill, Catherine, et autres
Publié: (2013)

Limits of biconditioned Bienayme-Galton-Watson trees
par: Dan, Vanessa
Publié: (2025)

Parking on supercritical geometric Bienaymé--Galton--Watson trees
par: Chen, Linxiao, et autres
Publié: (2024)

Random minimum spanning tree and dense graph limits
par: Hladký, Jan, et autres
Publié: (2023)

The local limit of weighted spanning trees on balanced networks
par: Kúsz, Ágnes
Publié: (2025)

Surprising identities for the greedy independent set on Cayley trees
par: Contat, Alice
Publié: (2021)

Anticoncentration of random spanning trees in almost regular graphs
par: Lee, Hyunwoo
Publié: (2026)

Markov chains on trees: almost lower and upper directed cases
par: Fredes, Luis, et autres
Publié: (2024)

Growing conditioned BGW trees with log-concave offspring distributions
par: Fleurat, William
Publié: (2024)

A counter-example to persistence in generalised preferential attachment trees
par: Iyer, Tejas
Publié: (2026)

Anticoncentration of random spanning trees in graphs with large minimum degree
par: Bitonti, Veronica, et autres
Publié: (2026)

The generalized Zagreb index for non-plane and plane recursive trees
par: Feng, Qunqiang, et autres
Publié: (2025)

Maximum Agreement Subtrees and Hölder homeomorphisms between Brownian trees
par: Budzinski, Thomas, et autres
Publié: (2023)

Sweet Trims are made of Threes: A càdlàg erasure of the Brownian tree
par: Caraceni, Alessandra, et autres
Publié: (2026)

Guessing Strategies for Shuffling Machines
par: Clay, Alexander
Publié: (2025)

The diameter of random spanning trees interpolating between the UST and the MST of the complete graph
par: Kúsz, Ágnes
Publié: (2024)

Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
par: Bhamidi, Shankar, et autres
Publié: (2020)

Tree height and the asymptotic mean of the Colijn-Plazzotta rank of unlabeled binary rooted trees
par: Devroye, Luc, et autres
Publié: (2024)

Binary search trees of permuton samples
par: Corsini, Benoît, et autres
Publié: (2024)

An algorithm for uniform generation of unlabeled trees (Pólya trees), with an extension of Cayley's formula
par: Bartholdi, Laurent, et autres
Publié: (2024)

Spectral non-concentration near the top for unimodular random graphs
par: Fraczyk, Mikolaj, et autres
Publié: (2024)

When does a tree activate the random graph?
par: Antonir, Asaf Cohen, et autres
Publié: (2025)

On the lumpability of tree-valued Markov chains
par: Alves, Rodrigo B., et autres
Publié: (2024)

The proportion of permutations fixing a $k$-set
par: Green, Ben, et autres
Publié: (2026)

Spanning trees of bounded degree in random geometric graphs
par: Anastos, Michael, et autres
Publié: (2025)

Fringe trees of Patricia tries, compressed binary search trees, and three other random full binary trees
par: Janson, Svante
Publié: (2024)