scispace - formally typeset
J

Juan G. Restrepo

Researcher at University of Colorado Boulder

Publications -  95
Citations -  3762

Juan G. Restrepo is an academic researcher from University of Colorado Boulder. The author has contributed to research in topics: Mobile station & Cellular network. The author has an hindex of 33, co-authored 89 publications receiving 3264 citations. Previous affiliations of Juan G. Restrepo include Northeastern University & University of Maryland, College Park.

Papers
More filters
Journal ArticleDOI

A Rabbit Ventricular Action Potential Model Replicating Cardiac Dynamics at Rapid Heart Rates

TL;DR: This study modified the L-type calcium (Ca) current and Ca(i) cycling formulations based on new experimental patch-clamp data obtained in isolated rabbit ventricular myocytes, and developed a minimal seven-state Markovian model of I(Ca,L) that reproduced Ca- and voltage-dependent kinetics.
Journal ArticleDOI

Onset of synchronization in large networks of coupled oscillators.

TL;DR: The theory of the transition from incoherence to coherence in large networks of coupled phase oscillators is studied and it is found that the theory describes the transition well in situations in which the mean-field approximation fails.
Journal ArticleDOI

Characterizing the Dynamical Importance of Network Nodes and Links

TL;DR: It is shown how the characterization of the dynamical importance of nodes can be affected by degree-degree correlations and network community structure, and how this can be used to optimize techniques for controlling certain network dynamical processes.
Journal ArticleDOI

Predicting criticality and dynamic range in complex networks: effects of topology.

TL;DR: A general theoretical approach to study the effects of network topology on dynamic range is developed, which quantifies the range of stimulus intensities resulting in distinguishable network responses and finds that the largest eigenvalue of the weighted network adjacency matrix governs the network dynamic range.
Journal ArticleDOI

Approximating the largest eigenvalue of network adjacency matrices.

TL;DR: Approximations to the largest eigenvalue of adjacency matrices of a network are developed and the relationships between these approximations are discussed.