Corpus ID: 209531858

# Asymptotic convergence rate of the longest run in an inflating Bernoulli net.

@article{Ni2019AsymptoticCR,
title={Asymptotic convergence rate of the longest run in an inflating Bernoulli net.},
author={Kai Ni and Shanshan Cao and Xiaoming Huo},
journal={arXiv: Applications},
year={2019}
}
• Published 31 December 2019
• Mathematics, Engineering
• arXiv: Applications
In image detection, one problem is to test whether the set, though mostly consisting of uniformly scattered points, also contains a small fraction of points sampled from some (a priori unknown) curve, for example, a curve with $C^{\alpha}$-norm bounded by $\beta$. One approach is to analyze the data by counting membership in multiscale multianisotropic strips, which involves an algorithm that delves into the length of the path connecting many consecutive "significant" nodes. In this paper, we… Expand

#### References

SHOWING 1-10 OF 68 REFERENCES
Detection of objects in noisy images and site percolation on square lattices
• Mathematics, Computer Science
• ArXiv
• 2011
An algorithm is presented that allows to detect objects of un- known shapes in the presence of random noise and has linear complex- ity and exponential accuracy and is appropriate for real-time systems. Expand
Percolation, 2nd ed., ser
• Grundlehren der mathematischen Wissenschaften,
• 1999
Two moments su ce for Poisson approx-imations: the Chen-Stein method
• Mathematics
• 1989
Convergence to the Poisson distribution, for the number of occurrences of dependent events, can often be established by computing only first and second moments, but not higher ones. This remarkableExpand
Cluster detection in networks using percolation
• Mathematics
• 2013
We consider the task of detecting a salient cluster in a sensor network, that is, an undirected graph with a random variable attached to each node. Motivated by recent research in environmentalExpand
Learning and Design of Principal Curves
• Mathematics, Computer Science
• IEEE Trans. Pattern Anal. Mach. Intell.
• 2000
This work defines principal curves as continuous curves of a given length which minimize the expected squared distance between the curve and points of the space randomly chosen according to a given distribution, making it possible to theoretically analyze principal curve learning from training data and it also leads to a new practical construction. Expand
Principle curves
• Journal of American Statistical Association, vol. 84, no. 406, pp. 502–516, June 1989.
• 1989
Adaptive multiscale detection of filamentary structures embedded in a background of uniform random points
• Mathematics
• 2003
We are given a set of n points that might be uniformly distributed in the unit square [0,1] 2 . We wish to test whether the set, although mostly consisting of uniformly scattered points, alsoExpand
On the length of the longest head run
We evaluate the accuracy of approximation to the distribution of the length of the longest head run in a Markov chain with a discrete state space. An estimate of the accuracy of approximation inExpand
Spatial Scan Statistic
• Computer Science
• Encyclopedia of Social Network Analysis and Mining
• 2014
Flexibly Shaped Spatial Scan Statistic digunakan untuk memetakan kecamatan di Kota Surabaya yang terdeteksi sebagai wilayah kantong balita gizi buruk agar dapat diketahui ke camatan mana yang menjadi prioritas dalam penanganan kasus balita GWNBR. Expand
Detection of an anomalous cluster in a network
• Mathematics
• 2011
We consider the problem of detecting whether or not in a given sensor network, there is a cluster of sensors which exhibit an "unusual behavior." Formally, suppose we are given a set of nodes andExpand