Related papers: The spectral dimension of random brushes
We develop rigorous, analytic techniques to study the behaviour of biased random walks on combs. This enables us to calculate exactly the spectral dimension of random comb ensembles for any bias scenario in the teeth or spine. Two specific…
We consider the spectral gap of a uniformly chosen random $(d_1,d_2)$-biregular bipartite graph $G$ with $|V_1|=n, |V_2|=m$, where $d_1,d_2$ could possibly grow with $n$ and $m$. Let $A$ be the adjacency matrix of $G$. Under the assumption…
Let X be a 2-dimensional simplicial complex. The degree of an edge e is the number of 2-faces of X containing e. The complex X is an \epsilon-expander if the coboundary d_1(\phi) of every Z_2-valued 1-cochain \phi \in C^1(X;Z_2) satisfies…
We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…
For a class of random band matrices of band width $W$, we prove regularity of the average spectral measure at scales $\epsilon \geq W^{-0.99}$, and find its asymptotics at these scales.
A two-dimensional string is simply a two-dimensional array. We continue the study of the combinatorial properties of repetitions in such strings over the binary alphabet, namely the number of distinct tandems, distinct quartics, and runs.…
We develop a multifractal random tilling that fills the square. The multifractal is formed by an arrangement of rectangular blocks of different sizes, areas and number of neighbors. The overall feature of the tilling is an heterogeneous and…
Consider a network $D$ of pipes which have to be cleaned using some cleaning agents, called brushes, assigned to some vertices. The minimum number of brushes required for cleaning the network $D$ is called its brush number. The tattooing of…
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…
We show that the diameter D(G_n) of a random labelled connected planar graph with n vertices is equal to n^{1/4+o(1)}, in probability. More precisely there exists a constant c>0 such that the probability that D(G_n) lies in the interval…
Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…
A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…
Consider the random graph sampled uniformly from the set of all simple graphs with a given degree sequence. Under mild conditions on the degrees, we establish a Large Deviation Principle (LDP) for these random graphs, viewed as elements of…
In various theories of quantum gravity, one observes a change in the spectral dimension from the topological spatial dimension $d$ at large length scales to some smaller value at small, Planckian scales. While the origin of such a flow is…
We conduct a quantitative analysis of how many random edges need to be added to a base graph $H$ in order to significantly increase natural minor-monotone graph parameters of the resulting graph $R$. Specifically, we show that if $R$ is…
A sequence $D = \{d_1,...d_n\}$ is a feasible degree sequence if there is a graph on $\{1,...,n\}$ such that $i$ has degree $d_i$. For such a sequence, $G(D)$ is a graph chosen uniformly at random from those with the given degree sequence.…
We show that the twin-width of every $n$-vertex $d$-regular graph is at most $n^{\frac{d-2}{2d-2}+o(1)}$ and that almost all $d$-regular graphs attain this bound. More generally, we obtain bounds on the twin-width of sparse Erd\H{o}s-Renyi…
We study dimensions of the faces of the cone of nonnegative polynomials and the cone of sums of squares; we show that there are dimensional differences between corresponding faces of these cones. These dimensional gaps occur in all cases…
This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…
The size-Ramsey number of a graph $G$ is the minimum number of edges in a graph $H$ such that every 2-edge-coloring of $H$ yields a monochromatic copy of $G$. Size-Ramsey numbers of graphs have been studied for almost 40 years with…