Related papers: Can smooth graphons in several dimensions be repre…
In view of the many quantum field theoretical descriptions of graphene in $2+1$ dimensions, we present another field theoretical feature of graphene, in the presence of defects. Particularly, we shall be interested in gapped graphene in the…
We study Tian's $\alpha$-invariant in comparison with the $\alpha_1$-invariant for pairs $(S_d,H)$ consisting of a smooth surface $S_d$ of degree $d$ in the projective three-dimensional space and a hyperplane section $H$. A conjecture of…
We demonstrate that it is possible to mechanically exfoliate graphene under ultra high vacuum conditions on the atomically well defined surface of single crystalline silicon. The flakes are several hundred nanometers in lateral size and…
Graphons are limit objects of sequences of graphs and are used to analyze the behavior of large graphs. Recently, graphon signal processing has been developed to study signal processing on large graphs. A major limitation of this approach…
We give a short elementary proof of the main theorem in the paper "Differential calculus on graphon space" by Diao et al. (JCTA 2015), which says that any graphon parameters whose $(N+1)$-th derivatives all vanish must be a linear…
A graph G on omega_1 is called <omega-smooth if for each uncountable subset W of omega_1, G is isomorphic to G[W-W'] for some finite W'. We show that in various models of ZFC if a graph G is <omega-smooth then G is necessarily trivial, i.e,…
Hladky, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding notions in finite graphs. Combinatorial optimization studies the…
Recovering the random graph model from an observed collection of networks is known to present significant challenges in the setting, where the networks do not share a common node set and have different sizes. More specifically, the goal is…
Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a…
An undirected graph G is d-degenerate if every subgraph of G has a vertex of degree at most d. By the classical theorem of Erd\H{o}s and Gallai from 1959, every graph of degeneracy d>1 contains a cycle of length at least d+1. The proof of…
Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
Inspired by a width invariant defined on permutations by Guillemot and Marx [SODA '14], we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width graphs, map graphs, $K_t$-free unit…
Let $G$ be a $2$-step stratified group of topological dimension $d$ and homogeneous dimension $Q$. Let $L$ be a homogeneous sub-Laplacian on $G$. By a theorem due to Christ and to Mauceri and Meda, an operator of the form $F(L)$ is of weak…
Given a class $\mathcal G$ of graphs, let ${\mathcal G}_n$ denote the set of graphs in $\mathcal G$ on vertex set $[n]$. For certain classes $\mathcal G$, we are interested in the asymptotic behaviour of a random graph $R_n$ sampled…
Every graphon defines a random graph on any given number $n$ of vertices. It was known that the graphon is random-free if and only if the entropy of this random graph is subquadratic. We prove that for random-free graphons, this entropy can…
We show that for any $d\ge 2$ and $\Delta>0$ there exists $\eta>0$ such that the following holds: Let $G$ be an $n$-vertex graph with at least $\Omega(n^2)$ edges and let $H$ be an $n$-vertex $d$-degenerate graph with maximum degree at most…
Signal analysis on graphs relies heavily on the graph Fourier transform, which is defined as the projection of a signal onto an eigenbasis of the associated shift operator. Large graphs of similar structure may be represented by a graphon.…
We study a general class of weighted shifts whose weights $\alpha$ are given by $\alpha_n = \sqrt{\frac{p^n + N}{p^n + D}}$, where $p > 1$ and $N$ and $D$ are parameters so that $(N,D) \in (-1, 1)\times (-1, 1)$. Some few examples of these…
A sequence of graphs with diverging number of nodes is a dense graph sequence if the number of edges grows approximately as for complete graphs. To each such sequence a function, called graphon, can be associated, which contains information…