Related papers: Singularities in the entropy of asymptotically lar…

We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of…

In this paper, we prove a rigidity theorem of asymptotically hyperbolic manifolds only under the assumptions on curvature. Its proof is based on analyzing asymptotic structures of such manifolds at infinity and a volume comparison theorem.

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…

Let $G$ be a finite non-abelian simple group, $C$ a non-identity conjugacy class of $G$, and $\Gamma_C$ the Cayley graph of $G$ based on $C \cup C^{-1}$. Our main result shows that in any such graph, there is an involution at bounded…

We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on $n$ vertices and $m$ edges, provided that $m-n\to\infty$ and $m=O(n\log n)$ as $n\to\infty$. This is the entire range of $m$ not covered by…

We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…

In this paper we disprove a conjecture of Lidick\'y and Murphy about the number of copies of a given graph in a $K_r$-free graph and give an alternative general conjecture. We also prove an asymptotically tight bound on the number of copies…

We study 3-random-like graphs, that is, sequences of graphs in which the densities of triangles and anti-triangles converge to 1/8. Since the random graph ${\mathcal G}_{n,1/2}$ is, in particular, 3-random-like, this can be viewed as a weak…

Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

We investigate fast diffusions on finite directed graphs. We prove results in a way dual to presented in Bobrowski, A. Ann. Henri Poincar\'e (2012) 13(6): 1501-1510 and Bobrowski, A., Morawska, K. DCDS-B (2012), 17(7): 2313-2327, and obtain…

We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…

We use fine curve graph tools to prove that there exist parabolic isometries of graphs of curves associated to surfaces of infinite type.

We prove the almost sure existence of absolutely continuous spectrum at low disorder for the Anderson model on the simplest example of a product of a regular tree with a finite graph. This graph contains loops of unbounded size.

We prove a coarse version of Halin's Grid Theorem: Every one-ended, locally finite graph that contains the disjoint union of infinitely many rays as an asymptotic minor also contains the half-grid as an asymptotic minor. More generally, we…

The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…

The relevance of the algebraic entropy in the study of birational discrete time dynamical systems highlights the need to relate it to other characteristics of these systems. In this letter, two complementary proofs are given that the…

We consider non-degenerate, finitely supported random walks on a free group. We show that the entropy and the linear drift vary analytically with th eprobability of constant support.

We prove the entropic continuity of Lyapunov exponent for C^r maps of the interval or of the circle with large entropy for r>1, without making any assumptions on the set of critical points. A consequence is the upper semi-continuity of…

We exhibit a procedure to asymptotically enumerate monotone grid classes of permutations. This is then applied to compute the asymptotic number of permutations in any connected one-corner class. Our strategy consists of enumerating the…