Imagen de Portada

Random Walks and the Meeting Time for Trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Beveridge, Andrew, Bridenbaugh, Ben, Pomerance, Ari Holcombe
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Probability 05C81 (primary), 05C05 (secondary), 60J10 (secondary)
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Random Walks and the Best Meeting Time for Trees
por: Beveridge, Andrew, et al.
Publicado: (2025)

Sharp Thresholds for Factors in Random Graphs
por: Burghart, Fabian, et al.
Publicado: (2024)

Walks on the slit plane
por: Bousquet-Melou, Mireille, et al.
Publicado: (2000)

The hitting time of nice factors
por: Burghart, Fabian, et al.
Publicado: (2024)

Partial orders and monotonicity of logarithmic depth and height in preferential attachment trees
por: Mönch, Christian
Publicado: (2026)

A logical limit law for $231$-avoiding permutations
por: Albert, Michael, et al.
Publicado: (2022)

A polynomial algorithm to compute the boxicity and threshold dimension of complements of block graphs
por: Caoduro, Marco, et al.
Publicado: (2025)

Bi-eulerian embeddings of graphs and digraphs
por: Ellingham, M. N., et al.
Publicado: (2024)

A coarse Tutte polynomial for hypermaps
por: Ellis-Monaghan, Joanna A., et al.
Publicado: (2024)

Age-dependent random connection models with arc reciprocity: clustering and connectivity
por: Lüchtrath, Lukas, et al.
Publicado: (2026)

Critical first passage percolation on random graphs
por: Bhamidi, Shankar, et al.
Publicado: (2024)

Sharp thresholds for NAC-colourings and stable cuts in random graphs
por: Clinch, Katie, et al.
Publicado: (2025)

Upper bounds on the odd graceful chromatic number of graphs
por: Afifurrahman, Muhammad, et al.
Publicado: (2025)

Spanning Components and Surfaces Under Minimum Vertex Degree
por: Allsop, Jack, et al.
Publicado: (2025)

Turán number of four vertex-disjoint cliques
por: Kostochka, Alexandr, et al.
Publicado: (2025)

Artin-Ihara L-functions for hypergraphs
por: Eyler, Mason, et al.
Publicado: (2023)

Board games, random boards and long boards
por: Shaviv, Ary
Publicado: (2021)

Symmetric Union Closed Families
por: M, Nived J
Publicado: (2024)

Some Combinatorial Formulas Related to Diagonal Ramsey Numbers
por: Jiradilok, Pakawut
Publicado: (2024)

Matching Complexes of Outerplanar Graphs
por: Bayer, Margaret, et al.
Publicado: (2024)

Matrices with simple symmetric digraphs and their group inverses
por: Nandi, Raju
Publicado: (2023)

A Classification of Graphs through Quadratic Embedding Constants and Clique Graph Insights
por: Baskoro, Edy Tri, et al.
Publicado: (2023)

Infinite grids in digraphs
por: Hamann, Matthias, et al.
Publicado: (2024)

A Critical Probability for Biclique Partition of $G_{n,p}$
por: Bohman, Tom, et al.
Publicado: (2022)

Chain Tutte polynomials
por: Wakefield, Max
Publicado: (2023)

Lévy Langevin Monte Carlo for sampling from heavy-tailed target distributions
por: Behme, Anita, et al.
Publicado: (2025)

Targeted Immunisation Thresholds for the Contact Process on Power-Law Trees
por: Fernley, John, et al.
Publicado: (2023)

Hypercube Embeddings And Median Structure In The Intersection Lattice Of Discriminantal Arrangements B(n,k)
por: Das, Pragnya
Publicado: (2026)

Factor of iid colorings of trees
por: Thornton, Riley
Publicado: (2024)

On the eigenvalues of cyclic covers of Paley graphs
por: Dinin, Natalie, et al.
Publicado: (2026)

Improved bound of graph energy in terms of vertex cover number
por: Samanta, Aniruddha
Publicado: (2025)

Reducing metastable continuous-space Markov chains to Markov chains on a finite set
por: Berglund, Nils
Publicado: (2023)

Extending the noise of splitting to its completion and stability of Brownian maxima
por: Vidmar, Matija, et al.
Publicado: (2024)

Generic infinitesimal rigidity for rotational groups in the plane
por: La Porta, Alison, et al.
Publicado: (2024)

The Defective Parking Space and Defective Kreweras Numbers
por: Garcia, Rebecca E., et al.
Publicado: (2024)

Large deviation-based tuning schemes for Metropolis-Hastings algorithms
por: Milinanni, Federica
Publicado: (2024)

Large deviations for Independent Metropolis Hastings and Metropolis-adjusted Langevin algorithm
por: Milinanni, Federica, et al.
Publicado: (2024)

Prime power variations of higher $Lie_n$ modules
por: Sundaram, Sheila
Publicado: (2021)

Phase transitions for contact processes on one-dimensional networks
por: Jahnel, Benedikt, et al.
Publicado: (2025)

Phase transitions for contact processes on sparse random graphs via metastability and local limits
por: Jahnel, Benedikt, et al.
Publicado: (2025)