id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
math/0509325 | On $Z_{2^k}$-Dual Binary Codes | math.CO cs.IT math.IT | A new generalization of the Gray map is introduced. The new generalization
$\Phi: Z_{2^k}^n \to Z_{2}^{2^{k-1}n}$ is connected with the known generalized
Gray map $\phi$ in the following way: if we take two dual linear
$Z_{2^k}$-codes and construct binary codes from them using the generalizations
$\phi$ and $\Phi$ of... |
math/0509358 | On decomposability of 4-ary distance 2 MDS codes, double-codes, and
n-quasigroups of order 4 | math.CO cs.IT math.IT | A subset $S$ of $\{0,1,...,2t-1\}^n$ is called a $t$-fold MDS code if every
line in each of $n$ base directions contains exactly $t$ elements of $S$. The
adjacency graph of a $t$-fold MDS code is not connected if and only if the
characteristic function of the code is the repetition-free sum of the
characteristic func... |
math/0509575 | Evolutionary Trees and the Ising Model on the Bethe Lattice: a Proof of
Steel's Conjecture | math.PR cs.CE cs.DS math.CA math.CO math.ST q-bio.PE stat.TH | A major task of evolutionary biology is the reconstruction of phylogenetic
trees from molecular data. The evolutionary model is given by a Markov chain on
a tree. Given samples from the leaves of the Markov chain, the goal is to
reconstruct the leaf-labelled tree.
It is well known that in order to reconstruct a tre... |
math/0509620 | On diameter perfect constant-weight ternary codes | math.CO cs.IT math.IT | From cosets of binary Hamming codes we construct diameter perfect
constant-weight ternary codes with weight $n-1$ (where $n$ is the code length)
and distances 3 and 5. The class of distance 5 codes has parameters unknown
before. Keywords: constant-weight codes, ternary codes, perfect codes, diameter
perfect codes, pe... |
math/0510276 | An algorithmic and a geometric characterization of Coarsening At Random | math.ST cs.AI stat.ME stat.TH | We show that the class of conditional distributions satisfying the coarsening
at Random (CAR) property for discrete data has a simple and robust algorithmic
description based on randomized uniform multicovers: combinatorial objects
generalizing the notion of partition of a set. However, the complexity of a
given CAR ... |
math/0510521 | On surrogate loss functions and $f$-divergences | math.ST cs.IT math.IT stat.TH | The goal of binary classification is to estimate a discriminant function
$\gamma$ from observations of covariate vectors and corresponding binary
labels. We consider an elaboration of this problem in which the covariates are
not available directly but are transformed by a dimensionality-reducing
quantizer $Q$. We pre... |
math/0512263 | Metric and probabilistic information associated with Fredholm integral
equations of the first kind | math.CA cs.IT math.IT | The problem of evaluating the information associated with Fredholm integral
equations of the first kind, when the integral operator is self-adjoint and
compact, is considered here. The data function is assumed to be perturbed
gently by an additive noise so that it still belongs to the range of the
operator. First we ... |
math/0602070 | The Matrix-Forest Theorem and Measuring Relations in Small Social Groups | math.CO cs.IR math.AG | We propose a family of graph structural indices related to the Matrix-forest
theorem. The properties of the basic index that expresses the mutual
connectivity of two vertices are studied in detail. The derivative indices that
measure "dissociation," "solitariness," and "provinciality" of vertices are
also considered.... |
math/0602171 | Preference fusion when the number of alternatives exceeds two: indirect
scoring procedures | math.OC cs.MA math.CO | We consider the problem of aggregation of incomplete preferences represented
by arbitrary binary relations or incomplete paired comparison matrices. For a
number of indirect scoring procedures we examine whether or not they satisfy
the axiom of self-consistent monotonicity. The class of {\em win-loss combining
scorin... |
math/0602505 | MDL Convergence Speed for Bernoulli Sequences | math.ST cs.IT cs.LG math.IT math.PR stat.TH | The Minimum Description Length principle for online sequence
estimation/prediction in a proper learning setup is studied. If the underlying
model class is discrete, then the total expected square loss is a particularly
interesting performance measure: (a) this quantity is finitely bounded,
implying convergence with p... |
math/0602522 | Characterizations of scoring methods for preference aggregation | math.OC cs.MA math.FA | The paper surveys more than forty characterizations of scoring methods for
preference aggregation and contains one new result. A general scoring operator
is {\it self-consistent} if alternative $i$ is assigned a greater score than
$j$ whenever $i$ gets no worse (better) results of comparisons and its
`opponents' are ... |
math/0602552 | From Incomplete Preferences to Ranking via Optimization | math.OC cs.MA math.CO | We consider methods for aggregating preferences that are based on the
resolution of discrete optimization problems. The preferences are represented
by arbitrary binary relations (possibly weighted) or incomplete paired
comparison matrices. This incomplete case remains practically unexplored so
far. We examine the pro... |
math/0603155 | Vers une commande multivariable sans mod\`ele | math.OC cs.CE cs.RO physics.class-ph | A control strategy without any precise mathematical model is derived for
linear or nonlinear systems which are assumed to be finite-dimensional. Two
convincing numerical simulations are provided.
|
math/0604233 | Generalization error bounds in semi-supervised classification under the
cluster assumption | math.ST cs.LG stat.TH | We consider semi-supervised classification when part of the available data is
unlabeled. These unlabeled data can be useful for the classification problem
when we make an assumption relating the behavior of the regression function to
that of the marginal distribution. Seeger (2000) proposed the well-known
"cluster as... |
math/0605498 | Cross-Entropic Learning of a Machine for the Decision in a Partially
Observable Universe | math.OC cs.AI cs.LG cs.NE cs.RO math.ST stat.TH | Revision of the paper previously entitled "Learning a Machine for the
Decision in a Partially Observable Markov Universe" In this paper, we are
interested in optimal decisions in a partially observable universe. Our
approach is to directly approximate an optimal strategic tree depending on the
observation. This appro... |
math/0605740 | Sharp thresholds for high-dimensional and noisy recovery of sparsity | math.ST cs.IT math.IT stat.TH | The problem of consistently estimating the sparsity pattern of a vector
$\betastar \in \real^\mdim$ based on observations contaminated by noise arises
in various contexts, including subset selection in regression, structure
estimation in graphical models, sparse approximation, and signal denoising. We
analyze the beh... |
math/0606315 | Bayesian Regression of Piecewise Constant Functions | math.ST cs.LG math.PR stat.TH | We derive an exact and efficient Bayesian regression algorithm for piecewise
constant functions of unknown segment number, boundary location, and levels. It
works for any noise and segment level prior, e.g. Cauchy which can handle
outliers. We derive simple but good estimates for the in-segment variance. We
also prop... |
math/0606643 | Entropy And Vision | math.PR cs.CV cs.DB cs.DM cs.LG math.CO | In vector quantization the number of vectors used to construct the codebook
is always an undefined problem, there is always a compromise between the number
of vectors and the quantity of information lost during the compression. In this
text we present a minimum of Entropy principle that gives solution to this
comprom... |
math/0606734 | Codes in spherical caps | math.MG cs.IT math.IT | We consider bounds on codes in spherical caps and related problems in
geometry and coding theory. An extension of the Delsarte method is presented
that relates upper bounds on the size of spherical codes to upper bounds on
codes in caps. Several new upper bounds on codes in caps are derived.
Applications of these bou... |
math/0607243 | An active curve approach for tomographic reconstruction of binary
radially symmetric objects | math.OC cs.CV | This paper deals with a method of tomographic reconstruction of radially
symmetric objects from a single radiograph, in order to study the behavior of
shocked material. The usual tomographic reconstruction algorithms such as
generalized inverse or filtered back-projection cannot be applied here because
data are very ... |
math/0607507 | In-Degree and PageRank of Web pages: Why do they follow similar power
laws? | math.PR cs.IR | The PageRank is a popularity measure designed by Google to rank Web pages.
Experiments confirm that the PageRank obeys a `power law' with the same
exponent as the In-Degree. This paper presents a novel mathematical model that
explains this phenomenon. The relation between the PageRank and In-Degree is
modelled throug... |
math/0607648 | Singular Values and Eigenvalues of Tensors: A Variational Approach | math.SP cs.IR cs.NA math.NA math.OC | We propose a theory of eigenvalues, eigenvectors, singular values, and
singular vectors for tensors based on a constrained variational approach much
like the Rayleigh quotient for symmetric matrix eigenvalues. These notions are
particularly useful in generalizing certain areas where the spectral theory of
matrices ha... |
math/0608522 | Graph Laplacians and their convergence on random neighborhood graphs | math.ST cs.LG stat.TH | Given a sample from a probability measure with support on a submanifold in
Euclidean space one can construct a neighborhood graph which can be seen as an
approximation of the submanifold. The graph Laplacian of such a graph is used
in several machine learning methods like semi-supervised learning,
dimensionality redu... |
math/0608556 | On optimal quantization rules for some problems in sequential
decentralized detection | math.ST cs.IT math.IT stat.TH | We consider the design of systems for sequential decentralized detection, a
problem that entails several interdependent choices: the choice of a stopping
rule (specifying the sample size), a global decision function (a choice between
two competing hypotheses), and a set of quantization rules (the local decisions
on t... |
math/0608571 | Intensional Models for the Theory of Types | math.LO cs.AI | In this paper we define intensional models for the classical theory of types,
thus arriving at an intensional type logic ITL. Intensional models generalize
Henkin's general models and have a natural definition. As a class they do not
validate the axiom of Extensionality. We give a cut-free sequent calculus for
type t... |
math/0608713 | Occam's hammer: a link between randomized learning and multiple testing
FDR control | math.ST cs.LG stat.TH | We establish a generic theoretical tool to construct probabilistic bounds for
algorithms where the output is a subset of objects from an initial pool of
candidates (or more generally, a probability distribution on said pool). This
general device, dubbed "Occam's hammer'', acts as a meta layer when a
probabilistic bou... |
math/0609461 | Cross-Entropy method: convergence issues for extended implementation | math.OC cs.LG cs.NE math.ST stat.TH | The cross-entropy method (CE) developed by R. Rubinstein is an elegant
practical principle for simulating rare events. The method approximates the
probability of the rare event by means of a family of probabilistic models. The
method has been extended to optimization, by considering an optimal event as a
rare event. ... |
math/0609562 | On quadratic residue codes and hyperelliptic curves | math.CO cs.IT math.AG math.IT math.NT | A long standing problem has been to develop "good" binary linear codes to be
used for error-correction. This paper investigates in some detail an attack on
this problem using a connection between quadratic residue codes and
hyperelliptic curves. One question which coding theory is used to attack is:
Does there exist ... |
math/0610184 | Adaptive Poisson disorder problem | math.PR cs.IT math.IT math.ST stat.TH | We study the quickest detection problem of a sudden change in the arrival
rate of a Poisson process from a known value to an unknown and unobservable
value at an unknown and unobservable disorder time. Our objective is to design
an alarm time which is adapted to the history of the arrival process and
detects the diso... |
math/0611422 | Cartes auto-organis\'{e}es pour l'analyse exploratoire de donn\'{e}es et
la visualisation | math.ST cs.NE nlin.AO stat.TH | This paper shows how to use the Kohonen algorithm to represent
multidimensional data, by exploiting the self-organizing property. It is
possible to get such maps as well for quantitative variables as for qualitative
ones, or for a mixing of both. The contents of the paper come from various
works by SAMOS-MATISSE memb... |
math/0611433 | Working times in atypical forms of employment: the special case of
part-time work | math.ST cs.NE stat.TH | In the present article, we attempt to devise a typology of forms of part-time
employment by applying a widely used neuronal methodology called Kohonen maps.
Starting out with data that we describe using category-specific variables, we
show how it is possible to represent observations and the modalities of the
variabl... |
math/0611937 | Remarks on Inheritance Systems | math.LO cs.AI | We try a conceptual analysis of inheritance diagrams, first in abstract
terms, and then compare to "normality" and the "small/big sets" of preferential
and related reasoning. The main ideas are about nodes as truth values and
information sources, truth comparison by paths, accessibility or relevance of
information by... |
math/0612046 | On the Submodularity of Influence in Social Networks | math.PR cs.GT cs.SI | We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the
spread of influence in social networks. A social network can be represented by
a directed graph where the nodes are individuals and the edges indicate a form
of social relationship. A simple way to model the diffusion of ideas,
innovative b... |
math/0612682 | Convergence Speed in Distributed Consensus and Control | math.OC cs.SY | We study the convergence speed of distributed iterative algorithms for the
consensus and averaging problems, with emphasis on the latter. We first
consider the case of a fixed communication topology. We show that a simple
adaptation of a consensus algorithm leads to an averaging algorithm. We prove
lower bounds on th... |
math/0701131 | Compressed Sensing and Redundant Dictionaries | math.PR cs.IT math.IT | This article extends the concept of compressed sensing to signals that are
not sparse in an orthonormal basis but rather in a redundant dictionary. It is
shown that a matrix, which is a composition of a random matrix of certain type
and a deterministic dictionary, has small restricted isometry constants. Thus,
signal... |
math/0701142 | On the use of self-organizing maps to accelerate vector quantization | math.ST cs.NE stat.TH | Self-organizing maps (SOM) are widely used for their topology preservation
property: neighboring input vectors are quantified (or classified) either on
the same location or on neighbor ones on a predefined grid. SOM are also widely
used for their more classical vector quantization property. We show in this
paper that... |
math/0701144 | Statistical tools to assess the reliability of self-organizing maps | math.ST cs.NE stat.TH | Results of neural network learning are always subject to some variability,
due to the sensitivity to initial conditions, to convergence to local minima,
and, sometimes more dramatically, to sampling variability. This paper presents
a set of tools designed to assess the reliability of the results of
Self-Organizing Ma... |
math/0701145 | Bootstrap for neural model selection | math.ST cs.NE stat.TH | Bootstrap techniques (also called resampling computation techniques) have
introduced new advances in modeling and model evaluation. Using resampling
methods to construct a series of new samples which are based on the original
data set, allows to estimate the stability of the parameters. Properties such
as convergence... |
math/0701152 | Missing values : processing with the Kohonen algorithm | math.ST cs.NE stat.TH | The processing of data which contain missing values is a complicated and
always awkward problem, when the data come from real-world contexts. In
applications, we are very often in front of observations for which all the
values are not available, and this can occur for many reasons: typing errors,
fields left unanswer... |
math/0701261 | Tracking Stopping Times Through Noisy Observations | math.ST cs.IT math.IT stat.TH | A novel quickest detection setting is proposed which is a generalization of
the well-known Bayesian change-point detection model. Suppose
\{(X_i,Y_i)\}_{i\geq 1} is a sequence of pairs of random variables, and that S
is a stopping time with respect to \{X_i\}_{i\geq 1}. The problem is to find a
stopping time T with r... |
math/0701419 | Strategies for prediction under imperfect monitoring | math.ST cs.LG stat.TH | We propose simple randomized strategies for sequential prediction under
imperfect monitoring, that is, when the forecaster does not have access to the
past outcomes but rather to a feedback signal. The proposed strategies are
consistent in the sense that they achieve, asymptotically, the best possible
average reward.... |
math/0701791 | Linear versus Non-linear Acquisition of Step-Functions | math.CA cs.CV | We address in this paper the following two closely related problems:
1. How to represent functions with singularities (up to a prescribed
accuracy) in a compact way?
2. How to reconstruct such functions from a small number of measurements?
The stress is on a comparison of linear and non-linear approaches. As a ... |
math/0702116 | A Direct Matrix Method for Computing Analytical Jacobians of Discretized
Nonlinear Integro-differential Equations | math.NA cs.CE | In this pedagogical article, we present a simple direct matrix method for
analytically computing the Jacobian of nonlinear algebraic equations that arise
from the discretization of nonlinear integro-differential equations. The method
is based on a formulation of the discretized equations in vector form using
only mat... |
math/0702301 | Information-theoretic limits on sparsity recovery in the
high-dimensional and noisy setting | math.ST cs.IT math.IT stat.TH | The problem of recovering the sparsity pattern of a fixed but unknown vector
$\beta^* \in \real^p based on a set of $n$ noisy observations arises in a
variety of settings, including subset selection in regression, graphical model
selection, signal denoising, compressive sensing, and constructive
approximation. Of int... |
math/0702804 | The Loss Rank Principle for Model Selection | math.ST cs.LG stat.ME stat.ML stat.TH | We introduce a new principle for model selection in regression and
classification. Many regression models are controlled by some smoothness or
flexibility or complexity parameter c, e.g. the number of neighbors to be
averaged over in k nearest neighbor (kNN) regression or the polynomial degree
in regression with poly... |
math/0702866 | Consumer Profile Identification and Allocation | math.ST cs.NE stat.TH | We propose an easy-to-use methodology to allocate one of the groups which
have been previously built from a complete learning data base, to new
individuals. The learning data base contains continuous and categorical
variables for each individual. The groups (clusters) are built by using only
the continuous variables ... |
math/0703019 | Reading policies for joins: An asymptotic analysis | math.PR cs.DB | Suppose that $m_n$ observations are made from the distribution $\mathbf {R}$
and $n-m_n$ from the distribution $\mathbf {S}$. Associate with each pair, $x$
from $\mathbf {R}$ and $y$ from $\mathbf {S}$, a nonnegative score $\phi(x,y)$.
An optimal reading policy is one that yields a sequence $m_n$ that maximizes
$\mat... |
math/9310227 | A linear construction for certain Kerdock and Preparata codes | math.CO cs.IT math.IT | The Nordstrom-Robinson, Kerdock, and (slightly modified) Pre\- parata codes
are shown to be linear over $\ZZ_4$, the integers $\bmod~4$. The Kerdock and
Preparata codes are duals over $\ZZ_4$, and the Nordstrom-Robinson code is
self-dual. All these codes are just extended cyclic codes over $\ZZ_4$. This
provides a si... |
math/9508219 | New results on binary linear codes | math.CO cs.IT math.IT | This research announcement describes in very rough terms methods and a
computer language under development, which can be used to prove the
nonexistence of binary linear codes. Over a hundred new results have been
obtained by the author. For example, there is no [29,11,10] code. The proof of
this is roughly outlined.
|
math/9801152 | On the classifiability of cellular automata | math.LO cs.NE | Based on computer simulations Wolfram presented in several papers conjectured
classifications of cellular automata into 4 types. He distinguishes the 4
classes of cellular automata by the evolution of the pattern generated by
applying a cellular automaton to a finite input. Wolfram's qualitative
classification is bas... |
math/9905046 | Duality between Multidimensional Convolutional Codes and Systems | math.OC cs.IT math.AC math.AG math.IT | Multidimensional convolutional codes generalize (one dimensional)
convolutional codes and they correspond under a natural duality to
multidimensional systems widely studied in the systems literature.
|
math/9905165 | Perception games, the image understanding and interpretational geometry | math.HO cs.CV | The interactive game theoretical approach to the description of perception
processes is proposed. The subject is treated formally in terms of a new class
of the verbalizable interactive games which are called the perception games. An
application of the previously elaborated formalism of dialogues and
verbalizable int... |
math/9909163 | Coding Theory and Uniform Distributions | math.CO cs.IT math.IT math.NT | In the present paper we introduce and study finite point subsets of a special
kind, called optimum distributions, in the n-dimensional unit cube. Such
distributions are closely related with known (delta,s,n)-nets of low
discrepancy. It turns out that optimum distributions have a rich combinatorial
structure. Namely, ... |
math/9910062 | Efficient sphere-covering and converse measure concentration via
generalized coding theorems | math.PR cs.IT math.FA math.IT | Suppose A is a finite set equipped with a probability measure P and let M be
a ``mass'' function on A. We give a probabilistic characterization of the most
efficient way in which A^n can be almost-covered using spheres of a fixed
radius. An almost-covering is a subset C_n of A^n, such that the union of the
spheres ce... |
math/9910149 | Rational points, genus and asymptotic behaviour in reduced algebraic
curves over finite fields | math.AG cs.IT math.IT math.NT | The number A(q) shows the asymptotic behaviour of the quotient of the number
of rational points over the genus of non-singular absolutely irreducible curves
over a finite field Fq. Research on bounds for A(q) is closely connected with
the so-called asymptotic main problem in Coding Theory. In this paper, we study
som... |
math/9910151 | Decoding Algebraic Geometry codes by a key equation | math.AG cs.IT math.IT math.NA | A new effective decoding algorithm is presented for arbitrary
algebraic-geometric codes on the basis of solving a generalized key equation
with the majority coset scheme of Duursma. It is an improvement of Ehrhard's
algorithm, since the method corrects up to the half of the Goppa distance with
complexity order O(n**2... |
math/9910155 | Computing Weierstrass semigroups and the Feng-Rao distance from singular
plane models | math.AG cs.IT math.IT math.NA | We present an algorithm to compute the Weierstrass semigroup at a point P
together with functions for each value in the semigroup, provided P is the only
branch at infinity of a singular plane model for the curve. As a byproduct, the
method also provides us with a basis for the spaces L(mP) and the computation
of the... |
math/9910175 | Polynomial method in coding and information theory | math.CO cs.IT math.IT | Polynomial, or Delsarte's, method in coding theory accounts for a variety of
structural results on, and bounds on the size of, extremal configurations
(codes and designs) in various metric spaces. In recent works of the authors
the applicability of the method was extended to cover a wider range of problems
in coding ... |
math/9911025 | On the parameters of Algebraic Geometry codes related to Arf semigroups | math.NT cs.IT math.AG math.IT | In this paper we compute the order (or Feng-Rao) bound on the minimum
distance of one-point algebraic geometry codes, when the Weierstrass semigroup
at the point Q is an Arf semigroup. The results developed to that purpose also
provide the dimension of the improved geometric Goppa codes related to those.
|
nlin/0001057 | Numerical Replication of Computer Simulations: Some Pitfalls and How To
Avoid Them | nlin.AO cs.NE | A computer simulation, such as a genetic algorithm, that uses IEEE standard
floating-point arithmetic may not produce exactly the same results in two
different runs, even if it is rerun on the same computer with the same input
and random number seeds. Researchers should not simply assume that the results
from one run... |
nlin/0002040 | The dynamics of iterated transportation simulations | nlin.AO cs.CE | Iterating between a router and a traffic micro-simulation is an increasibly
accepted method for doing traffic assignment. This paper, after pointing out
that the analytical theory of simulation-based assignment to-date is
insufficient for some practical cases, presents results of simulation studies
from a real world ... |
nlin/0006025 | Information Bottlenecks, Causal States, and Statistical Relevance Bases:
How to Represent Relevant Information in Memoryless Transduction | nlin.AO cond-mat.dis-nn cs.LG physics.data-an | Discovering relevant, but possibly hidden, variables is a key step in
constructing useful and predictive theories about the natural world. This brief
note explains the connections between three approaches to this problem: the
recently introduced information-bottleneck method, the computational mechanics
approach to i... |
nlin/0109019 | Olfactory search at high Reynolds number | nlin.CD cs.RO nlin.AO physics.bio-ph | Locating the source of odor in a turbulent environment - a common behavior
for living organisms - is non-trivial because of the random nature of mixing.
Here we analyze the statistical physics aspects of the problem and propose an
efficient strategy for olfactory search which can work in turbulent plumes. The
algorit... |
nlin/0202038 | On model selection and the disability of neural networks to decompose
tasks | nlin.AO cond-mat.dis-nn cs.NE | A neural network with fixed topology can be regarded as a parametrization of
functions, which decides on the correlations between functional variations when
parameters are adapted. We propose an analysis, based on a differential
geometry point of view, that allows to calculate these correlations. In
practise, this de... |
nlin/0202039 | A neural model for multi-expert architectures | nlin.AO cond-mat.dis-nn cs.NE | We present a generalization of conventional artificial neural networks that
allows for a functional equivalence to multi-expert systems. The new model
provides an architectural freedom going beyond existing multi-expert models and
an integrative formalism to compare and combine various techniques of learning.
(We con... |
nlin/0204038 | Neutrality: A Necessity for Self-Adaptation | nlin.AO cs.NE q-bio | Self-adaptation is used in all main paradigms of evolutionary computation to
increase efficiency. We claim that the basis of self-adaptation is the use of
neutrality. In the absence of external control neutrality allows a variation of
the search distribution without the risk of fitness loss.
|
nlin/0210041 | Simple Model for the Dynamics of Correlations in the Evolution of
Economic Entities Under Varying Economic Conditions | nlin.AO cond-mat.stat-mech cs.CE physics.soc-ph | From some observations on economic behaviors, in particular changing economic
conditions with time and space, we develop a very simple model for the
evolution of economic entities within a geographical type of framework. We
raise a few questions and attempt to investigate whether some of them can be
tackled by our mo... |
nlin/0211010 | Evolution and anti-evolution in a minimal stock market model | nlin.AO cond-mat.stat-mech cs.MA q-fin.TR | We present a novel microscopic stock market model consisting of a large
number of random agents modeling traders in a market. Each agent is
characterized by a set of parameters that serve to make iterated predictions of
two successive returns. The future price is determined according to the offer
and the demand of al... |
nlin/0211013 | A Spin Glass Model of Human Logic Systems | nlin.AO cond-mat.dis-nn cs.MA | In this paper, we discuss different models for human logic systems and
describe a game with nature. G\"odel`s incompleteness theorem is taken into
account to construct a model of logical networks based on axioms obtained by
symmetry breaking. These classical logic networks are then coupled using rules
that depend on ... |
nlin/0211024 | Exploring the cooperative regimes in a model of agents without memory or
"tags": indirect reciprocity vs. selfish incentives | nlin.AO cond-mat cs.CE hep-lat nlin.CG physics.soc-ph | The self-organization in cooperative regimes in a simple mean-field version
of a model based on "selfish" agents which play the Prisoner's Dilemma (PD)
game is studied. The agents have no memory and use strategies not based on
direct reciprocity nor 'tags'. Two variables are assigned to each agent $i$ at
time $t$, me... |
nlin/0212030 | The structure of evolutionary exploration: On crossover, buildings
blocks and Estimation-Of-Distribution Algorithms | nlin.AO cs.NE q-bio | The notion of building blocks can be related to the structure of the
offspring probability distribution: loci of which variability is strongly
correlated constitute a building block. We call this correlated exploration.
With this background we analyze the structure of the offspring probability
distribution, or explor... |
nlin/0304006 | Determining possible avenues of approach using ANTS | nlin.AO cs.AI | Threat assessment is an important part of level 3 data fusion. Here we study
a subproblem of this, worst-case risk assessment. Inspired by agent-based
models used for simulation of trail formation for urban planning, we use ant
colony optimization (ANTS) to determine possible avenues of approach for the
enemy, given ... |
nlin/0306055 | A Model for Prejudiced Learning in Noisy Environments | nlin.AO cs.LG | Based on the heuristics that maintaining presumptions can be beneficial in
uncertain environments, we propose a set of basic axioms for learning systems
to incorporate the concept of prejudice. The simplest, memoryless model of a
deterministic learning rule obeying the axioms is constructed, and shown to be
equivalen... |
nlin/0309039 | Self-organizing Traffic Control: First Results | nlin.AO cs.MA | We developed a virtual laboratory for traffic control where agents use
different strategies in order to self-organize on the road. We present our
first results where we compare the performance and behaviour promoted by
environmental constrains and five different simple strategies: three inspired
in flocking behaviour... |
nlin/0312056 | Shannon information, LMC complexity and Renyi entropies: a
straightforward approach | nlin.AO cond-mat.stat-mech cs.IT math.IT nlin.CD physics.comp-ph q-bio.QM | The LMC complexity, an indicator of complexity based on a probabilistic
description, is revisited. A straightforward approach allows us to establish
the time evolution of this indicator in a near-equilibrium situation and gives
us a new insight for interpreting the LMC complexity for a general non
equilibrium system.... |
nlin/0402046 | Spontaneous Emergence of Complex Optimal Networks through Evolutionary
Adaptation | nlin.AO cond-mat.stat-mech cs.MA nlin.CG q-bio.QM | An important feature of many complex systems, both natural and artificial, is
the structure and organization of their interaction networks with interesting
properties. Here we present a theory of self-organization by evolutionary
adaptation in which we show how the structure and organization of a network is
related t... |
nlin/0404004 | Protocol Requirements for Self-organizing Artifacts: Towards an Ambient
Intelligence | nlin.AO cs.AI | We discuss which properties common-use artifacts should have to collaborate
without human intervention. We conceive how devices, such as mobile phones,
PDAs, and home appliances, could be seamlessly integrated to provide an
"ambient intelligence" that responds to the user's desires without requiring
explicit programm... |
nlin/0404032 | Metrics for more than two points at once | nlin.AO cond-mat.other cs.LG math.GM | The conventional definition of a topological metric over a space specifies
properties that must be obeyed by any measure of "how separated" two points in
that space are. Here it is shown how to extend that definition, and in
particular the triangle inequality, to concern arbitrary numbers of points.
Such a measure of... |
nlin/0407032 | Application of Artificial Neural Network in Jitter Analysis of
Dispersion-Managed Communication System | nlin.PS cs.AI cs.NA | Artificial Neural Network (ANN) is used as numerical methode in solving
modified Nonlinear Schroedinger (NLS) equation with Dispersion Managed System
(DMS) for jitter analysis. We take the optical axis z and the time t as input,
and then some relevant values such as the change of position and the center
frequency of ... |
nlin/0408007 | Entropy Maximization as a Holistic Design Principle for Complex Optimal
Networks and the Emergence of Power Laws | nlin.AO cond-mat.stat-mech cs.IT math.IT q-bio.QM | We present a general holistic theory for the organization of complex
networks, both human-engineered and naturally-evolved. Introducing concepts of
value of interactions and satisfaction as generic network performance measures,
we show that the underlying organizing principle is to meet an overall
performance target ... |
nlin/0408039 | Stability and Diversity in Collective Adaptation | nlin.AO cs.LG math.DS nlin.CD stat.ML | We derive a class of macroscopic differential equations that describe
collective adaptation, starting from a discrete-time stochastic microscopic
model. The behavior of each agent is a dynamic balance between adaptation that
locally achieves the best action and memory loss that leads to randomized
behavior. We show t... |
nlin/0408040 | Notes on information geometry and evolutionary processes | nlin.AO cs.NE | In order to analyze and extract different structural properties of
distributions, one can introduce different coordinate systems over the manifold
of distributions. In Evolutionary Computation, the Walsh bases and the Building
Block Bases are often used to describe populations, which simplifies the
analysis of evolut... |
nlin/0409013 | Epistemic communities: description and hierarchic categorization | nlin.AO cs.IR | Social scientists have shown an increasing interest in understanding the
structure of knowledge communities, and particularly the organization of
"epistemic communities", that is groups of agents sharing common knowledge
concerns. However, most existing approaches are based only on either social
relationships or sema... |
nlin/0411063 | Detecting synchronization in spatially extended discrete systems by
complexity measurements | nlin.CG cond-mat.dis-nn cs.MA math.DS nlin.PS q-bio.QM | The synchronization of two stochastically coupled one-dimensional cellular
automata (CA) is analyzed. It is shown that the transition to synchronization
is characterized by a dramatic increase of the statistical complexity of the
patterns generated by the difference automaton. This singular behavior is
verified to be... |
nlin/0411066 | Self-Organizing Traffic Lights | nlin.AO cond-mat.stat-mech cs.AI cs.MA | Steering traffic in cities is a very complex task, since improving efficiency
involves the coordination of many actors. Traditional approaches attempt to
optimize traffic lights for a particular density and configuration of traffic.
The disadvantage of this lies in the fact that traffic densities and
configurations c... |
nlin/0505043 | A network analysis of committees in the United States House of
Representatives | nlin.AO cs.MA math.ST physics.data-an physics.soc-ph stat.TH | Network theory provides a powerful tool for the representation and analysis
of complex systems of interacting agents. Here we investigate the United States
House of Representatives network of committees and subcommittees, with
committees connected according to ``interlocks'' or common membership. Analysis
of this net... |
nlin/0506061 | Transmitting a signal by amplitude modulation in a chaotic network | nlin.CD cond-mat.stat-mech cs.NE | We discuss the ability of a network with non linear relays and chaotic
dynamics to transmit signals, on the basis of a linear response theory
developed by Ruelle \cite{Ruelle} for dissipative systems. We show in
particular how the dynamics interfere with the graph topology to produce an
effective transmission network... |
nlin/0508006 | Metamimetic Games : Modeling Metadynamics in Social Cognition | nlin.AO cs.MA nlin.CG | Imitation is fundamental in the understanding of social system dynamics. But
the diversity of imitation rules employed by modelers proves that the modeling
of mimetic processes cannot avoid the traditional problem of endogenization of
all the choices, including the one of the mimetic rules. Starting from the
remark t... |
nlin/0509007 | Lattices for Dynamic, Hierarchic & Overlapping Categorization: the Case
of Epistemic Communities | nlin.AO cs.AI cs.DL cs.IR | We present a method for hierarchic categorization and taxonomy evolution
description. We focus on the structure of epistemic communities (ECs), or
groups of agents sharing common knowledge concerns. Introducing a formal
framework based on Galois lattices, we categorize ECs in an automated and
hierarchically structure... |
nlin/0511015 | Combinatorial Approach to Object Analysis | nlin.AO cs.LG | We present a perceptional mathematical model for image and signal analysis. A
resemblance measure is defined, and submitted to an innovating combinatorial
optimization algorithm. Numerical Simulations are also presented
|
nlin/0512048 | Modeling Endogenous Social Networks: the Example of Emergence and
Stability of Cooperation without Refusal | nlin.AO cond-mat.other cs.GT cs.MA cs.OH q-bio.OT q-bio.PE | Aggregated phenomena in social sciences and economics are highly dependent on
the way individuals interact. To help understanding the interplay between
socio-economic activities and underlying social networks, this paper studies a
sequential prisoner's dilemma with binary choice. It proposes an analytical and
computa... |
nlin/0605029 | Three Logistic Models for the Ecological and Economic Interactions:
Symbiosis, Predator-Prey and Competition | nlin.AO cs.MA math.DS | If one isolated species (corporation) is supposed to evolve following the
logistic mapping, then we are tempted to think that the dynamics of two species
(corporations) can be expressed by a coupled system of two discrete logistic
equations. As three basic relationships between two species are present in
Nature, name... |
nlin/0609033 | Fame Emerges as a Result of Small Memory | nlin.AO cs.CY cs.MA physics.soc-ph | A dynamic memory model is proposed in which an agent ``learns'' a new agent
by means of recommendation. The agents can also ``remember'' and ``forget''.
The memory size is decreased while the population size is kept constant.
``Fame'' emerged as a few agents become very well known in expense of the
majority being com... |
nlin/0609038 | From Neuron to Neural Networks dynamics | nlin.AO cond-mat.dis-nn cs.NE | This paper presents an overview of some techniques and concepts coming from
dynamical system theory and used for the analysis of dynamical neural networks
models. In a first section, we describe the dynamics of the neuron, starting
from the Hodgkin-Huxley description, which is somehow the canonical description
for th... |
nlin/0610040 | Self-organizing traffic lights: A realistic simulation | nlin.AO cond-mat.stat-mech cs.AI physics.comp-ph physics.soc-ph | We have previously shown in an abstract simulation (Gershenson, 2005) that
self-organizing traffic lights can improve greatly traffic flow for any
density. In this paper, we extend these results to a realistic setting,
implementing self-organizing traffic lights in an advanced traffic simulator
using real data from a... |
nlin/0611044 | Why the Maxwellian Distribution is the Attractive Fixed Point of the
Boltzmann Equation | nlin.CD cond-mat.stat-mech cs.MA math.ST physics.class-ph stat.TH | The origin of the Boltzmann factor is revisited. An alternative derivation
from the microcanonical picture is given. The Maxwellian distribution in a
mono-dimensional ideal gas is obtained by following this insight. Other
possible applications, as for instance the obtaining of the wealth distribution
in the human soc... |
nlin/0611054 | A Model of a Trust-based Recommendation System on a Social Network | nlin.AO cs.IR physics.soc-ph | In this paper, we present a model of a trust-based recommendation system on a
social network. The idea of the model is that agents use their social network
to reach information and their trust relationships to filter it. We investigate
how the dynamics of trust among agents affect the performance of the system by
com... |
nlin/0702001 | Bistability: a common feature in some "aggregates" of logistic maps | nlin.AO cs.NE | As it was argued by Anderson [Science 177, 393 (1972)], the "reductionist"
hypothesis does not by any means imply a "constructionist" one. Hence, in
general, the behavior of large and complex aggregates of elementary components
can not be understood nor extrapolated from the properties of a few components.
Following ... |
nlin/0703036 | Statistical User Model for the Internet Access | nlin.AO cond-mat.stat-mech cs.MA cs.NI | A new statistical based model approach to characterize a user's behavior in
an Internet access link is presented. The real patterns of Internet traffic in
a heterogeneous Campus Network are studied. We find three clearly different
patterns of individual user's behavior, study their common features and group
particula... |
nlin/0703050 | Competition of Self-Organized Rotating Spiral Autowaves in a
Nonequilibrium Dissipative System of Three-Level Phaser | nlin.CG cs.NE nlin.AO | We present results of cellular automata based investigations of rotating
spiral autowaves in a nonequilibrium excitable medium which models three-level
paramagnetic microwave phonon laser (phaser). The computational model is
described in arXiv:cond-mat/0410460v2 and arXiv:cond-mat/0602345v1 . We have
observed several... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.