37 citations · 78 across the 20 of their papers we have counts for
22 papers
Escape times for subgraph detection and graph partitioning
Zachary M. Boyd, Nicolas Fraiman, Jeremy L. Marzuola +2
We provide a rearrangement based algorithm for fast detection of subgraphs of vertices with long escape times for directed or undirected networks. Complementing other notions o…
Opinion dynamics on directed complex networks
Nicolas Fraiman, Tzu-Chi Lin, Mariana Olvera-Cravioto
We propose and analyze a mathematical model for the evolution of opinions on directed complex networks. Our model generalizes the popular DeGroot and Friedkin-Johnsen models by all…
Algorithms for the ferromagnetic Potts model on expanders
Charlie Carlson, Ewan Davies, Nicolas Fraiman +3
We give algorithms for approximating the partition function of the ferromagnetic -color Potts model on graphs of maximum degree . Our primary contribution is a fully polynomi…
Beam Search for Feature Selection
Nicolas Fraiman, Zichao Li
In this paper, we present and prove some consistency results about the performance of classification models using a subset of features. In addition, we propose to use beam search t…
On the power of choice for Boolean functions
Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche
In this paper we consider a variant of the well-known Achlioptas process for graphs adapted to monotone Boolean functions. Fix a number of choices and a sequence o…
Classification with Nearest Disjoint Centroids
Nicolas Fraiman, Zichao Li
In this paper, we develop a new classification method based on nearest centroid, and it is called the nearest disjoint centroid classifier. Our method differs from the nearest cent…