Undersampled Critical Branching Processes on Small-World and Random Networks Fail to Reproduce the Statistics of Spike Avalanches

The power-law size distributions obtained experimentally for neuronal avalanches are an important evidence of criticality in the brain. This evidence is supported by the fact that a critical branching process exhibits the same exponent t~3=2. Models at criticality have been employed to mimic avalanche propagation and explain the statistics observed experimentally. However, a crucial aspect of neuronal recordings has been almost completely neglected in the models: undersampling. While in a typical multielectrode array hundreds of neurons are recorded, in the same area of neuronal tissue tens of thousands of neurons can be found. Here we investigate the consequences of undersampling in models with three different topologies (two-dimensional, small-world and random network) and three different dynamical regimes (subcritical, critical and supercritical). We found that undersampling modifies avalanche size distributions, extinguishing the power laws observed in critical systems. Distributions from subcritical systems are also modified, but the shape of the undersampled distributions is more similar to that of a fully sampled system. Undersampled supercritical systems can recover the general characteristics of the fully sampled version, provided that enough neurons are measured. Undersampling in two-dimensional and small-world networks leads to similar effects, while the random network is insensitive to sampling density due to the lack of a well-defined neighborhood. We conjecture that neuronal avalanches recorded from local field potentials avoid undersampling effects due to the nature of this signal, but the same does not hold for spike avalanches. We conclude that undersampled branching-process-like models in these topologies fail to reproduce the statistics of spike avalanches.

Being more certain about random assignment in social policy evaluations

Social experiments have been widely utilised in evaluations of social programmes in the US to identify ‘what works’, whilst in the UK their use is more controversial. This paper explores the paradigmatic, technical and practical issues evaluators confront in using randomised experiments to evaluate social policies. Possible remedies to some of these problems are outlined. It is argued that although no evaluation methodology is problem-free, policy makers and researchers should be more confident about the merits of using random assignment, provided it is used in conjunction with other methodologies more suited to understanding why and how interventions work.

Bayesian alignment of continuous molecular shapes using random fields

Statistical methodology is proposed for comparing molecular shapes. In order to account for the continuous nature of molecules, classical shape analysis methods are combined with techniques used for predicting random fields in spatial statistics. Applying a modification of Procrustes analysis, Bayesian inference is carried out using Markov chain Monte Carlo methods for the pairwise alignment of the resulting molecular fields. Superimposing entire fields rather than the configuration matrices of nuclear positions thereby solves the problem that there is usually no clear one--to--one correspondence between the atoms of the two molecules under consideration. Using a similar concept, we also propose an adaptation of the generalised Procrustes analysis algorithm for the simultaneous alignment of multiple molecular fields. The methodology is applied to a dataset of 31 steroid molecules.

Keys to Genera of the Tremellales /

Mode of access: Internet.

Random matrix theory eta aplikazioa kaos kuantikoan

[eus] Gradu amaierako lan honetan ausazko matrizeen teoriari, RMT-ri, buruzko sarrera orokor bat egiten da ondoren aplikazio fisiko bat emateko. Teoriaren aplikazioa egiteko Kaos kuantikoa deritzon fisikaren arloa erabiliko da. Lehenik eta behin, RMT-ren kontzeptu batzuk azalduko dira helburutzat lehen auzokideen distantziaren distribuzioaren espresio lortzea izanik. Izan ere, distribuzio honek erakutsiko baititu Kaosak kuantikoki uzten dituen aztarnak. Bigarren kapituluan, aplikazio fisikoa azalduko da. Lehenengo Kaosean RMT nola aplikatzen den ikusiko da, ondoren adibide batzuen bidez argituz, eremu magnetiko batean dagoen hidrogeno atomoa eta billar kuantikoak izenarekin ezagutzen diren sistemak, batik bat.

Shifting Processes with Cyclically Exchangeable Increments at Random

International audience

Analysis of a stochastic SIR epidemic on a random network incorporating household structure

This paper is concerned with a stochastic SIR (susceptible-infective-removed) model for the spread of an epidemic amongst a population of individuals, with a random network of social contacts, that is also partitioned into households. The behaviour of the model as the population size tends to infinity in an appropriate fashion is investigated. A threshold parameter which determines whether or not an epidemic with few initial infectives can become established and lead to a major outbreak is obtained, as are the probability that a major outbreak occurs and the expected proportion of the population that are ultimately infected by such an outbreak, together with methods for calculating these quantities. Monte Carlo simulations demonstrate that these asymptotic quantities accurately reflect the behaviour of finite populations, even for only moderately sized finite populations. The model is compared and contrasted with related models previously studied in the literature. The effects of the amount of clustering present in the overall population structure and the infectious period distribution on the outcomes of the model are also explored.

Darboux Transformations and Random Point Processes

International audience

Threshold behaviour and final outcome of an epidemic on a random network with household structure

This paper considers a stochastic SIR (susceptible-infective-removed) epidemic model in which individuals may make infectious contacts in two ways, both within 'households' (which for ease of exposition are assumed to have equal size) and along the edges of a random graph describing additional social contacts. Heuristically-motivated branching process approximations are described, which lead to a threshold parameter for the model and methods for calculating the probability of a major outbreak, given few initial infectives, and the expected proportion of the population who are ultimately infected by such a major outbreak. These approximate results are shown to be exact as the number of households tends to infinity by proving associated limit theorems. Moreover, simulation studies indicate that these asymptotic results provide good approximations for modestly-sized finite populations. The extension to unequal sized households is discussed briefly.

Testing the random walk hypothesis with variance ratio statistics

Mestrado em Finanças

Reading keys in the communication of wine in China. Wine marketing strategies

Mestrado Vinifera Euromaster - Instituto Superior de Agronomia - UL

Nature of the spin-glass phase in dense packings of Ising dipoles with random anisotropy axes

By Monte Carlo simulations, we study the character of the spinglass (SG) phase in dense disordered packings of magnetic nanoparticles (NPs). We focus on NPs which have large uniaxial anisotropies and can be well represented as Ising dipoles. Dipoles are placed on SC lattices and point along randomly oriented axes. From the behaviour of a SG correlation length we determine the transition temperature Tc between the paramagnetic and a SG phase. For temperatures well below Tc we find distributions of the SG overlap parameter q that are strongly sample-dependent and exhibit several spikes. We find that the average width of spikes, and the fraction of samples with spikes higher than a certain threshold does not vary appreciably with the system sizes studied. We compare these results with the ones found previously for 3D site-diluted systems of parallel Ising dipoles and with the behaviour of the Sherrington-Kirkpatrick model.

Statistical properties of radiation of multiwavelength random DFB fiber laser

In the presented paper, the temporal and statistical properties of a Lyot filter based multiwavelength random DFB fiber laser with a wide flat spectrum, consisting of individual lines, were investigated. It was shown that separate spectral lines forming the laser spectrum have mostly Gaussian statistics and so represent stochastic radiation, but at the same time the entire radiation is not fully stochastic. A simple model, taking into account phenomenological correlations of the lines' initial phases was established. Radiation structure in the experiment and simulation proved to be different, demanding interactions between different lines to be described via a NLSE-based model.

Disorder-induced light localisation:from random to artificial

Light localisation in one-dimensional (1D) randomly disordered medium is usually characterized by randomly distributed resonances with fluctuating transmission values, instead of selectively distributed resonances with close-to-unity transmission values that are needed in real application fields. By a resonance tuning scheme developed recently, opening of favorable resonances or closing of unfavorable resonances are achieved by disorder micro-modification, both on the layered medium and the fibre Bragg grating (FBG) array. And furthermore, it is shown that those disorder-induced resonances are independently tunable. Therefore, selected resonances and arranged light localisation can be achieved via artificial disorder, and thus meet the demand of various application fields.

Random walk with restart over dynamic graphs

Random Walk with Restart (RWR) is an appealing measure of proximity between nodes based on graph structures. Since real graphs are often large and subject to minor changes, it is prohibitively expensive to recompute proximities from scratch. Previous methods use LU decomposition and degree reordering heuristics, entailing O(|V|^3) time and O(|V|^2) memory to compute all (|V|^2) pairs of node proximities in a static graph. In this paper, a dynamic scheme to assess RWR proximities is proposed: (1) For unit update, we characterize the changes to all-pairs proximities as the outer product of two vectors. We notice that the multiplication of an RWR matrix and its transition matrix, unlike traditional matrix multiplications, is commutative. This can greatly reduce the computation of all-pairs proximities from O(|V|^3) to O(|delta|) time for each update without loss of accuracy, where |delta| (<<|V|^2) is the number of affected proximities. (2) To avoid O(|V|^2) memory for all pairs of outputs, we also devise efficient partitioning techniques for our dynamic model, which can compute all pairs of proximities segment-wisely within O(l|V|) memory and O(|V|/l) I/O costs, where 1<=l<=|V| is a user-controlled trade-off between memory and I/O costs. (3) For bulk updates, we also devise aggregation and hashing methods, which can discard many unnecessary updates further and handle chunks of unit updates simultaneously. Our experimental results on various datasets demonstrate that our methods can be 1–2 orders of magnitude faster than other competitors while securing scalability and exactness.