Related papers: Correlations in uniform spanning trees: a fermioni…
We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…
The matrices of spanning rooted forests are studied as a tool for analysing the structure of networks and measuring their properties. The problems of revealing the basic bicomponents, measuring vertex proximity, and ranking from preference…
The competition between local and global driving forces is significant in a wide variety of naturally occurring branched networks. We have investigated the impact of a global minimization criterion versus a local one on the structure of…
We study the height of a spanning tree $T$ of a graph $G$ obtained by starting with a single vertex of $G$ and repeatedly selecting, uniformly at random, an edge of $G$ with exactly one endpoint in $T$ and adding this edge to $T$.
For dendrite graphs from biological experiments on mouse's retinal ganglion cells, a paper by Nakatsukasa, Saito and Woei reveals a mysterious phase transition phenomenon in the spectra of the corresponding graph Laplacian matrices. While…
We use Stein's method to obtain distributional approximations of subgraph counts in the uniform attachment model or random directed acyclic graph; we provide also estimates of rates of convergence. In particular, we give uni- and…
Large graphs abound in machine learning, data mining, and several related areas. A useful step towards analyzing such graphs is that of obtaining certain summary statistics - e.g., or the expected length of a shortest path between two…
By means of analytic techniques we show that the expected number of spanning trees in a connected labelled series-parallel graph on $n$ vertices chosen uniformly at random satisfies an estimate of the form $s \varrho^{-n} (1+o(1))$, where…
We study universal uncertainty relations and present a method called joint probability distribution diagram to improve the majorization bounds constructed independently in [Phys. Rev. Lett. 111, 230401 (2013)] and [J. Phys. A. 46, 272002…
Recent results on solutions to the equation of motion of the cubic fermionic string field theory and an equivalence of non-polynomial and cubic string field theories are discussed. To have a possibility to deal with both GSO(+) and GSO(-)…
We study the classification of interacting fermionic and bosonic symmetry protected topological (SPT) states. We define a SPT state as whether or not it is separated from the trivial state through a bulk phase transition, which is a general…
The assumption that the elements of the cost matrix in the classical assignment problem are drawn independently from a standard Gaussian distribution motivates the study of a particular Gaussian field indexed by the symmetric permutation…
We give sharp, uniform estimates for the probability that the empirical distribution function for n uniform-[0,1] random variables stays to one side of a given line.
Grand Unified Theories (GUTs) are attractive candidates for more fundamental elementary particle theories. They can not only unify the Standard Model (SM) interactions but also different types of SM fermions, in particular quarks and…
This paper establishes a universality result for scaling limits of uniformly random lozenge tilings of large domains. We prove that whenever a boundary of the domain has three adjacent straight segments inclined under 120 degrees to each…
We propose a generalized model for uniform recursive tree (URT) by introducing an imperfect growth process, which may generate disconnected components (clusters). The model undergoes an interesting phase transition from a singly connected…
Given a collection $\{\lambda_1, \dots, \lambda_n\} $ of real numbers, there is a canonical probability distribution on the set of real symmetric or complex Hermitian matrices with eigenvalues $\lambda_1,\ldots,\lambda_n$. In this paper, we…
We compare lattice QCD determinations of topological susceptibility using a gluonic definition from the gradient flow and a fermionic definition from the spectral projector method. We use ensembles with dynamical light, strange and charm…
We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "intensity" of the loop-erased random walk in…
The probability distribution of the closest neighbor and farther neighbor spacings from a given level have been studied for interacting fermion/boson systems with and without spin degree of freedom constructed using an embedded GOE of one…