activity
20222026
most citedGrowth factors of random butterfly matrices and the stability of avoiding pivoting

8 citations · 10 across the 10 of their papers we have counts for

collaborators

12 papers

cs.CV2026

TERRA: Learning Transportable Latent Actions through Temporal Effect Representation and Relational Alignment

Tianxingjian Ding, Mubarak Shah, Yu Tian

Latent actions supervise robot policies with action-like codes inferred from visual transitions, and their usefulness hinges on two questions: what a code keeps from a transition,…

math.CO2026

Burning rooted graph products

John Peca-Medlin

The burning number of a graph is the minimum number of rounds required to burn all vertices when, at each discrete step, existing fires spread to neighboring vertices an…

math.PR2025

The Horton-Strahler number of butterfly trees

John Peca-Medlin

The Horton-Strahler (HS) number, a classical measure of branching complexity arising in hydrology and register allocation, is studied for butterfly trees, a recursive family of bin…

math.PR2025

Heights of butterfly trees

John Peca-Medlin, Chenyang Zhong

Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding inter…

math.PR2025

Pivot probabilities and norm effects in Gaussian elimination for -ensembles

Kenji Gunawan, John Peca-Medlin

We analyze pivot probabilities in Gaussian elimination with partial pivoting (GEPP) for random matrix ensembles. For GUE matrices, we resolve a previously reported dis…

math.PR2024

On the longest increasing subsequence and number of cycles of butterfly permutations

John Peca-Medlin, Chenyang Zhong

One method to generate random permutations involves using Gaussian elimination with partial pivoting (GEPP) on a random matrix and storing the permutation matrix factor fro…

math.NA2024

Complete pivoting growth of butterfly matrices and butterfly Hadamard matrices

John Peca-Medlin

The growth problem in Gaussian elimination (GE) remains a foundational question in numerical analysis and numerical linear algebra. Wilkinson resolved the growth problem in GE with…

math.SP2023

Total positivity and spectral theory for Toeplitz Hessenberg matrix ensembles

Nicholas Ercolani, John Peca-Medlin, Jonathan Ramalheira-Tsu

In this paper we define and lay the groundwork for studying a novel matrix ensemble: totally positive Hessenberg Toeplitz operators, denoted TPHT. This is the intersection of two e…

physics.soc-ph2023

Random matrix statistics and safety rest areas on interstates in the United States

Jia Cai, John Peca-Medlin, Yunke Wan

We analyze physical spacings between locations of safety rest areas on interstates in the United States. We show normalized safety rest area spacings on major interstates exhibit W…

math.NA2023★ 1 cited

Growth factors of orthogonal matrices and local behavior of Gaussian elimination with partial and complete pivoting

John Peca-Medlin

Gaussian elimination (GE) is the most used dense linear solver. Error analysis of GE with selected pivoting strategies on well-conditioned systems can focus on studying the behavio…

math.NA2023★ 1 cited

Distribution of the number of pivots needed using Gaussian elimination with partial pivoting on random matrices

John Peca-Medlin

Gaussian elimination with partial pivoting (GEPP) is a widely used method to solve dense linear systems. Each GEPP step uses a row transposition pivot movement if needed to ensure…

math.NA2022★ 8 cited

Growth factors of random butterfly matrices and the stability of avoiding pivoting

John Peca-Medlin, Thomas Trogdon

Random butterfly matrices were introduced by Parker in 1995 to remove the need for pivoting when using Gaussian elimination. The growing applications of butterfly matrices have oft…