4 citations · 12 across the 12 of their papers we have counts for
6 papers · 1 filter
Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations
Hayoung Choi, Jinglian He, Hang Hu +1
The von Neumann graph entropy (VNGE) can be used as a measure of graph complexity, which can be the measure of information divergence and distance between graphs. However, computin…
Geometric Mean of Partial Positive Definite Matrices with Missing Entries
Hayoung Choi, Sejong Kim, Yuanming Shi
In this paper the geometric mean of partial positive definite matrices with missing entries is considered. The weighted geometric mean of two sets of positive matrices is defined,…
An algebraic-geometric approach for linear regression without correspondences
Manolis C. Tsakiris, Liangzu Peng, Aldo Conca +3
Linear regression without correspondences is the problem of performing a linear regression fit to a dataset for which the correspondences between the independent samples and the ob…
Catalan-like numbers and Hausdorff moment sequences
Hayoung Choi, Yeong-Nan Yeh, Seonguk Yoo
In this paper we show that many well-known counting coefficients, including the Catalan numbers, the Motzkin numbers, the central binomial coefficients, the central Delannoy number…
Comparing large-scale graphs based on quantum probability theory
Hayoung Choi, Hosoo Lee, Yifei Shen +1
In this paper, a new measurement to compare two large-scale graphs based on the theory of quantum probability is proposed. An explicit form for the spectral distribution of the cor…
Structure for -Metric Spaces and Related Fixed Point Theorems
Hayoung Choi, Sejong Kim, Seung Yeop Yang
In this paper, we propose a generalized notion of a distance function, called a -metric. The -metric with degree is a distance of points, generalizing the ordinary…