Searcharxiv⌕ Search

arXiv subjects

Andreas Strömbergsson

Publications and source records attributed to Andreas Strömbergsson.

27 records · Page 2Linked to original sources

An Effective Ratner Equidistribution Result for ASL(2,R)

Let G=ASL(2,R) be the affine special linear group of the plane, and set Gamma=ASL(2,Z). We prove a polynomially effective asymptotic equidistribution result for the orbits of a 1-dimensional, non-horospherical unipotent flow on Gamma\G.

math.DS↗

Power-law distributions for the free path length in Lorentz gases

It is well known that, in the Boltzmann-Grad limit, the distribution of the free path length in the Lorentz gas with disordered scatterer configuration has an exponential density. If, on the other hand, the scatterers are located at the vertices of a Euclidean lattice, the density has a power-law tail proportional to xi^{-3}. In the present paper we construct scatterer configurations whose free path lengths have a distribution with tail xi^{-N-2} for any positive integer N. We also discuss the properties of the random flight process that describes the Lorentz gas in the Boltzmann-Grad limit. The convergence of the distribution of the free path length follows from equidistribution of large spheres in products of certain homogeneous spaces, which in turn is a consequence of Ratner's measure classification theorem.

math-ph↗

Free path lengths in quasicrystals

Previous studies of kinetic transport in the Lorentz gas have been limited to cases where the scatterers are distributed at random (e.g. at the points of a spatial Poisson process) or at the vertices of a Euclidean lattice. In the present paper we investigate quasicrystalline scatterer configurations, which are non-periodic, yet strongly correlated. A famous example is the vertex set of the Penrose tiling. Our main result proves the existence of a limit distribution of the free path length, which answers a question of Wennberg. The limit distribution is characterised by a certain random variable on the space of higher dimensional lattices, and is distinctly different from the exponential distribution observed for random scatterer configurations. The key ingredients in the proofs are equidistribution theorems on homogeneous spaces, which follow from Ratner's measure classification.

math-ph↗

Gaps between logs

We calculate the limiting gap distribution for the fractional parts of log n, where n runs through all positive integers. By rescaling the sequence, the proof quickly reduces to an argument used by Barra and Gaspard in the context of level spacing statistics for quantum graphs. The key ingredient is Weyl equidistribution of irrational translations on multi-dimensional tori. Our results extend to logarithms with arbitrary base; we deduce explicit formulas when the base is transcendental or the r:th root of an integer. If the base is close to one, the gap distribution is close to the exponential distribution.

math.NT↗

On the probability of a random lattice avoiding a large convex set

Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp up to a scaling of C by a constant. We also prove bounds on a variant of p(C) where the probability is conditioned on the random lattice containing a fixed given point p. Our bounds have applications, among other things, to the asymptotic properties of the collision kernel of the periodic Lorentz gas in the Boltzmann-Grad limit, in arbitrary dimension d.

math.NT↗

Diameters of random circulant graphs

The diameter of a graph measures the maximal distance between any pair of vertices. The diameters of many small-world networks, as well as a variety of other random graph models, grow logarithmically in the number of nodes. In contrast, the worst connected networks are cycles whose diameters increase linearly in the number of nodes. In the present study we consider an intermediate class of examples: Cayley graphs of cyclic groups, also known as circulant graphs or multi-loop networks. We show that the diameter of a random circulant 2k-regular graph with n vertices scales as n^{1/k}, and establish a limit theorem for the distribution of their diameters. We obtain analogous results for the distribution of the average distance and higher moments.

math.CO↗

On the limit distribution of Frobenius numbers

The Frobenius number g(a) of an integer vector a with positive coprime coefficients is defined as the largest integer that does not have a representation as a non-negative integer linear combination of the coefficients of a. According to a recent result by Marklof, if a is taken to be random in an expanding d-dimensional domain D, then g(a) (appropriately rescaled) has a limit distribution. In the present paper we prove an asymptotic formula for the (algebraic) tail behavior of this limit distribution. We also prove that the corresponding upper bound on the probability of the Frobenius number being large holds uniformly with respect to the expansion factor of the domain D. Finally we prove that for large d, the limit distribution has almost all of its mass concentrated in a fairly short interval. The techniques involved in the proofs come from the geometry of numbers, and in particular we use results by Schmidt on the distribution of sublattices of Z^m, and bounds by Rogers and Schmidt on lattice coverings of space with convex bodies.

math.NT↗

The periodic Lorentz gas in the Boltzmann-Grad limit: asymptotic estimates

The dynamics of a point particle in a periodic array of spherical scatterers converges, in the limit of small scatterer size, to a random flight process, whose paths are piecewise linear curves generated by a Markov process with memory two. The corresponding transport equation is distinctly different from the linear Boltzmann equation observed in the case of a random configuration of scatterers. In the present paper we provide asymptotic estimates for the transition probabilities of this Markov process. Our results in particular sharpen previous upper and lower bounds on the distribution of free path lengths obtained by Bourgain, Golse and Wennberg.

math-ph↗

The distribution of free path lengths in the periodic Lorentz gas and related lattice point problems

The periodic Lorentz gas describes the dynamics of a point particle in a periodic array of spherical scatterers, and is one of the fundamental models for chaotic diffusion. In the present paper we investigate the Boltzmann-Grad limit, where the radius of each scatterer tends to zero, and prove the existence of a limiting distribution for the free path length of the periodic Lorentz gas. We also discuss related problems, such as the statistical distribution of directions of lattice points that are visible from a fixed position.

math.DS↗