Related papers: Phase Transitions in Partially Structured Random G…
We apply a PDE-based method to deduce the critical time and the size of the giant component of the ``triangle percolation'' on the Erd\H{o}s-R\'enyi random graph process investigated by Palla, Der\'enyi and Vicsek
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…
We define a continuum percolation model that provides a collection of random ellipses on the plane and study the behavior of the covered set and the vacant set, the one obtained by removing all ellipses. Our model generalizes a construction…
We consider the graphical representations of the Ising model on tree-like graphs. We construct a class of graphs on which the loop $\mathrm{O}(1)$ model and the single random current exhibit a non-unique phase transition with respect to the…
The following random graph model was introduced for the evolution of protein-protein interaction networks: Let $\mathcal G = (G_n)_{n=n_0, n_0+1,...}$ be a sequence of random graphs, where $G_n = (V_n, E_n)$ is a graph with $|V_n|=n$…
The existence (or not) of infinite clusters is explored for two stochastic models of intersecting line segments in $d \ge 2$ dimensions. Salient features of the phase diagram are established in each case. The models are based on site…
We present an analytic proof of the existence of phase transition in the large $N$ limit of certain random noncommutaitve geometries. These geometries can be expressed as ensembles of Dirac operators. When they reduce to single matrix…
Archdeacon and Grable (1995) proved that the genus of the random graph $G\in\mathcal{G}_{n,p}$ is almost surely close to $pn^2/12$ if $p=p(n)\geq3(\ln n)^2n^{-1/2}$. In this paper we prove an analogous result for random bipartite graphs in…
We propose the $K$-selective percolation process as a model for the iterative removals of nodes with the specific intermediate degree in complex networks. In the model, a random node with degree $K$ is deactivated one by one until no more…
We provide a sufficient condition on the isoperimetric properties of a regular graph $G$ of growing degree $d$, under which the random subgraph $G_p$ typically undergoes a phase transition around $p=\frac{1}{d}$ which resembles the…
We study a model of network with clustering and desired node degree. The original purpose of the model was to describe optimal structures of scientific collaboration in the European Union. The model belongs to the family of exponential…
The location and nature of the percolation transition in random networks is a subject of intense interest. Recently, a series of graph evolution processes have been introduced that lead to discontinuous percolation transitions where the…
In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree…
We consider a recently introduced model of color-avoiding percolation defined as follows. Every edge in a graph $G$ is colored in some of $k\ge 2$ colors. Two vertices $u$ and $v$ in $G$ are said to be CA-connected if $u$ and $v$ may be…
Discontinuous percolation transitions and the associated tricritical points are manifest in a wide range of both equilibrium and non-equilibrium cooperative phenomena. To demonstrate this, we present and relate the continuous and first…
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…
In the corrupted compass model on a vertex-transitive graph, a neighbouring edge of every vertex is chosen uniformly at random and opened. Additionally, with probability $p$, independently for every vertex, every neighbouring edge is…
For a given permutation $\pi_n$ in $S_n$, a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (\pi_n(i) - \pi_n (j)) < 0$. In this paper, we study various statistics of random…
The evolution of the Erd\H{o}s-R\'enyi (ER) network by adding edges can be viewed as a cluster aggregation process. Such ER processes can be described by a rate equation for the evolution of the cluster-size distribution with the connection…