Related papers: On large deviation properties of Erdos-Renyi rando…
We present exact calculations of the partition function $Z$ of the $q$-state Potts model and its generalization to real $q$, the random cluster model, for arbitrary temperature on $n$-vertex ladder graphs with free, cyclic, and M\"obius…
We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph processes. We consider a model where edges appear independently after an exponential time at rate equal to the…
We study the Potts model on locally tree-like random graphs of arbitrary degree distribution. Using a population dynamics algorithm we numerically solve the problem exactly. We confirm our results with simulations. Comparisons with a…
We introduce a variant of the Erd\"os--R\'enyi random graph where the number of vertices is random and follows a Poisson law. A very simple Markov property of the model entails that the Lukasiewicz exploration is made of…
Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We prove that the component structure of a graph chosen uniformly at random from the class $\mathcal{S}_g(n,m)$ of all graphs on vertex set $[n]=\{1,\dotsc,n\}$ with $m$ edges…
For Erd\H{o}s-R\'enyi random graphs with average degree $\gamma$, and uniformly random $\gamma$-regular graph on $n$ vertices, we prove that with high probability the size of both the Max-Cut and maximum bisection are…
Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with $m$ left vertices, n right vertices, t edges, and each vertex of degree at least one. We…
The standard Large Deviation Theory (LDT) mirrors the Boltzmann-Gibbs (BG) factor which describes the thermal equilibrium of short-range Hamiltonian systems, the velocity distribution of which is Maxwellian. It is generically applicable to…
Exponential random graph models (ERGMs) are flexible probability models allowing edge dependency. However, it is known that, to a first-order approximation, many ERGMs behave like Erd\"os-R\'enyi random graphs, where edges are independent.…
Random K-out graphs are garnering interest in designing distributed systems including secure sensor networks, anonymous crypto-currency networks, and differentially-private decentralized learning. In these security-critical applications, it…
We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…
Fixing $\beta \ge 0$ and an integer $q \ge 2$, consider the ferromagnetic $q$-Potts measures $\mu_n^{\beta,B}$ on finite graphs ${\sf G}_n$ on $n$ vertices, with external field strength $B \ge 0$ and the corresponding random cluster…
We consider random walks on several classes of graphs and explore the likely structure of the vacant set, i.e. the set of unvisited vertices. Let \Gamma(t) be the subgraph induced by the vacant set of the walk at step t. We show that for…
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…
The poster presents an analytic formalism describing metric properties of undirected random graphs with arbitrary degree distributions and statistically uncorrelated (i.e. randomly connected) vertices. The formalism allows to calculate the…
In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…
Boltzmann-Sanov and Cramer-Chernoff's theorems provide large deviation probabilities, entropy, and rate functions for the spatial distribution of systems and the total internal energy of an ensemble respectively. By the method of Lagrange's…
A temporal graph is a graph whose edges appear only at certain points in time. Recently, the second and the last three authors proposed a natural temporal analog of the Erd\H{o}s-R\'enyi random graph model. The proposed model is obtained by…
Let $(\mu_{\alpha})$ be a net of Radon sub-probability measures on the real line, and $(t_{\alpha})$ be a net in $]0,+\infty[$ converging to 0. Assuming that the generalized log-moment generating function $L(\lambda)$ exists for all…
The classical result in the theory of random graphs, proved by Erdos and Renyi in 1960, concerns the threshold for the appearance of the giant component in the random graph process. We consider a variant of this problem, with a Ramsey…