Searcharxiv⌕ Search

arXiv subjects

J. J. P. Veerman

Publications and source records attributed to J. J. P. Veerman.

At least 19 recordsLinked to original sources

Birkhoff Measures, Birkhoff Sums, and Discrepancies

We study the distribution of a sequence of points in the circle generated by rotations by a fixed irrational number $ρ$ with initial condition $x_0$, that is: $\{x_0+iρ\}_{i=1}^n$. The \emph{discrepancy} as defined by Pisot and Van Der Corput \cite{VdCP}, quantifies how evenly distributed such a sequence is. Consider the ergodic or Birkhoff sum of mean zero $S(ρ,n,x):=\sum_{i=1}^{n} (\{x+iρ\}-1/2)$, where $\{\cdot\}$ denotes the fractional part. This is a piecewise-linear map in the variable $x$ with $n$ branches, each with slope $n$. For fixed $n$ and $ρ$, let $ν(ρ,n,z)$ be the number of pre-images of $S(ρ,n,x)=z$ divided by $n$. Then $ν(ρ,n,z)$ is a probability density. We call the associated measures Birkhoff measures. We investigate how the graph of $ν(ρ,n,z)$ varies with $n$. We prove that the length of the support of the Birkhoff measure $ν(ρ,n,z)dz$ can be expressed in terms of the discrepancy. We also show that if $n$ is a continued fraction denominator of $ρ$, then the graph of $ν(ρ,n,z)$ an approximate isosceles trapezoid. We also give new, brief, proofs of two classical results, one by Ramshaw \cite{Ramshaw} and one found by Kuipers-Niederreiter \cite{KN}. These results allow efficient computation of both Birkhoff sums and discrepancies.

math.DS↗

Classification of Minimal Separating Sets of Low Genus Surfaces

A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such sets show up in a variety of contexts. For example, in a wide class of metric spaces, if we choose distinct points p and q, then the set of points x satisfying d(x, p) = d(x, q) is a minimal separating set. In this paper we classify which topological graphs can be realized as minimal separating sets in surfaces of low genus. In general the question of whether a graph can be embedded at all in a surface is a difficult one, so our work is partly computational. We classify graphs embeddings which are minimal separating in a given genus and write a computer program to find all such embeddings and their underlying graphs.

math.CO↗

The Bunching and Monotonicity Properties of Families of Probability Distributions

Measuring the concentration of random variables is a fundamental concept in probability and statistics. Here, we explore a type of concentration measure for continuous random variables with bounded support and use it to provide a notion of stochastic order by concentration. We give an application to the Beta family of distributions, and specifically to the one-parameter subfamily with constant mean. This leads to using U.S. household income data to fit generalized Beta distributions and offers a new measure of income concentration.

math.ST↗

Geodesics on Regular Constant Distance Surfaces

Suppose that the surfaces K0 and Kr are the boundaries of two convex, complete, connected C^2 bodies in R^3. Assume further that the (Euclidean) distance between any point x in Kr and K0 is always r (r > 0). For x in Kr, let Π(x) denote the nearest point to x in K0. We show that the projection Π preserves geodesics in these surfaces if and only if both surfaces are concentric spheres or co-axial round cylinders. This is optimal in the sense that the main step to establish this result is false for C^{1,1} surfaces. Finally, we give a non-trivial example of a geodesic preserving projection of two C^2 non-constant distance surfaces. The question whether for any C^2 convex surface S0, there is a surface S whose projection to S0 preserves geodesics is open.

math.MG↗

A New Estimate of the Cutoff Value in the Bak-Sneppen Model

We present evidence that the Bak-Sneppen model of evolution on $N$ vertices requires $N^3$ iterates to reach equilibrium. This is substantially more than previous authors suggested (on the order of $N^2$). Based on that estimate, we present a novel algorithm inspired by previous rank-driven analyses of the model allowing for direct simulation of the model with populations of up to $N = 25600$ for $2\cdot N^3$ iterations. These extensive simulations suggest a cutoff value of $x^* = 0.66692 \pm 0.00003$, a value slightly lower than previously estimated yet still distinctly above $2/3$. We also study how the cutoff values $x^*_N$ at finite $N$ approximate the conjectured value $x^*$ at $N=\infty$. Assuming $x^*_N-x^*_\infty \sim N^{-ν}$, we find that $ν=0.978\pm 0.025$, which is significantly lower than previous estimates ($ν\approx 1.4$).

cond-mat.stat-mech↗

Chemical Reaction Networks in a Laplacian Framework

The study of the dynamics of chemical reactions, and in particular phenomena such as oscillating reactions, has led to the recognition that many dynamical properties of a chemical reaction can be predicted from graph theoretical properties of a certain directed graph, called a Chemical Reaction Network (CRN). In this graph, the edges represent the reactions and the vertices the reacting combinations of chemical substances. In contrast with the classical treatment, in this work, we heavily rely on a recently developed theory of directed graph Laplacians to simplify the traditional treatment of the so-called deficiency zero systems of CRN theory. We show that much of the dynamics of these polynomial systems of differential equations can be understood by analyzing the directed graph Laplacian associated with the system. Beside the more concise mathematical treatment, this leads to considerably stronger results. In particular, (i) we show that our Laplacian deficiency zero theorem is markedly stronger than the traditional one and (ii) we derive simple equations for the locus of the equilibria in all (Laplacian) deficiency zero cases. This paper is written in a way to make the material easily accessible to a mathematical audience. In particular, no knowledge of chemistry or physics is assumed.

math.DS↗

Equidistant sets on Alexandrov surfaces

We examine properties of equidistant sets determined by nonempty disjoint compact subsets of a compact 2-dimensional Alexandrov space (of curvature bounded below). The work here generalizes many of the known results for equidistant sets determined by two distinct points on a compact Riemannian 2-manifold. Notably, we find that the equidistant set is always a finite simplicial 1-complex. These results are applied to answer an open question concerning the Hausdorff dimension of equidistant sets in the Euclidean plane.

math.MG↗

A Remarkable Summation Formula, Lattice Tilings, and Fluctuations

We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to efficiently analyze the average behavior of certain common nonlinear dynamical systems, such as the angle-doubling map, $x \mapsto 2x$ modulo 1. In particular, one can use this information to analyze how the behavior of individual orbits deviates from the global average (called fluctuations). More generally, the formula is valid in $\mathbb{R}^m$, where expanding maps give rise to so-called number systems. To illustrate the usefulness in this setting, we compute the fluctuations of a certain map on the plane.

math.DS↗

Statistics of a Family of Piecewise Linear Maps

We study statistical properties of the truncated flat spot map $f_t(x)$. In particular, we investigate whether for large $n$, the deviations $\sum_{i=0}^{n-1} \left(f_t^i(x_0)-\frac 12\right)$ upon rescaling satisfy a $Q$-Gaussian distribution if $x_0$ and $t$ are both independently and uniformly distributed on the unit circle. This was motivated by the fact that if $f_t$ is the rotation by $t$, then it has been shown that in this case the rescaled deviations are distributed as a $Q$-Gaussian with $Q=2$ (a Cauchy distribution). This is the only case where a non-trivial (i.e. $Q\neq 1$) $Q$-Gaussian has been analytically established in a conservative dynamical system. In this note, however, we prove that for the family considered here, $\lim_n S_n/n$ converges to a random variable with a curious distribution which is clearly not a $Q$-Gaussian or any other standard smooth distribution.

math.DS↗

Linear Nearest Neighbor Flocks with All Distinct Agents

This paper analyzes the global dynamics of 1-dimensional agent arrays with nearest neighbor linear couplings. The equations of motion are second order linear ODEs with constant coeffcients. The novel part of this research is that the couplings are different for each distinct agent. We allow the forces to depend on the positions and velocity (damping terms) but the magnitudes of both the position and velocity couplings are different for each agent. We, also, do not assume that the forces are "Newtonian" (i.e. the force due to A on B equals the minus the force of B on A) as this assumption does not apply to certain situations, such as traffic modeling. For example, driver A reacting to driver B does not imply the opposite reaction in driver B. There are no known analytical means to solve these systems, even though they are linear, and so relatively little is known about them. This paper is a generalization of previous work that computed the global dynamics of 1-dimensional sequences of identical agents [3] assuming periodic boundary conditions. In this paper, we push that method further, similar to [2], and use an extended periodic boundary condition to to gain quantitative insights to the systems under consideration. We find that we can approximate the global dynamics of such a system by carefully analyzing the low-frequency behavior of the system with (generalized) periodic boundary conditions.

math.OC↗

One-Sided Derivative of Distance to a Compact Set

We give a complete and self-contained proof of a folklore theorem which says that in an Alexandrov space the distance between a point $γ(t)$ on a geodesic $γ$ and a compact set $K$ is a right-differentiable function of $t$. Moreover, the value of this right-derivative is given by the negative cosine of the minimal angle between the geodesic and any shortest path to the compact set (Theorem 4.3). Our treatment serves as a general introduction to metric geometry and relies only on the basic elements, such as comparison triangles and upper angles.

math.MG↗

Cauchy distributions for the integrable standard map

We consider the integrable (zero perturbation) two--dimensional standard map, in light of current developments on ergodic sums of irrational rotations, and recent numerical evidence that it might possess non-trivial q-Gaussian statistics. Using both classical and recent results, we show that the phase average of the sum of centered positions of an orbit, for long times and after normalization, obeys the Cauchy distribution (a q-Gaussian with q=2), while for almost all individual orbits such a sum does not obey any distribution at all. We discuss the question of existence of distributions for KAM tori.

math.DS↗

A Primer on Laplacian Dynamics in Directed Graphs

We analyze the asymptotic behavior of general first order Laplacian processes on digraphs. The most important ones of these are diffusion and consensus with both continuous and discrete time. We treat diffusion and consensus as dual processes. This is the first complete exposition of this material in a single work.

math.DS↗

Stability Conditions for Coupled Autonomous Vehicles Formations

In this paper, we give necessary conditions for stability of coupled autonomous vehicles in R. We focus on linear arrays with decentralized vehicles, where each vehicle interacts with only a few of its neighbors. We obtain explicit expressions for necessary conditions for stability in the cases that a system consists of a periodic arrangement of two or three different types of vehicles, i.e. configurations as follows: ...2-1-2-1 or ...3-2-1-3-2-1. Previous literature indicated that the (necessary) condition for stability in the case of a single vehicle type (...1-1-1) held that the first moment of certain coefficients of the interactions between vehicles has to be zero. Here, we show that that does not generalize. Instead, the (necessary) condition in the cases considered is that the first moment plus a nonlinear correction term must be zero.

math.DS↗

Navigating Around Convex Sets

We review some basic results of convex analysis and geometry in $\mathbb{R}^n$ in the context of formulating a differential equation to track the distance between an observer flying outside a convex set $K$ and $K$ itself.

math.DS↗

Symmetry and Stability of Homogenuous Flocks. A Position Paper

The study of the movement of flocks, whether biological or technological is motivated by the desire to understand the capability of coherent motion of a large number of agents that only receive very limited information. In a biological flock a large group of animals seek their course while moving in a more or less fixed formation. It seems reasonable that the immediate course is determined by leaders at the boundary of the flock. The others follow: what is their algorithm? The most popular technological application consists of cars on a one-lane road. The light turns green and the lead car accelerates. What is the efficient algorithm for the others to closely follow without accidents? In this position paper we present some general questions from a more fundamental point of view. We believe that the time is right to solve many of these questions: they are within our reach.

eess.SY↗

Diffusion and consensus on weakly connected directed graphs

Let $G$ be a weakly connected directed graph with asymmetric graph Laplacian ${\cal L}$. Consensus and diffusion are dual dynamical processes defined on $G$ by $\dot x=-{\cal L}x$ for consensus and $\dot p=-p{\cal L}$ for diffusion. We consider both these processes as well their discrete time analogues. We define a basis of row vectors $\{\bar γ_i\}_{i=1}^k$ of the left null-space of ${\cal L}$ and a basis of column vectors $\{γ_i\}_{i=1}^k$ of the right null-space of ${\cal L}$ in terms of the partition of $G$ into strongly connected components. This allows for complete characterization of the asymptotic behavior of both diffusion and consensus --- discrete and continuous --- in terms of these eigenvectors. As an application of these ideas, we present a treatment of the pagerank algorithm that is dual to the usual one. We further show that the teleporting feature usually included in the algorithm is not strictly necessary. This is a complete and self-contained treatment of the asymptotics of consensus and diffusion on digraphs. Many of the ideas presented here can be found scattered in the literature, though mostly outside mainstream mathematics and not always with complete proofs. This paper seeks to remedy this by providing a compact and accessible survey.

math.CO↗

On the Uniformity of $(3/2)^n$ Modulo 1

It has been conjectured that the sequence $(3/2)^n$ modulo $1$ is uniformly distributed. The distribution of this sequence is signifcant in relation to unsolved problems in number theory including the Collatz conjecture. In this paper, we describe an algorithm to compute $(3/2)^n$ modulo $1$ to $n = 10^8$. We then statistically analyze its distribution. Our results strongly agree with the hypothesis that $(3/2)^n$ modulo 1 is uniformly distributed.

math.NT↗