Related papers: Exactly Solvable Random Graph Ensemble with Extens…
A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random…
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet…
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…
Graphs are ubiquitous real-world data structures, and generative models that approximate distributions over graphs and derive new samples from them have significant importance. Among the known challenges in graph generation tasks,…
We study the dynamics of the Stochastic Sandpile Model on finite graphs, with two main results. First, we describe a procedure to exactly sample from the stationary distribution of the model in all connected finite graphs, extending a…
The stochastic Kronecker Graph model can generate large random graph that closely resembles many real world networks. For example, the output graph has a heavy-tailed degree distribution, has a (low) diameter that effectively remains…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
Consider a random regular graph of fixed degree $d$ with $n$ vertices. We study spectral properties of the adjacency matrix and of random Schr\"odinger operators on such a graph as $n$ tends to infinity. We prove that the integrated density…
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…
We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(\Delta)$ and provide (i) for $\alpha <…
We study the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of $n$ random points in a compact set $\Omega_n$ of $\R^d$. Under various assumptions we establish the…
Statistical equilibrium models of coherent structures in two-dimensional and barotropic quasi-geostrophic turbulence are formulated using canonical and microcanonical ensembles, and the equivalence or nonequivalence of ensembles is…
We describe a finite inhomogeneous three dimensional system of classical particles which interact through short and (or) long range interactions by means of a simple analytic spin model. The thermodynamic properties of the system are worked…
We study the set ${\cal L}(G)$ of lengths of all cycles that appear in a random $d$-regular $G$ on $n$ vertices for a fixed $d\geq 3$, as well as in Erd\H{o}s--R\'enyi random graphs on $n$ vertices with a fixed average degree $c>1$.…
We introduce a new model of random multigraphs with colored vertices and weighted edges. It is similar to the "inhomogeneous random graph model" of S\"oderberg (2002), extended by Bollob\'as, Janson and Riordan (2007). By means of analytic…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
We present an approach to synthesizing new graph structures from empirically specified distributions. The generative model is an auto-decoder that learns to synthesize graphs from latent codes. The graph synthesis model is learned jointly…
We take on a Random Matrix theory viewpoint to study the spectrum of certain reversible Markov chains in random environment. As the number of states tends to infinity, we consider the global behavior of the spectrum, and the local behavior…
In this paper, we draw attention to the problem of phase transitions in systems with locally affine microcanonical entropy, in which partial equivalence of (microcanonical and canonical) ensembles is observed. We focus on a very simple spin…
It is widely accepted that the dynamic of entanglement in presence of a generic circuit can be predicted by the knowledge of the statistical properties of the entanglement spectrum. We tested this assumption by applying a Metropolis-like…