Related papers: Switching Transition in a Resource Exchange Model …
In this work, we study the topological transition on the associated networks in a model proposed by Saeedian et al. (Scientific Reports 2019 9:9726), which considers a coupled dynamics of node and link states. Our goal was to better…
We investigate absorption, i.e., almost sure convergence to an absorbing state, in time-varying (non-homogeneous) discrete-time Markov chains with finite state space. We consider systems that can switch among a finite set of transition…
Random key graphs have received considerable attention and been used in various applications including secure sensor networks, social networks, the study of epidemics, cryptanalysis, and recommender systems. In this paper, we investigate a…
We propose a simple model for a binary decision making process on a graph, motivated by modeling social decision making with cooperative individuals. The model is similar to a random field Ising model or fiber bundle model, but with key…
We analyze the non-equilibrium order-disorder transition of Axelrod's model of social interaction in several complex networks. In a small world network, we find a transition between an ordered homogeneous state and a disordered state. The…
We introduce an evolving network model in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability $p$. The resulting network is sparse for $p<\frac{1}{2}$ and dense (average degree…
This paper studies a power transmission system with both conventional generators (CGs) and distributed energy assets (DEAs) providing frequency control. We consider an operating condition with demand aggregating two dynamic components: one…
We consider discrete, iterative load balancing via matchings on arbitrary graphs. Initially each node holds a certain number of tokens, defining the load of the node, and the objective is to redistribute the tokens such that eventually each…
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is…
Firing patterns in the central nervous system often exhibit strong temporal irregularity and heterogeneity in their time averaged response properties. Previous studies suggested that these properties are outcome of an intrinsic chaotic…
We study the independence structure of finitely exchangeable distributions over random vectors and random networks. In particular, we provide necessary and sufficient conditions for an exchangeable vector so that its elements are completely…
Given a graph where every vertex has exactly one labeled token, how can we most quickly execute a given permutation on the tokens? In (sequential) token swapping, the goal is to use the shortest possible sequence of swaps, each of which…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
This paper deals with the balanced truncation model reduction of discrete-time, linear time-varying, heterogeneous subsystems interconnected over finite arbitrary directed graphs. The information transfer between the subsystems is subject…
We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient…
Tipping elements in the Earth System receive increased scientific attention over the recent years due to their nonlinear behavior and the risks of abrupt state changes. While being stable over a large range of parameters, a tipping element…
The zero-temperature Ising model is known to reach a fully ordered ground state in sufficiently dense random graphs. In sparse random graphs, the dynamics gets absorbed in disordered local minima at magnetization close to zero. Here, we…
We present an agent-based model of microscopic wealth exchange in a dynamic network to study the topological features associated with economic inequality. The model evolves through two alternating processes, the conservative exchange of…
We study binary state contagion dynamics on a social network where nodes act in response to the average state of their neighborhood. We model the competing tendencies of imitation and non-conformity by incorporating an off-threshold into…
In this paper, we investigate random walk based token circulation in dynamic environments subject to failures. We describe hypotheses on the dynamic environment that allow random walks to meet the important property that the token visits…