相关论文: Annealed limit theorems for the ising model on ran…
We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…
We consider the Ising model on the square lattice with biaxially correlated random ferromagnetic couplings, the critical point of which is fixed by self-duality. The disorder represents a relevant perturbation according to the extended…
We investigate structural properties of large, sparse random graphs through the lens of "sampling convergence" (Borgs et. al. (2017)). Sampling convergence generalizes left convergence to sparse graphs, and describes the limit in terms of a…
In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…
We provide proofs of the following theorems by considering the entropy of random walks: Theorem 1.(Alon, Hoory and Linial) Let G be an undirected simple graph with n vertices, girth g, minimum degree at least 2 and average degree d: Odd…
We consider a general model of a disordered copolymer with adsorption. This includes, as particular cases, a generalization of the copolymer at a selective interface introduced by Garel et al. [Europhys. Lett. 8 (1989) 9--13], pinning and…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…
We consider a class of elliptic random matrices which generalize two classical ensembles from random matrix theory: Wigner matrices and random matrices with iid entries. In particular, we establish a central limit theorem for linear…
We determine the diameter of generalized Grassmann graphs and the zero forcing number of some generalized Johnson graphs, generalized Grassmann graphs and the Hamming graphs. Our work extends several previously known results.
We consider the distribution of the major index on standard tableaux of arbitrary straight shape and certain skew shapes. We use cumulants to classify all possible limit laws for any sequence of such shapes in terms of a simple auxiliary…
We study models of weighted exponential random graphs in the large network limit. These models have recently been proposed to model weighted network data arising from a host of applications including socio-econometric data such as migration…
We investigate the statistics of the mean magnetisation, of its large deviations and persistent large deviations in simple coarsening systems. We consider more specifically the case of the diffusion equation, of the Ising chain at zero…
What does an Erdos-Renyi graph look like when a rare event happens? This paper answers this question when p is fixed and n tends to infinity by establishing a large deviation principle under an appropriate topology. The formulation and…
This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. More precisely, in the family of of $d$-regular graphs, which graph $G$ maximizes/minimizes the…
We prove that it is consistent that $\aleph_\omega$ is strong limit, $2^{\aleph_\omega}$ is large and the universality number for graphs on $\aleph_{\omega+1}$ is small. The proof uses Prikry forcing with interleaved collapsing.
We consider a Random Graph Model on $\mathbb{Z}^{d}$ that incorporates the interplay between the statistics of the graph and the underlying space where the vertices are located. Based on a graphical construction of the model as the…
Let $\mathcal G$ be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at random from all {\em connected} graphs in $\mathcal G$ on $n$…
On locally tree-like random graphs, we relate the random cluster model with external magnetic fields and $q\geq 2$ to Ising models with vertex-dependent external fields. The fact that one can formulate general random cluster models in terms…
We study the linear eigenvalue statistics of large random graphs in the regimes when the mean number of edges for each vertex tends to infinity. We prove that for a rather wide class of test functions the fluctuations of linear eigenvalue…