Related papers: A phase transition for repeated averages

Given a sequence of numbers $\{p_n\}$ in $[0,1]$, consider the following experiment. First, we flip a fair coin and then, at step $n$, we turn the coin over to the other side with probability $p_n$, $n\ge 2$. What can we say about the…

We propose and demonstrate a new phase retrieval method for imaging through random media. Although methods to recover the Fourier amplitude through random distortions are well established, recovery of the Fourier phase has been a more…

Change point estimation in its offline version is traditionally performed by optimizing over the data set of interest, by considering each data point as the true location parameter and computing a data fit criterion. Subsequently, the data…

Under suitable moment assumptions, we show that a genuinely d-dimensional step-reinforced random walk undergoes a phase transition between recurrence and transience in dimensions $d=1,2$, and that it is transient for all reinforcement…

Let $\{\xi_i\}_{i \geq 1}$ be a sequence of i.i.d.\ positive random variables. Starting from the usual square lattice replace each horizontal edge that links a site in $i$-th vertical column to another in the $(i+1)$-th vertical column by…

We study the extremes of a sequence of random variables $(R_n)$ defined by the recurrence $R_n=M_nR_{n-1}+q$, $n\ge1$, where $R_0$ is arbitrary, $(M_n)$ are iid copies of a non--degenerate random variable $M$, $0\le M\le1$, and $q>0$ is a…

We investigate fluctuation phenomena for the graph distance and the number of cut points associated with random media arising from the range of a random walk. Our results demonstrate a sequence of dimension-dependent phase transitions in…

We study sequences of partitions of a non decreasing sequence I n of intervals into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according…

This paper studies transfer learning for estimating the mean of random functions based on discretely sampled data, where, in addition to observations from the target distribution, auxiliary samples from similar but distinct source…

Fundamental optics such as lenses and prisms work by applying phase shifts to incoming light via the refractive index. In these macroscopic devices, many particles each contribute a miniscule phase shift, working together to impose a total…

In this paper, we study the biased random transposition shuffle, a natural generalization of the classical random transposition shuffle studied by Diaconis and Shahshahani. We diagonalize the transition matrix of the shuffle and use these…

We present some accelerated variants of fixed point iterations for computing the minimal non-negative solution of the unilateral matrix equation associated with an M/G/1-type Markov chain. These variants derive from certain staircase…

Let $(X,\mathcal{A}, \mu)$ be a probability measure space and let $T_i,$ $1\leq i\leq H,$ be commuting invertible measure preserving transformations on this measure space. We prove the following pointwise results; The averages…

Let H(n) be the group of 3x3 uni-uppertriangular matrices with entries in Z/nZ, the integers mod n. We show that the simple random walk converges to the uniform distribution in order n^2 steps. The argument uses Fourier analysis and is…

We investigate the phase transition in the three-dimensional abelian Higgs model for N complex scalar fields, using the gauge-invariant average action \Gamma_{k}. The dependence of \Gamma_{k} on the effective infra-red cut-off k is…

Observational learning is an important information aggregation mechanism. However, it occasionally leads to a state in which an entire population chooses a sub-optimal option. When it occurs and whether it is a phase transition remain…

The one-dimensional phase retrieval problem consists in the recovery of a complex-valued signal from its Fourier intensity. Due to the well-known ambiguousness of this problem, the determination of the original signal within the extensive…

Consider the complete graph \(K_n\) on \(n\) vertices where each edge \(e\) is independently open with probability \(p_n(e)\) or closed otherwise. Here \(\frac{C-\alpha_n}{n} \leq p_n(e) \leq \frac{C+\alpha_n}{n}\) where \(C > 0\) is a…

Change-point analysis is a flexible and computationally tractable tool for the analysis of times series data from systems that transition between discrete states and whose observables are corrupted by noise. The change-point algorithm is…

We consider a phase retrieval problem, where the goal is to reconstruct a $n$-dimensional complex vector from its phaseless scalar products with $m$ sensing vectors, independently sampled from complex normal distributions. We show that,…