Related papers: Switching Transition in a Resource Exchange Model …
We study a model of wealth dynamics [Bouchaud and M\'ezard 2000, \emph{Physica A} \textbf{282}, 536] which mimics transactions among economic agents. The outcomes of the model are shown to depend strongly on the topological properties of…
In the context of understanding the nature of the risk transformation process of the financial system we propose an iterative risk-trading game between several agents who build their trading strategies based on a general utility setting.…
We develop a formalism to study linearized perturbations around the equilibria of a pure exchange economy. With the use of mean field theory techniques, we derive equations for the flow of products in an economy driven by heterogeneous…
We consider a model of nomadic agents exploring and competing for time-varying location-specific resources, arising in crowdsourced transportation services, online communities, and in traditional location based economic activity. This model…
We present a model in which we investigate the structure and evolution of a random network that connects agents capable of exchanging wealth. Economic interactions between neighbors can occur only if the difference between their wealth is…
We discuss a non-equilibrium statistical system on a graph or network. Identical particles are injected, interact with each other, traverse, and leave the graph in a stochastic manner described in terms of Poisson rates, possibly dependent…
This paper is a step towards a systematic theory of the transitivity (clustering) phenomenon in random networks. A static framework is used, with adjacency matrix playing the role of the dynamical variable. Hence, our model is a matrix…
We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of 3-loops (triangles). We find that such ensembles generally exhibit two transitions, a clustering…
In this note we study the phase transition for percolation on quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention probabilities. A quasi-transitive graph is an infinite graph with finitely many different "types" of…
Time-varying connections are crucial in understanding the structures and dynamics of complex networks. In this paper, we propose a continuous-time switching topology model for temporal networks that is driven by bursty behavior and study…
Nonlinear dynamical systems may be exposed to tipping points, critical thresholds at which small changes in the external inputs or in the systems parameters abruptly shift the system to an alternative state with a contrasting dynamical…
This article deals with input-to-state stability (ISS) of discrete-time switched systems. Given a family of nonlinear systems with exogenous inputs, we present a class of switching signals under which the resulting switched system is ISS.…
To mimic the complex transport-like collective phenomena in a man-made or natural system, we study an open network junction model of totally asymmetric simple exclusion process with bulk particle attachment and detachment. The stationary…
We study an open-chain totally asymmetric exclusion process (TASEP) with stochastic gates present at the two boundaries. The gating dynamics has been modeled keeping the physical system of ion-channel gating in mind. These gates can…
Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.
The possibility to analyze everyday monetary transactions is limited by the scarcity of available data, as this kind of information is usually considered highly sensitive. Present econophysics models are usually employed on presumed random…
Iterative load balancing algorithms for indivisible tokens have been studied intensively in the past. Complementing previous worst-case analyses, we study an average-case scenario where the load inputs are drawn from a fixed probability…
We study the weighted token swapping problem, in which we are given a graph on $n$ vertices, $n$ weighted tokens, an initial assignment of one token to each vertex, and a final assignment of one token to each vertex. The goal is to find a…