◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hyunju Kim

4 papers hereh-index 6392 citations12 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author3
  • middle author1

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • physics.soc-ph2
  • cs.SI1
  • math.CO1
same name
  • Hyunju Kim — 6 papers, h 10
  • Hyunju Kim — 5 papers, h 6
  • Hyunju Kim — 4 papers, h 6
  • Hyunju Kim — 4 papers, h 4
  • Hyunju Kim — 2 papers, h 3
  • Hyunju Kim — 2 papers, h 5

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20092023
most citedEfficient and exact sampling of simple graphs with given arbitrary degree sequence

170 citations · 225 across the 4 of their papers we have counts for

collaborators

4 papers

cs.SI2023

Characterization of Simplicial Complexes by Counting Simplets Beyond Four Nodes

Hyunju Kim, Jihoon Ko, Fanchen Bu +1

Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in…

physics.soc-ph2011★ 55 cited

Constructing and sampling directed graphs with given degree sequences

H. Kim, C. I. Del Genio, K. E. Bassler +1

The interactions between the components of complex networks are often directed. Proper modeling of such systems frequently requires the construction of ensembles of digraphs with a…

physics.soc-ph2010★ 170 cited

Efficient and exact sampling of simple graphs with given arbitrary degree sequence

Charo I. Del Genio, Hyunju Kim, Zoltan Toroczkai +1

Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangin…

math.CO2009

Degree-based graph construction

Hyunju Kim, Zoltan Toroczkai, Péter L. Erdős +2

Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.