Searcharxiv⌕ Search

arXiv subjects

Svante Janson

Publications and source records attributed to Svante Janson.

At least 37 records · Page 2Linked to original sources

Periodic minimum in the count of binomial coefficients not divisible by a prime

The summatory function of the number of binomial coefficients not divisible by a prime is known to exhibit regular periodic oscillations, yet identifying the less regularly behaved minimum of the underlying periodic functions has been open for almost all cases. We propose an approach to identify such minimum in some generality, solving particularly a previous conjecture of B. Wilson [Asymptotic behavior of Pascal's triangle modulo a prime, Acta Arith. 83 (1998), pp. 105-116].

math.NT↗

The Harmonic Descent Chain

The decreasing Markov chain on \{1,2,3, \ldots\} with transition probabilities $p(j,j-i) \propto 1/i$ arises as a key component of the analysis of the beta-splitting random tree model. We give a direct and almost self-contained "probability" treatment of its occupation probabilities, as a counterpart to a more sophisticated but perhaps opaque derivation using a limit continuum tree structure and Mellin transforms.

math.PR↗

On semi-restricted Rock, Paper, Scissors

Spiro, Surya and Zeng (Electron. J. Combin. 2023; arXiv:2207.11272) recently studied a semi-restricted variant of the well-known game Rock, Paper, Scissors; in this variant the game is played for $3n$ rounds, but one of the two players is restricted and has to use each of the three moves exactly $n$ times. They find the optimal strategy, and they show that it results in an expected score for the unrestricted player $Θ(\sqrt{n})$; they conjecture, based on numerical evidence, that the expectation is $\approx 1.46\sqrt{n}$. We analyse the result of the strategy further and show that the average is $\sim c \sqrt{n}$ with $c=3\sqrt{3}/2\sqrtπ=1.466$, verifying the conjecture. We also find the asymptotic distribution of the score, and compute its variance.

math.PR↗

Almost sure and moment convergence for triangular Pólya urns

We consider triangular Pólya urns and show under very weak conditions a general strong limit theorem of the form $X_{ni}/a_{ni}\to \mathcal{X}_i$ a.s., where $X_{ni}$ is the number of balls of colour $i$ after $n$ draws; the constants $a_{ni}$ are explicit and of the form $n^α\log^γn$; the limit is a.s. positive, and may be either deterministic or random, but is in general unknown. The result extends to urns with subtractions under weak conditions, but a counterexample shows that some conditions are needed. For balanced urns we also prove moment convergence in the main results if the replacements have the corresponding moments. The proofs are based on studying the corresponding continuous-time urn using martingale methods, and showing corresponding results there. We assume for convenience that all replacements have finite second moments.

math.PR↗

Better-than-average uniform random variables and Eulerian numbers, or: How many candidates should a voter approve?

Consider $n$ independent random numbers with a uniform distribution on $[0,1]$. The number of them that exceed their mean is shown to have an Eulerian distribution, i.e., it is described by the Eulerian numbers. This is related to, but distinct from, the well known fact that the integer part of the sum of independent random numbers uniform on $[0,1]$ has an Eulerian distribution. One motivation for this problem comes from voting theory.

math.PR↗

Uncovering a graph

Uncover the vertices of a given graph, deterministic or random, in random order; we consider both a discrete-time and a continuous-time version. We study the evolution of the number of visible edges, and show convergence after normalization to a Gaussian process. This problem was studied by Hackl, Panholzer, and Wagner for the case when the graph is a random labelled tree; we generalize their result to more general graphs, including both other classes of random and non-random trees, and denser graphs. The results are similar in all cases, but some differences can be seen depending on the size of the average degree and of the variance of the vertex degrees.

math.PR↗

Fringe trees for random trees with given vertex degrees

We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given vertex degrees, for random simply generated trees (or conditioned Galton--Watson trees), and for additive functionals. The key tool for our work is an extension to the multivariate setting of a theorem by Gao and Wormald (2004), which provides a way to show asymptotic normality by analysing the behaviour of sufficiently high factorial moments.

math.PR↗

Approximation of Subgraph Counts in the Uniform Attachment Model

We use Stein's method to obtain distributional approximations of subgraph counts in the uniform attachment model or random directed acyclic graph; we provide also estimates of rates of convergence. In particular, we give uni- and multi-variate Poisson approximations to the counts of cycles, and normal approximations to the counts of unicyclic subgraphs; we also give a partial result for the counts of trees. We further find a class of multicyclic graphs whose subgraph counts are a.s. bounded as $n\to\infty$.

math.PR↗

On a central limit theorem in renewal theory

Serfozo (2009, Theorem 2.65) gives a useful central limit theorem for processes with regenerative increments. Unfortunately, there is a gap in the proof. We fill this gap, and at the same time we weaken the assumptions. Furthermore, we give conditions for moment convergence in this setting. We give also further results complementing results in Serfozo (2009) on the law of large numbers and estimates for the mean; in particular, we show that there is a gap between conditions for the weak and strong laws of large numbers.

math.PR↗

Real trees

We survey the definition and some elementary properties of real trees. There are no new results, as far as we know. One purpose is to give a number of different definitions and show the equivalence between them. We discuss also, for example, the four-point inequality, the length measure and the connection to the theory of Gromov hyperbolic spaces. Several examples are given.

math.CO↗

Central limit theorem for components in meandric systems through high moments

We investigate here the behaviour of a large typical meandric system, proving a central limit theorem for the number of components of given shape. Our main tool is a theorem of Gao and Wormald, that allows us to deduce a central limit theorem from the asymptotics of large moments of our quantities of interest.

math.PR↗

The number of descendants in a random directed acyclic graph

We consider a well known model of random directed acyclic graphs of order $n$, obtained by recursively adding vertices, where each new vertex has a fixed outdegree $d\ge2$ and the endpoints of the $d$ edges from it are chosen uniformly at random among previously existing vertices. Our main results concern the number $X$ of vertices that are descendants of $n$. We show that $X/\sqrt n$ converges in distribution; the limit distribution is, up to a constant factor, given by the $d$th root of a Gamma distributed variable. $Γ(d/(d-1))$. When $d=2$, the limit distribution can also be described as a chi distribution $χ(4)$. We also show convergence of moments, and find thus the asymptotics of the mean and higher moments.

math.PR↗

On the Statistics of the Number of Fixed-Dimensional Subcubes in a Random Subset of the n-Dimensional Discrete Unit Cube

This paper consists of two independent, but related parts. In the first part we show how to use symbolic computation to derive explicit expressions for the first few moments of the number of implicants that a random Boolean function has, or equivalently the number of fixed-dimensional subcubes contained in a random subset of the $n$-dimensional cube. These explicit expressions suggest, but do not prove, that these random variables are always asymptotically normal. The second part presents a full, human-generated proof, of this asymptotic normality, first proved by Urszula Konieczna.

math.CO↗

Phragmén's Voting Methods and Justified Representation

In the late 19th century, Swedish mathematician Lars Edvard Phragmén proposed a load-balancing approach for selecting committees based on approval ballots. We consider three committee voting rules resulting from this approach: two optimization variants - one minimizing the maximal load and one minimizing the variance of loads - and a sequential variant. We study Phragmén's methods from an axiomatic point of view, focusing on properties capturing proportional representation. We show that the sequential variant satisfies proportional justified representation, which is a rare property for committee monotonic methods. Moreover, we show that the optimization variants satisfy perfect representation. We also analyze the computational complexity of Phragmén's methods and provide mixed-integer programming based algorithms for computing them.

cs.GT↗

Conditioned Galton-Watson trees: The shape functional, and more on the sum of powers of subtree sizes and its mean

For a complex number $α$, we consider the sum of the $α$th powers of subtree sizes in Galton--Watson trees conditioned to be of size $n$. Limiting distributions of this functional $X_n(α)$ have been determined for $\Reα\neq 0$, revealing a transition between a complex normal limiting distribution for $\Reα< 0$ and a non-normal limiting distribution for $\Reα> 0$. In this paper, we complete the picture by proving a normal limiting distribution, along with moment convergence, in the missing case $\Reα= 0$. The same results are also established in the case of the so-called shape functional $X_n'(0)$, which is the sum of the logarithms of all subtree sizes; these results were obtained earlier in special cases. Additionally, we prove convergence of all moments in the case $\Reα< 0$, where this result was previously missing, and establish new results about the asymptotic mean for real $α< 1/2$. A novel feature for $\Reα=0$ is that we find joint convergence for several $α$ to independent limits, in contrast to the cases $\Reα\neq0$, where the limit is known to be a continuous function of $α$. Another difference from the case $\Reα\neq0$ is that there is a logarithmic factor in the asymptotic variance when $\Reα=0$; this holds also for the shape functional. The proofs are largely based on singularity analysis of generating functions.

math.PR↗

On Knuth's conjecture for back and forward arcs in Depth First Search in a random digraph with geometric outdegree distribution

Donald Knuth, in a draft of a coming volume of The Art of Computer Programming, has recently conjectured that in Depth-First Search of a random digraph with geometric outdegree distribution, the numbers of back and forward arcs have the same distribution. We show that this conjecture is equivalent to an equality between two generating functions defined by different recursions. Unfortunately, we have not been able so use this to prove the conjecture, which still is open, but we hope that this note will inspire others to succeed with the conjecture.

math.CO↗

Depth-First Search performance in a random digraph with geometric outdegree distribution

We present an analysis of the depth-first search algorithm in a random digraph model with independent outdegrees having a geometric distribution. The results include asymptotic results for the depth profile of vertices, the height (maximum depth) and average depth, the number of trees in the forest, the size of the largest and second-largest trees, and the numbers of arcs of different types in the depth-first jungle. Most results are first order. For the height we show an asymptotic normal distribution. This analysis proposed by Donald Knuth in his next to appear volume of The Art of Computer Programming gives interesting insight in one of the most elegant and efficient algorithm for graph analysis due to Tarjan.

cs.DS↗

Identities and periodic oscillations of divide-and-conquer recurrences splitting at half

We study divide-and-conquer recurrences of the form \begin{equation*} f(n) = αf(\lfloor \tfrac n2\rfloor) + βf(\lceil \tfrac n2\rceil) + g(n) \qquad(n\ge2), \end{equation*} with $g(n)$ and $f(1)$ given, where $α,β\ge0$ with $α+β>0$; such recurrences appear often in analysis of computer algorithms, numeration systems, combinatorial sequences, and related areas. We show that the solution satisfies always the simple \emph{identity} \begin{equation*} f(n) = n^{\log_2(α+β)} P(\log_2n) - Q(n) \end{equation*} under an optimum (iff) condition on $g(n)$. This form is not only an identity but also an asymptotic expansion because $Q(n)$ is of a smaller order. Explicit forms for the \emph{continuity} of the periodic function $P$ are provided, together with a few other smoothness properties. We show how our results can be easily applied to many dozens of concrete examples collected from the literature, and how they can be extended in various directions. Our method of proof is surprisingly simple and elementary, but leads to the strongest types of results for all examples to which our theory applies.

cs.DS↗