Wesley Pegden

From MaRDI portal
Person:295852

Available identifiers

zbMath Open pegden.wesleyWikidataQ57609231 ScholiaQ57609231MaRDI QIDQ295852

List of research outcomes





PublicationDate of PublicationType
The bright side of simple heuristics for the TSP2024-11-09Paper
On the intersecting family process2024-11-09Paper
Corrigendum to “Online purchasing under uncertainty”2023-10-12Paper
Spanners in randomly weighted graphs: Euclidean case2023-10-10Paper
Maker Breaker on digraphs2023-10-04Paper
The bright side of simple heuristics for the TSP2023-10-04Paper
Direct sampling of short paths for contiguous partitioning2023-07-11Paper
Sequentially constrained Hamilton cycles in random graphs2023-05-01Paper
Multitrees in random graphs2023-02-17Paper
Unit sphere fibrations in Euclidean space2022-10-25Paper
On the Cover Time of the Emerging Giant2022-07-28Paper
Subexponential mixing for partition chains on grid-like graphs2022-06-01Paper
Individual variation in susceptibility or exposure to SARS-CoV-2 lowers the herd immunity threshold2022-05-16Paper
Spanners in randomly weighted graphs: independent edge lengths2022-01-13Paper
Multitrees in random graphs2021-10-17Paper
https://portal.mardi4nfdi.de/entity/Q50026512021-07-28Paper
Minimum-weight combinatorial structures under random cost-constraints2021-01-29Paper
Comb inequalities for typical Euclidean TSP instances2020-12-01Paper
Random volumes in d-dimensional polytopes2020-10-20Paper
On random multi-dimensional assignment problems2020-10-14Paper
Stability of patterns in the abelian sandpile2020-03-25Paper
Minors of a random binary matroid2020-02-14Paper
Traveling in randomly embedded random graphs2019-11-28Paper
A note on the rank of a sparse random matrix2019-11-21Paper
On the rank of a random binary matrix2019-10-15Paper
On the rank of a random binary matrix2019-10-14Paper
On the Cover Time of Dense Graphs2019-08-29Paper
Separating effect from significance in Markov chain tests2019-04-08Paper
A note on dispersing particles on a line2019-02-20Paper
A note on the localization number of random graphs: diameter two case2019-02-08Paper
Assessing significance in a Markov chain without mixing2019-01-11Paper
Diffusion limited aggregation on the Boolean lattice2018-12-17Paper
Online purchasing under uncertainty2018-09-25Paper
The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights2018-08-15Paper
On the rank of a random binary matrix2018-06-13Paper
Constraining the clustering transition for colorings of sparse random graphs2018-05-25Paper
Extremal Collections of $k$-Uniform Vectors2018-01-29Paper
Separating subadditive euclidean functionals2017-10-24Paper
A partisan districting protocol with provably nonpartisan outcomes2017-10-24Paper
Separating subadditive euclidean functionals2017-09-29Paper
The Apollonian structure of integer superharmonic matrices2017-07-21Paper
Looking for vertex number one2017-05-03Paper
Apollonian structure in the abelian sandpile2016-06-14Paper
Scalefree hardness of average-case Euclidean TSP approximation2016-04-15Paper
Walker-Breaker Games2015-09-02Paper
Between 2- and 3-colorability2015-02-19Paper
An Extension of the Moser--Tardos Algorithmic Local Lemma2014-09-26Paper
The topology of competitively constructed graphs2014-09-04Paper
Critical graphs without triangles: an optimum density construction2014-03-17Paper
Convergence of the abelian sandpile2013-04-25Paper
The lefthanded local lemma characterizes chordal dependency graphs2012-12-14Paper
Sets resilient to erosion2011-05-11Paper
Highly nonrepetitive sequences: Winning strategies from the local lemma2011-01-17Paper
The Hales-Jewett number is exponential: game-theoretic consequences2009-03-16Paper
A finite goal set in the plane which is not a winner2009-01-28Paper
Distance sequences in locally infinite vertex-transitive digraphs2007-05-08Paper
On the intersecting family processN/APaper
Sampling Balanced Forests of Grids in Polynomial TimeN/APaper

Research outcomes over time

This page was built for person: Wesley Pegden