English
Related papers

Related papers: The spectral dimension of generic trees

200 papers

Every finite metric tree has generalized roundness strictly greater than one. On the other hand, some countable metric trees have generalized roundness precisely one. The purpose of this paper is to identify some large classes of countable…

Functional Analysis · Mathematics 2016-08-18 Elena Caffarelli , Ian Doust , Anthony Weston

Four-particle tree-level scattering amplitudes in string theory are magically consistent with unitarity, reflected in the non-trivial fact that beneath the critical dimension, the residues of the amplitudes on massive poles can be expanded…

High Energy Physics - Theory · Physics 2022-03-14 Nima Arkani-Hamed , Lorenz Eberhardt , Yu-tin Huang , Sebastian Mizera

We consider critical multitype Bienaym\'e trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied under two distinct conditioning frameworks: first,…

Probability · Mathematics 2025-08-01 Louigi Addario-Berry , Philipp Beltran , Benedikt Stufler , Paul Thévenin

We present an analysis of the spectral density of the adjacency matrix of large random trees. We show that there is an infinity of delta peaks at all real numbers which are eigenvalues of finite trees. By exact enumerations and Monte-Carlo…

Disordered Systems and Neural Networks · Physics 2007-05-23 O. Golinelli

We show that the expected size of the maximum agreement subtree of two $n$-leaf trees, uniformly random among all trees with the shape, is $\Theta(\sqrt{n})$. To derive the lower bound, we prove a global structural result on a decomposition…

Combinatorics · Mathematics 2018-09-13 Pratik Misra , Seth Sullivant

The spectral density of random matrices is studied through a quaternionic generalisation of the Green's function, which precisely describes the mean spectral density of a given matrix under a particular type of random perturbation. Exact…

Mathematical Physics · Physics 2011-04-08 Tim Rogers

We calculate the almost sure Hausdorff dimension for a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous…

The properties of scale-free random trees are investigated using both preconditioning on non-extinction and fixed size averages, in order to study the thermodynamic limit. The scaling form of volume probability is found, the connectivity…

Other Condensed Matter · Physics 2009-11-10 Luca Donetti , Claudio Destri

We establish spectral estimates at a critical energy level for $h$-pseudors . Via a trace formula, we compute the contribution of isolated (non-extremum) critical points under a condition of "real principal type". The main result holds for…

Analysis of PDEs · Mathematics 2007-05-23 Brice Camus

We study properties of the harmonic measure of balls in typical large discrete trees. For a ball of radius $n$ centered at the root, we prove that, although the size of the boundary is of order $n$, most of the harmonic measure is supported…

Probability · Mathematics 2017-07-04 Nicolas Curien , Jean-François Le Gall

This work continues the study of the properties of finitely constrained groups of binary tree automorphisms in terms of their Hausdorff dimension. We prove that there are exactly $2^{2d-3}$ finitely constrained groups of binary tree…

Group Theory · Mathematics 2017-10-17 Andrew Penland

Tree-level scattering amplitudes for a scalar particle coupled to an arbitrary number N of photons and a single graviton are computed. We employ the worldline formalism as the main tool to compute the irreducible part of the amplitude,…

High Energy Physics - Theory · Physics 2020-08-04 Naser Ahmadiniaz , Filippo Maria Balli , Olindo Corradini , José Manuel Dávila , Christian Schubert

It is a classic result in spectral theory that the limit distribution of the spectral measure of random graphs G(n, p) converges to the semicircle law in case np tends to infinity with n. The spectral measure for random graphs G(n, c/n)…

Combinatorics · Mathematics 2024-05-15 Eva-Maria Hainzl , Élie de Panafieu

We study random two-component spanning forests ($2$SFs) of finite graphs, giving formulas for the first and second moments of the sizes of the components, vertex-inclusion probabilities for one or two vertices, and the probability that an…

Probability · Mathematics 2017-04-06 Adrien Kassel , Richard Kenyon , Wei Wu

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, of all trees with both given order and fixed diameter, the trees with the minimal distance spectral radius are completely…

Combinatorics · Mathematics 2013-10-24 Guanglong Yu , Shuguang Guo , Mingqing Zhai

In this paper we study the dimension spectrum of continued fractions with coefficients restricted to infinite subsets of natural numbers. We prove that if $E$ is any arithmetic progression, the set of primes, or the set of squares…

Dynamical Systems · Mathematics 2018-05-31 Vasileios Chousionis , Dmitriy Leykekhman , Mariusz Urbański

This work provides a general spectral analysis of size-structured two-phase population models. Systematic functional analytic results are given. We deal first with the case of finite maximal size. We characterize the irreducibility of the…

Analysis of PDEs · Mathematics 2020-09-14 Mustapha Mokhtar-Kharroubi , Quentin Richard

The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of…

Probability · Mathematics 2017-07-04 M. T. Barlow , D. A. Croydon , T. Kumagai

We consider the problem of the characteristics of mass spectra in the doubly symmetric theory of fields transforming under the proper Lorentz group representations decomposable into an infinite direct sum of finite-dimensional irreducible…

High Energy Physics - Theory · Physics 2007-05-23 L. M. Slad

We investigate the limiting behavior of random tree growth in preferential attachment models. The tree stems from a root, and we add vertices to the system one-by-one at random, according to a rule which depends on the degree distribution…

Probability · Mathematics 2012-06-21 Anna Rudas , Imre Péter Tóth