◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

H. Rieger

12 papers hereh-index 416.4k citations238 works total

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

author position
  • first author1
  • middle author3
  • last author8

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

fields
  • cond-mat.dis-nn5
  • cond-mat.stat-mech4
  • cond-mat1
  • cond-mat.supr-con1
  • q-bio.TO1
same name
  • H. Rieger — 1 paper, h 13

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
19952008
most citedConstrained spin dynamics description of random walks on hierarchical scale-free networks

27 citations · 103 across the 8 of their papers we have counts for

collaborators
Showing cond-mat.stat-mechShow all

4 papers · 1 filter

cond-mat.stat-mech2005★ 14 cited

Disorder-induced phases in the S=1 antiferromagnetic Heisenberg chain

Péter Lajkó, Enrico Carlon, Heiko Rieger +1

We use extensive density matrix renormalization group (DMRG) calculations to explore the phase diagram of the random S=1 antiferromagnetic Heisenberg chain with a power-law distrib…

cond-mat.stat-mech2005★ 19 cited

Maximum flow and topological structure of complex networks

Deok-Sun Lee, Heiko Rieger

The problem of sending the maximum amount of flow q between two arbitrary nodes s and t of complex networks along links with unit capacity is studied, which is equivalent to…

cond-mat.stat-mech2003★ 27 cited

Constrained spin dynamics description of random walks on hierarchical scale-free networks

Jae Dong Noh, Heiko Rieger

We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chai…

cond-mat.stat-mech2003

Random Walks on Complex Networks

Jae Dong Noh, Heiko Rieger

We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk…

◍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.