相关论文: Erdos-Renyi random graphs + forest fires = self-or…
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 give a rigorous proof of two phase transitions for a disordered system designed to find large cliques inside Erdos random graphs. Such a system is associated with a conservative probabilistic cellular automaton inspired by the cavity…
We consider a multitype epidemic model which is a natural extension of the randomized Reed--Frost epidemic model. The main result is the derivation of an asymptotic Gaussian limit theorem for the final size of the epidemic. The method of…
The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
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…
We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message passing approach to evaluate heterogeneous, node dependent probabilities of belonging to the giant or…
We study the level spacing distribution p(s) in the spectrum of random networks. According to our numerical results, the shape of p(s) in the Erdos-Renyi (E-R) random graph is determined by the average degree <k>, and p(s) undergoes a…
This paper examines a model involving two dynamic Erd\H{o}s-R\'enyi random graphs that evolve in parallel, with edges in each graph alternating between being present and absent according to specified on- and off-time distributions. A key…
In this paper we consider a population process evolving on a dynamic random graph. The dynamic random graph is an Erd\H{o}s--R\'enyi graph that is resampled every time unit, independently of the previous ones, with `edge existence…
We study a discrete model of coagulation, involving a large number $N$ of particles. Pairs of particles are given i.i.d exponential clocks with parameter $1/N$. When a clock rings, a link between the corresponding pair of particles is…
We introduce a random finite rooted tree $\mathcal{C}$, the steady state cluster, characterized by a recursive description: $\mathcal{C}$ is a singleton with probability $1/2$ and otherwise is obtained by joining by an edge the roots of two…
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{\'e}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a…
We propose two classes of dynamic versions of the classical Erd\H{o}s-R\'enyi graph: one in which the transition rates are governed by an external regime process, and one in which the transition rates are periodically resampled. For both…
Spontaneous explosive is an abrupt transition to collective behavior taking place in heterogeneous networks when the frequencies of the nodes are positively correlated to the node degree. This explosive transition was conjectured to be…
We study a graph-theoretic property known as robustness, which plays a key role in certain classes of dynamics on networks (such as resilient consensus, contagion and bootstrap percolation). This property is stronger than other graph…
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…
Many systems, ranging from engineering to medical to societal, can only be properly characterized by multiple interdependent networks whose normal functioning depends on one another. Failure of a fraction of nodes in one network may lead to…
We consider the canonical ensemble of multilayered constrained Erdos-Renyi networks (CERN) and regular random graphs (RRG), where each layer represents graph vertices painted in a specific color. We study the critical behavior in such…