:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Balister, Paul, Donderwinkel, Serte, Groenland, Carla, Johnston, Tom, Scott, Alex
Formato:	Preprint
Publicado:	2023
Materias:	Combinatorics Probability
Acceso en línea:	https://arxiv.org/abs/2301.07022
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved bounds for 1-independent percolation on $\mathbb{Z}^n$
por: Balister, Paul, et al.
Publicado: (2022)

Tournaments and random walks
por: Donderwinkel, Serte, et al.
Publicado: (2024)

A local limit theorem for the edge counts of random induced subgraphs of a random graph
por: Balister, Paul, et al.
Publicado: (2025)

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

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

Sinaĭ excursions: An analogue of Sparre Andersen's formula for the area process of a random walk
por: Donderwinkel, Serte, et al.
Publicado: (2024)

Random trees have height $O(\sqrt{n})$
por: Addario-Berry, Louigi, et al.
Publicado: (2022)

The number and structure of connected graphs with a fixed degree sequence
por: Bell, Sasha, et al.
Publicado: (2026)

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

Tournament score sequences, Erdős-Ginzburg-Ziv numbers, and the Lévy-Khintchine method
por: Bassan, Michal, et al.
Publicado: (2024)

Shotgun assembly of random graphs
por: Johnston, Tom, et al.
Publicado: (2022)

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

Graphical sequences and plane trees
por: Bassan, Michal, et al.
Publicado: (2024)

To see the forest for the trees: On the infinite divisibility of unlabeled forests
por: Bassan, Michal, et al.
Publicado: (2025)

Short reachability networks
por: Groenland, Carla, et al.
Publicado: (2022)

Refined Horton-Strahler numbers I: a discrete bijection
por: Addario-Berry, Louigi, et al.
Publicado: (2024)

Infinite induced-saturated graphs
por: Bonamy, Marthe, et al.
Publicado: (2025)

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

Reconstruction of shredded random matrices
por: Balister, Paul, et al.
Publicado: (2024)

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

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

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

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

Anticoncentration of random spanning trees in graphs with large minimum degree
por: Bitonti, Veronica, et al.
Publicado: (2026)

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)

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

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

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

Bounded-degree graphs of non-negative Ollivier-Ricci curvature have subexponential growth and diffusive random walk
por: Hutchcroft, Tom, et al.
Publicado: (2025)

A Polynomial Upper Bound for Poset Saturation
por: Bastide, Paul, et al.
Publicado: (2023)

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

Representation theory and cycle statistics for random walks on the symmetric group
por: Arcona, Dominic
Publicado: (2025)

Evolution of recursive trees with limited memory
por: Angel, Omer, et al.
Publicado: (2025)

Temporal connectivity of Random Geometric Graphs
por: Brandenberger, Anna, et al.
Publicado: (2025)

The largest $K_r$-free set of vertices in a random graph
por: Bohman, Tom, et al.
Publicado: (2026)

Speeding up random walk mixing by starting from a uniform vertex
por: Díaz, Alberto Espuny, et al.
Publicado: (2022)

Revisiting scaling limits for critical inhomogeneous random graphs with finite third moments
por: Addario-Berry, Louigi, et al.
Publicado: (2025)

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

Recurrence, transience and anti-concentration of Rademacher random walks
por: Bhattacharya, Satyaki, et al.
Publicado: (2025)