8 citations · 35 across the 18 of their papers we have counts for
35 papers
Peripherality in networks: theory and applications
Jesse Geneson, Shen-Fu Tsai
We investigate several related measures of peripherality and centrality for vertices and edges in networks, including the Mostar index which was recently introduced as a measure of…
The distance-k dimension of graphs
Jesse Geneson, Eunjeong Yi
The metric dimension, , of a graph is a graph parameter motivated by robot navigation that has been studied extensively. Let be a graph with vertex set , and…
Sharper bounds for online learning of smooth functions of a single variable
Jesse Geneson
We investigate the generalization of the mistake-bound model to continuous real-valued single variable functions. Let be the class of absolutely continuous function…
Continuous Turán numbers
Jesse Geneson
In this paper, we define a notion of containment and avoidance for subsets of . Then we introduce a new, continuous and super-additive extremal function for subsets $…
A note on the price of bandit feedback for mistake-bounded online learning
Jesse Geneson
The standard model and the bandit model are two generalizations of the mistake-bound model to online multiclass classification. In both models the learner guesses a classification…
Almost all permutation matrices have bounded saturation functions
Jesse Geneson
Saturation problems for forbidden graphs have been a popular area of research for many decades, and recently Brualdi and Cao initiated the study of a saturation problem for 0-1 mat…