Related papers: Dominating occupancy processes by the independent …
The configuration model is a sequence of random graphs constructed such that in the large network limit the degree distribution converges to a pre-specified probability distribution. The component structure of such random graphs can be…
In this paper we present the concept of description of random processes in complex systems with the discrete time. It involves the description of kinetics of discrete processes by means of the chain of finite-difference non-Markov equations…
We apply Doeblin's ergodicity coefficient as a computational tool to approximate the occupancy distribution of a set of states in a homogeneous but possibly non-stationary finite Markov chain. Our approximation is based on new properties…
Spatial models for occupancy data are used to estimate and map the true presence of a species, which may depend on biotic and abiotic factors as well as spatial autocorrelation. Traditionally researchers have accounted for spatial…
Occupied diffusions offer a Markovian framework for path-dependent dynamics by lifting the state space with a flow of occupation measures. Because this additional feature is infinite-dimensional, the simulation of these processes remains…
We present an approach that can be useful when the network or system performance is described by a model that is not Markovian. Although most performance models are based on Markov chains or Markov processes, in some cases the Markov…
Quantitative predictions about the processes that promote species coexistence are a subject of active research in ecology. In particular, competitive interactions are known to shape and maintain ecological communities, and situations where…
A simple periodically driven system displaying rich behavior is introduced and studied. The system self-organizes into a mosaic of static ordered regions with three possible patterns, which are threaded by one-dimensional paths on which a…
The graph theoretic concept of maximal independent set arises in several practical problems in computer science as well as in game theory. A maximal independent set is defined by the set of occupied nodes that satisfy some packing and…
We consider two important time scales---the Markov and cryptic orders---that monitor how an observer synchronizes to a finitary stochastic process. We show how to compute these orders exactly and that they are most efficiently calculated…
We consider a particle system with weights and the scaling limits derived from its occupation time. We let the particles perform independent recurrent L\'evy motions and we assume that their initial positions and weights are given by a…
We study an annealed site diluted quantum XY model with spin $S\in \frac{1}{2}\mathbb{N}$. We find regions of the parameter space where, in spite of being a priori favourable for a densely occupied state, phases with staggered occupancy…
Many studies suggest that searching for parking is associated with significant direct and indirect costs. Therefore, it is appealing to reduce the time which car drivers spend on finding an available parking lot, especially in urban areas…
We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…
A relation between a class of stationary points of the energy landscape of continuous spin models on a lattice and the configurations of a Ising model defined on the same lattice suggests an approximate expression for the microcanonical…
We propose Occupancy Flow Fields, a new representation for motion forecasting of multiple agents, an important task in autonomous driving. Our representation is a spatio-temporal grid with each grid cell containing both the probability of…
The ordinary contact process is used to model the spread of a disease in a population. In this model, each infected individual waits an exponentially distributed time with parameter 1 before becoming healthy. In this paper, we introduce and…
A deterministic walk in a random environment can be understood as a general random process with finite-range dependence that starts repeating a loop once it reaches a site it has visited before. Such process lacks the Markov property. We…
The idea is advanced that self-organization in complex systems can be treated as decision making (as it is performed by humans) and, vice versa, decision making is nothing but a kind of self-organization in the decision maker nervous…
We derive new discrete event simulation algorithms for marked time point processes. The main idea is to couple a special structure, namely the associated local independence graph, as defined by Didelez arXiv:0710.5874, with the activity…