English
Related papers

Related papers: Differences between the potential theories on a tr…

200 papers

The BCFW recursion relations provide a powerful way to compute tree amplitudes in gauge theories and gravity, but only hold if some amplitudes vanish when two of the momenta are taken to infinity in a particular complex direction. This is a…

High Energy Physics - Theory · Physics 2014-11-18 Nima Arkani-Hamed , Jared Kaplan

Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…

Methodology · Statistics 2025-12-01 Maria Alejandra Valdez Cabrera , Amy D Willis , Armeen Taeb

Conventional gauge-fixing schemes such as R$_\xi$ gauges may lead to a violation of the Higgs-boson low-energy theorem beyond the tree level. To elucidate this fact, we study a simple model whose U(1) gauge symmetry is spontaneously broken,…

High Energy Physics - Phenomenology · Physics 2009-10-30 Apostolos Pilaftsis

Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of…

Data Structures and Algorithms · Computer Science 2016-10-20 Jarek Duda

We show that it is impossible to improve the high-energy behavior of the tree-level four-point amplitude of a massive spin-2 particle by including the exchange of any number of scalars and vectors in four spacetime dimensions. This…

High Energy Physics - Theory · Physics 2019-10-16 James Bonifacio , Kurt Hinterbichler , Rachel A. Rosen

A branch-and-bound (BB) tree certifies a dual bound on the value of an integer program. In this work, we introduce the tree compression problem (TCP): Given a BB tree T that certifies a dual bound, can we obtain a smaller tree with the same…

Optimization and Control · Mathematics 2023-06-08 Gonzalo Muñoz , Joseph Paat , Álinson S. Xavier

We say that a real X is n-generic relative to a perfect tree T if X is a path through T and for all Sigma^0_n (T) sets S, there exists a number k such that either X|k is in S or for all tau in T extending X|k we have tau is not in S. A real…

Logic · Mathematics 2008-07-19 Bernard A. Anderson

We give two consistent constructions of trees $T$ whose finite power $T^{n+1}$ is sharply different from $T^n$: 1. An $\aleph_1$-tree $T$ whose interval topology $X_T$ is perfectly normal, but $(X_T)^2$ is not even countably metacompact. 2.…

Logic · Mathematics 2026-04-22 Ari Meir Brodsky , Assaf Rinot , Shira Yadai

We analyze the trade-off between model complexity and accuracy for random forests by breaking the trees up into individual classification rules and selecting a subset of them. We show experimentally that already a few rules are sufficient…

Machine Learning · Computer Science 2020-12-09 Michael Rapp , Eneldo Loza Mencía , Johannes Fürnkranz

Distributional sources of matter on codimension-two and higher branes are only well-defined as regularized objects. Nevertheless, intuition from effective field theory suggests that the low-energy physics on such branes should be…

High Energy Physics - Theory · Physics 2008-11-26 Claudia de Rham

We consider the task of learning the maximum-likelihood polytree from data. Our first result is a performance guarantee establishing that the optimal branching (or Chow-Liu tree), which can be computed very easily, constitutes a good…

Artificial Intelligence · Computer Science 2013-01-30 Sanjoy Dasgupta

Probability estimation is one of the fundamental tasks in statistics and machine learning. However, standard methods for probability estimation on discrete objects do not handle object structure in a satisfactory manner. In this paper, we…

Applications · Statistics 2018-11-06 Cheng Zhang , Frederick A. Matsen

In this manuscript we study how the vertex energy of a tree is affected when joined with a bipartite graph. We find an alternating pattern with respect to the coalescence vertex: the energy decreases for vertices located at odd distances…

Spectral Theory · Mathematics 2024-02-06 Octavio Arizmendi , Saylé Sigarreta

We introduce and study a generalization of majorization called relative submajorization and show that it has many applications to the resource theories of thermodynamics, bipartite entanglement, and quantum coherence. In particular, we show…

Quantum Physics · Physics 2016-12-28 Joseph M. Renes

We prove that the multiplicity of a fixed eigenvalue $\alpha$ in a random recursive tree on $n$ vertices satisfies a central limit theorem with mean and variance asymptotically equal to $\mu_{\alpha} n$ and $\sigma^2_{\alpha} n$…

Combinatorics · Mathematics 2022-08-12 Kenneth Dadedzi , Stephan Wagner

In a recent article [5], the authors claim that the distance between the b-chromatic index of a tree and a known upper bound is at most 1. At the same time, in [7] the authors claim to be able to construct a tree where this difference is…

Discrete Mathematics · Computer Science 2015-11-19 Ana Silva

A large number of explicit estimators are proposed in this paper for loss rate estimation in a network of the tree topology. All of the estimators are proved to be unbiased and consistent instead of asymptotic unbiased as that obtained in…

Information Theory · Computer Science 2015-08-06 Weiping Zhu

We divide the free energy near the critical point into two parts. One is the regular part, the other is the singular part. The singular part is assumed to be a concrete possible form. The singular part in this form is different from Widom…

Statistical Mechanics · Physics 2007-05-23 Jianxiang Tian , Yuanxing Gui

The duality relation between one-loop integrals and phase-space integrals, developed in a previous work, is extended to higher-order loops. The duality relation is realized by a modification of the customary +i0 prescription of the Feynman…

High Energy Physics - Phenomenology · Physics 2011-03-17 Isabella Bierenbaum , Stefano Catani , Petros Draggiotis , German Rodrigo

This paper makes two main contributions: The first is the construction of a near-minimum spanning tree with constant average distortion. The second is a general equivalence theorem relating two refined notions of distortion: scaling…

Data Structures and Algorithms · Computer Science 2018-11-14 Yair Bartal , Arnold Filtser , Ofer Neiman
‹ Prev 1 8 9 10 Next ›