Jinyoung Park

activity

20172021

collaborators

11 papers

math.CO2021

On a problem of M. Talagrand

Keith Frankston, Jeff Kahn, Jinyoung Park

We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $F$ of subsets of a finite set $V$ . The full conject…

math.CO2021

Note on the number of balanced independent sets in the Hamming cube

Jinyoung Park

Let $Q_{d}$ be the $d$ -dimensional Hamming cube and $N = ∣ V (Q_{d}) ∣ = 2^{d}$ . An independent set $I$ in $Q_{d}$ is called balanced if $I$ contains the same number of even and odd vertices. We…

math.NA2020

Deep neural network for solving differential equations motivated by Legendre-Galerkin approximation

Bryce Chudomelka, Youngjoon Hong, Hyunwoo Kim +1

Nonlinear differential equations are challenging to solve numerically and are important to understanding the dynamics of many physical systems. Deep neural networks have been appli…

math.CO2020

The threshold for the square of a Hamilton cycle

Jeff Kahn, Bhargav Narayanan, Jinyoung Park

Resolving a conjecture of Kühn and Osthus from 2012, we show that $p = 1/ n$ is the threshold for the random graph $G_{n, p}$ to contain the square of a Hamilton cycle.

math.CO2020

Tuza's Conjecture for random graphs

Jeff Kahn, Jinyoung Park

A celebrated conjecture of Zs. Tuza says that in any (finite) graph, the minimum size of a cover of triangles by edges is at most twice the maximum size of a set of edge-disjoint t…

math.CO2019

Thresholds versus fractional expectation-thresholds

Keith Frankston, Jeff Kahn, Bhargav Narayanan +1

Proving a conjecture of Talagrand, a fractional version of the 'expectation-threshold' conjecture of Kalai and the second author, we show for any increasing family $F$ on a finite…