Related papers: Limit Theorems for Fixed Point Biased Pattern Avoi…
We study vectors chosen at random from a compact convex polytope in $\mathbb{R}^n$ given by a finite number of linear constraints. We determine which projections of these random vectors are asymptotically normal as $n\to\infty$. Marginal…
We propose a study of the Adaptive Biasing Force method's robustness under generic (possibly non-conservative) forces. We first ensure the flat histogram property is satisfied in all cases. We then introduce a fixed point problem yielding…
There is a wide literature on change point tests, but the case of variables with infinite variances is essentially unexplored. In this paper we address this problem by studying the asymptotic behavior of trimmed CUSUM statistics. We show…
An infinte word w avoids a pattern p with the involution t if there is no substitution for the variables in p and no involution t such that the resulting word is a factor of w. We investigate the avoidance of patterns with respect to the…
We study probabilities of various rare events for the limiting point process that appears at the random matrix hard edge. We also show a transition from hard edge to bulk behavior. Asymptotic events studied include a central limit theorem…
Networked discrete dynamical systems are often used to model the spread of contagions and decision-making by agents in coordination games. Fixed points of such dynamical systems represent configurations to which the system converges. In the…
We completely classify the asymptotic behavior of the number of alternating sign matrices classically avoiding a single permutation pattern, in the sense of [Johansson and Linusson 2007]. In particular, we give a uniform proof of an…
A broad range of nonlinear processes over networks are governed by threshold dynamics. So far, existing mathematical theory characterizing the behavior of such systems has largely been concerned with the case where the thresholds are…
In statistical problems, a set of parameterized probability distributions is used to estimate the true probability distribution. If Fisher information matrix at the true distribution is singular, then it has been left unknown what we can…
The persistent homology of a stationary point process on ${\bf R}^N$ is studied in this paper. As a generalization of continuum percolation theory, we study higher dimensional topological features of the point process such as loops,…
This paper considers the limiting distribution of $\pi_{\lambda,\theta}$, the stationary distribution of the infinitely-many-alleles diffusion with symmetric overdominance \cite{MR1626158}. In \cite{MR2519357} the large deviation principle…
We study the asymptotic behavior of short cycles of random permutations with cycle weights. More specifically, on a specially constructed metric space whose elements encode all possible cycles, we consider a point process containing all…
We treat the change point problem in ergodic diffusion processes from discrete observations. Tonaki et al. (2020) proposed adaptive tests for detecting changes in the diffusion and drift parameters in ergodic diffusion models. When any…
We consider the detection and localization of change points in the distribution of an offline sequence of observations. Based on a nonparametric framework that uses a similarity graph among observations, we propose new test statistics when…
In multiple change-point problems, different data segments often follow different distributions, for which the changes may occur in the mean, scale or the entire distribution from one segment to another. Without the need to know the number…
We use the recently developed method of weighted dependency graphs to prove central limit theorems for the number of occurrences of any fixed pattern in multiset permutations and in set partitions. This generalizes results for patterns of…
In the on-line nearest-neighbour graph (ONG), each point after the first in a sequence of points in R^d is joined by an edge to its nearest-neighbour amongst those points that precede it in the sequence. We study the large-sample asymptotic…
The asymptotic behavior, as $n\rightarrow \infty $ of the probability of the event that a decomposable critical branching process $\mathbf{Z}(m)=(Z_{1}(m),...,Z_{N}(m)),$ $m=0,1,2,...,$ with $N$ types of particles dies at moment $n$ is…
The problem of change-point estimation is considered under a general framework where the data are generated by unknown stationary ergodic process distributions. In this context, the consistent estimation of the number of change-points is…
We study fixed points of cellular automata with $N$ sites on random sparse graphs. In the large $N$ limit such models are known to exhibit phase transitions, from a ``frozen'' phase, where at most a finite number of sites fluctuate at long…