Related papers: An isomorphism between branched and geometric roug…
Given a graph $G$, the graph $[G]$ obtained by adding, for each pair of vertices of $G$, a unique vertex adjacent to both vertices is called the binding graph of $G$. In this work, we show that the class of binding graphs is…
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…
Lyon's rough paths give an algebraic and analytic framework for Stieltjes integrals in a regime of low regularity where the usual Riemann-Stieltjes integral does not converge. Before we may rigorously define rough paths, we start with the…
Random forests construct each tree with a different, randomised representation of the feature space. Their uniform voting cannot correct errors in regions where trees with incorrect representations probabilistically outnumber correct ones,…
We show that every $k$-tree of toughness greater than $\frac{k}{3}$ is Hamilton-connected for $k \geq 3$. (In particular, chordal planar graphs of toughness greater than $1$ are Hamilton-connected.) This improves the result of Broersma et…
The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can…
We develop a directional formalism for the partition graph G_n based on several canonical reference sets: the main chain, the self-conjugate axis, the spine, and the boundary framework. For each such set S, the graph distance d_S induces a…
A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…
In this paper, we show the existence of a polynomial time graph isomorphism algorithm for all graphs excluding graphs that are locally trianglefree. This particular class of graphs allows to divide the graph into neighbourhood sub-graph…
We introduce and study the complexity of Path Packing. Given a graph $G$ and a list of paths, the task is to embed the paths edge-disjoint in $G$. This generalizes the well known Hamiltonian-Path problem. Since Hamiltonian Path is…
There are several interrelated notions of discrete curvature on graphs. Many approaches utilize the optimal transportation metric on its probability simplex or the distance matrix of the graph. In this survey article, we compute formulas…
The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of…
In recent years, there has been significant interest in characterizing the induced subgraph obstructions to bounded treewidth and pathwidth. While this has recently been resolved for pathwidth, the case of treewidth remains open, and prior…
We give a formalism for approximate isomorphism in continuous logic simultaneously generalizing those of two papers by Ben Yaacov and by Ben Yaacov, Doucha, Nies, and Tsankov, which are largely incompatible. With this we explicitly exhibit…
Three-way dissimilarities are a generalization of (two-way) dissimilarities which can be used to indicate the lack of homogeneity or resemblance between any three objects. Such maps have applications in cluster analysis, and have been used…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
The study of Markov chains on discrete spaces, such as digraphs, has captivated mathematicians in recent decades due to its interconnectedness with topology, geometry, dynamics, spectral theory, and differential equations. Furthermore,…
We consider random matrices whose shape is the dilation $N\lambda$ of a self-conjugate Young diagram $\lambda$. In the large-$N$ limit, the empirical distribution of the squared singular values converges almost surely to a probability…
We initiate the study of spectral generalizations of the graph isomorphism problem. (a)The Spectral Graph Dominance (SGD) problem: On input of two graphs $G$ and $H$ does there exist a permutation $\pi$ such that $G\preceq \pi(H)$? (b) The…
Rough paths techniques give the ability to define solutions of stochastic differential equations driven by signals $X$ which are not semimartingales and whose $p$-variation is finite only for large values of $p$. In this context, rough…