Related papers: Generalized random sequential adsorption on Erd\H{…
We consider random-access networks where nodes represent servers with a queue and can be either active or inactive. A node deactivates at unit rate, while it activates at a rate that depends on its queue length, provided none of its…
Random sequential addition (RSA) models are used in a large variety of contexts to model particle aggregation and jamming. A key feature of these models is the algebraic time dependence of the asymptotic jamming coverage as $t\to\infty$.…
When studying networks using random graph models, one is sometimes faced with situations where the notion of adjacency between nodes reflects multiple constraints. Traditional random graph models are insufficient to handle such situations.…
We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…
Irreversible adsorption of objects of different shapes and sizes on Euclidean, fractal and random lattices is studied. The adsorption process is modeled by using random sequential adsorption (RSA) algorithm. Objects are adsorbed on one-,…
Adsorption of tetramer built of four identical spheres was studied numerically using the Random Sequential Adsorption (RSA) algorithm. Tetramers were adsorbed on a two dimensional, flat and homogeneous surface. Two different models of the…
Concentration results say that a sequence of random variables becomes progressively concentrated around the mean. Such results are common in the study of functions of random graphs. We introduce a real-valued logic with various aggregate…
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach…
Adsorption of trimers and hexamers built of identical spheres was studied numerically using the Random Sequential Adsorption (RSA) algorithm. Particles were adsorbed on a two dimensional, flat and homogeneous surface. Numerical simulations…
We investigate Ramsey numbers of bounded degree graphs and provide an interpolation between known results on the Ramsey numbers of general bounded degree graphs and bounded degree graphs of small bandwidth. Our main theorem implies that…
We study the statistical behavior under random sequential renormalization(RSR) of several network models including Erd"os R'enyi (ER) graphs, scale-free networks and an annealed model (AM) related to ER graphs. In RSR the network is locally…
We consider the Erd\H{o}s-R\'enyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed $d\ge 1$, we show that with high probability, the graph becomes rigid in $\mathbb R^d$…
We propose a new yet natural algorithm for learning the graph structure of general discrete graphical models (a.k.a. Markov random fields) from samples. Our algorithm finds the neighborhood of a node by sequentially adding nodes that…
The random sequential adsorption (RSA) model is modified to describe damage and crack accumulation. The exclusion for object deposition (for damaged region formation) is not for the whole object, as in the standard RSA, but only for the…
In this work, we present a variant of the multilayer random sequential adsorption (RSA) process that is inspired by orthogonal resource sharing in wireless communication networks. In the one-dimensional (1D) version of this variant, the…
We study by Monte Carlo computer simulations random sequential adsorption (RSA) with diffusional relaxation, of lattice hard squares in two dimensions. While for RSA without diffusion the coverage approaches its maximum jamming value…
We give the first polynomial-time, differentially node-private, and robust algorithm for estimating the edge density of Erd\H{o}s-R\'enyi random graphs and their generalization, inhomogeneous random graphs. We further prove…
In this paper we consider the Erd\H{o}s-R\'enyi random graph in the sparse regime in the limit as the number of vertices $n$ tends to infinity. We are interested in what this graph looks like when it contains many triangles, in two…
We model the transmission of information of a message on the Erd\"os-R\'eny random graph with parameters $(n,p)$ and limited resources. The vertices of the graph represent servers that may broadcast a message at random. Each server has a…
We prove a large deviation principle for a greedy exploration process on an Erd\"os-R\'enyi (ER) graph when the number of nodes goes to infinity. To prove our main result, we use the general strategy to study large deviations of processes…