Related papers: Cluster Dynamics for Randomly Frustrated Systems w…
E-science applications may require huge amounts of data and high processing power where grid infrastructures are very suitable for meeting these requirements. The load distribution in a grid may vary leading to the bottlenecks and…
In the load balancing problem, each node in a network is assigned a load, and the goal is to equally distribute the loads among the nodes, by preforming local load exchanges. While load balancing was extensively studied in static networks,…
We propose a structure-preserving model-reduction methodology for large-scale dynamic networks with tightly-connected components. First, the coherent groups are identified by a spectral clustering algorithm on the graph Laplacian matrix…
Clustering is one of the major tasks in data mining. In the last few years, Clustering of spatial data has received a lot of research attention. Spatial databases are components of many advanced information systems like geographic…
Large numbers of ground states of two-dimensional Ising spin glasses with periodic boundary conditions in both directions are calculated for sizes up to 40^2. A combination of a genetic algorithm and Cluster-Exact Approximation is used. For…
Simulating energy systems is vital for energy planning to understand the effects of fluctuating renewable energy sources and integration of multiple energy sectors. Capacity expansion is a powerful tool for energy analysts and consists of…
This work studies the effects of a weak notion of symmetry on diffusively-coupled multi-agent systems. We focus on networks comprised of agents and controllers which are maximally equilibrium independent passive, and show that these…
Symmetries are ubiquitous in network systems and have profound impacts on the observable dynamics. At the most fundamental level, many synchronization patterns are induced by underlying network symmetry, and a high degree of symmetry is…
The inclusion of a fragmentation mechanism in population balance equations introduces complex interactions that make the analytical or even computational treatment much more difficult than for the pure aggregation case. This is specially…
The community structure of complex networks reveals both their organization and hidden relationships among their constituents. Most community detection methods currently available are not deterministic, and their results typically depend on…
This paper studies the dynamics of a network of diffusively-coupled bistable systems. Under mild conditions and without requiring smoothness of the vector field, we analyze the network dynamics and show that the solutions converge globally…
We present a simple mathematical framework for the description of the dynamics of glassy systems in terms of a random walk in a complex energy landscape pictured as a network of minima. We show how to use the tools developed for the study…
Based on statistical approach we described possible formation of spatially inhomogeneous distribution in the system of interacting Fermi particles by long-rage forces, and we demonstrated nonperturbative calculation of the partition…
Emergent design failures are ubiquitous in complex systems, and often arise when system elements cluster. Approaches to systematically reduce clustering could improve a design's resilience, but reducing clustering is difficult if it is…
We discuss the problem of ultrametricity in mean field spin glasses by means of a hierarchical clustering algorithm. We complement the clustering approach with quantitative testing: we discuss both in some detail. We show that the…
Controlling complex dynamical systems has been a topic of considerable interest in academic circles in recent decades. While existing works have primarily focused on closed-loop control schemes with infinite-time durations, this paper…
Using molecular dynamics simulation, we investigate the slow dynamics of a supercooled binary mixture of soft particles interacting with a generalized Hertzian potential. At low density, it displays typical slow dynamics near its glass…
We consider the storage properties of temporal patterns, i.e. cycles of finite lengths, in neural networks represented by (generally asymmetric) spin glasses defined on random graphs. Inspired by the observation that dynamics on sparse…
We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the {\em loop algorithm}. The basic steps in constructing a…
A general scheme for devising efficient cluster dynamics proposed in a previous letter [Phys.Rev.Lett. 72, 1541 (1994)] is extensively discussed. In particular the strong connection among equilibrium properties of clusters and dynamic…