Obserwuj
Stephen J Young
Tytuł
Cytowane przez
Cytowane przez
Rok
Random dot product graph models for social networks
SJ Young, ER Scheinerman
International Workshop on Algorithms and Models for the Web-Graph, 138-149, 2007
4062007
Interval partitions and Stanley depth
C Biró, DM Howard, MT Keller, WT Trotter, SJ Young
Journal of Combinatorial Theory, Series A 117 (4), 475-482, 2010
652010
Dimensionality of social networks using motifs and eigenvalues
A Bonato, DF Gleich, M Kim, D Mitsche, P Prałat, Y Tian, SJ Young
PloS one 9 (9), e106052, 2014
482014
Braess’s paradox in large sparse graphs
F Chung, SJ Young
Internet and Network Economics: 6th International Workshop, WINE 2010 …, 2010
292010
Directed random dot product graphs
SJ Young, E Scheinerman
Internet Mathematics 5 (1-2), 91-111, 2008
272008
A major league baseball team uses operations research to improve draft preparation
N Streib, SJ Young, J Sokol
Interfaces 42 (2), 119-130, 2012
252012
On the Stanley depth of squarefree Veronese ideals
MT Keller, YH Shen, N Streib, SJ Young
Journal of Algebraic Combinatorics 33, 313-324, 2011
232011
Relative Hausdorff distance for network analysis
SG Aksoy, KE Nowak, E Purvine, SJ Young
Applied Network Science 4, 1-25, 2019
202019
Posets with cover graph of pathwidth two have bounded dimension
C Biró, MT Keller, SJ Young
Order 33, 195-212, 2016
202016
A characterization of partially ordered sets with linear discrepancy equal to 2
DM Howard, MT Keller, SJ Young
Order 24, 139-153, 2007
192007
Stanley depth of squarefree monomial ideals
MT Keller, SJ Young
Journal of Algebra 322 (10), 3789-3792, 2009
162009
Random dot product graphs: a flexible model for complex networks
SJ Young
Georgia Institute of Technology, 2008
132008
Synthetic power grids from real world models
SJ Young, Y Makarov, R Diao, R Fan, R Huang, J O’Brien, ...
2018 IEEE Power & Energy Society General Meeting (PESGM), 1-5, 2018
112018
Degree bounds for linear discrepancy of interval orders and disconnected posets
MT Keller, SJ Young
Discrete mathematics 310 (15-16), 2198-2203, 2010
112010
Braess's paradox in expanders
F Chung, SJ Young, W Zhao
Random Structures & Algorithms 41 (4), 451-468, 2012
102012
Algorithms and models for the web-graph
SJ Young, ER Scheinerman, A Bonato, FRK Chung
Springer, Berlin, 2007
102007
Connectivity and giant component of stochastic Kronecker graphs
M Radcliffe, SJ Young
arXiv preprint arXiv:1310.7652, 2013
92013
Directional Laplacian centrality for cyber situational awareness
SG Aksoy, E Purvine, SJ Young
Digital Threats: Research and Practice (DTRAP) 2 (4), 1-28, 2021
82021
Spectralfly: Ramanujan graphs as flexible and efficient interconnection networks
S Young, S Aksoy, J Firoz, R Gioiosa, T Hagge, M Kempton, J Escobedo, ...
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2022
72022
The weighted spectrum of the universal cover and an Alon–Boppana result for the normalized Laplacian
SJ Young
Journal of Combinatorics 13 (1), 23-40, 2022
72022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20