Related papers: On the geometry of exponential random graphs and a…
Exponential-family random graph models (ERGMs) provide a principled and flexible way to model and simulate features common in social networks, such as propensities for homophily, mutuality, and friend-of-a-friend triad closure, through…
Exponential families comprise a broad class of statistical models and parametric families like normal distributions, binomial distributions, gamma distributions or exponential distributions. Thereby the formal representation of its…
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 propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…
This paper considers the problem of defining distributions over graphical structures. We propose an extension of the hyper Markov properties of Dawid and Lauritzen [Ann. Statist. 21 (1993) 1272-1317], which we term structural Markov…
We investigate the asymptotic structure of a random perfect graph $P_n$ sampled uniformly from the perfect graphs on vertex set $\{1,\ldots,n\}$. Our approach is based on the result of Pr\"omel and Steger that almost all perfect graphs are…
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…
The spectral and localization properties of heterogeneous random graphs are determined by the resolvent distributional equations, which have so far resisted an analytic treatment. We solve analytically the resolvent equations of random…
We study the ergodic and statistical properties of a class of maps of the circle and of the interval of Lorenz type which present indifferent fixed points and points with unbounded derivative. These maps have been previously investigated in…
We prove that projective spaces of Lorentzian and real stable polynomials are homeomorphic to closed Euclidean balls. This solves a conjecture of June Huh and the author. The proof utilizes and refines a connection between the symmetric…
Recently there has been increased interest in fitting generative graph models to real-world networks. In particular, Bl\"asius et al. have proposed a framework for systematic evaluation of the expressivity of random graph models. We extend…
Statistical analysis of social networks provides valuable insights into complex network interactions across various scientific disciplines. However, accurate modeling of networks remains challenging due to the heavy computational burden and…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
Probabilistic graphical models that encode an underlying Markov random field are fundamental building blocks of generative modeling to learn latent representations in modern multivariate data sets with complex dependency structures. Among…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
The presence of unobserved node specific heterogeneity in Exponential Random Graph Models (ERGM) is a general concern, both with respect to model validity as well as estimation instability. We therefore extend the ERGM by including node…
In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence of G. We describe how this model naturally appears in the…
Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…
Exponential random graph models are a class of widely used exponential family models for social networks. The topological structure of an observed network is modelled by the relative prevalence of a set of local sub-graph configurations…
We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…