Ryan Jeong

activity

20212026

most citedDeep ReLU Networks Preserve Expected Length

7 citations · 9 across the 9 of their papers we have counts for

collaborators

10 papers

cs.IT2026

The Random Subsequence Model and Uniform Codes for the Deletion Channel

Ryan Jeong, Francisco Pernice

We introduce the Random Subsequence Model, a spin glass model on pairs of random strings $(X, Y) \in {0, 1}^{N} \times {0, 1}^{M}$ whose partition function counts subsequence embeddin…

math.CO2023

Bipartite Friends and Strangers Walking on Bipartite Graphs

Ryan Jeong

Given $n$ -vertex simple graphs $X$ and $Y$ , the friends-and-strangers graph $FS (X, Y)$ has as its vertices all $n!$ bijections from $V (X)$ to $V (Y)$ , where two bijections…

math.CO2023

Phase Transitions for Sparse Random Sets Under Linear Forms

Ryan Jeong, Steven J. Miller

Let $A \subseteq {0, 1, \dots, N}$ be a random set in which each element is included independently with probability $p = p (N)$ . Fix an integer $h \geq 2$ and a linear form $$L(x_1,\do…

math.CO2023

VC-Dimension of Hyperplanes over Finite Fields

Ruben Ascoli, Livia Betti, Justin Cheigh +8

Let $F_{q}^{d}$ be the $d$ -dimensional vector space over the finite field with $q$ elements. For a subset $E \subseteq F_{q}^{d}$ and a fixed nonzero $t \in F_{q}$ ,…

math.CO2022

Towards the Gaussianity of Random Zeckendorf Games

Justin Cheigh, Guilherme Zeus Dantas e Moura, Ryan Jeong +4

Zeckendorf proved that any positive integer has a unique decomposition as a sum of non-consecutive Fibonacci numbers, indexed by $F_{1} = 1, F_{2} = 2, F_{n + 1} = F_{n} + F_{n - 1}$ . Motiva…

math.NT2022

Sum and Difference Sets in Generalized Dihedral Groups

Ruben Ascoli, Justin Cheigh, Guilherme Zeus Dantas e Moura +6

Given a group $G$ , we say that a set $A \subseteq G$ has more sums than differences (MSTD) if $∣ A + A ∣ > ∣ A - A ∣$ , has more differences than sums (MDTS) if $∣ A + A ∣ < ∣ A - A ∣$ , or is sum-d…

math.CO2022

VC-Dimension and Distance Chains in $F_{q}^{d}$

Ruben Ascoli, Livia Betti, Justin Cheigh +8

Given a domain $X$ and a collection $H$ of functions $h : X \to {0, 1}$ , the Vapnik-Chervonenkis (VC) dimension of $H$ measures its complexity in an appropriate s…

math.CO2022★ 1 cited

On Structural Aspects of Friends-And-Strangers Graphs

Ryan Jeong

Given two graphs $X$ and $Y$ with the same number of vertices, the friends-and-strangers graph $FS (X, Y)$ has as its vertices all $n!$ bijections from $V (X)$ to $V (Y)$ , wi…

math.CO2022★ 1 cited

On the Diameters of Friends-and-Strangers Graphs

Ryan Jeong

Given simple graphs $X$ and $Y$ on the same number of vertices, the friends-and-strangers graph $FS (X, Y)$ has as its vertices all bijections from $V (X)$ to $V (Y)$ , where…

stat.ML2021★ 7 cited

Deep ReLU Networks Preserve Expected Length

Boris Hanin, Ryan Jeong, David Rolnick

Assessing the complexity of functions computed by a neural network helps us understand how the network will learn and generalize. One natural measure of complexity is how the netwo…

The Random Subsequence Model and Uniform Codes for the Deletion Channel

Bipartite Friends and Strangers Walking on Bipartite Graphs

Phase Transitions for Sparse Random Sets Under Linear Forms

VC-Dimension of Hyperplanes over Finite Fields

Towards the Gaussianity of Random Zeckendorf Games

Sum and Difference Sets in Generalized Dihedral Groups

VC-Dimension and Distance Chains in Fqd​

On Structural Aspects of Friends-And-Strangers Graphs

On the Diameters of Friends-and-Strangers Graphs

Deep ReLU Networks Preserve Expected Length

VC-Dimension and Distance Chains in $F_{q}^{d}$