Imagen de Portada

A Nordhaus--Gaddum problem for the spectral gap of a graph

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kim, Sooyeong, Madras, Neal
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Probability 60J10, 05C81
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Random rotor walks and i.i.d. sandpiles on Sierpinski graphs
por: Kaiser, Robin, et al.
Publicado: (2022)

On the structure of the sandpile identity element on Sierpinski gasket graphs
por: Kaiser, Robin, et al.
Publicado: (2026)

Average height for Abelian sandpiles and the looping constant on Sierpinski graphs
por: Heizmann, Nico, et al.
Publicado: (2023)

Nonconcentration of hitting times for random walks on graphs
por: Chiclana, Rafael
Publicado: (2026)

Collisions of random walks on comb graphs with a planar base
por: De Ambroggio, Umberto, et al.
Publicado: (2025)

The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational
por: Sylvester, John
Publicado: (2021)

Diameter and mixing time of the giant component in the percolated hypercube
por: Anastos, Michael, et al.
Publicado: (2025)

Triple collisions on a comb graph
por: Croydon, David A., et al.
Publicado: (2024)

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

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

Geometric Bounds on the Fastest Mixing Markov Chain
por: Olesker-Taylor, Sam, et al.
Publicado: (2021)

Time-Biased Random Walks and Robustness of Expanders
por: Olesker-Taylor, Sam, et al.
Publicado: (2024)

Locally Markov walks on finite graphs
por: Kaiser, Robin, et al.
Publicado: (2024)

Mixing cutoff for simple random walks on the Chung-Lu digraph
por: Bianchi, Alessandra, et al.
Publicado: (2024)

Mixing trichotomy for random walks on directed stochastic block models
por: Bianchi, Alessandra, et al.
Publicado: (2025)

Probabilistic Zero Forcing with Vertex Reversion
por: Brennan, Zachary
Publicado: (2024)

Any fully graphic region of degree sequences can be sampled rapidly
por: Erdős, Péter L., et al.
Publicado: (2025)

Mixing times of a Burnside process Markov chain on set partitions
por: Paguyo, J. E.
Publicado: (2022)

Sensitivity of mixing times of Cayley graphs
por: Hermon, Jonathan, et al.
Publicado: (2020)

Burnside process on parking functions and Dyck paths
por: Feng, Ivan Z., et al.
Publicado: (2026)

An interesting spectral gap problem, from Jim Fill
por: Fill, James Allen
Publicado: (2025)

On the jump of the cover time in random geometric graphs
por: Martinez, Carlos, et al.
Publicado: (2025)

Lonely passenger problem: the more buses there are, the more lonely passengers there will be
por: Tóth, Imre Péter
Publicado: (2025)

The $k$-Plancherel measure and a Finite Markov Chain
por: Linusson, Svante, et al.
Publicado: (2025)

Sandpiles on the Vicsek fractal explode with probability 1/4
por: Heizmann, Nico, et al.
Publicado: (2023)

Simultaneous Cutoff on the Multitype Configuration Model
por: Fernley, John, et al.
Publicado: (2024)

Hitting Time Distributions of Random Walks on Finite Graphs
por: Kumar, Anuraag
Publicado: (2025)

Convergence of blanket times for sequences of random walks on critical random graphs
por: Andriopoulos, George
Publicado: (2018)

The spectra of graph substitutions
por: Hirschler, Thomas, et al.
Publicado: (2025)

Feynman Formula for Discrete-time Quantum Walks
por: Fouque, Jean-Pierre, et al.
Publicado: (2025)

Multiple Random Walks on Graphs: Mixing Few to Cover Many
por: Rivera, Nicolás, et al.
Publicado: (2020)

Hitting times in the stochastic block model
por: Ottolini, Andrea
Publicado: (2024)

Scaling limit of the Aldous-Broder chain on regular graphs: the transient regime
por: Hernández, Osvaldo Angtuncio, et al.
Publicado: (2025)

Cutoff for generalised Bernoulli-Laplace urn models
por: Goenka, Ritesh, et al.
Publicado: (2025)

Explicit cutoff profiles for colored top-$m$-to-random shuffles
por: Feng, Ivan Z.
Publicado: (2026)

Return probability on Bienaymé-Galton-Watson trees and spectral asymptotics of sparse Erdős-Rényi random graphs
por: Heydenreich, Markus, et al.
Publicado: (2026)

Up-down chains and scaling limits: application to permuton- and graphon-valued diffusions
por: Féray, Valentin, et al.
Publicado: (2025)

Conditions for Equivalence of Random Interlacements and Random Walk Reflected off of Infinity
por: Yu, Yao
Publicado: (2025)

The Uniform Random Walk on graphs, loop processes and graphings
por: Abert, Miklos, et al.
Publicado: (2025)

The Ising Model on a Two-Community Stochastic Block Model
por: Bianchi, Alessandra, et al.
Publicado: (2026)