Related papers: Phase transitions in edge-weighted exponential ran…
We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…
We extend the well-known and widely used Exponential Random Graph Model (ERGM) by including nodal random effects to compensate for heterogeneity in the nodes of a network. The Bayesian framework for ERGMs proposed by Caimo and Friel (2011)…
Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…
Despite the recently exhibited importance of higher-order interactions for various processes, few flexible (null) models are available. In particular, most studies on hypergraphs focus on a small set of theoretical models. Here, we…
Lots of neural network architectures have been proposed to deal with learning tasks on graph-structured data. However, most of these models concentrate on only node features during the learning process. The edge features, which usually play…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
The contact structure between hosts has a critical influence on disease spread. However, most networkbased models used in epidemiology tend to ignore heterogeneity in the weighting of contacts. This assumption is known to be at odds with…
We analyze the 3-parameter family of random networks which are uniform on networks with fixed number of edges, triangles, and nodes (between 33 and 66). We find precursors of phase transitions which are known to be present in the asymptotic…
To provide a phenomenological theory for the various interesting transitions in restructuring networks we employ a statistical mechanical approach with detailed balance satisfied for the transitions between topological states. This enables…
A large and sparse random graph with independent exponentially distributed link weights can be used to model the propagation of messages or diseases in a network with an unknown connectivity structure. In this article we study an extended…
We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…
The collection of data on populations of networks is becoming increasingly common, where each data point can be seen as a realisation of a network-valued random variable. A canonical example is that of brain networks: a typical neuroimaging…
Exponential-family random graph models (ERGMs) provide a principled way to model and simulate features common in human social networks, such as propensities for homophily and friend-of-a-friend triad closure. We show that, without…
We study spatial embeddings of random graphs in which nodes are randomly distributed in geographical space. We let the edge probability between any two nodes to be dependent on the spatial distance between them and demonstrate that this…
Global variational approximation methods in graphical models allow efficient approximate inference of complex posterior distributions by using a simpler model. The choice of the approximating model determines a tradeoff between the…
In this paper we study the impact of random exponential edge weights on the distances in a random graph and, in particular, on its diameter. Our main result consists of a precise asymptotic expression for the maximal weight of the shortest…
The random graph of Erdos and Renyi is one of the oldest and best studied models of a network, and possesses the considerable advantage of being exactly solvable for many of its average properties. However, as a model of real-world networks…
Using edge weights is essential for modeling real-world systems where links possess relevant information, and preserving this information in low-dimensional representations is relevant for classification and prediction tasks. This paper…
Preferential attachment is a central paradigm in the theory of complex networks. In this contribution we consider various generalizations of preferential attachment including for example node removal and edge rewiring. We demonstrate that…