Related papers: Singularities in the entropy of asymptotically lar…

We study asymptotically harmonic manifolds of negative curvature, without any cocompactness or homogeneity assumption. We show that asymptotic harmonicity provides a lot of information on the asymptotic geometry of these spaces: in…

We present new values and bounds on the (normalised) closeness centrality $\bar{\mathsf{C}}_C$ of connected graphs and on its product $\bar{l}\bar{\mathsf{C}}_C$ with the mean distance $\bar{l}$ of these graphs. Our main result presents the…

Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.

In a recent research on degenerate points of steady axisymmetric gravity flows with general vorticity, it has been shown that the possible asymptotics near any stagnation point must be the "Stokes corner", the "horizontal cusp", or the…

Given a closed, orientable surface of constant negative curvature and genus $g \ge 2$, we study a family of generalized Bowen-Series boundary maps and prove the following rigidity result: in this family the topological entropy is constant…

We explore an asymptotic behavior of entropies for sums of independent random variables that are convolved with a small continuous noise.

For a simple model of shallow and wide neural networks, we show that the epigraph of its input-output map as a function of the network parameters approximates epigraph of a. convex function in a precise sense. This leads to a plausible…

We prove that asymptotically almost surely, the random Cayley sum graph over a finite abelian group $G$ has edge density close to the expected one on every induced subgraph of size at least $\log^c |G|$, for any fixed $c > 1$ and $|G|$…

We prove the existence of (non compact) complex surfaces with a smooth rational curve embedded such that there does not exist any formal singular foliation along the curve. In particular, at arbitray small neighborhood of the curve, any…

We show that in a topological dynamical system $(X,T)$ of positive entropy there exist proper (positively) asymptotic pairs, that is, pairs $(x,y)$ such that $x\not= y$ and $\lim_{n\to +\infty} d(T^n x,T^n y)=0$. More precisely we consider…

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

In this paper, we use a formula obtained in [8] to study certain asymptotic behaviors of GUE (Gaussian unitary ensemble) correlators. More precisely, we obtain large genus asymptotics of enumerations of ordinary graphs and ribbon graphs…

Addressing a question posed by Chen and Ma from an asymptotic point of view, we present a short proof for the edge density needed to guarantee that two vertices of the same degree are connected by a path of a fixed length. In particular, we…

We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…

A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\geq 3$, let $r= r(n)\geq 3$ be an integer and let $\boldsymbol{k} =…

We prove the continuity of asymptotic entropy, as a function of the step distribution, among non-degenerate probability measures with finite Shannon entropy on the free solvable group $S_{d,m}$ of rank $d\ge 3$ and derived length $m\ge 2$.

Yet another simple proof of the entropy power inequality is given, which avoids both the integration over a path of Gaussian perturbation and the use of Young's inequality with sharp constant or R\'enyi entropies. The proof is based on a…

In this paper we consider finitary symmetric random walks on groups. We construct new possible asymptotics for the drift. We show that the drift can be very close to linear ant yet sublinear. We also give estimates for entropy growth of…

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…