English
Related papers

Related papers: Intersections of random chords of a circle

200 papers

The divergence of a group is a quasi-isometry invariant defined in terms of pairs of points and lengths of paths avoiding a suitable ball around the identity. In this paper we study "random divergence'', meaning the divergence at two points…

Group Theory · Mathematics 2023-03-20 Antoine Goldsborough , Alessandro Sisto

We have previously proposed a study of arrangements of small circles which also surround regions in the plane realized as the images of natural real algebraic maps yielding Morse-Bott functions by projections. Among studies of arrangements,…

Algebraic Geometry · Mathematics 2025-03-04 Naoki Kitazawa

We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…

Combinatorics · Mathematics 2024-07-29 Mikhail Isaev , Brendan D. McKay , Angus Southwell , Maksim Zhukovskii

The derivative of a polynomial with all zeros on the unit circle has the zeros of its derivative on or inside the unit circle. It has been observed that in many cases the zeros of the derivative have a bimodal distribution: there are two…

Complex Variables · Mathematics 2025-02-20 David W. Farmer

In this paper, we study rare events in spherical and Gaussian random geometric graphs in high dimensions. In these models, the vertices correspond to points sampled uniformly at random on the $d$ dimensional unit sphere or correspond to $d$…

Probability · Mathematics 2025-10-13 Prabhanka Deka , Fangzhou Luo , Baichuan Wu

Given a set of points in P^2, we consider the common zeros of the set of curves of a given degree passing through those points. For general sets of points, these zero sets have the expected dimension and are smooth. In fact, given graded…

Algebraic Geometry · Mathematics 2011-07-11 Zachariah C. Teitler

In testing the independence of two Gaussian populations, one computes the distribution of the sample canonical correlation coefficients, given that the actual correlation is zero. The "Laplace transform" of this distribution is not only an…

Combinatorics · Mathematics 2007-05-23 M. Adler , P. van Moerbeke

We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given $\alpha \in (0,1)$, the union of any $n$-vertex graph with minimum degree $\alpha n$ and the binomial random…

Combinatorics · Mathematics 2025-07-18 Julia Böttcher , Olaf Parczyk , Amedeo Sgueglia , Jozef Skokan

This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular $\el$-sided polygon. Using this result, we obtain the closed-form probability…

Information Theory · Computer Science 2013-06-27 Zubair Khalid , Salman Durrani

We study critical site percolation on the triangular lattice. We find the difference of the probabilities of having a percolation interface to the right and to the left of two given points in the scaling limit. This generalizes both Cardy's…

Probability · Mathematics 2025-04-22 Mikhail Khristoforov , Mikhail Skopenkov , Stanislav Smirnov

We study a simple random walk on an n-dimensional hypercube. For any starting position we find the probability of hitting vertex a before hitting vertex b, whenever a and b share the same edge. This generalizes the model in Doyle, P., and…

Probability · Mathematics 2007-11-19 Stanislav Volkov , Timothy Wong

We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…

Mathematical Physics · Physics 2020-05-26 Ondřej Turek

We characterise the probability distributions that arise from quantum circuits all of whose gates commute, and show when these distributions can be classically simulated efficiently. We consider also marginal distributions and the…

Computational Complexity · Computer Science 2010-05-12 Dan Shepherd

The interpolation problem is a natural and fundamental question whose roots trace back to ancient Greece. The story is long and rich, with many chapters, and a complete solution has been obtained only recently. Exploring it leads us on a…

Algebraic Geometry · Mathematics 2024-05-28 Eric Larson , Ravi Vakil , Isabel Vogt

Using the spectral multiplicities of the standard torus, we endow the Laplace eigenspaces with Gaussian probability measures. This induces a notion of random Gaussian Laplace eigenfunctions on the torus ("arithmetic random waves"). We study…

Mathematical Physics · Physics 2012-06-22 Manjunath Krishnapur , Par Kurlberg , Igor Wigman

Concept of entangled probability distribution of several random variables is introduced. These probability distributions describe multimode quantum states in probability representation of quantum mechanics. Example of entangled probability…

Quantum Physics · Physics 2023-02-28 Vladimir N. Chernega , Olga V. Man'ko , Vladimir I. Man'ko

The complex or non-hermitian orthogonal polynomials with analytic weights are ubiquitous in several areas such as approximation theory, random matrix models, theoretical physics and in numerical analysis, to mention a few. Due to the…

Classical Analysis and ODEs · Mathematics 2016-04-26 A. Martinez-Finkelshtein , E. A. Rakhmanov

We consider an extremal problem for subsets of high-dimensional spheres that can be thought of as an extension of the classical isoperimetric problem on the sphere. Let $A$ be a subset of the $(m-1)$-dimensional sphere $\mathbb{S}^{m-1}$,…

Probability · Mathematics 2018-11-27 Leighton Pate Barnes , Ayfer Ozgur , Xiugang Wu

To any generic curve in an oriented surface there corresponds an oriented chord diagram, and any oriented chord diagram may be realized by a curve in some oriented surface. The genus of an oriented chord diagram is the minimal genus of an…

Geometric Topology · Mathematics 2009-04-29 Nathan Linial , Tahl Nowik

Let $d\ge 3$ be a fixed integer, $p\in (0,1)$, and let $n\geq 1$ be a positive integer such that $dn$ is even. Let $\mathbb{G}(n, d, p)$ be a (random) graph on $n$ vertices obtained by drawing uniformly at random a $d$-regular (simple)…

Probability · Mathematics 2021-12-10 Umberto De Ambroggio , Matthew I. Roberts