• Kyungpook Mathematical Journal
• /
• v.55 no.2
• /
• pp.373-382
• /
• 2015

In this paper, we introduce and study a new multivalued mapping in $\mathbb{R}$-trees, called k-strictly pseudononspreading. We also introduce a new two-step iterative process for two k-strictly pseudononspreading multivalued mappings in $\mathbb{R}$-trees. Strong convergence theorems of the proposed iteration to a common fixed point of two k-strictly pseudononspreading multivalued mappings in $\mathbb{R}$-trees are established. Our results improve and extend the corresponding results existing in the literature.

• Communications of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.507-518
• /
• 2016

The aim of this paper is to prove some strong convergence theorems for the modified Ishikawa iteration process involving a pair of a generalized asymptotically nonexpansive single-valued mapping and a quasi-nonexpansive multi-valued mapping in the framework of $\mathbb{R}$-trees under the gate condition.

• Honam Mathematical Journal
• /
• v.35 no.4
• /
• pp.757-764
• /
• 2013

In this paper, we give sufficient conditions for a map with nonconvex values to have a continuous selection and the selection extension property in LC-metric spaces under the one-point extension property. And we apply it to weakly lower semicontinuous maps and generalize previous results. We also get a continuous selection theorem for almost lower semicontinuous maps with closed sub-admissible values in $\mathbb{R}$-trees.

• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.1
• /
• pp.79.1-79.1
• /
• 2019

We present an algorithm for the fast computation of the general N-point spatial correlation functions of any discrete point set embedded within an Euclidean space of ${\mathbb{R}}n$. Utilizing the concepts of kd-trees and graph databases, we describe how to count all possible N-tuples in binned configurations within a given length scale, e.g. all pairs of points or all triplets of points with side lengths < rmax. Through benchmarking we show the computational advantage of our new graph-based algorithm over more traditional methods. We show that all 3-point configurations up to and beyond the Baryon Acoustic Oscillation scale (~200 Mpc in physical units) can be performed on current Sloan Digital Sky Survey (SDSS) data in reasonable time. Finally we present the first measurements of the 4-point correlation function of ~0.5 million SDSS galaxies over the redshift range 0.43< z <0.7. We present the publicly available code GRAMSCI (GRAph Made Statistics for Cosmological Information; bitbucket.org/csabiu/gramsci), under a GNU General Public License.