Andrew Beveridge

activity

20242026

collaborators

4 papers

math.CO2026

Approval Ballot Triangles and Strict-Sense Ballots

Andrew Beveridge, Ian Calaway

We consider a family of binary triangular arrays, called approval ballot triangles (ABTs), that are in bijection with totally symmetric self-complementary plane partitions (TSSCPPs…

math.CO2025

Random Walks and the Best Meeting Time for Trees

Andrew Beveridge, Ari Holcombe Pomerance

We consider random walks on a tree $G = (V, E)$ with stationary distribution $π_{v} = deg (v) /2∣ E ∣$ for $v \in V$ . Let the hitting time $H (v, w)$ denote the expected number of st…

math.CO2025

Random Walks and the Meeting Time for Trees

Andrew Beveridge, Ben Bridenbaugh, Ari Holcombe Pomerance

Consider a random walk on a tree $G = (V, E)$ . For $v, w \in V$ , let the hitting time $H (v, w)$ denote the expected number of steps required for the random walk started at $v$ to reach…

math.CO2024

The Exact Mixing Time for Trees with Fixed Diameter

Andrew Beveridge, Kristin Heysse, Rhys O'Higgins +1

We characterize the extremal structure for the exact mixing time for random walks on trees $T_{n, d}$ of order $n$ with diameter $d$ . Given a graph $G = (V, E)$ , let $H (v, π)$ denote th…