Thomas LoFaro

Thomas LoFaro

Auto-generated profile, based on publicly available information

Thomas LoFaro

Department of Mathematics, Computer Science and Statistics, Gustavus Adolphus College, Saint Peter, MN, USA

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2006 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
AFAyman Farahat
Ayman Farahat
TLThomas LoFaro
Thomas LoFaro
JMJoel C. Miller
Joel C. Miller
GRGregory Rae
Gregory Rae
LWLesley A. Ward
Lesley A. Ward
Algorithms such as Kleinberg's HITS algorithm, the PageRank algorithm of Brin and Page, and the SALSA algorithm of Lempel and Moran use the link structure of a network of web pages to assign weights to each page in the network. The weights can then be used to rank the pages as authoritative sources. These algorithms share a common underpinning; they find a dominant eigenvector of a nonnegative matrix that describes the link structure of the given network and use the entries of this eigenvector as the page weights. We use this commonality to give a unified treatment, proving the existence of the required eigenvector for the PageRank, HITS, and SALSA algorithms, the uniqueness of the PageRank eigenvector, and the convergence of the algorithms to these eigenvectors. However, we show that the HITS and SALSA eigenvectors need not be unique. We examine how the initialization of the algorithms affects the final weightings produced. We give examples of networks that lead the HITS and SALSA algorithms to returnnonunique or nonintuitive rankings. We characterize all such networks in terms of the connectivity of the related HITS authority graph. We propose a modification, Exponentiated Input to HITS, to the adjacency matrix input to the HITS algorithm. We prove that Exponentiated Input to HITS returns a unique ranking, provided that the network is weakly connected. Our examples also show that SALSA can give inconsistent hub and authority weights, due to nonuniqueness. We also mention a small modification to the SALSA initialization which makes the hub and authority weights consistent.

26 November 2014 in Journal of Neuroscience
Verified
Journal Article
Open access
PDF file
KLKenway Louie
Kenway Louie
TLThomas LoFaro
Thomas LoFaro
RWRyan Webb
Ryan Webb
PGPaul W. Glimcher
Paul W. Glimcher
Normalization is a widespread neural computation, mediating divisive gain control in sensory processing and implementing a context-dependent value code in decision-related frontal and parietal cortices. Although decision-making is a dynamic process with complex temporal characteristics, most models of normalization are time-independent and little is known about the dynamic interaction of normalization and choice. Here, we show that a simple differential equation model of normalization explains the characteristic phasic-sustained pattern of cortical decision activity and predicts specific normalization dynamics: value coding during initial transients, time-varying value modulation, and delayed onset of contextual information. Empirically, we observe these predicted dynamics in saccade-related neurons in monkey lateral intraparietal cortex. Furthermore, such models naturally incorporate a time-weighted average of past activity, implementing an intrinsic reference-dependence in value coding. These results suggest that a single network mechanism can explain both transient and sustained decision activity, emphasizing the importance of a dynamic view of normalization in neural coding.

1 January 1994 in Neural Computation
Verified
Journal Article
Closed access
TLThomas LoFaro
Thomas LoFaro
NKNancy Kopell
Nancy Kopell
EMEve Marder
Eve Marder
SHScott L. Hooper
Scott L. Hooper
We study the properties of a network consisting of two model neurons that are coupled by reciprocal inhibition. The study was motivated by data from a pair of cells in the crustacean stomatogastric ganglion. One of the model neurons is an endogenous burster; the other is excitable but not bursting in the absence of phasic input. We show that the presence of a hyperpolarization activated inward current (ih) in the excitable neuron allows these neurons to fire in integer subharmonics, with the excitable cell firing once for every N ≥ 1 bursts of the oscillator. The value of N depends on the amount of hyperpolarizing current injected into the excitable cell as well as the voltage activation curve of ih. For a fast synapse, these parameter changes do not affect the characteristic point in the oscillator cycle at which the excitable cell bursts; for slower synapses, such a relationship is maintained within small windows for each N. The network behavior in the current work contrasts with the activity of a pair of coupled oscillators for which the interaction is through phase differences; in the latter case, subharmonics exist if the uncoupled oscillators have near integral frequency relationships, but the phase relationships of the oscillators in general change significantly with parameters. The mechanism of this paper provides a potential means of coordinating subnetworks acting on different time scales but maintaining fixed relationships between characteristic points of the cycles.

23 June 1999 in Journal of Mathematical Biology
Verified
Journal Article
Closed access
PDF file
TLThomas LoFaro
Thomas LoFaro
NKNancy Kopell
Nancy Kopell

1 August 1996 in Mathematical and Computer Modelling
Verified
Journal Article
Closed access
TLT. LoFaro
T. LoFaro

1 December 1997 in International Journal of Bifurcation and Chaos
Verified
Journal Article
Closed access
TLThomas Lofaro
Thomas Lofaro