Related papers: Observables of random spanning trees in random env…
We study (unrooted) random forests on a graph where the probability of a forest is multiplicatively weighted by a parameter $\beta>0$ per edge. This is called the arboreal gas model, and the special case when $\beta=1$ is the uniform forest…
We introduce a multiscale measure of network instability based on the joint use of Detrended Cross-Correlation Analysis (DCCA) and Minimum Spanning Tree (MST) filtering. The proposed metric, the Elastic Detrended Cross-Correlation Ratio…
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…
We study the minimum spanning tree distribution on the space of spanning trees of the $n$-by-$n$ grid for large $n$. We establish bounds on the decay rates of the probability of the most and the least probable spanning trees as…
The tree-level amplitudes in $\beta$-deformed theory are studied from twistor string theory. We first show that a simple generalization of the proposal in hep-th/0410122 gives the correct results for all of the tree-level amplitudes to the…
The temperature ($T$) and frequency ($\omega$) dependent conductivity of weakly disordered Luttinger liquids is calculated in a systematic way both by perturbation theory and from a finite temperature renormalization group (RG) treatment to…
This Master's thesis examines the properties of large degree vertices in random recursive directed acyclic graphs (RRDAGs), a generalization of the well-studied random recursive tree (RRT) model. Using a novel adaptation of Kingman's…
The pressure spectrum and structure function in homogeneous steady turbulence of an incompressible fluid is studied using direct numerical simulation. The resolution of the simulation is up to $1024^3$ and the Taylor microscale Reynolds…
The effect of structural disorder on the stress response inside three dimensional particle assemblies is studied using computer simulations of frictionless sphere packings. Upon applying a localised, perturbative force within the packings,…
The Bethe Strip of width $m$ is the cartesian product $\B\times\{1,...,m\}$, where $\B$ is the Bethe lattice (Cayley tree). We prove that Anderson models on the Bethe strip have "extended states" for small disorder. More precisely, we…
We study the root-averaged density of states for the Anderson model on the Bethe lattice in the strong-disorder regime. Here the density of states means the root-averaged spectral measure, not a finite-volume eigenvalue counting limit. We…
Inspired by the seminal works of Khuller et al. (STOC 1994) and Chan (SoCG 2003) we study the bottleneck version of the Euclidean bounded-degree spanning tree problem. A bottleneck spanning tree is a spanning tree whose largest edge-length…
We study, in random sparse networks, finite size scaling of the spin glass susceptibility $\chi_{\rm SG}$, which is a proper measure of the de Almeida-Thouless (AT) instability of spin glass systems. Using a phenomenological argument…
We study the spectrum of a system of coupled disordered harmonic oscillators in the thermodynamic limit. This Euclidean random matrix ensemble has been suggested as model for the low-temperature vibrational properties of glass. Exact…
We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.
Functional data analysis (FDA) and ensemble learning can be powerful tools for analyzing complex environmental time series. Recent literature has highlighted the key role of diversity in enhancing accuracy and reducing variance in ensemble…
Let $P \subseteq \mathbb{R}^2$ be a set of points and $T$ be a spanning tree of $P$. The \emph{stabbing number} of $T$ is the maximum number of intersections any line in the plane determines with the edges of $T$. The \emph{tree stabbing…
We continue and extend our earlier investigation ``Strings in a Time-Dependent Orbifold'' (hep-th/0204168). We formulate conditions for an orbifold to be amenable to perturbative string analysis and classify the low dimensional orbifolds…
We present a graph theoretical approach to the configurational statistics of random tree-like objects, such as randomly branching polymers. In particular, for ideal trees we show that Pr\"ufer labelling provides: (i) direct access to the…
The zero-temperature Ising model is known to reach a fully ordered ground state in sufficiently dense random graphs. In sparse random graphs, the dynamics gets absorbed in disordered local minima at magnetization close to zero. Here, we…