Related papers: Parametricity Features and their Requirements
This paper is devoted to a discussion of specific properties of invariants in the theory of forms.
The problem of identifiability of model parameters for open quantum systems is considered by investigating two-level dephasing systems. We discuss under which conditions full information about the Hamiltonian and dephasing parameters can be…
We consider marginal log-linear models for parameterizing distributions on multidimensional contingency tables. These models generalize ordinary log-linear and multivariate logistic models, besides several others. First, we obtain some…
The concept of robustness of regulatory networks has been closely related to the nature of the interactions among genes, and the capability of pattern maintenance or reproducibility. Defining this robustness property is a challenging task,…
The survey provides an overview of the developing area of parameterized algorithms for graph modification problems. We concentrate on edge modification problems, where the task is to change a small number of adjacencies in a graph in order…
Genetic regulatory networks are defined by their topology and by a multitude of continuously adjustable parameters. Here we present a class of simple models within which the relative importance of topology vs. interaction strengths becomes…
We give an elementary account of the notion of Y-frieze patterns, explain some of their properties, and reveal their connection with Coxeter's frieze patterns.
A simple parametrization for the octupole collective variables is proposed and the symmetries of the wave functions are discussed in terms of the solutions corresponding to the vibrational limit. [PACS: 21.60Ev, 21.60.Fw, 21.10.Re]
We initiate a program of parameterized proof complexity that aims to provide evidence that FPT is different from W[1]. A similar program already exists for the classes W[2] and W[SAT]. We contrast these programs and prove upper and lower…
This paper addresses how to construct features for the problem of image correspondence, in particular, the paper addresses how to construct features so as to maintain the right level of invariance versus discriminability. We show that…
Ergodicity is a fundamental issue for a stochastic process. In this paper, we refine results on ergodicity for a general type of Markov chain to a specific type or the $GI/G/1$-type Markov chain, which has many interesting and important…
In this paper, four parameters Wright function is considered. Certain geometric properties such as starlikeness, convexity, uniform convexity and close-to-convexity are discussed for this function. Further, certain geometric properties of…
Many complex systems satisfy a set of constraints on their degrees of freedom, and at the same time, they are able to work and adapt to different conditions. Here, we describe the emergence of this ability in a simplified model in which the…
We propose a sufficient and necessary separability criterion for pure states in multipartite and high dimensional systems. Its main advantage is operational and computable. The obvious expressions of this criterion can be given out by the…
Given a classification model and a prediction for some input, there are heuristic strategies for ranking features according to their importance in regard to the prediction. One common approach to this task is rooted in propositional logic…
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…
There are several different common definitions of a property in topological dynamics called "topological transitivity," and it is part of the folklore of dynamical systems that under reasonable hypotheses, they are equivalent. Various…
Parametrization of qutrits on the complex projective plane CP^2 = SU(3)/U(2) is given explicitly. A set of constraints that characterize mixed state density matrices is found.
The parameter space of dynamical systems arising in applications is often found to be high-dimensional and difficult to explore. We construct a fast algorithm to numerically analyze "quantitative features" of dynamical systems depending on…
The intuition that a long history is required for the emergence of complexity in natural systems is formalized using the notion of depth. The depth of a system is defined in terms of the number of parallel computational steps needed to…