Related papers: Localisation in a growth model with interaction. A…
We define a class of probability distributions that we call simplicial mixture models, inspired by simplicial complexes from algebraic topology. The parameters of these distributions represent their topology and we show that it is possible…
Aggregation processes in systems of planar macromolecules and colloids drive a broad range of phenomena in natural systems and soft materials. Depending on chemical architecture, intermolecular interactions in these systems may favor…
If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability…
We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…
We investigate regular configurations of a small number of particles settling under gravity in a viscous fluid. The particles do not touch each other and can move relative to each other. The dynamics is analyzed in the point-particle…
We introduce a simple model of active transport for an ensemble of particles driven by an external shear flow. Active refers to the fact that the flow of the particles is modified by the distribution of particles itself. The model consists…
The study of "random segments" is a classic issue in geometrical probability, whose complexity depends on how it is defined. But in apparently simple models, the random behavior is not immediate. In the present manuscript the following…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
Start with a graph with a subset of vertices called {\it the border}. A particle released from the origin performs a random walk on the graph until it comes to the immediate neighbourhood of the border, at which point it joins this subset…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…
Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…
When particles move at a constant speed and have the tendency to align their directions of motion, ordered large scale movement can emerge despite significant levels of noise. Many variants of this model of self-propelled particles have…
This paper addresses the general problem of modelling and learning rank data with ties. We propose a probabilistic generative model, that models the process as permutations over partitions. This results in super-exponential combinatorial…
The step-growth polymerisation of a mixture of arbitrary-functional monomers is viewed as a time-continuos random graph process with degree bounds that are not necessarily the same for different vertices. The sequence of degree bounds acts…
We consider an infinite system of particles in one dimension, each particle performs independant Sinai's random walk in random environment. Considering an instant $t$, large enough, we prove a result in probability showing that the…
We consider the stochastic ranking process with space-time dependent jump rates for the particles. The process is a simplified model of the time evolution of the rankings such as sales ranks at online bookstores. We prove that the joint…
We consider the long time behavior of heterogeneously interacting diffusive particle systems and their large population limit. The interaction is of mean field type with weights characterized by an underlying graphon. The limit is given by…
We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…
The diffusion of finite-size hard-core interacting particles in two- or three-dimensional confined domains is considered in the limit that the confinement dimensions become comparable to the particle's dimensions. The result is a nonlinear…