user login 

Conference on Applications of Network Theory
Conference on Applications of Network Theory
7-9 April 2011
Home > Contribution details
get PDF of this contribution get XML of this contribution get ICal of this contribution
Linear and Optimization Hamiltonians in Random Graph Modeling
Exponential random graph theory is the complex network
analog of the canonical ensemble theory from statistical
physics. While it has been particularly successful in
modeling networks with specified degree distributions, a
naïve model of a clustered network using a graph Hamiltonian
linear in the number of triangles has been shown to undergo
an abrupt transition into an unrealistic phase of extreme
clustering via triangle condensation. Here we study a
non-linear graph Hamiltonian that explicitly forbids such a
condensation and show numerically that it generates an
equilibrium phase with specified intermediate clustering. We
also discuss some applications based on Hamiltonian-based
graph theory.
Id: 256
Room: FD5
Starting date:
08-Apr-2011   15:10
Duration: 40'
Presenters: Dr. PARK, Juyong

Nordita  | Last modified 07 March 2015 10:29  |  HELP