## Dependence of the slope on R, Q and the fitting radius

>> pendientes=simul_pendientes(6000:250:8500,-.5:.2:1,200);
>> R=6000:250:8500;
>> Q=-.5:.2:1;
>> imagesc(Q,R,pendientes); set(gca,’YDir’,’normal’)

>> mesh(Q,R,pendientes)

So approximately linear change with R, and almost no change with Q.

Now we see the dependence with the fitting area:
ans =
1.0e-005 *
0.0000 0.1023 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000

All very significant.

Also a big change, depending on the fitting radius.

## Effect of having different dispersion in the center and in the periphery

We do not see a significant widening of the pattern. However, a very relevant bias appears:

Simulations with std 10 in the central 1.5 mm (radius), and std 20 in the rest (up to 3 mm radius):

>> fig_pap_simulaciones_ruidoperiferia_01(5,1)

Simulations with std 10 in the central 1.5 mm (radius), and std 40 in the rest (up to 3 mm radius):

>> fig_pap_simulaciones_ruidoperiferia_01(5,1)

## Why fishes behave “better” than Condorcet

We see this problem in Sumpter et al. (2008), Consensus Decision Making by Fish, Curr Biol.

Condorcet Theorem just says the probability that, if we make N trials with probability p of getting the right answer in each trial, at least more than half of them get the right answer. Thus, each trial is completely independent. The solution to this problem is the same as the solution to problems of the kind “taking balls from a box”. Thus, if the number of fishes is odd, the probability of the majority taking the “right” decision is

If the number of fishes is even, we have the problem of ties. Assuming that ties are resolved by tossing a fair coin (so each option has 50% probability of being chosen), we have

On the other hand, as shown by Ward et al. (2008) Quorum decision-making facilitates… pnas, decisions of different fishes in the shoal are not independent. Once one or more fishes decide one option, the probability that other go for that option increases (in fact, Sumpter et al. 2008 also use this formula in other part of their paper). Therefore, it is to be expected that the probability increases faster for the case of fishes. It is as if p in the above formula was not constant, but increased.

## Possible objective functions for the many-eyes problem

Version 1: Probability that at least one fish detects a predator at a given distance.

A predator arrives at a certain angle. The probability that a fish sees the predator if there is no occlusion by another fish is p. If N fishes have free view at the angle of the arriving predator, the probability that at leas one fish sees the predator is

1-(1-p)^N. This probability increases with N until it saturates.

If we binnarize the 2D space in 360 angles, and we assume equal probability for the predator arriving each angle, then we have that the probability that at least one fish sees the predator is

, where N_i is the number of fishes with free line of vision at angle i.

The advantage of this cost function is that it takes into account both that many fishes see a certain point (but with the saturation, which I find very reasonable) and that not all fishes look at the same place, leaving others without surveillance.

Since sometimes the shoal will not react until several fish have started evasion, this cost may be generalized to the case when at least n fishes see the predator. However, I think the formula is not simple.

A possible problem with this objective is that it may depend on the binning on angles. My intuition says it will not depend on that (at least not strongly), but at first sight I do not see an easy way of proving it.

Version 2: Distance at which the probability of detecting a predator passes a threshold.

We may assume that the probability that a fish sees the predator (p) depends on distance in a simple way. We may assume that, for long distances (where the probability is much lower than one) the probability grows linearly with the angle subtended by the predator. This angle is inversely proportional to distance, so p=k/d, where k is a constant and d is the distance. Then, for a given angle, the probability that at leas one fish sees the predator is

H=1-(1-k/d)^N.

For a given (constant) value of H, we have that the distance depends on N as

.

The two versions may not be equivalent, because they will weight differently the benefits of equally distributing the surveillance in all angles. But I would not expect strong differences…

## Figures for Gonzalo’s talk in Tarragona

>> V0=zeros(279,1);
V0([40 41])=1;
>> V=matrizsistema2V_num(M,V0,[-1 1],.0005,1000);
>> imagesc(V)
>> caxis([0 .3])

Good.

>> find(roc(:,2)>.8,1)
ans =
36
>> umbral(36)
ans =
0.0017

## New Figure 2

>> fig_pap_elegans_16(1,zeros(100))

## Omega vs Deltax, for the parameters alpha=0.05 beta=1.5, with the new generalized omega

>> clear
>> [pos,omega_general,costes,x]=coste2pos_restofijas(todas.A*.05,todas.M*1.5+todas.S,todas.f,todas.pos_real,1);
>> desv=abs(todas.pos_real-pos);
>> plot(desv,omega_general,’.’)

To start with, only one outlier. Note that the new omega depends on the exponent, so this by itself favors exponent 1.

Bad news for the fit to the mean (without the outlier):

>> buenas=(desv<.2 | omega_general<20);
>> sum(~buenas)
ans =
1