Search results for "Crete"
showing 10 items of 2495 documents
Lattices and dual lattices in optimal experimental design for Fourier models
1998
Number-theoretic lattices, used in integration theory, are studied from the viewpoint of the design and analysis of experiments. For certain Fourier regression models lattices are optimal as experimental designs because they produce orthogonal information matrices. When the Fourier model is restricted, that is a special subset of the full factorial (cross-spectral) model is used, there is a difficult inversion problem to find generators for an optimal design for the given model. Asymptotic results are derived for certain models as the dimension of the space goes to infinity. These can be thought of as a complexity theory connecting designs and models or as special type of Nyquist sampling t…
On the empirical spectral distribution for certain models related to sample covariance matrices with different correlations
2021
Given [Formula: see text], we study two classes of large random matrices of the form [Formula: see text] where for every [Formula: see text], [Formula: see text] are iid copies of a random variable [Formula: see text], [Formula: see text], [Formula: see text] are two (not necessarily independent) sets of independent random vectors having different covariance matrices and generating well concentrated bilinear forms. We consider two main asymptotic regimes as [Formula: see text]: a standard one, where [Formula: see text], and a slightly modified one, where [Formula: see text] and [Formula: see text] while [Formula: see text] for some [Formula: see text]. Assuming that vectors [Formula: see t…
Genericity of dimension drop on self-affine sets
2017
We prove that generically, for a self-affine set in $\mathbb{R}^d$, removing one of the affine maps which defines the set results in a strict reduction of the Hausdorff dimension. This gives a partial positive answer to a folklore open question.
Quantum Walk Search on Johnson Graphs
2016
The Johnson graph $J(n,k)$ is defined by $n$ symbols, where vertices are $k$-element subsets of the symbols, and vertices are adjacent if they differ in exactly one symbol. In particular, $J(n,1)$ is the complete graph $K_n$, and $J(n,2)$ is the strongly regular triangular graph $T_n$, both of which are known to support fast spatial search by continuous-time quantum walk. In this paper, we prove that $J(n,3)$, which is the $n$-tetrahedral graph, also supports fast search. In the process, we show that a change of basis is needed for degenerate perturbation theory to accurately describe the dynamics. This method can also be applied to general Johnson graphs $J(n,k)$ with fixed $k$.
On almost sure convergence of amarts and martingales without the Radon-Nikodym property
1988
It is shown here that for any Banach spaceE-valued amart (X n) of classB, almost sure convergence off(Xn) tof(X) for eachf in a total subset ofE * implies scalar convergence toX.
Random walk networks
2004
Abstract Random Boolean networks are among the best-known systems used to model genetic networks. They show an on–off dynamics and it is easy to obtain analytical results with them. Unfortunately very few genes are strictly on–off switched. On the other hand, continuous methods are in principle more suitable to capture the real behavior of the genome, but have difficulties when trying to obtain analytical results. In this work, we introduce a new model of random discrete network: random walk networks, where the state of each gene is changed by small discrete variations, being thus a natural bridge between discrete and continuous models.
On the Analysis of a Random Interleaving Walk–Jump Process with Applications to Testing
2011
Abstract Although random walks (RWs) with single-step transitions have been extensively studied for almost a century as seen in Feller (1968), problems involving the analysis of RWs that contain interleaving random steps and random “jumps” are intrinsically hard. In this article, we consider the analysis of one such fascinating RW, where every step is paired with its counterpart random jump. In addition to this RW being conceptually interesting, it has applications in testing of entities (components or personnel), where the entity is never allowed to make more than a prespecified number of consecutive failures. The article contains the analysis of the chain, some fascinating limiting proper…
An Adaptive Parallel Tempering Algorithm
2013
Parallel tempering is a generic Markov chainMonteCarlo samplingmethod which allows good mixing with multimodal target distributions, where conventionalMetropolis- Hastings algorithms often fail. The mixing properties of the sampler depend strongly on the choice of tuning parameters, such as the temperature schedule and the proposal distribution used for local exploration. We propose an adaptive algorithm with fixed number of temperatures which tunes both the temperature schedule and the parameters of the random-walk Metropolis kernel automatically. We prove the convergence of the adaptation and a strong law of large numbers for the algorithm under general conditions. We also prove as a side…
On surrogating 0–1 knapsack constraints
1999
In this note, we present a scheme for tightening 0–1 knapsack constraints based on other knapsack constraints surrogating.
Stochastic labelling of biological images
1998
Many hypotheses made by experimental researchers can be formulated as a stochastic labelling of a given image. Some stochastic labelling methods for random closed sets are proposed in this paper. Molchanov (I. Molchanov, 1984, Theor. Probability and Math. Statist.29, 113–119) provided the probabilistic background for this problem. However, there is a lack of specific labelling models. Ayala and Simo (G. Ayala and A. Simo, 1995, Advances in Applied Probability27, 293–305) proposed a method in which, given the whole set of connected components, every component is classified in a certain phase or category in a completely random way. Alternative methods are necessary in case the random labellin…