Related papers: The Use of Minimal Spanning Trees in Particle Phys…
An introduction to the minimal supersymmetric Standard Model (MSSM) is given. The motivation for ``low-energy'' supersymmetry is reviewed, and the structure of the MSSM is outlined. In its most general form, the MSSM can be viewed as a…
This paper presents a randomized Las Vegas distributed algorithm that constructs a minimum spanning tree (MST) in weighted networks with optimal (up to polylogarithmic factors) time and message complexity. This algorithm runs in…
In this work, I collect and discuss a series of open questions in one-dimensional geometric optimization in Euclidean spaces. The focus is on two classes of problems: maximal distance minimizers and Steiner trees. Maximal distance…
We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and…
Since the Universe is inhomogeneous on scales well below the Hubble radius, light bundles from distant galaxies are deflected and distorted by the tidal gravitational field of the large-scale matter distribution as they propagate through…
This paper give a simple linear-time algorithm that, given a weighted digraph, finds a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous trade-off: given the…
The goal of this paper is to study the similarity between sequences using a distance between the \emph{context} trees associated to the sequences. These trees are defined in the framework of \emph{Sparse Probabilistic Suffix Trees} (SPST),…
We give an overview of the possibility of GLAST to explore theories beyond the Standard Model of particle physics. Among the wide taxonomy we will focus in particular on low scale supersymmetry and theories with extra space-time dimensions.…
These lecture notes concentrate on a few specific topics concerning the distribution of galaxies on scales from 0.1 to nearly 1000/h Mpc. The main aim is to provide the students with the information and tools to familiarize with a few basic…
The calculation of Euclidean distance between points is generalized to one-dimensional objects such as strings or polymers. Necessary and sufficient conditions for the minimal transformation between two polymer configurations are derived.…
One of the useful features of muon colliders is the naturally narrow spread in beam energies. Measurements of threshold cross sections then become a prime candidate for precision measurements of particle masses, widths, and couplings as…
The Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$. This problem, known to be NP-hard, has…
Physicists routinely need probabilistic models for a number of tasks such as parameter inference or the generation of new realizations of a field. Establishing such models for highly non-Gaussian fields is a challenge, especially when the…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
Building a spanning tree, minimum spanning tree (MST), and BFS tree in a distributed network are fundamental problems which are still not fully understood in terms of time and communication cost. x The first work to succeed in computing a…
The many ways in which machine and deep learning are transforming the analysis and simulation of data in particle physics are reviewed. The main methods based on boosted decision trees and various types of neural networks are introduced,…
Particles have tremendous potential as astronomical messengers, and conversely, studying the universe as a whole also teaches us about particle physics. This thesis encompasses both of these research directions. Many models predict a…
Geometric characteristics of metric spaces that appear in formulas of the Gromov--Hausdorff distances from these spaces to so-called simplexes, i.e., to the metric spaces, all whose non-zero distances are the same are studied. The…
We derive a microscopic theory of glassy dynamics based on the transport of voids by micro-string motions, each of which involves particles arranged in a line hopping simultaneously displacing one another. Disorder is modeled by a random…
The topic of cosmic strings provides a bridge between the physics of the very small and the very large. They are predicted by some unified theories of particle interactions. If they exist, they may help to explain some of the largest-scale…