Related papers: Singularities in the entropy of asymptotically lar…

We investigate the existence of FIID homomorphisms from regular trees to finite graphs. Using entropy inequalities we show that there are graphs with arbitrarily large chromatic number to which there is no FIID homomorphism from a 3-regular…

We explicitly describe the possible pairs of triangle and square densities for r-regular finite simple graphs. We also prove that every r-regular unimodular random graph can be approximated by r-regular finite graphs with respect to these…

We give an expression for the frequency of non-simple curves in closed surfaces and exploit it to study relative frequencies of such curves in large genus. This extend to the case of non-simple curves Mirzakhani's expressions of frequencies…

In this paper we prove a universal inequality describing the asymptotic behavior of support points for planar continuous curves. As corollaries we get an analogous result for tangent points of differentiable planar curves and some…

We show that the continuity property of Lyapunov exponents proved in \cite{BCS-Exponents} for smooth surface diffeomorphisms extends to smooth interval maps, in the case when the map only has non-flat critical points and the entropies…

We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…

Although asymptotic analyses of undirected network models based on degree sequences have started to appear in recent literature, it remains an open problem to study statistical properties of directed network models. In this paper, we…

In this paper we review the asymptotic matching conjectures for $r$-regular bipartite graphs, and their connections in estimating the monomer-dimer entropies in $d$-dimensional integer lattice and Bethe lattices. We prove new rigorous upper…

We prove that a graph G is asymptotically isomorphic to the ray if and only if G is uniformly spherically bounded and is of bounded local degrees. This problem arouse in combinatorics and was posed in [3] (Problem 10.1).

We present a technique for approximating generic normalization constants subject to constraints. The method is then applied to derive the exact asymptotics for the conditional normalization constant of constrained exponential random graphs.

The unconstrained exponential family of random graphs assumes no prior knowledge of the graph before sampling, but it is natural to consider situations where partial information about the graph is known, for example the total number of…

We provide asymptotic formulae for the numbers of bipartite graphs with given degree sequence, and of loopless digraphs with given in- and out-degree sequences, for a wide range of parameters. Our results cover medium range densities and…

In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…

This paper concerns the large deviations of a system of interacting particles on a random graph. There is no stochasticity, and the only sources of disorder are the random graph connections, and the initial condition. The average number of…

In this paper, we study dynamics of maps on quasi-graphs characterizing their invariant measures. In particular, we prove that every invariant measure of quasi-graph map with zero topological entropy has discrete spectrum. Additionally, we…

Quantifying the complexity of large graphs requires measures that extend beyond predefined structural features and scale efficiently with graph size. This work adopts a generative perspective, modeling large networks as exchangeable graphs…

In this paper, we initiate the systematic study of density of algebraic points on surfaces. We give an effective asymptotic range in which the density degree set has regular behavior dictated by the index. By contrast, in small degree, the…