Related papers: Fully Packed O(n=1) Model on Random Eulerian Trian…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
Cluster-weighted modeling (CWM) is a mixture approach for modeling the joint probability of a response variable and a set of explanatory variables. The parameters are estimated by means of the expectation-maximization algorithm according to…
We display the construction of a twisted superalgebra for the N=1 Euclidian supergravity on 4-manifolds with an almost complex structure. It acts on a representation of twisted supersymmetry made of forms with odd and even statistics and it…
We show that many well-known transforms in convex geometry (in particular, centroid body, convex floating body, and Ulam floating body) are special instances of a general construction, relying on applying sublinear expectations to random…
We examine the total mixed scalar curvature of a fixed distribution as a functional of a pseudo-Riemannian metric. We develop variational formulas for quantities of extrinsic geometry of the distribution to find the critical points of this…
A cyclic random motion at finite velocity with orthogonal directions is considered in the plane and in $\mathbb{R}^3$. We obtain in both cases the explicit conditional distributions of the position of the moving particle when the number of…
We define and study a family of distributions with domain complete Riemannian manifold. They are obtained by projection onto a fixed tangent space via the inverse exponential map. This construction is a popular choice in the literature for…
We have calculated the joint probability distribution function for random reverse-cyclic matrices and shown that it is related to an N-body exactly solvable model. We refer to this well-known model potential as a screened harmonic…
Upper exponential inequalities for the tail probabilities of the centered and normalized number of triangles in the Erd\"{o}s-R\'{e}nyi graph are obtained, where the probability of every edge is fixed. The result is formulated in terms of…
An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N), respectively). An ensemble of…
Let $M$ be a random matrix in the orthogonal group $\O_n$, distributed according to Haar measure, and let $A$ be a fixed $n\times n$ matrix over $\R$ such that $\tr(AA^t)=n$. Then the total variation distance of the random variable…
We model human mobility as a combinatorial allocation process, treating trips as distinguishable balls assigned to location-bins and generating origin-destination (OD) networks. From this analogy, we construct a unified three-scale…
A class of the $D=4$ gravity models describing a coupled system of $n$ Abelian vector fields and the symmetric $n \times n$ matrix generalizations of the dilaton and Kalb-Ramond fields is considered. It is shown that the Pecci-Quinn axion…
A book embedding of a complete graph is a spatial embedding whose planar projection has the vertices located along a circle, consecutive vertices are connected by arcs of the circle, and the projections of the remaining "interior" edges in…
The enumeration of planar maps equipped with an Eulerian orientation has attracted attention in both combinatorics and theoretical physics since at least 2000. The case of 4-valent maps is particularly interesting: these orientations are in…
The Eulerian variational formulation of the gyrokinetic system with electrostatic turbulence is presented in general spatial coordinates by extending our previous work [H. Sugama, {\it et al}., Phys.\ Plasmas {\bf 25}, 102506 (2018)]. The…
We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…
A graph $G$ is total weight $(k,k')$-choosable if for any total list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and each edge $e$ a set $L(e)$ of $k'$ real numbers, there is a proper total…
We review matrix methods as applied to tracer transport. Because tracer transport is linear, matrix methods are an ideal fit for the problem. A gridded, Eulerian tracer simulation can be approximated as a system of linear ordinary…
We develop an algorithm for sampling from the unitary invariant random matrix ensembles. The algorithm is based on the representation of their eigenvalues as a determinantal point process whose kernel is given in terms of orthogonal…