Related papers: A phase transition for repeated averages
In this paper, we extend recent results on the convergence of ergodic averages along sequences generated by return times to shrinking targets in rapidly mixing systems, partially answering questions posed by the first author, Maass and the…
We introduce a new type of card shuffle called one-sided transpositions. At each step a card is chosen uniformly from the pack and then transposed with another card chosen uniformly from below it. This defines a random walk on the symmetric…
We study how to sample paths of a random walk up to the first time it crosses a fixed barrier, in the setting where the step sizes are iid with negative mean and have a regularly varying right tail. We introduce a desirable property for a…
We calculate analytically the phase boundary for a nonequilibrium phase transition in a one-dimensional array of coupled, overdamped parametric harmonic oscillators in the limit of strong and weak spatial coupling. Our results show that the…
We propose a flexible convex relaxation for the phase retrieval problem that operates in the natural domain of the signal. Therefore, we avoid the prohibitive computational cost associated with "lifting" and semidefinite programming (SDP)…
In this paper we establish an estimate for the rate of convergence of the Krasnosel'ski\v{\i}-Mann iteration for computing fixed points of non-expansive maps. Our main result settles the Baillon-Bruck conjecture [3] on the asymptotic…
Fourier phase retrieval is a classical problem that deals with the recovery of an image from the amplitude measurements of its Fourier coefficients. Conventional methods solve this problem via iterative (alternating) minimization by…
In this paper we study the phase transitions of different types of Random Boolean networks. These differ in their updating scheme: synchronous, semi-synchronous, or asynchronous, and deterministic or non-deterministic. It has been shown…
We provide a unified framework to proving pointwise convergence of sparse sequences, deterministic and random, at the $L^1(X)$ endpoint. Specifically, suppose that \[ a_n \in \{ \lfloor n^c \rfloor, \min\{ k : \sum_{j \leq k} X_j = n\} \}…
Grover presented the fixed-point search by replacing the selective inversions by selective phase shifts of $\pi /3$. In this paper, we investigate the convergence behavior of the fixed-point search algorithm with general but equal phase…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
Let g(x)=x/2 + 17/30 (mod 1), let \xi_i, i= 1,2,... be a sequence of independent, identically distributed random variables with uniform distribution on the interval [0,1/15], define g_i(x)=g(x)+ \xi_i (mod 1) and, for n=1,2,..., define…
A random walk with counterbalanced steps is a process of partial sums $\check S(n)=\check X_1+ \cdots + \check X_n$ whose steps $\check X_n$ are given recursively as follows. For each $n\geq 2$, with a fixed probability $p$, $\check X_n$ is…
We prove pointwise convergence, as $N\to \infty$, for the multiple ergodic averages $\frac{1}{N}\sum_{n=1}^N f(T^nx)\cdot g(S^{a_n}x)$, where $T$ and $S$ are commuting measure preserving transformations, and $a_n$ is a random version of the…
We propose a power-law $m$-uniform random hypergraph on $n$ vertexes. In this hypergraph, each vertex is independently assigned a random weight from a power-law distribution with exponent $\alpha\in(0,\infty)$ and the hyperedge…
We study a $U(1)\times U(1)$ system with short-range interactions and mutual $\theta=2\pi/3$ statistics in (2+1) dimensions. We are able to reformulate the model to eliminate the sign problem, and perform a Monte Carlo study. We find a…
We present an analytic proof of the existence of phase transition in the large $N$ limit of certain random noncommutaitve geometries. These geometries can be expressed as ensembles of Dirac operators. When they reduce to single matrix…
We study a class of models of i.i.d.~random environments in general dimensions $d\ge 2$, where each site is equipped randomly with an environment, and a parameter $p$ governs the frequency of certain environments that can act as a barrier.…
We introduce a voting model that is similar to a Keynesian beauty contest and analyze it from a mathematical point of view. There are two types of voters-copycat and independent-and two candidates. Our voting model is a binomial…
The regular tree corresponds to the random regular graph as its local limit. For this reason the famous double phase transition of the contact process on regular tree has been seen to correspond to a phase transition on the large random…