相关论文: Characteristic length of random knotting for cylin…

We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…

We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a…

Conditionally on the Riemann hypothesis for certain Dedekind zeta functions, we show that the characteristic polynomial of a class of random tridiagonal matrices of large dimension is irreducible, with probability exponentially close to…

When a thick cylindrical coin is tossed in the air and lands without bouncing on an inelastic substrate, it ends up on its face or its side. We account for the rigid body dynamics of spin and precession and calculate the probability…

A grid poset -- or grid for short -- is a product of chains. We ask, what does a random linear extension of a grid look like? In particular, we show that the average "jump number," i.e., the number of times that two consecutive elements in…

We consider a uniform distribution on the set $\mathcal{M}_k$ of moments of order $k \in \mathbb{N}$ corresponding to probability measures on the interval $[0,1]$. To each (random) vector of moments in $\mathcal{M}_{2n-1}$ we consider the…

We prove Poisson approximation results for the bottom part of the length spectrum of a random closed hyperbolic surface of large genus. Here, a random hyperbolic surface is a surface picked at random using the Weil-Petersson volume form on…

We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…

For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons…

Self-avoiding polymers in two-dimensional ($d=2$) melts are known to adopt compact configurations of typical size $R(N) \sim N^{1/d}$ with $N$ being the chain length. Using molecular dynamics simulations we show that the irregular shapes of…

We study nearest-neighbors branching random walks started from a point at the interior of a hypercube. We show that the probability that the process escapes the hypercube is monotonically decreasing with respect to the distance of its…

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

We study moments of characteristic polynomials of truncated Haar distributed matrices from the three classical compact groups O(N), U(N) and Sp(2N). For finite matrix size we calculate the moments in terms of hypergeometric functions of…

We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…

The value distribution of derivatives of characteristic polynomials of matrices from SO(N) is calculated at the point 1, the symmetry point on the unit circle of the eigenvalues of these matrices. We consider subsets of matrices from SO(N)…

The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…

This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…

In this paper, we study the curvature properties of random complex plane curves. We bound from below the probability that a uniform proportion of the area of a random complex degree $d$ plane curve has a curvature smaller than $-d/8$. Our…

In this report, the explicit probability density functions of the random Euclidean distances associated with regular hexagons are given, when the two endpoints of a link are randomly distributed in the same hexagon, and two adjacent…

Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…