Related papers: An isomorphism theorem for random interlacements

We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.

We present a simple proof for the universality of invariant and equivariant tensorized graph neural networks. Our approach considers a restricted intermediate hypothetical model named Graph Homomorphism Model to reach the universality…

We revisit a simple model class for machine learning on graphs, where a random walk on a graph produces a machine-readable record, and this record is processed by a deep neural network to directly make vertex-level or graph-level…

In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of…

We extend the theory of probability graphons, continuum representations of edge-decorated graphs arising in graph limits theory, to the 'right convergence' point of view. First of all, we generalise the notions of overlay functionals and…

Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…

In this paper we show that on bounded degree graphs and general trees, the cover time of the simple random walk is asymptotically equal to the product of the number of edges and the square of the expected supremum of the Gaussian free field…

We show that the total variation mixing time is not quasi-isometry invariant, even for Cayley graphs. Namely, we construct a sequence of pairs of Cayley graphs with maps between them that twist the metric in a bounded way, while the ratio…

We study the problem of detecting the edge correlation between two random graphs with $n$ unlabeled nodes. This is formalized as a hypothesis testing problem, where under the null hypothesis, the two graphs are independently generated;…

Let $S$ be a set of transpositions generating the symmetric group $S_n$. The transposition graph of $S$ is defined to be the graph with vertex set $\{1,\ldots,n\}$, and with vertices $i$ and $j$ being adjacent in $T(S)$ whenever $(i,j) \in…

We present a strong connection between quantum information and quantum permutation groups. Specifically, we define a notion of quantum isomorphisms of graphs based on quantum automorphisms from the theory of quantum groups, and then show…

We present an algorithm to grow a graph with scale-free structure of {\it in-} and {\it out-links} and variable wiring diagram in the class of the world-wide Web. We then explore the graph by intentional random walks using local…

Consider two independent Erd\H{o}s-R\'enyi $G(N,1/2)$ graphs. We show that with probability tending to $1$ as $N\to\infty$, the largest induced isomorphic subgraph has size either $\lfloor x_N-\varepsilon_N\rfloor$ or $\lfloor…

There has recently been much interest in Gaussian fields on linear networks and, more generally, on compact metric graphs. One proposed strategy for defining such fields on a metric graph $\Gamma$ is through a covariance function that is…

According to a recent conjecture, isospectral objects have different nodal count sequences. We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counter-examples to this conjecture. In…

Let $(X_n)_{n\geq 0}$ be a reversible random walk on a graph $G$ satisfying an anchored isoperimetric inequality. We give upper bounds for exit time (and occupation time in transient case) by X of any set which contains the root. As an…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

Random graphs offer a useful mathematical representation of a variety of real world complex networks. Exponential random graphs, for example, are particularly suited towards generating random graphs constrained to have specified statistical…

We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…