相关论文: Differences between the potential theories on a tr…
Because of the existence of cubic scalar couplings, there are in general nondecoupling effects at tree level in the scalar sector of any theory with two or more very different mass scales. We show this explicitly in the minimal…
We establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…
We investigate the Schmid theorem, which states that if one has a tree level mechanism with a particle decaying to two particles and one of them decaying posteriorly to two other particles, the possible triangle singularity developed by the…
We study the limiting behavior of a Bienayme-Galton-Watson tree conditioned to have a large number of vertices and either a fixed number of leaves or a fixed number of internal nodes. The first biconditioning gives a universal result with…
This talk considers possible lessons of string theory for low energy physics. These are of two types. First, assuming that string theory is the correct underlying theory of all interactions, we ask whether there are any generic predictions…
Assuming Zipf's Law to be accurate, we show that existing techniques for partially optimizing binary trees produce results that are approximately 10% worse than true optimal. We present a new approximate optimization technique that runs in…
Understanding the cancellation of ultraviolet and infrared singularities in perturbative quantum field theory is of central importance for the development and automation of various theoretical tools that make accurate predictions for…
Random forests are a very effective and commonly used statistical method, but their full theoretical analysis is still an open problem. As a first step, simplified models such as purely random forests have been introduced, in order to shed…
Based on bulk reconstruction from the finite boundary of the Bruhat-Tits tree, the boundary effective theory is obtained after integrating out fields outside this boundary. According to the $~p$-adic version of Anti-de Sitter/Conformal…
Rado's Conjecture is a compactness/reflection principle that says any nonspecial tree of height $\omega_1$ has a nonspecial subtree of size $\leq \aleph_1$. Though incompatible with Martin's Axiom, Rado's Conjecture turns out to have many…
Heritability is a central concept in the long-standing debate about nature versus nurture in biological and social sciences. However, existing notions of heritability are based on strong assumptions and do not use explicit causal models. We…
Maximum likelihood estimators are used extensively to estimate unknown parameters of stochastic trait evolution models on phylogenetic trees. Although the MLE has been proven to converge to the true value in the independent-sample case, we…
We consider critical multitype Bienaym\'e trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied under two distinct conditioning frameworks: first,…
Can we do arithmetic in a completely different way, with a radically different data structure? Could this approach provide practical benefits, like operations on giant numbers while having an average performance similar to traditional…
The energy test is a powerful binning-free, multi-dimensional and distribution-free tool that can be applied to compare a measurement to a given prediction (goodness-of-fit) or to check whether two data samples originate from the same…
If $G$ is a graph and $\mathbf{m}$ is an ordered multiplicity list which is realizable by at least one symmetric matrix with graph $G$, what can we say about the eigenvalues of all such realizing matrices for $\mathbf{m}$? It has sometimes…
Four-dimensional strings with the standard model gauge group $SU(3)\times SU(2)\times U(1)$ give model-dependent predictions for the tree level weak mixing-angle. In the presence of an extra pseudo-anomalous gauged- ${U(1)}_X$, the value of…
Consider the following heuristic for building a decision tree for a function $f : \{0,1\}^n \to \{\pm 1\}$. Place the most influential variable $x_i$ of $f$ at the root, and recurse on the subfunctions $f_{x_i=0}$ and $f_{x_i=1}$ on the…
We continue our analysis of establishing the reliability of "simple" effective theories where massive fields are "frozen" rather than integrated out, in a wide class of four dimensional theories with global or local N=1 supersymmetry. We…
The paper deals with optimality issues in connection with updating beliefs in networks. We address two processes: triangulation and construction of junction trees. In the first part, we give a simple algorithm for constructing an optimal…