Related papers: Transitive closure in a polluted environment
We study a family of interacting particle systems with annihilating and coalescing reactions. Two types of particles are interspersed throughout a transitive unimodular graph. Both types diffuse as simple random walks with possibly…
We identify a new type of pattern formation in spatially distributed active systems. We simulate one-dimensional two-component systems with predator-prey local interaction and pursuit-evasion taxis between the components. In a sufficiently…
By event-driven molecular dynamics simulations we investigate magneto-transport in a two-dimensional model with randomly distributed scatterers close to the field-induced localization transition. This transition is generated by percolating…
Consider a discrete locally finite subset $\Gamma$ of $R^d$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. The…
A bootstrap percolation process on a graph G is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round every uninfected node which has at least r infected neighbours…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
The congestion formation on a urban road network is one of the key issue for the development of a sustainable mobility in the future smart cities. In this work we propose a reductionist approach studying the stationary states of a simple…
We introduce a new percolation model to describe and analyze the spread of an epidemic on a general directed and locally finite graph. We assign a two-dimensional random weight vector to each vertex of the graph in such a way that the…
We introduce and solve a model of hardcore particles on a one dimensional periodic lattice which undergoes an active-absorbing state phase transition at finite density. In this model an occupied site is defined to be active if its left…
We consider a slight modification of the frog model. For a given graph, each vertex has $\mathrm{Poisson}(\lambda)$ particles (or frogs). At time zero, only the particles at the origin are active, and all the other particles are sleeping.…
The bootstrap percolation (or threshold model) is a dynamic process modelling the propagation of an epidemic on a graph, where inactive vertices become active if their number of active neighbours reach some threshold. We study an…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
Recent studies have indicated that the coarse grained dynamics of a large class of traffic models and driven-diffusive systems may be described by urn models. We consider a class of one-dimensional urn models whereby particles hop from an…
The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups…
We make the first steps towards generalizing the theory of stochastic block models, in the sparse regime, towards a model where the discrete community structure is replaced by an underlying geometry. We consider a geometric random graph…
The margins within the geographic range of species are often specific in terms of ecological and evolutionary processes, and can strongly influence the species' reaction to climate change. One of the frequently observed features at range…
2-boostrap percolation on a graph is a diffusion process where a vertex gets infected whenever it has at least 2 infected neighbours, and then stays infected forever. It has been much studied on the infinite grid for random Bernoulli…
We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
We investigate the geometric properties of loops on two-dimensional lattice graphs, where edge weights are drawn from a distribution that allows for positive and negative weights. We are interested in the appearance of spanning loops of…