Related papers: A Central Limit Theorem for Diffusion in Sparse Ra…
We consider a generalization of the so-called divide and color model recently introduced by Haggstrom. We investigate the behaviour of the magnetization in large boxes and its fluctuations. Thus, laws of large numbers and Central Limit…
We study percolation on networks, which is used as a model of the resilience of networked systems such as the Internet to attack or failure and as a simple model of the spread of disease over human contact networks. We reformulate…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
We discuss the diffusion phenomenon in the parabolic and hyperbolic regimes. New effects related to the finite velocity of the diffusion process are predicted, that can partially explain the strange behavior associated to adsorption…
We study fluctuations of the empirical processes of a non-equilibrium interacting particle system consisting of two species over a domain that is recently introduced in [8] and establish its functional central limit theorem. This…
Network dynamics with point-process-based interactions are of paramount modeling interest. Unfortunately, most relevant dynamics involve complex graphs of interactions for which an exact computational treatment is impossible. To circumvent…
The explosive percolation problem on the complete graph is investigated via extensive numerical simulations. We obtain the cluster-size distribution at the moment when the cluster size heterogeneity becomes maximum. The distribution is…
We study small perturbations of diffusion processes in $\mathbb{R}^d$ that leave invariant a finite collection of hypersurfaces. Each surface is assumed to be repelling for the unperturbed process, and the unperturbed motion on each of the…
Bootstrap percolation provides an emblematic instance of phase behavior characterised by an abrupt transition with diverging critical fluctuations. This unusual hybrid situation generally occurs in particle systems in which the occupation…
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the `people' graph…
We establish a central limit theorem for the sum of $\epsilon$-independent random variables, extending both the classical and free probability setting. Central to our approach is the use of graphon limits to characterize the limiting…
We study diffusion on a substrate with permanent traps distributed with critical positional correlation, modeled by their placement on the perimeters of a critical percolation cluster. We perform a numerical analysis of the vibrational…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
We formulate and establish the central limit theorem for products of i.i.d. random variables on arbitrary simply connected nilpotent Lie groups, allowing a possible bias. Two new phenomena arise in the presence of a bias: (a) the walk…
We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs…
In this paper, we study convergence of coupled dynamical systems on convergent sequences of graphs to a continuum limit. We show that the solutions of the initial value problem for the dynamical system on a convergent graph sequence tend to…
In $\HH$-bootstrap percolation, a set $A \subset V(\HH)$ of initially 'infected' vertices spreads by infecting vertices which are the only uninfected vertex in an edge of the hypergraph $\HH$. A particular case of this is the $H$-bootstrap…
This paper concerns the large deviations of a system of interacting particles on a random graph. There is no stochasticity, and the only sources of disorder are the random graph connections, and the initial condition. The average number of…
A random growth lattice filling model of percolation with touch and stop growth rule is developed and studied numerically on a two dimensional square lattice. Nucleation centers are continuously added one at a time to the empty sites and…
The $r$-neighbour bootstrap process describes an infection process on a graph, where we start with a set of initially infected vertices and an uninfected vertex becomes infected as soon as it has $r$ infected neighbours. An inital set of…