Related papers: A Central Limit Theorem for Diffusion in Sparse Ra…
We investigate the phenomenon of diffusion in a countably infinite society of individuals interacting with their neighbors in a network. At a given time, each individual is either active or inactive. The diffusion is driven by two…
We generalize the poissonian evolving random graph model of Bauer and Bernard to deal with arbitrary degree distributions. The motivation comes from biological networks, which are well-known to exhibit non poissonian degree distribution. A…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…
In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…
We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.
We investigate properties of node centrality in random growing tree models. We focus on a measure of centrality that computes the maximum subtree size of the tree rooted at each node, with the most central node being the tree centroid. For…
In this Letter, we show that the explosive percolation is a novel continuous phase transition. The order-parameter-distribution histogram at the percolation threshold is studied in Erd\H{o}s-R\'{e}nyi networks, scale-free networks, and…
Ordinary differential equations obtained as limits of Markov processes appear in many settings. They may arise by scaling large systems, or by averaging rapidly fluctuating systems, or in systems involving multiple time-scales, by a…
We study a majority based preference diffusion model in which the members of a social network update their preferences based on those of their connections. Consider an undirected graph where each node has a strict linear order over a set of…
We study the percolation configuration arising from the random current representation of the near-critical Ising model on the complete graph. We compute the scaling limit of the cluster size distribution for an arbitrary set of sources in…
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…
In their work [Proc. Natl. Acad. Sci. USA 112 (2015) E5725], Bosse et al. experimentally showed that virus capsid exhibits not only normal diffusion but also anomalous diffusion in nucleus of a living cell. There, it was found that the…
We study the following bootstrap percolation process: given a connected graph $G$, a constant $\rho \in [0, 1]$ and an initial set $A \subseteq V(G)$ of \emph{infected} vertices, at each step a vertex~$v$ becomes infected if at least a…
Two similar Minkowskian diffusions have been considered, on one hand by Barbachoux, Debbasch, Malik and Rivet ([BDR1], [BDR2], [BDR3], [DMR], [DR]), and on the other hand by Dunkel and H\"anggi ([DH1], [DH2]). We address here two questions,…
We consider weakly interacting jump processes on time-varying random graphs with dynamically changing multi-color edges. The system consists of a large number of nodes in which the node dynamics depends on the joint empirical distribution…
The spread of new ideas, behaviors or technologies has been extensively studied using epidemic models. Here we consider a model of diffusion where the individuals' behavior is the result of a strategic choice. We study a simple coordination…
We establish central and non-central limit theorems for sequences of functionals of the Gaussian output of an infinitely-wide random neural network on the d-dimensional sphere . We show that the asymptotic behaviour of these functionals as…
We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…
We extend classical bootstrap percolation by introducing two concurrent, competing processes on an Erd\H{o}s--R\'{e}nyi random graph $G(n,p_n)$. Each node can assume one of three states: red, black, or white. The process begins with…
We consider the empirical process G_t of a one-dimensional diffusion with finite speed measure, indexed by a collection of functions F. By the central limit theorem for diffusions, the finite-dimensional distributions of G_t converge weakly…