Related papers: The evolution of subcritical Achlioptas processes
In a new type of percolation phase transition, which was observed in a set of non-equilibrium models, each new connection between vertices is chosen from a number of possibilities by an Achlioptas-like algorithm. This causes preferential…
We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical…
After the Achlioptas process (AP), which yields the so-called explosive percolation, was introduced, the number of papers on percolation phenomena has been literally exploding. Most of the existing studies, however, have focused only on the…
A bootstrap percolation process on a graph $G$ is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round each uninfected node which has at least $r$ infected neighbours…
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…
The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…
The finite-size scaling (FSS) theory for continuous phase transitions has been useful in determining the critical behavior from the size dependent behaviors of thermodynamic quantities. When the phase transition is discontinuous, however,…
The vital nodes are the ones that play an important role in the organization of network structure or the dynamical behaviours of networked systems. Previous studies usually applied the node centralities to quantify the importance of nodes.…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
We study four Achlioptas type processes with "explosive" percolation transitions. All transitions are clearly continuous, but their finite size scaling functions are not entire holomorphic. The distributions of the order parameter, the…
A bootstrap percolation process on a graph G is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round every uninfected node which has at least r infected neighbours…
In this paper we review the recent advances on explosive percolation, a very sharp phase transition first observed by Achlioptas et al. (Science, 2009). There a simple model was proposed, which changed slightly the classical percolation…
We introduce perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equations. These models are local, in the sense that at each step…
We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…
We present a novel approach to study the evolution of the size (i.e. the number of vertices) of the giant component of a random graph process. It is based on the exploration algorithm called simultaneous breadth-first walk, introduced by…
The Norros-Reittu model is a random graph with $n$ vertices and i.i.d. weights assigned to them. The number of edges between any two vertices follows an independent Poisson distribution whose parameter is increasing in the weights of the…
A growing random graph is constructed by successively sampling without replacement an element from the pool of virtual vertices and edges. At start of the process the pool contains $N$ virtual vertices and no edges. Each time a vertex is…