Youngser Park

Youngser Park

Auto-generated profile, based on publicly available information

Youngser Park

Department of Applied Mathematics and Statistics (AMS), Center for Imaging Science (CIS), Mathematical Institute for Data Science (MINDS), Johns Hopkins University, Baltimore, MD, USA

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 August 2017 in Nature
Verified
Journal Article
Closed access
PDF file
KEKatharina Eichler
Katharina Eichler
FLFeng Li
Feng Li
ALAshok Litwin-Kumar
Ashok Litwin-Kumar
YPYoungser Park
Youngser Park
IAIngrid Andrade
Ingrid Andrade
ACAlbert Cardona
Albert Cardona

25 April 2014 in Science
Verified
Journal Article
Closed access
PDF file
JVJoshua T. Vogelstein
Joshua T. Vogelstein
YPYoungser Park
Youngser Park
TOTomoko Ohyama
Tomoko Ohyama
RKRex A. Kerr
Rex A. Kerr
JTJames W. Truman
James W. Truman
MZMarta Zlatic
Marta Zlatic
Optogenetic Insights: Mapping functional neural circuits for many behaviors has been almost impossible, soVogelsteinet al.(p.386, published online 27 March; see the Perspective byO'Leary and Marder) developed a broadly applicable optogenetic method for neuron-behavior mapping and used it to phenotype larvalDrosophilaand thus developed a reference atlas. As optogenetic experiments become routine in certain fields of neuroscience research, creating even more specialized tools is imperative (see the Perspective byHayashi). By engineering channelrhodopsin,Wieteket al.(p.409, published online 27 March) andBerndtet al.(p.420) created two different light-gated anion channels to block action potential generation during synaptic stimulation or depolarizing current injections. These new tools not only improve understanding of channelrhodopsins but also provide a way to silence cells.

1 October 2005 in Computational and Mathematical Organization Theory
Verified
Journal Article
Closed access
PDF file
CPCarey E. Priebe
Carey E. Priebe
JCJohn M. Conroy
John M. Conroy
DMDavid J. Marchette
David J. Marchette
YPYoungser Park
Youngser Park

5 December 2016 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
VLVince Lyzinski
Vince Lyzinski
MTMinh Tang
Minh Tang
AAAvanti Athreya
Avanti Athreya
YPYoungser Park
Youngser Park
CPCarey E. Priebe
Carey E. Priebe
In disciplines as diverse as social network analysis and neuroscience, many large graphs are believed to be composed of loosely connected smaller graph primitives, whose structure is more amenable to analysis We propose a robust, scalable, integrated methodology for community detection and community comparison in graphs. In our procedure, we first embed a graph into an appropriate Euclidean space to obtain a low-dimensional representation, and then cluster the vertices into communities. We next employ nonparametric graph inference techniques to identify structural similarity among these communities. These two steps are then applied recursively on the communities, allowing us to detect more fine-grained structure. We describe a hierarchical stochastic blockmodel-namely, a stochastic blockmodel with a natural hierarchical structure-and establish conditions under which our algorithm yields consistent estimates of model parameters and motifs, which we define to be stochastically similar groups of subgraphs. Finally, we demonstrate the effectiveness of our algorithm in both simulated and real data. Specifically, we address the problem of locating similar sub-communities in a partially reconstructed Drosophila connectome and in the social network Friendster.

11 December 2013 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
HWHeng Wang
Heng Wang
MTMinh Tang
Minh Tang
YPYoungser Park
Youngser Park
CPCarey E. Priebe
Carey E. Priebe
The ability to detect change-points in a dynamic network or a time series of graphs is an increasingly important task in many applications of the emerging discipline of graph signal processing. This paper formulates change-point detection as a hypothesis testing problem in terms of a generative latent position model, focusing on the special case of the Stochastic Block Model time series. We analyze two classes of scan statistics, based on distinct underlying locality statistics presented in the literature. Our main contribution is the derivation of the limiting properties and power characteristics of the competing scan statistics. Performance is compared theoretically, on synthetic data, and empirically, on the Enron email corpus.

8 March 2019 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Open access
PDF file
CPCarey E. Priebe
Carey E. Priebe
YPYoungser Park
Youngser Park
JVJoshua T. Vogelstein
Joshua T. Vogelstein
JCJohn M. Conroy
John M. Conroy
VLVince Lyzinski
Vince Lyzinski
EBEric Bridgeford
Eric Bridgeford
Clustering is concerned with coherently grouping observations without any explicit concept of true groupings. Spectral graph clustering—clustering the vertices of a graph based on their spectral embedding—is commonly approached via K-means (or, more generally, Gaussian mixture model) clustering composed with either Laplacian spectral embedding (LSE) or adjacency spectral embedding (ASE). Recent theoretical results provide deeper understanding of the problem and solutions and lead us to a “two-truths” LSE vs. ASE spectral graph clustering phenomenon convincingly illustrated here via a diffusion MRI connectome dataset: The different embedding methods yield different clustering results, with LSE capturing left hemisphere/right hemisphere affinity structure and ASE capturing gray matter/white matter core–periphery structure. Significance Spectral graph clustering—clustering the vertices of a graph based on their spectral embedding—is of significant current interest, finding applications throughout the sciences. But as with clustering in general, what a particular methodology identifies as “clusters” is defined (explicitly, or, more often, implicitly) by the clustering algorithm itself. We provide a clear and concise demonstration of a “two-truths” phenomenon for spectral graph clustering in which the first step—spectral embedding—is either Laplacian spectral embedding, wherein one decomposes the normalized Laplacian of the adjacency matrix, or adjacency spectral embedding given by a decomposition of the adjacency matrix itself. The two resulting clustering methods identify fundamentally different (true and meaningful) structure.