Related papers: GREM-like K processes on trees with infinite depth
We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground $\lambda$-term corresponds to some property…
In this article, we study linearly edge-reinforced random walk on general multi-level ladders for large initial edge weights. For infinite ladders, we show that the process can be represented as a random walk in a random environment, given…
In nature, one observes that a K-theory of an object is defined in two steps. First a "structured" category is associated to the object. Second, a K-theory machine is applied to the latter category to produce an infinite loop space. We…
k-means is a widely used clustering algorithm, but for $k$ clusters and a dataset size of $N$, each iteration of Lloyd's algorithm costs $O(kN)$ time. Although there are existing techniques to accelerate single Lloyd iterations, none of…
Let ${Z_{n},n\geq 0} $ be a critical branching process in random environment and let $T$ be its moment of extinction. Under the annealed approach we prove, as $n\to \infty ,$ a limit theorem for the number of particles in the process at…
Even if a logical network consists of thermodynamically reversible gate operations, the computation process may have high dissipation rate if the gate implementation is controlled by external clock signals. It is an open question whether…
Within the setting of rare event modelling, the method of level sets allows us to define an equivalence relation over rare events with distinct rates of entropy production. This method allows us to clarify the relation between the empirical…
We investigate the possibility to assist the numerically ill-posed calculation of spectral properties of interacting quantum systems in thermal equilibrium by extending the imaginary-time simulation to a finite Schwinger-Keldysh contour.…
We study the asymptotics of the survival probability for the critical and decomposable branching processes in random environment and prove Yaglom type limit theorems for these processes. It is shown that such processes possess some…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
Magnetizations are introduced to the Generalized Random Energy Model (GREM) and numerical simulations on ac susceptibility is made for direct comparison with experiments in glassy materials. Prominent dynamical natures of spin glasses, {\it…
We consider nonintersecting random walks satisfying the condition that the increments have a finite moment generating function. We prove that in a certain limiting regime where the number of walks and the number of time steps grow to…
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…
We develop a unified approach to defining a point at infinity for an arbitrary space and formalizing convergence to this point. Central to our work is a method to quantify and classify the rates at which functions approach their limits at…
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root.…
We construct a probability model seemingly unrelated to the considered stochastic process of coagulation and fragmentation. By proving for this model the local limit theorem, we establish the asymptotic formula for the partition function of…
A number of recent works have employed decision trees for the construction of explainable partitions that aim to minimize the $k$-means cost function. These works, however, largely ignore metrics related to the depths of the leaves in the…
We discuss the enumeration of Feynman diagrams at tree order for processes with external lines of different types. We show how this can be done by iterating algebraic Schwinger-Dyson equations. Asymptotic estimates for very many external…
We study nongeneric planar trees and prove the existence of a Gibbs measure on infinite trees obtained as a weak limit of the finite volume measures. It is shown that in the infinite volume limit there arises exactly one vertex of infinite…
The $k$-expansion of a graph $G$ is the $k$-uniform hypergraph obtained from $G$ by adding $k-2$ new vertices to every edge. We determine, for all $k > d \geq 1$, asymptotically optimal $d$-degree conditions that ensure the existence of all…