—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
Abstract-- We investigate cascade dynamics in thresholdcontrolled (multiplex) propagation on random geometric networks. We find that such local dynamics can serve as an efficient, ...
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...
Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, E...
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...