Related papers: Potential Theory on Trees, Graphs and Ahlfors Regu…
In the field of parameterized complexity theory, the study of graph width measures has been intimately connected with the development of width-based model checking algorithms for combinatorial properties on graphs. In this work, we…
Given a simple, unweighted, undirected graph $G=(V,E)$ with $|V|=n$ and $|E|=m$, and parameters $0 < \varepsilon, \delta <1$, along with \texttt{Degree}, \texttt{Neighbour}, \texttt{Edge} and \texttt{RandomEdge} query access to $G$, we…
In arXiv:math/0603621 we introduced the notion of a partial translation $C^*$-algebra for a discrete metric space. Here we demonstrate that several important classical $C^*$-algebras and extensions arise naturally by considering partial…
We review old and new uses of exchangeability, emphasizing the general theme of exchangeable representations of complex random structures. Illustrations of this theme include processes of stochastic coalescence and fragmentation; continuum…
In this article we study two related models of quantum geometry: generic random trees and two-dimensional causal triangulations. The Hausdorff and spectral dimensions that arise in these models are calculated and their relationship with the…
Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…
We introduce the basic concepts related to subharmonic functions and potentials, mainly for the case of the complex plane and prove the Riesz decomposition theorem. Beyond the elementary facts of the theory we deviate slightly from the…
Hodge theory is a beautiful synthesis of geometry, topology, and analysis, which has been developed in the setting of Riemannian manifolds. On the other hand, spaces of images, which are important in the mathematical foundations of vision…
In physics geometrical connections are the mean to create models with local symmetries (gauge connections), as well as general diffeomorphisms invariance (affine connections). Here we study the irreducible tensor decomposition of…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
We give a complete criterion for when two hyperbolic automorphisms of a tree generate a free, discrete subgroup. The decision depends only on three geometric invariants: the translation lengths of the generators and the length of overlap of…
In this work, we propose trait-based merge trees a generalization of merge trees to feature level sets, targeting the analysis of tensor field or general multi-variate data. For this, we employ the notion of traits defined in attribute…
The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to be a tree metric, and has served as the foundation for numerous distance-based reconstruction methods in phylogenetics. Our main result is…
The fate of shift-symmetries in effective string models is considered beyond tree-level. Such symmetries have been proposed in the past as a way to maintain a hierarchically small Higgs mass and also play a role in schemes of cosmological…
We propose a version of the Quantum Ergodicity theorem on large regular graphs of fixed valency. This is a property of delocalization of "most" eigenfunctions. We consider expander graphs with few short cycles (for instance random large…
We discuss 1-Ahlfors-regular connected sets in a general metric space and prove that such sets are `flat' on most scales and in most locations. Our result is quantitative, and when combined with work of I. Hahlomaa, gives a characterization…
We propose a family of graph structural indices related to the Matrix-forest theorem. The properties of the basic index that expresses the mutual connectivity of two vertices are studied in detail. The derivative indices that measure…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
Let $K_m-H$ be the graph obtained from $K_m$ by removing the edges set $E(H)$ of $H$ where $H$ is a subgraph of $K_m$. In this paper, we characterize the potentially $K_5-P_4$ and $K_5-Y_4$-graphic sequences where $Y_4$ is a tree on 5…
A natural extension of the Dijkgraaf-Vafa proposal is to include fields in the fundamental representation of the gauge group. In this paper we use field theory techniques to analyze gauge theories whose tree level superpotential is a…