Related papers: Border aggregation model
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal properties of this process in the new setting where the…
Exclusive diffusion on a one-dimensional lattice is studied. In the model particles hop stochastically into both directions with different rates. At the ends of the lattice particles are injected and removed. The exact stationary…
We introduce and investigate a new model of a finite number of particles jumping forward on the real line. The jump lengths are independent of everything, but the jump rate of each particle depends on the relative position of the particle…
Semi-random processes involve an adaptive decision-maker, whose goal is to achieve some predetermined objective in an online randomized environment. They have algorithmic implications in various areas of computer science, as well as…
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…
Consider "Frozen Random Walk" on $\mathbb{Z}$: $n$ particles start at the origin. At any discrete time, the leftmost and rightmost $\lfloor{\frac{n}{4}}\rfloor$ particles are "frozen" and do not move. The rest of the particles in the "bulk"…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes. We establish cutoff phenomena for…
Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…
We study reaction-diffusion processes with multi-species of particles and hard-core interaction. We add boundary driving to the system by means of external reservoirs which inject and remove particles, thus creating stationary currents. We…
In this article we present an algorithm to compute bounds on the marginals of a graphical model. For several small clusters of nodes upper and lower bounds on the marginal values are computed independently of the rest of the network. The…
We consider a continuous-time branching random walk on $\mathbb{Z}$ in a random non homogeneous environment. Particles can walk on the lattice points or disappear with random intensities. The process starts with one particle at initial time…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
A new approach to describing aerosol behavior is proposed. Boundary functionals of random process theory are applied to describe the behavior of aerosol concentrations during coagulation. It is shown that considering the first-passage time…
We introduce the concept of geometric extremal graphical models, which are defined through the gauge function of the limit set obtained from suitably scaled random vectors in light-tailed margins. For block graphs, we prove results relating…
Consider the model where particles are initially distributed on $\mathbb{Z}^d, \, d\geq 2$, according to a Poisson point process of intensity $\lambda>0$, and are moving in continuous time as independent simple symmetric random walks. We…
The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small world property of real…
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…
We study preferential attachment mechanisms in random graphs that are parameterized by (i) a constant bias affecting the degree-biased distribution on the vertex set and (ii) the distribution of times at which new vertices are created by…