Wesley Pegden

activity

20102026

most citedAssessing significance in a Markov chain without mixing

86 citations · 218 across the 38 of their papers we have counts for

collaborators

Showing 2021 · math.COShow all

3 papers · 2 filters

math.CO2021

Spanners in randomly weighted graphs: Euclidean case

Alan Frieze, Wesley Pegden

Given a connected graph $G = (V, E)$ and a length function $ℓ : E \to R$ we let $d_{v, w}$ denote the shortest distance between vertex $v$ and vertex $w$ . A $t$ -spanner is a…

math.CO2021

Multitrees in random graphs

Alan Frieze, Wesley Pegden

Let $N = (2 n)$ and $s \geq 2$ . Let $e_{i, j}, i = 1, 2, \dots, N, j = 1, 2, \dots, s$ be $s$ independent permutations of the edges $E (K_{n})$ of the complete graph $K_{n}$ . A {\em MultiT…

math.CO2021

Spanners in randomly weighted graphs: independent edge lengths

Alan Frieze, Wesley Pegden

Given a connected graph $G = (V, E)$ and a length function $ℓ : E \to R$ we let $d_{v, w}$ denote the shortest distance between vertex $v$ and vertex $w$ . A $t$ -spanner is a…