English
Related papers

Related papers: On a random model of forgetting

200 papers

We study weak convergence of a sequence of point processes to a scale-invariant simple point process. For a deterministic sequence $(z_n)_{n\in\mathbb{N}}$ of positive real numbers increasing to infinity as $n \to \infty$ and a sequence…

Probability · Mathematics 2020-06-16 Chinmoy Bhattacharjee , Ilya Molchanov

Let $S$ be a finite set, and $X_1,\ldots,X_n$ an i.i.d. uniform sample from $S$. To estimate the size $|S|$, without further structure, one can wait for repeats and use the birthday problem. This requires a sample size of the order…

Statistics Theory · Mathematics 2026-04-28 Sourav Chatterjee , Persi Diaconis , Susan Holmes

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…

Probability · Mathematics 2007-05-23 Svante Janson

$S \subseteq \mathbb{Z}_{2n}$ is said to be sum-free if $S$ has no solution to the equation $a+b=c$. The sum-free process on $\mathbb{Z}_{2n}$ starts with $S:=\emptyset$, and iteratively inserts elements of $\mathbb{Z}_{2n}$, where each…

Combinatorics · Mathematics 2019-12-03 Patrick Bennett

Let $\mathcal{M}$ be a set with $M$ elements, let $\psi :\mathcal{M}\to\mathcal{M}$ be a bijective involution, and let~$\boldsymbol{\mathcal{X}}_{\psi}$ be the set of sequences $(x_1,\dots,x_M)\in\mathcal{M}^M$ with the property that…

Number Theory · Mathematics 2026-02-26 Cristian Cobeli , The Nguyen , Alexandru Zaharescu

Let S_n=X_1+...+X_n be a sum of independent symmetric random variables such that |X_{i}|\leq 1. Denote by W_n=\epsilon_{1}+...+\epsilon_{n} a sum of independent random variables such that \prob{\eps_i = \pm 1} = 1/2. We prove that…

Probability · Mathematics 2019-11-13 Dainius Dzindzalieta , Matas Šileikis , Tomas Juškevičius

We consider the symmetric simple exclusion process evolving on the interval of length $n-1$ in contact with reservoirs of density $\rho \in (0,1)$ at the boundary. We use Yau's relative entropy method to show that if the initial measure is…

Probability · Mathematics 2021-10-14 Patrícia Gonçalves , Milton Jara , Rodrigo Marinho , Otávio Menezes

We investigate three types of averaging principles and the normal deviation for multi-scale stochastic differential equations (in short, SDEs) with polynomial nonlinearity. More specifically, we first demonstrate the strong convergence of…

Dynamical Systems · Mathematics 2023-08-22 Mengyu Cheng , Zhenxin Liu , Michael Röckner

For a Gaussian time series with long-memory behavior, we use the FEXP-model for semi-parametric estimation of the long-memory parameter $d$. The true spectral density $f_o$ is assumed to have long-memory parameter $d_o$ and a FEXP-expansion…

Statistics Theory · Mathematics 2012-02-24 Willem Kruijer , Judith Rousseau

Attractors in asymmetric neural networks with deterministic parallel dynamics were shown to present a "chaotic" regime at symmetry eta < 0.5, where the average length of the cycles increases exponentially with system size, and an…

Disordered Systems and Neural Networks · Physics 2009-10-31 Ugo Bastolla , Giorgio Parisi

Let $x_1,\dots,x_{n}$ be a fixed sequence of real numbers. At each stage, pick $k$ integers $\{I_{i}\}_{1\leq i \leq k}$ uniformly at random without replacement and then for each $i \in \{1,2,\dots,k\}$ replace $x_{I_i}$ by…

Probability · Mathematics 2026-02-18 Rohit Chaudhuri

A random graph process, $\Gorg[1](n)$, is a sequence of graphs on $n$ vertices which begins with the edgeless graph, and where at each step a single edge is added according to a uniform distribution on the missing edges. It is well known…

Probability · Mathematics 2008-11-26 Gideon Amir , Ori Gurel-Gurevich , Eyal Lubetzky , Amit Singer

Suppose Alice and Bob receive strings $X=(X_1,...,X_n)$ and $Y=(Y_1,...,Y_n)$ each uniformly random in $[s]^n$ but so that $X$ and $Y$ are correlated . For each symbol $i$, we have that $Y_i = X_i$ with probability $1-\eps$ and otherwise…

Information Theory · Computer Science 2012-08-30 Siu On Chan , Elchanan Mossel , Joe Neeman

Nested sampling (NS) is a popular algorithm for Bayesian computation. We investigate statistical errors in NS both analytically and numerically. We show two analytic results. First, we show that the leading terms in Skilling's expression…

Instrumentation and Methods for Astrophysics · Physics 2023-03-29 Andrew Fowlie , Qiao Li , Huifang Lv , Yecheng Sun , Jia Zhang , Le Zheng

Construct recursively a long string of words w1. .. wn, such that at each step k, w k+1 is a new word with a fixed probability p $\in$ (0, 1), and repeats some preceding word with complementary probability 1 -- p. More precisely, given a…

Probability · Mathematics 2019-06-26 Jean Bertoin

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

Probability · Mathematics 2020-11-09 Michael P. Casey

Let $\{X_i(t),t\ge0\}, 1\le i\le n$ be independent copies of a stationary process $\{X(t), t\ge0\}$. For given positive constants $u,T$, define the set of $r$th conjunctions $ C_{r,T,u}:= \{t\in [0,T]: X_{r:n}(t) > u\}$ with $X_{r:n}(t)$…

Probability · Mathematics 2014-08-07 Krzysztof Debicki , Enkelejd Hashorva , Lanpeng Ji , Chengxiu Ling

We consider the one dimensional totally asymmetric simple exclusion process with initial product distribution with densities $0 \leq \rho_0 < \rho_1 <...< \rho_n \leq 1$ in $(-\infty,c_1\ve^{-1})$, $[c_1\ve^{-1},c_2\epsilon^{-1}),...,[c_n…

Probability · Mathematics 2011-11-10 Pablo A. Ferrari , L. Renato G. Fontes , M. Eulalia Vares

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

Probability · Mathematics 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

Combinatorics · Mathematics 2024-08-07 Anant Godbole , Hannah Swickheimer
‹ Prev 1 3 4 5 6 7 10 Next ›