Related papers: Upper large deviations for power-weighted edge len…
This paper deals with the union set of a stationary Poisson process of cylinders in $\mathbb{R}^n$ having an $(n-m)$-dimensional base and an $m$-dimensional direction space, where $m\in\{0,1,\ldots,n-1\}$ and $n\geq 2$. The concept…
This article describes a complex network model whose weights are proportional to the difference between uniformly distributed ``fitness'' values assigned to the nodes. It is shown both analytically and experimentally that the strength…
This paper studied the fundamental modeling defect existing in Poisson-distributed cellular networks in which all base stations form a homogeneous Poisson point process (PPP) of intensity $\lambda_B$ and all users form another independent…
Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…
The thermodynamic properties of non interacting bosons on a complex network can be strongly affected by topological inhomogeneities. The latter give rise to anomalies in the density of states that can induce Bose-Einstein condensation in…
We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…
We present improved methods for calculating confidence intervals and $p$-values in situations where standard asymptotic approaches fail due to small sample sizes. We apply these techniques to a specific class of statistical model that can…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
For three decades statistical mechanics has been providing a framework to analyse neural networks. However, the theoretically tractable models, e.g., perceptrons, random features models and kernel machines, or multi-index models and…
In this work, we derive sharp non-asymptotic deviation bounds for weighted sums of Dirichlet random variables. These bounds are based on a novel integral representation of the density of a weighted Dirichlet sum. This representation allows…
In this paper we compare and contrast the behavior of the posterior predictive distribution to the risk of the maximum a posteriori estimator for the random features regression model in the overparameterized regime. We will focus on the…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
The theory of large deviations constitutes a mathematical cornerstone in the foundations of Boltzmann-Gibbs statistical mechanics, based on the additive entropy $S_{BG}=- k_B\sum_{i=1}^W p_i \ln p_i$. Its optimization under appropriate…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
Fix a space dimension $d\ge 2$, parameters $\alpha > -1$ and $\beta \ge 1$, and let $\gamma_{d,\alpha, \beta}$ be the probability measure of an isotropic random vector in $\mathbb{R}^d$ with density proportional to \begin{align*}…
We study the distance between the two rightmost particles in branching Brownian motion. Derrida and the second author have shown that the long-time limit $d_{12}$ of this random variable can be expressed in terms of PDEs related to the…
We introduce a new model of preferential attachment with fitness, and establish a time reversed duality between the model and a system of branching-coalescing particles. Using this duality, we give a clear and concise explanation for the…
In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.
We study a coarsening process of one-dimensional cell complexes. We show that if cell boundaries move with velocities proportional to the difference in size of neighboring cells, then the average cell size grows at a prescribed exponential…
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 =…