English
Related papers

Related papers: The Limit Profile of Star Transpositions

200 papers

We develop Markov chain mixing time estimates for a class of Markov chains with restricted transitions. We assume transitions may occur along a cycle of $n$ nodes and on $n^\gamma$ additional edges, where $\gamma < 1$. We find that the…

Probability · Mathematics 2015-06-26 Balázs Gerencsér

The difficulty of description of the radiative transfer in disordered photonic crystals arises from the necessity to consider on the equal footing the wave scattering by periodic modulations of the dielectric function and by its random…

Disordered Systems and Neural Networks · Physics 2009-10-16 M. V. Erementchouk , L. I. Deych , H. Noh , H. Cao , A. A. Lisyansky

We consider random permutation matrices following a one-parameter family of deformations of the uniform distribution, called Ewens' measures, and modifications of these matrices where the entries equal to one are replaced by i.i.d uniform…

Probability · Mathematics 2018-03-12 Valentin Bahier

Inferences from observations clearly show that mixing in stars extends beyond the convective boundaries defined by mixing length theory. This triggered the proposal of a variety of prescriptions to include additional mixing in stellar…

Solar and Stellar Astrophysics · Physics 2025-08-01 Lynn Buchele

We prove the sharpness of the phase transition for speed in the biased random walk on the supercritical percolation cluster on Z^d. That is, for each d at least 2, and for any supercritical parameter p > p_c, we prove the existence of a…

Probability · Mathematics 2013-10-18 Alexander Fribergh , Alan Hammond

We consider a multi-type Moran model (in continuous time) with selection and type-dependent mutation. This paper is concerned with the evolution of genealogical information forward in time. For this purpose we define and analytically…

Probability · Mathematics 2015-11-19 Peter Seidel

We propose a method based on continuous time Markov chain approximation to compute the distribution of Parisian stopping times and price Parisian options under general one-dimensional Markov processes. We prove the convergence of the method…

Computational Finance · Quantitative Finance 2021-07-15 Gongqiu Zhang , Lingfei Li

In this article, we study the critical percolation threshold $p_c$ for $d$-regular graphs. It is well-known that $p_c \geq \frac{1}{d-1}$ for such graphs, with equality holding for the $d$-regular tree. We prove that among all…

Probability · Mathematics 2025-01-10 Ishaan Bhadoo

We study Markov chains which model genome rearrangements. These models are useful for studying the equilibrium distribution of chromosomal lengths, and are used in methods for estimating genomic distances. The primary Markov chain studied…

Probability · Mathematics 2007-10-25 Nayantara Bhatnagar , Pietro Caputo , Prasad Tetali , Eric Vigoda

We prove a new lower bound on the critical density $\rho_c$ of the hard disk model, i.e., the density below which it is possible to efficiently sample random configurations of $n$ non-overlapping disks in a unit torus. We use a classic…

Computational Complexity · Computer Science 2014-07-09 Thomas P. Hayes , Cristopher Moore

In the probability theory limit distributions (or probability measures) are often characterized by some convolution equations (factorization properties) rather than by Fourier transforms (the characteristic functionals). In fact, usually…

Probability · Mathematics 2013-07-24 Zbigniew J. Jurek

Constrained diffusions in convex polyhedral domains with a general oblique reflection field, and with a diffusion coefficient scaled by a small parameter, are considered. Using an interior Dirichlet heat kernel lower bound estimate for…

Probability · Mathematics 2013-08-19 Amarjit Budhiraja , Zhen-Qing Chen

We consider oriented percolation on Z^d times Z_+ whose bond-occupation probability is pD(...), where p is the percolation parameter and D is a probability distribution on Z^d. Suppose that D(x) decays as |x|^{-d-\alpha} for some \alpha>0.…

Probability · Mathematics 2007-08-21 Lung-Chi Chen , Akira Sakai

The best known lower and upper bounds on the mixing time for the random-to-random insertions shuffle are $(1/2-o(1))n\log n$ and $(2+o(1))n\log n$. A long standing open problem is to prove that the mixing time exhibits a cutoff. In…

Probability · Mathematics 2015-03-19 Eliran Subag

In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…

We study $k$-star decompositions, that is, partitions of the edge set into disjoint stars with $k$ edges, in the uniformly random $d$-regular graph model $\mathcal{G}_{n,d}$. Using the small subgraph conditioning method, we prove an…

Combinatorics · Mathematics 2026-02-17 Michelle Delcourt , Catherine Greenhill , Mikhail Isaev , Bernard Lidický , Luke Postle

Theoretical derivation and numerical confirmation are provided for the scaling of pore-blockade times as $N^{2+\nu}$ for unbiased translocation in two and three dimensions, with $N$ as the polymer length and $\nu$ as the Flory exponent of…

Soft Condensed Matter · Physics 2010-02-12 Debabrata Panja , Gerard T. Barkema

Pulsars are stars that emit electromagnetic radiation in well-defined time intervals. The frequency of such pulses decays with time as is quantified by the {\it braking index} ($n$). In the canonical model $n = 3$ for all pulsars, but…

High Energy Astrophysical Phenomena · Physics 2018-11-28 H. O. Oliveira , N. S. Magalhaes , R. M. Marinho , G. A. Carvalho , C. Frajuca

We consider triangular arrays of Markov chains that converge weakly to a diffusion process. Second order Edgeworth type expansions for transition densities are proved. The paper differs from recent results in two respects. We allow…

Statistics Theory · Mathematics 2007-05-23 Valentin Konakov , Enno Mammen

Let C be a linear code with length n and minimum distance d. The stopping redundancy of C is defined as the minimum number of rows in a parity-check matrix for C such that the smallest stopping sets in the corresponding Tanner graph have…

Information Theory · Computer Science 2007-07-13 Junsheng Han , Paul H. Siegel
‹ Prev 1 3 4 5 6 7 10 Next ›