Related papers: Simultaneous large deviations for the shape of You…

We study logical limit laws for preferential attachment random graphs. In this random graph model, vertices and edges are introduced recursively: at time $1$, we start with vertices $0,1$ and $m$ edges between them. At step $n+1$ the vertex…

We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…

This paper introduces a convenient strategy for coding and predicting sequences of independent, identically distributed random variables generated from a large alphabet of size $m$. In particular, the size of the sample is allowed to be…

We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex…

Dependency trees have proven to be a very successful model to represent the syntactic structure of sentences of human languages. In these structures, vertices are words and edges connect syntactically-dependent words. The tendency of these…

We study the statistical properties of the generation of random graphs according the configuration model, where one assigns randomly degrees to nodes. This model is often used, e.g., for the scale-free degree distribution ~d^gamma. For the…

Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…

This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…

We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph…

Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social and biological networks are often characterized by degree-degree {dependencies} between neighbouring nodes. One of the problems with the…

We study the size of the largest biconnected components in sparse Erd\H{o}s-R\'enyi graphs with finite connectivity and Barab\'asi-Albert graphs with non-integer mean degree. Using a statistical-mechanics inspired Monte Carlo approach we…

We compute the joint large deviation rate functional in the limit of large time for the current flowing through the edges of a finite graph on which a boundary-driven system of stochastic particles evolves with zero-range dynamics.This…

Word-representable graphs are a class of graphs that can be represented by words, where edges and non-edges are determined by the alternation of letters in those words. Several papers in the literature have explored the…

We study mixed long-range percolation on the square lattice. Each vertical edge of unit length is independently open with probability $\varepsilon$, and each horizontal edge of length $i$ is independently open with probability $p_i$. Also,…

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 describe the asymptotic behaviour of large degrees in random hyperbolic graphs, for all values of the curvature parameter $ \alpha$. We prove that, with high probability, the node degrees satisfy the following ordering property: the…

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

Let $p(n)$ be the number of all integer partitions of the positive integer $n$ and let $\lambda$ be a partition, selected uniformly at random from among all such $p(n)$ partitions. It is known that each partition $\lambda$ has a unique…

We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…

Motivated by low energy consumption in geographic routing in wireless networks, there has been recent interest in determining bounds on the length of edges in the Delaunay graph of randomly distributed points. Asymptotic results are known…