Related papers: Fully Packed O(n=1) Model on Random Eulerian Trian…
This paper develops methods to study the distribution of Eulerian statistics defined by second-order recurrence relations. We define a random process to decompose the statistics over compositions of integers. It is shown that the numbers of…
Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by…
We study a rolling model from the perspective of probability. More precisely, we consider a Riemannian manifold rolling against Euclidean space, where the rolling is coupled with random slipping and twisting. The system is modelled by a…
We set up a model of an electric charge where the noninvertible metric phase of first order gravity supercedes the point charge singularity in a curved spacetime. A topological interpretation of the electric charge is provided in terms of…
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…
We numerically study the phase diagram and critical properties of the two-dimensional disordered O(n) loop model by using the transfer matrix and the worm Monte Carlo methods. The renormalization group flow is extracted from the landscape…
We study large charge sectors in the $O(N)$ model in $6-\epsilon $ dimensions. For $4<d<6$, in perturbation theory, the quartic $O(N)$ theory has a UV stable fixed point at large $N$. It was recently argued that this fixed point can be…
We study a completely-packed loop model with crossings in a three-dimensional lattice and confirm it is described by $\mathrm{RP}^{n-1}$ sigma field theories. We use Monte Carlo simulations, with systems sizes up to…
This paper provides new results for a tracking control of the attitude dynamics of a rigid body. Both of the attitude dynamics and the proposed control system are globally expressed on the special orthogonal group, to avoid complexities and…
Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with probability $n^{-a}$, $0 < a < 1/2$, and let $p(n) = n^{1+\epsilon}$, $0 < \epsilon < 1$. We prove that, almost surely, for every…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
Herding and kernel herding are deterministic methods of choosing samples which summarise a probability distribution. A related task is choosing samples for estimating integrals using Bayesian quadrature. We show that the criterion minimised…
Herding and kernel herding are deterministic methods of choosing samples which summarise a probability distribution. A related task is choosing samples for estimating integrals using Bayesian quadrature. We show that the criterion minimised…
We study the large-N limit of a class of matrix models for dually weighted triangulated random surfaces using character expansion techniques. We show that for various choices of the weights of vertices of the dynamical triangulation the…
Two new nontrivial U(1) gauge symmetries are proposed, one based on the particle content of the standard model and the other on that of its supersymmetric generalization. Each is an unexpected first example of its kind. A third new proposal…
This note addresses the meander enumeration problem: "Count all topologically inequivalent configurations of a closed planar non self-intersecting curve crossing a line through a given number of points". We review a description of meanders…
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…
Delaunay triangulations provide a bijection between a set of $N+3$ points in the complex plane, and the set of triangulations with given circumcircle intersection angles. The uniform Lebesgue measure on these angles translates into a…
In this article we provide several exact formulae to calculate the probability that a random triangle chosen within a planar region (any Lebesgue measurable set of finite measure) contains a given fixed point $O$. These formulae are in…
Non-Euclidean triangle centers can be described using homogeneous coordinates that are proportional to the generalized sines of the directed distances of a given center from the edges of the reference triangle. Identical homogeneous…