相关论文: The two-star model: exact solution in the sparse r…

Exponential random graphs are important to model the structure of real-world complex networks. Here we solve the two-star model with degree-degree correlations in the sparse regime. The model constraints the average correlation between the…

The p-star model or exponential random graph is among the oldest and best-known of network models. Here we give an analytic solution for the particular case of the 2-star model, which is one of the most fundamental of exponential random…

In this paper, we explore the two-star Exponential Random Graph Model, which is a two parameter exponential family on the space of simple labeled graphs. We introduce auxiliary variables to express the two-star model as a mixture of the…

The two-star random graph is the simplest exponential random graph model with nontrivial interactions between the graph edges. We propose a set of auxiliary variables that control the thermodynamic limit where the number of vertices N tends…

This paper gives a way to simulate from the two star probability distribution on the space of simple graphs via auxiliary variables. Using this simulation scheme, the model is explored for various domains of the parameter values, and the…

Due to their conceptual and mathematical simplicity, Erd\"os-R\'enyi or classical random graphs remain as a fundamental paradigm to model complex interacting systems in several areas. Although condensation phenomena have been widely…

Exponential Random Graph Models (ERGM) behave peculiar in large networks with thousand(s) of actors (nodes). Standard models containing two-star or triangle counts as statistics are often unstable leading to completely full or empty…

The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…

We study the graph alignment problem over two independent Erd\H{o}s-R\'enyi graphs on $n$ vertices, with edge density $p$ falling into two regimes separated by the critical window around $p_c=\sqrt{\log n/n}$. Our result reveals an…

In this paper, we study exponential random graph models subject to certain constraints. We obtain some general results about the asymptotic structure of the model. We show that there exists non-trivial regions in the phase plane where the…

We study the two-dimensional Ising model on a network with a novel type of quenched topological (connectivity) disorder. We construct random lattices of constant coordination number and perform large scale Monte Carlo simulations in order…

Diluted mean-field models are graphical models in which the geometry of interactions is determined by a sparse random graph or hypergraph. Based on a nonrigorous but analytic approach called the "cavity method", physicists have predicted…

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…

The Axelrod model has been widely studied since its proposal for social influence and cultural dissemination. In particular, the community of statistical physics focused on the presence of a phase transition as a function of its two main…

We consider the Ising model for two interacting groups of spins embedded in an Erd\"{o}s-R\'{e}nyi random graph. The critical properties of the system are investigated by means of extensive Monte Carlo simulations. Our results evidence the…

We perform a model-agnostic Bayesian analysis of the neutron-star-matter equation of state (EoS), using known ab-initio constraints and astrophysical observations to limit its behavior at intermediate densities. Permitting explicit…

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…

In a highly influential paper twenty years ago, Barab\'asi and Albert [Science 286, 509 (1999)] showed that networks undergoing generic growth processes with preferential attachment evolve towards scale-free structures. In any finite…

Based on Jaynes' maximum entropy principle, exponential random graphs provide a family of principled models that allow the prediction of network properties as constrained by empirical data (observables). However, their use is often hindered…

A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…