Related papers: A graphon counter example
We give an example of a dynamical system which is mixing relative to one of its factors, but for which relative mixing of order three does not hold.
We give an example of a finitely presented simple group containing a finitely generated subgroup which is not finitely presented.
Let f be a function defined on positive numbers. The subject is the trace inequality $Tr f(A) + Tr f(P_2AP_2) \le Tr f(P_{12}AP_{12}) + \Tr f(P_{23}AP_{23})$, where $A$ is a positive operator, $P_1,P_2,P_3$ are orthogonal projections such…
In many network problems, graphs may change by the addition of nodes, or the same problem may need to be solved in multiple similar graphs. This generates inefficiency, as analyses and systems that are not transferable have to be…
We construct an example of a coarse proximity space that is not induced by any coarse structure. We then show how to "stitch" two coarse proximity spaces with homeomorphic boundaries into one coarse proximity space. Finally, we construct a…
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…
Graphons offer a powerful framework for modeling large-scale networks, yet estimation remains challenging. We propose a novel approach that leverages a low-rank additive representation, yielding both a low-rank connection probability matrix…
Let f be a function transcendental and meromorphic in the plane, and define g(z) by g(z) = f(z+1) - f(z). A number of results are proved concerning the existence of zeros of g(z) or g(z)/f(z), in terms of the growth and the poles of f.
We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a relational inclusion to establishing that a graph constructed from it has empty extension. This sound and complete calculus is conceptually…
We prove that there exists an entire function for which every complex number is an asymptotic value and whose growth is arbitrarily slow subject only to the necessary condition that the function is of infinite order.
A simplified version of the theory of strongly regular graphs is developed for the case in which the graphs have no triangles. This leads to (i) direct proofs of the Krein conditions, and (ii) the characterization of strongly regular graphs…
A graphon that is defined on $[0,1]^d$ and is H\"older$(\alpha)$ continuous for some $d\ge2$ and $\alpha\in(0,1]$ can be represented by a graphon on $[0,1]$ that is H\"older$(\alpha/d)$ continuous. We give examples that show that this…
We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex…
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…
We construct an example of two continuous maps f and g of the circle to itself with the same absolute value of the Fourier transform but with different winding numbers, answering a question of Brezis.
Reduced cohomology motivates to look at harmonic functions which satisfy certain gradient conditions. If $G$ is a direct product of two infinite groups or a (FC-central)-by-cyclic group, then there are no harmonic functions with gradient in…
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…
We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…