Parallel Metropolis-Montecarlo Simulation for Potts Model using an Adaptable Network Topology based on Dynamic Graph Partitioning

2008 ◽  
Author(s):  
Carlos Castaneda-Morroquin ◽  
Carmen B. Navarrete ◽  
Alfonso Ortega ◽  
Manuel Alfonseca ◽  
Eloy Anguiano
Keyword(s):  
Network Topology ◽  
Potts Model ◽  
Graph Partitioning ◽  
Dynamic Graph ◽  
Montecarlo Simulation

scholarly journals Capturing the interplay of dynamics and networks through parameterizations of Laplacian operators

2016 ◽  
Vol 2 ◽  
pp. e57 ◽  
Author(s):  
Xiaoran Yan ◽  
Shang-hua Teng ◽  
Kristina Lerman ◽  
Rumi Ghosh
Keyword(s):  
Network Topology ◽  
Network Structure ◽  
Graph Partitioning ◽  
Laplacian Matrix ◽  
Dynamical Process ◽  
Dynamical Processes ◽  
Quality Function ◽  
The Impact ◽  
Laplacian Operators

We study the interplay between a dynamical process and the structure of the network on which it unfolds using the parameterized Laplacian framework. This framework allows for defining and characterizing an ensemble of dynamical processes on a network beyond what the traditional Laplacian is capable of modeling. This, in turn, allows for studying the impact of the interaction between dynamics and network topology on the quality-measure of network clusters and centrality, in order to effectively identify important vertices and communities in the network. Specifically, for each dynamical process in this framework, we define a centrality measure that captures a vertex’s participation in the dynamical process on a given network and also define a function that measures the quality of every subset of vertices as a potential cluster (or community) with respect to this process. We show that the subset-quality function generalizes the traditional conductance measure for graph partitioning. We partially justify our choice of the quality function by showing that the classic Cheeger’s inequality, which relates the conductance of the best cluster in a network with a spectral quantity of its Laplacian matrix, can be extended to the parameterized Laplacian. The parameterized Laplacian framework brings under the same umbrella a surprising variety of dynamical processes and allows us to systematically compare the different perspectives they create on network structure.

scholarly journals Dynamic Graph Partitioning Scheme for Supporting Load Balancing in Distributed Graph Environments

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 65254-65265
Author(s):  
Dojin Choi ◽  
Jinsu Han ◽  
Jongtae Lim ◽  
Jinsuk Han ◽  
Kyoungsoo Bok ◽  
...  
Keyword(s):  
Load Balancing ◽  
Graph Partitioning ◽  
Dynamic Graph

Passive mode discovery of network topology

2014 ◽  
Author(s):  
Lisheng Huang ◽  
Mingyong Yin ◽  
Changchun Li ◽  
Xin Wang
Keyword(s):  
Network Topology ◽  
Passive Mode
Sign in / Sign up

Export Citation Format

Share Document