相关论文: Graph limits: An alternative approach to s-graphon…

We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…

Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance…

A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…

By considering graphs as discrete analogues of Riemann surfaces, Baker and Norine (Adv. Math. 2007) developed a concept of linear systems of divisors for graphs. Building on this idea, a concept of gonality for graphs has been defined and…

Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…

A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…

Graph comparison is a certain type of condition on metric space encoded by a finite graph. We show that any nontrivial graph comparison implies one of Alexandrov's comparisons. The proof gives a complete description of graphs with trivial…

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…

In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper bound is provided by the Kruskal-Katona theorem, but this…

Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…

In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…

We consider a version of continuum long-range percolation on finite boxes of $\mathbb{R}^d$ in which the vertex set is given by the points of a Poisson point process and each pair of two vertices at distance $r$ is connected with…

For time-reversal invariant graphs we prove the Bohigas-Giannoni-Schmit conjecture in its most general form: For graphs that are mixing in the classical limit, all spectral correlation functions coincide with those of the Gaussian…

The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…

We study equivalent descriptions of the vague, weak, setwise and total-variation (TV) convergence of sequences of Borel measures on metrizable and non-metrizable topological spaces in this work. On metrizable spaces, we give some equivalent…

Let $G$ be a graph with a vertex set $V$. The graph $G$ is path-proximinal if there are a semimetric $d \colon V \times V \to [0, \infty[$ and disjoint proximinal subsets of the semimetric space $(V, d)$ such that $V = A \cup B$, and…

We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…

Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…

We propose a convergence mode for positive Radon measures which allows a sequence of probability measures to have an improper limiting measure. We define a sequence of vague priors as a sequence of probability measures that converges to an…

In these notes, uniform convergence on compacta is studied on the space of functions taking values in the set of finite Borel measures. Related limit theorems, including L\'evy's continuity theorem and functional limit theorems for…