Related papers: Is there switching without suspended horseshoes?
We extend the Markov additive methodology developed in [Ann. Appl. Probab. 9 (1999) 110-145, Ann. Appl. Probab. 11 (2001) 596-607] to obtain the sharp asymptotics of the steady state probability of a queueing network when one of the nodes…
We consider a process where a spin hops across a discrete network and at certain sites couples to static spins. While this setting is implementable in various scenarios (e.g quantum dots or coupled cavities) the physics of such processes is…
The elephant random walk is a history-dependent random walk. We study a class of interacting elephant random walks. Our model includes the exclusion process as a special case. By means of Monte Carlo simulations and mean-field arguments, we…
Starting from a Markov chain with a finite alphabet, we consider the chain obtained when all but one symbol are undistinguishable for the practitioner. We study necessary and sufficient conditions for this chain to have continuous…
Contrary to many recent models of growing networks, we present a model with fixed number of nodes and links, where it is introduced a dynamics favoring the formation of links between nodes with degree of connectivity as different as…
This paper, we explore the dynamics of threshold networks on undirected signed graphs. Much attention has been dedicated to understanding the convergence and long-term behavior of this model. Yet, an open question persists: How does the…
The ordinary time-dependent perturbation theory of quantum mechanics, that describes the interaction of a stationary system with a time-dependent perturbation, predicts that the transition probabilities induced by the perturbation are…
We investigate the possibilities of a tight binding ladder network as a mesoscopic switching device. Several cases have been discussed in which any one or both the arms of the ladder can assume random, ordered or quasiperiodic distribution…
It is shown that irreducible two-state continuous-time Markov chains interacting on a network in a bilinear fashion have a unique stable steady state. The proof is elementary and uses the relative entropy function.
We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning…
This paper considers continuously differentiable functions of two vector variables that have (possibly a continuum of) min-max saddle points. We study the asymptotic convergence properties of the associated saddle-point dynamics…
Dynamical patterns in complex networks of coupled oscillators are both of theoretical and practical interest, yet to fully reveal and understand the interplay between pattern emergence and network structure remains to be an outstanding…
Models such as those involving abrupt changes in the Earth's reflectivity due to ice melt and formation often use nonlinear terms (e.g., hyperbolic tangent) to model the transition between two states. For various reasons, these models are…
In social dilemmas, most interactions are transient and susceptible to restructuring, leading to continuous changes in social networks over time. Typically, agents assess the rewards of their current interactions and adjust their…
Recent advances in human mobility research have revealed consistent pairwise characteristics in movement behavior, yet existing mobility models often overlook the spatial and topological structure of mobility networks. By analyzing millions…
An abelian network is a collection of communicating automata whose state transitions and message passing each satisfy a local commutativity condition. This paper is a continuation of the abelian networks series of Bond and Levine (2016),…
In this work we present a model for evolving networks, where the driven force is related to the social affinity between individuals in a population. In the model, a set of individuals initially arranged on a regular ordered network and thus…
This paper enriches the topological horseshoe theory using finite subshift theory in symbolic dynamical systems, and develops an elementary framework addressing incomplete crossing and semi-horseshoes. Two illustrative examples are…
The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…
We study asymptotic stability of continuous-time systems with mode-dependent guaranteed dwell time. These systems are reformulated as special cases of a general class of mixed (discrete-continuous) linear switching systems on graphs, in…