scholarly journals Geometrical mutual information at the tricritical point of the two-dimensional Blume–Capel model

2016 ◽  
Vol 2016 (7) ◽  
pp. 073105
Author(s):  
Ipsita Mandal ◽  
Stephen Inglis ◽  
Roger G Melko
2011 ◽  
Vol 38 (6Part13) ◽  
pp. 3532-3532
Author(s):  
K Tateoka ◽  
A Nakata ◽  
Y Saito ◽  
Y Yaegashi ◽  
T Nakazawa ◽  
...  

2003 ◽  
Vol 15 (8) ◽  
pp. 1715-1749 ◽  
Author(s):  
Blaise Agüera y Arcas ◽  
Adrienne L. Fairhall ◽  
William Bialek

A spiking neuron “computes” by transforming a complex dynamical input into a train of action potentials, or spikes. The computation performed by the neuron can be formulated as dimensional reduction, or feature detection, followed by a nonlinear decision function over the low-dimensional space. Generalizations of the reverse correlation technique with white noise input provide a numerical strategy for extracting the relevant low-dimensional features from experimental data, and information theory can be used to evaluate the quality of the low-dimensional approximation. We apply these methods to analyze the simplest biophysically realistic model neuron, the Hodgkin-Huxley (HH) model, using this system to illustrate the general methodological issues. We focus on the features in the stimulus that trigger a spike, explicitly eliminating the effects of interactions between spikes. One can approximate this triggering “feature space” as a two-dimensional linear subspace in the high-dimensional space of input histories, capturing in this way a substantial fraction of the mutual information between inputs and spike time. We find that an even better approximation, however, is to describe the relevant subspace as two dimensional but curved; in this way, we can capture 90% of the mutual information even at high time resolution. Our analysis provides a new understanding of the computational properties of the HH model. While it is common to approximate neural behavior as “integrate and fire,” the HH model is not an integrator nor is it well described by a single threshold.


2017 ◽  
Vol 14 (6) ◽  
pp. 172988141774627 ◽  
Author(s):  
Sanming Song ◽  
J. Michael Herrmann ◽  
Bailu Si ◽  
Kaizhou Liu ◽  
Xisheng Feng

2021 ◽  
Author(s):  
George Golovko ◽  
Victor Reyes ◽  
Iryna Pinchuk ◽  
Yuriy Fofanov

AbstractMotivationVirtually all biological systems are governed by a set of complex relations between their components. Identification of relations within biological systems involves a rigorous search for patterns among variables/parameters. Two-dimensional (involving two variables) patterns are identified using correlation, covariation, and mutual information approaches. However, these approaches are not suited to identify more complicated multidimensional relations, which simultaneously include 3, 4, and more variables.ResultsWe present a novel pattern-specific method to quantify the strength and estimate the statistical significance of multidimensional Boolean patterns in multiomics data. In contrast with dimensionality reduction and AI solutions, patterns identified by the proposed approach may provide a better background for meaningful mechanistic interpretation of the biological processes. Our preliminary analysis suggests that multidimensional patterns may dominate the landscape of multi-omics data, which is not surprising because complex interactions between components of biological systems are unlikely to be reduced to simple pairwise interactions.


2019 ◽  
Vol 28 (1) ◽  
pp. 77-86 ◽  
Author(s):  
R. Mehaboobathunnisa ◽  
A.A. Haseena Thasneem ◽  
M. Mohamed Sathik

Abstract The traditional ray casting algorithm has the capability to render three-dimensional volume data in the viewable two-dimensional form by sampling the color data along the rays. The speed of the technique relies on the computation incurred by the huge volume of rays. The objective of the paper is to reduce the computations made over the rays by eventually reducing the number of samples being processed throughout the volume data. The proposed algorithm incorporates the grouping strategy based on fuzzy mutual information (FMI) over a group of voxels in the conventional ray casting to achieve the reduction. For the data group, with FMI in a desirable range, a single primary ray is cast into the group as a whole. As data are grouped before casting rays, the proposed algorithm reduces the interpolation calculation and thereby runs with lesser complexity, preserving the image quality.


Sign in / Sign up

Export Citation Format

Share Document