Related papers: Stochastic Sandpile Model: exact sampling and comp…
By means of the asynchronous cellular automata algorithm we study stationary states and spatial patterning in an $SIS$ model, in which the individuals' are attached to the vertices of a graph and their mobility is mimicked by varying the…
Studying sample path behaviour of stochastic fields/processes is a classical research topic in probability theory and related areas such as fractal geometry. To this end, many methods have been developed since a long time in Gaussian…
Kinetic self-avoiding trails are introduced and used to generate a substrate of randomly quenched flow vectors. Sandpile model is studied on such a substrate with asymmetric toppling matrices where the precise balance between the net…
Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.
We study a stochastic lattice gas of particles undergoing asymmetric diffusion in two dimensions. Transitions between a low-density uniform phase and high-density non-uniform phases characterized by localized or extended structure are…
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…
Due to the existence of multiple stationary distributions, we study the stability and instability of a stationary distribution for distribution dependent stochastic differential equations. This note is devoted to the instability of a…
The result of 2-dimensional Gaussian lattice fit to a speckle intensity pattern based on a linear model that includes nearest-neighbor interactions is presented. We also include a Monte Carlo simulation of the same spatial speckle pattern…
We consider Markov models of large-scale networks where nodes are characterized by their local behavior and by a mobility model over a two-dimensional lattice. By assuming random walk, we prove convergence to a system of partial…
To explain day-to-day (DTD) route-choice behaviors and traffic dynamics observed in a series of lab experiments, Part I of this research proposed a discrete choice-based analytical dynamic model (Qi et al., 2023). Although the deterministic…
Exact results on particle-densities as well as correlators in two models of immobile particles, containing either a single species or else two distinct species, are derived. The models evolve following a descent dynamics through…
We consider random perturbations of discrete-time dynamical systems. We give sufficient conditions for the stochastic stability of certain classes of maps, in a strong sense. This improves the main result in J. F. Alves, V. Araujo, Random…
We derive an existence result for solutions of a differential system which characterizes the equilibria of a particular model in granular matter theory, the so-called partially open table problem for growing sandpiles. Such result…
Layered stable (multivariate) distributions and processes are defined and studied. A layered stable process combines stable trends of two different indices, one of them possibly Gaussian. More precisely, in short time, it is close to a…
Recent studies have highlighted the sensitivity of active matter to boundaries and their geometries. Here we develop a general theory for the dynamics and statistics of active particles on curved surfaces and illustrate it on two examples.…
In this paper, we study "robust" dominating sets of random graphs that retain the domination property even if a small \emph{deterministic} set of edges are removed. We motivate our study by illustrating with examples from wireless networks…
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the…
We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…
We consider the median dynamics process in general graphs. In this model, each vertex has an independent initial opinion uniformly distributed in the interval [0,1] and, with rate one, updates its opinion to coincide with the median of its…
In recent works, we have proposed a stochastic cellular automaton model of traffic flow connecting two exactly solvable stochastic processes, i.e., the Asymmetric Simple Exclusion Process and the Zero Range Process, with an additional…