Related papers: Probability graphons and P-variables: two equivale…
We introduce a counterpart to the notion of vertex disjoint tilings by copy of a fixed graph F to the setting of graphons. The case F=K_2 gives the notion of matchings in graphons. We give a transference statement that allows us to switch…
We consider events over the probability space generated by the degree sequences of multiple independent Erd\H{o}s-R\'enyi random graphs, and consider an approximation probability space where such degree sequences are deemed to be sequences…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
We generalize ultraproducts and local-global limits of graphs to hypergraphs and other structures. We show that the local statistics of an ultraproduct of a sequence of hypergraphs are the ultralimits of the local statistics of the…
We present monotonicity inequalities for certain functions involving eigenvalues of $p$-Laplacians on signed graphs with respect to $p$. Inspired by such monotonicity, we propose new spectrum-based graph invariants, called (variational)…
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…
We study evolution equations on metric graphs with reservoirs, that is graphs where a one-dimensional interval is associated to each edge and, in addition, the vertices are able to store and exchange mass with these intervals. Focusing on…
We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a…
There are several notions of convergence for sequences of bounded degree graphs. One such notion is left convergence, which is based on counting neighborhood distributions. Another notion is right convergence, based on counting…
The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce the qualitative analogues of the Benjamini-Schramm and…
In [16], we observed the graph W*-probability theory. In this paper, we will review [16] and introduce special amalgamated random variables in this amalgamated W*-probability space. In particular, we will observe the amalgamated…
Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We prove new theoretical results about several variations of the cop and robber game on graphs. First, we consider a variation of the cop and robber game which is more symmetric called the cop and killer game. We prove for all $c < 1$ that…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…
We determine to within a constant factor the threshold for the property that two random k-uniform hypergraphs with edge probability p have an edge-disjoint packing into the same vertex set. More generally, we allow the hypergraphs to have…
We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…
Quantifying the complexity of large graphs requires measures that extend beyond predefined structural features and scale efficiently with graph size. This work adopts a generative perspective, modeling large networks as exchangeable graphs…
The unions of directed graphs are the simplest examples of pushouts of directed graphs. The conditions under which they contravariantly induce surjective gauge-equivariant pullbacks of graph C*-algebras have been well studied and vastly…