15 citations · 39 across the 6 of their papers we have counts for
8 papers
Arithmetic Conditions for the Invertibility of Circulant Matrices over Finite Fields
Jeong-Ok Choi, Youngmi Hur
This paper investigates arithmetic conditions, over finite fields, for the invertibility of circulant matrices whose first row is , in terms of linear constra…
Phase transition in the diffusion and bootstrap percolation models on regular random and Erdős-Rényi networks
Jeong-Ok Choi, Unjong Yu
The diffusion and bootstrap percolation models were studied in regular random and Erdős-Rényi networks using the modified Newman-Ziff algorithms. We calculated the percolation thre…
Invertibility of circulant matrices of arbitrary size
Jeong-Ok Choi, Youngmi Hur
In this paper, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear com…
Bootstrap and diffusion percolation transitions in three-dimensional lattices
Jeong-Ok Choi, Unjong Yu
We study the bootstrap and diffusion percolation models in the simple-cubic (sc), body-centered cubic (bcc), and face-centered cubic (fcc) lattices using the Newman-Ziff algorithm.…
Diffusion of innovations in finite networks: effects of heterogeneity, clustering, and bilingual option on the threshold in the contagion game model
Jeong-Ok Choi, Unjong Yu
The contagion threshold for diffusion of innovations is defined and calculated in finite graphs (two-dimensional regular lattices, regular random networks (RRNs), and two kinds of…
Newman-Ziff algorithm for the bootstrap percolation: application to the Archimedean lattices
Jeong-Ok Choi, Unjong Yu
We propose very efficient algorithms for the bootstrap percolation and the diffusion percolation models by extending the Newman-Ziff algorithm of the classical percolation [M. E. J…
A note on general epidemic region for infinite regular graphs
Unjong Yu, Jeong-Ok Choi
We study the contagion game with the bilingual option on infinite regular graphs introduced and modeled mathematically in [N. Immorlica et al. (2007)]. In the reference, Immorlica…
Fixation probability on clique-based graphs
Jeong-Ok Choi, Unjong Yu
The fixation probability of a mutant in the evolutionary dynamics of Moran process is calculated by the Monte-Carlo method on a few families of clique-based graphs. It is shown tha…