Related papers: Hyperuniformity in regular trees

Decomposing a deep neural network's learned representations into interpretable features could greatly enhance its safety and reliability. To better understand features, we adopt a geometric perspective, viewing them as a learned coordinate…

We investigate properties of node centrality in random growing tree models. We focus on a measure of centrality that computes the maximum subtree size of the tree rooted at each node, with the most central node being the tree centroid. For…

Inside the discipline of graph theory exists an extension known as the hypergraph. This generalization of graphs includes vertices along with hyperedges consisting of collections of two or more vertices. One well-studied application of this…

We consider the symmetric inclusion process on a general finite graph. Our main result establishes universal upper and lower bounds for the spectral gap of this interacting particle system in terms of the spectral gap of the random walk on…

The hyperuniformity concept provides a unified means to classify all perfect crystals, perfect quasicrystals, and exotic amorphous states of matter according to their capacity to suppress large-scale density fluctuations. While the…

There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…

We study a class of rooted trees with a substitution type structure. These trees are not necessarily regular, but exhibit a lot of symmetries. We consider nearest neighbor operators which reflect the symmetries of the trees. The spectrum of…

In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes with a given number of vertices and then consider properties…

We study matching polynomials of uniform hypergraph and spectral radii of uniform supertrees. By comparing the matching polynomials of supertrees, we extend Li and Feng's results on grafting operations on graphs to supertrees. Using the…

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…

We construct a family of self-adjoint operators on the prime numbers whose entries depend on pairwise arithmetic divergences, replacing geometric distance with number-theoretic dissimilarity. The resulting spectra encode how coherence…

We introduce a novel diffusion-based spectral algorithm to tackle regression analysis on high-dimensional data, particularly data embedded within lower-dimensional manifolds. Traditional spectral algorithms often fall short in such…

We consider site (vertex) percolation on $d$-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the…

We prove that the diffraction formula for regular model sets is equivalent to the Poisson Summation Formula for the underlying lattice. This is achieved using Fourier analysis of unbounded measures on locally compact abelian groups as…

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…

We investigate the size of the embedded regular tree rooted at a vertex in a $d$ regular random graph. We show that almost always, the radius of this tree will be ${1/2}\log n$, where $n$ is the number of vertices in the graph. And we give…

Disordered hyperuniform many-particle systems have attracted considerable recent attention. One important class of such systems is the classical ground states of "stealthy potentials." The degree of order of such ground states depends on a…

Inhomogeneous environments are rather ubiquitous in nature, often implying anomalies resulting in deviation from Gaussianity of diffusion processes. While sub- and superdiffusion are usually due to conversing environmental features…

Hyperuniform many-particle distributions possess a local number variance that grows more slowly than the volume of an observation window, implying that the local density is effectively homogeneous beyond a few characteristic length scales.…