Related papers: Correlations in uniform spanning trees: a fermioni…
Inspired by the intimate relationship between Voiculescu's noncommutative probability theory (of type A) and large-N matrix models in physics, we look for physical models related to noncommutative probability theory of type B. These turn…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
We present an extensive search for a general class of flipped $SU(5)$ models built within the free fermionic formulation of the heterotic string. We describe a set of algorithms which constitute the basis for a computer program capable of…
The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform…
We prove that if T is a tree on n vertices wih maximum degree D and the edge probability p(n) satisfies: np>c*max{D*logn,n^{\epsilon}} for some constant \epsilon>0, then with high probability the random graph G(n,p) contains a copy of T.…
Topological Quantum Field Theories (TQFTs) pertinent to some emergent low energy phenomena of condensed matter lattice models in 2+1 and 3+1D are explored. Many of our field theories are highly-interacting without free quadratic analogs.…
An undirected graphical model is a joint probability distribution defined on an undirected graph G*, where the vertices in the graph index a collection of random variables and the edges encode conditional independence relationships among…
In the framework of the four dimensional heterotic superstring with free fermions we present a revised version of the rank eight Grand Unified String Theories (GUST) which contain the $SU(3)_H$-gauge family symmetry. We also develop some…
A class of fermionic quantum field theories with interactions is shown to be equivalent to probabilistic cellular automata, namely cellular automata with a probability distribution for the initial states. Probabilistic cellular automata on…
We prove that the local limit of the weighted spanning trees on any simple connected high degree almost regular sequence of electric networks is the Poisson(1) branching process conditioned to survive forever, by generalizing [NP22] and…
The properties of scale-free random trees are investigated using both preconditioning on non-extinction and fixed size averages, in order to study the thermodynamic limit. The scaling form of volume probability is found, the connectivity…
The uniform recursive tree (URT) is one of the most important models and has been successfully applied to many fields. Here we study exactly the topological characteristics and spectral properties of the Laplacian matrix of a deterministic…
The matrices of spanning rooted forests are studied as a tool for analysing the structure of digraphs and measuring their characteristics. The problems of revealing the basis bicomponents, measuring vertex proximity, and ranking from…
The conjectured three generic local bulk statistics amongst all non-Hermitian random matrix symmetry classes have recently been extended to three generic local edge statistics. We study analytically and numerically complex spacing ratios…
Consider a connected graph $G=(E,V)$ with $N=|V|$ vertices. The main purpose of this paper is to explore the question of uniform sampling of a subtree of $G$ with $n$ nodes, for some $n\leq N$ (the spanning tree case correspond to $n=N$,…
We consider a latent space model for random graphs where a node $i$ is associated to a random latent point $X_i$ on the Euclidean unit ball. The probability that an edge exists between two nodes is determined by a ``link'' function, which…
Let $w:[0,1]^2\rightarrow [0,1]$ be a symmetric function, and consider the random process $G(n,w)$, where vertices are chosen from $[0,1]$ uniformly at random, and $w$ governs the edge formation probability. Such a random graph is said to…
We give a lower bound on the expected degree of the free minimal spanning forest of a vertex transitive graph in terms of its spectral radius. This result answers a question of Lyons-Peres-Schramm and simplifies the Gaboriau-Lyons proof of…
We establish a general map between Grassmann functionals for fermions and probability or weight distributions for Ising spins. The equivalence between the two formulations is based on identical transfer matrices and expectation values of…
We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph $G$ and a root node $r$, we seek a single spanning tree $T$ of minimum {\em stretch}, where the stretch of $T$ is defined to be the maximum…