相关论文: Condensation of degrees emerging through a first-o…

We obtain tight thresholds for bond percolation on one-dimensional small-world graphs, and apply such results to obtain tight thresholds for the \emph{Independent Cascade} process and the \emph{Reed-Frost} process in such graphs. These are…

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…

The study of probabilistic models for the analysis of complex networks represents a flourishing research field. Among the former, Exponential Random Graphs (ERGs) have gained increasing attention over the years. So far, only linear ERGs…

Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…

A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model that captures some characteristics of the preferential…

We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…

The existence of explosive phase transitions in random (Erd\H os R\'enyi-type) networks has been recently documented by Achlioptas et al.\ [Science {\bf 323}, 1453 (2009)] via simulations. In this Letter we describe the underlying mechanism…

We discuss several limiting degree distributions for a class of random threshold graphs in the many node regime. This analysis is carried out under a weak assumption on the distribution of the underlying fitness variable. This assumption,…

With a simple model, we study the evolution of random networks under attack and reconstruction. We introduce a new quality, invulnerability I(s), to describe the stability of the system. We find that the network can evolve to a stationary…

This work introduces and compares approaches for estimating rare-event probabilities related to the number of edges in the random geometric graph on a Poisson point process. In the one-dimensional setting, we derive closed-form expressions…

We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…

The pattern of isentropes in the vicinity of a first-order phase transition is proposed as a key for a sub-classification. While the confinement--deconfinement transition, conjectured to set in beyond a critical end point in the QCD phase…

In the inhomogeneous random graph model, each vertex $i\in\{1,\ldots,n\}$ is assigned a weight $W_i\sim\text{Unif}(0,1)$, and an edge between any two vertices $i,j$ is present with probability $k(W_i,W_j)/\lambda_n\in[0,1]$, where $k$ is a…

We present experimental evidence for a first-order freezing/melting phase transition in a nonequilibrium system -- an oscillated two-dimensional isobaric granular fluid. The steady-state transition occurs between a gas and a crystal and is…

Multicanonical ensemble simulations for the simulation of first-order phase transitions suffer from exponential slowing down. Monte Carlo autocorrelation times diverge exponentially with free energy barriers $\Delta F$, which in $L^d$ boxes…

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…

Growing network models with both heterogeneity of the nodes and topological constraints can give rise to a rich phase structure. We present a simple model based on preferential attachment with rewiring of the links. Rewiring probabilities…

In this paper we study the degree sequence of the permutation graph $G_{\pi_n}$ associated with a sequence $\pi_n\in S_n$ of random permutations. Joint limiting distributions of the degrees are established using results from graph and…

Let d = (d1, d2, ..., dn) be a vector of non-negative integers with even sum. We prove some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph.…

Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second…