:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Balister, Paul, Donderwinkel, Serte, Groenland, Carla, Johnston, Tom, Scott, Alex
Format:	Preprint
Publié:	2023
Sujets:	Combinatorics Probability
Accès en ligne:	https://arxiv.org/abs/2301.07022
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improved bounds for 1-independent percolation on $\mathbb{Z}^n$
par: Balister, Paul, et autres
Publié: (2022)

Tournaments and random walks
par: Donderwinkel, Serte, et autres
Publié: (2024)

A local limit theorem for the edge counts of random induced subgraphs of a random graph
par: Balister, Paul, et autres
Publié: (2025)

Tight universal bounds on the height times the width of random trees
par: Donderwinkel, Serte, et autres
Publié: (2024)

An elementary proof of the bunkbed conjecture for forests
par: Donderwinkel, Serte, et autres
Publié: (2025)

Sinaĭ excursions: An analogue of Sparre Andersen's formula for the area process of a random walk
par: Donderwinkel, Serte, et autres
Publié: (2024)

Random trees have height $O(\sqrt{n})$
par: Addario-Berry, Louigi, et autres
Publié: (2022)

The number and structure of connected graphs with a fixed degree sequence
par: Bell, Sasha, et autres
Publié: (2026)

Critical trees are neither too short nor too fat
par: Addario-Berry, Louigi, et autres
Publié: (2023)

Tournament score sequences, Erdős-Ginzburg-Ziv numbers, and the Lévy-Khintchine method
par: Bassan, Michal, et autres
Publié: (2024)

Shotgun assembly of random graphs
par: Johnston, Tom, et autres
Publié: (2022)

The largest common subtree of two random trees
par: Angel, Omer, et autres
Publié: (2025)

Graphical sequences and plane trees
par: Bassan, Michal, et autres
Publié: (2024)

To see the forest for the trees: On the infinite divisibility of unlabeled forests
par: Bassan, Michal, et autres
Publié: (2025)

Short reachability networks
par: Groenland, Carla, et autres
Publié: (2022)

Refined Horton-Strahler numbers I: a discrete bijection
par: Addario-Berry, Louigi, et autres
Publié: (2024)

Infinite induced-saturated graphs
par: Bonamy, Marthe, et autres
Publié: (2025)

Counting quadrant walks via Tutte's invariant method
par: Bernardi, Olivier, et autres
Publié: (2017)

Reconstruction of shredded random matrices
par: Balister, Paul, et autres
Publié: (2024)

Faster random walks via infrequent steering
par: Bukh, Boris, et autres
Publié: (2026)

Hypergraph universality via branching random walks
par: Nenadov, Rajko
Publié: (2024)

Counting quadrant walks via Tutte's invariant method (extended abstract)
par: Bernardi, O, et autres
Publié: (2015)

A random walk among random graphs
par: Curien, Nicolas
Publié: (2024)

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

Note on the trace of random walks on pseudorandom graphs
par: Chen, Yaobin, et autres
Publié: (2026)

Random walks on edge colored random graphs
par: Cooper, Colin, et autres
Publié: (2024)

Maximal entropy random walks and central Markov chains
par: Offret, Yoann, et autres
Publié: (2025)

The speed of random walks on semigroups
par: Blachar, Guy, et autres
Publié: (2025)

Asymptotics of returns to the coordinate hyperplanes for conditioned simple random walks
par: Garbit, Rodolphe, et autres
Publié: (2025)

Bounded-degree graphs of non-negative Ollivier-Ricci curvature have subexponential growth and diffusive random walk
par: Hutchcroft, Tom, et autres
Publié: (2025)

A Polynomial Upper Bound for Poset Saturation
par: Bastide, Paul, et autres
Publié: (2023)

The random walk on upper triangular matrices over $\mathbb{Z}/m \mathbb{Z}$
par: Nestoridi, Evita, et autres
Publié: (2020)

Representation theory and cycle statistics for random walks on the symmetric group
par: Arcona, Dominic
Publié: (2025)

Evolution of recursive trees with limited memory
par: Angel, Omer, et autres
Publié: (2025)

Temporal connectivity of Random Geometric Graphs
par: Brandenberger, Anna, et autres
Publié: (2025)

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

Speeding up random walk mixing by starting from a uniform vertex
par: Díaz, Alberto Espuny, et autres
Publié: (2022)

Revisiting scaling limits for critical inhomogeneous random graphs with finite third moments
par: Addario-Berry, Louigi, et autres
Publié: (2025)

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

Recurrence, transience and anti-concentration of Rademacher random walks
par: Bhattacharya, Satyaki, et autres
Publié: (2025)