Search results for "Finite set"
showing 10 items of 101 documents
The 0-Parameter Case
1998
As an introduction to the theory of bifurcations, in this chapter we want to consider individual vector fields, i.e., families of vector fields with a 0-dimensional parameter space. We will present two fundamentals tools: the desingularization and the asymptotic expansion of the return map along a limit periodic set. In the particular case of an individual vector field these techniques give the desired final result: the desingularization theorem says that any algebraically isolated singular point may be reduced to a finite number of elementary singularities by a finite sequence of blow-ups. If X is an analytic vector field on S 2, then the return map of any elementary graphic has an isolate…
Nucleon Form Factors at high q2 within constituent quark models
2000
The nucleon form factors are calculated using a non-relativistic description in terms of constituent quarks. The emphasis is put on the reliability of present numerical methods used to solve the three-body problem in order to correctly reproduce the expected asymptotic behavior of form factors. Nucleon wave functions obtained in the hyperspherical formalism or employing Faddeev equations have been considered. While a q**(-8) behavior is expected at high q for a quark-quark force behaving like 1/r at short distances, it is found that the hypercentral approximation in the hyperspherical formalism (K=0) leads to a q**(-7) behavior. An infinite set of waves is required to get the correct behavi…
DECENTRALIZED SUBSPACE PROJECTION IN LARGE NETWORKS
2018
A great number of applications in wireless sensor networks involve projecting a vector of observations onto a subspace dictated by prior information. Accomplishing such a task in a centralized fashion entails great power consumption, congestion at certain nodes, and suffers from robustness issues. A sensible alternative is to compute such projections in a decentralized fashion. To this end, recent works proposed schemes based on graph filters, which compute projections exactly with a finite number of local exchanges among sensor nodes. However, existing methods to obtain these filters are confined to reduced families of projection matrices or small networks. This paper proposes a method tha…
A primal-dual algorithm for the fermat-weber problem involving mixed gauges
1987
We give a new algorithm for solving the Fermat-Weber location problem involving mixed gauges. This algorithm, which is derived from the partial inverse method developed by J.E. Spingarn, simultaneously generates two sequences globally converging to a primal and a dual solution respectively. In addition, the updating formulae are very simple; a stopping rule can be defined though the method is not dual feasible and the entire set of optimal locations can be obtained from the dual solution by making use of optimality conditions. When polyhedral gauges are used, we show that the algorithm terminates in a finite number of steps, provided that the set of optimal locations has nonepty interior an…
A Neo2 bayesian foundation of the maxmin value for two-person zero-sum games
1994
A joint derivation of utility and value for two-person zero-sum games is obtained using a decision theoretic approach. Acts map states to consequences. The latter are lotteries over prizes, and the set of states is a product of two finite sets (m rows andn columns). Preferences over acts are complete, transitive, continuous, monotonie and certainty-independent (Gilboa and Schmeidler (1989)), and satisfy a new axiom which we introduce. These axioms are shown to characterize preferences such that (i) the induced preferences on consequences are represented by a von Neumann-Morgenstern utility function, and (ii) each act is ranked according to the maxmin value of the correspondingm × n utility …
Immune networks: multitasking capabilities near saturation
2013
Pattern-diluted associative networks were introduced recently as models for the immune system, with nodes representing T-lymphocytes and stored patterns representing signalling protocols between T- and B-lymphocytes. It was shown earlier that in the regime of extreme pattern dilution, a system with $N_T$ T-lymphocytes can manage a number $N_B!=!\order(N_T^\delta)$ of B-lymphocytes simultaneously, with $\delta!<!1$. Here we study this model in the extensive load regime $N_B!=!\alpha N_T$, with also a high degree of pattern dilution, in agreement with immunological findings. We use graph theory and statistical mechanical analysis based on replica methods to show that in the finite-connectivit…
Dynamics of a map with a power-law tail
2008
We analyze a one-dimensional piecewise continuous discrete model proposed originally in studies on population ecology. The map is composed of a linear part and a power-law decreasing piece, and has three parameters. The system presents both regular and chaotic behavior. We study numerically and, in part, analytically different bifurcation structures. Particularly interesting is the description of the abrupt transition order-to-chaos mediated by an attractor made of an infinite number of limit cycles with only a finite number of different periods. It is shown that the power-law piece in the map is at the origin of this type of bifurcation. The system exhibits interior crises and crisis-induc…
Optimal Reporting of Predictions
1989
Abstract Consider a problem in which you and a group of other experts must report your individual predictive distributions for an observable random variable X to some decision maker. Suppose that the report of each expert is assigned a prior weight by the decision maker and that these weights are then updated based on the observed value of X. In this situation you will try to maximize your updated, or posterior, weight by appropriately choosing the distribution that you report, rather than necessarily simply reporting your honest predictive distribution. We study optimal reporting strategies under various conditions regarding your knowledge and beliefs about X and the reports of the other e…
A more efficient second order blind identification method for separation of uncorrelated stationary time series
2016
The classical second order source separation methods use approximate joint diagonalization of autocovariance matrices with several lags to estimate the unmixing matrix. Based on recent asymptotic results, we propose a novel unmixing matrix estimator which selects the best lag set from a finite set of candidate sets specified by the user. The theory is illustrated by a simulation study.
Thermalization of Random Motion in Weakly Confining Potentials
2010
We show that in weakly confining conservative force fields, a subclass of diffusion-type (Smoluchowski) processes, admits a family of "heavy-tailed" non-Gaussian equilibrium probability density functions (pdfs), with none or a finite number of moments. These pdfs, in the standard Gibbs-Boltzmann form, can be also inferred directly from an extremum principle, set for Shannon entropy under a constraint that the mean value of the force potential has been a priori prescribed. That enforces the corresponding Lagrange multiplier to play the role of inverse temperature. Weak confining properties of the potentials are manifested in a thermodynamical peculiarity that thermal equilibria can be approa…