Related papers: Phase transitions in exponential random graphs

We use the order complex corresponding to a symmetric matrix (defined by Giusti et al in 2015). In this note, we use it to define a class of models of random graphs, and show some surprising experimental results, showing sharp phase…

The nonequilibrium phase transition in a system of diffusing, coagulating particles in the presence of a steady input and evaporation of particles is studied. The system undergoes a transition from a phase in which the average number of…

We study the following game on a finite graph $G = (V, E)$. At the start, each edge is assigned an integer $n_e \ge 0$, $n = \sum_{e \in E} n_e$. In round $t$, $1 \le t \le n$, a uniformly random vertex $v \in V$ is chosen and one of the…

The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups…

We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…

In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…

Let $P(n,M)$ be a graph chosen uniformly at random from the family of all labeled planar graphs with $n$ vertices and $M$ edges. In the paper we study the component structure of $P(n,M)$. Combining counting arguments with analytic…

We show that by restricting the degrees of the vertices of a graph to an arbitrary set \( \Delta \), the threshold point $ \alpha(\Delta) $ of the phase transition for a random graph with $ n $ vertices and $ m = \alpha(\Delta) n $ edges…

We consider a threshold epidemic model on a clustered random graph with overlapping communities. In other words, our epidemic model is such that an individual becomes infected as soon as the proportion of her infected neighbors exceeds the…

Across the sciences, the statistical analysis of networks is central to the production of knowledge on relational phenomena. Because of their ability to model the structural generation of networks, exponential random graph models are a…

We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…

One of the central tasks in many-body physics is the determination of phase diagrams. However, mapping out a phase diagram generally requires a great deal of human intuition and understanding. To automate this process, one can frame it as a…

It is discussed how phase transitions of first order (with phase separation and surface tension), continuous transitions and (multi)-critical points can be defined and classified for finite systems from the topology of the energy surface…

Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…

The phase diagram of a system of monodispersed hard rectangles of size $m\times m k$ on a square lattice is numerically determined for $m=2,3$ and aspect ratio $k= 1,2,\ldots, 7$. We show the existence of a disordered phase, a nematic phase…

In this paper we focus on the problem of the degree sequence for the following random graph process. At any time-step $t$, one of the following three substeps is executed: with probability $\alpha_1$, a new vertex $x_t$ and $m$ edges…

We present a detailed study of the phase diagram of the Ising model in random graphs with arbitrary degree distribution. By using the replica method we compute exactly the value of the critical temperature and the associated critical…

We treat the problem of characterizing in a systematic way the qualitative features of two-dimensional dynamical systems. To that end, we construct a representation of the topological features of phase portraits by means of diagrams that…

Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…

We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…