38 citations · 191 across the 25 of their papers we have counts for
5 papers · 1 filter
Ample simplicial complexes
Chaim Even-Zohar, Michael Farber, Lewis Mead
Motivated by potential applications in network theory, engineering and computer science, we study -ample simplicial complexes. These complexes can be viewed as finite approximat…
Spectral Analysis of Word Statistics
Chaim Even-Zohar, Tsviqa Lakrec, Ran J. Tessler
Given a random text over a finite alphabet, we study the frequencies at which fixed-length words occur as subsequences. As the data size grows, the joint distribution of word count…
independence: Fast Rank Tests
Chaim Even-Zohar
In 1948 Hoeffding devised a nonparametric test that detects dependence between two continuous random variables X and Y, based on the ranking of n paired samples (Xi,Yi). The comput…
Sizes of Simultaneous Core Partitions
Chaim Even-Zohar
There is a well-studied correspondence by Jaclyn Anderson between partitions that avoid hooks of length s or t and certain binary strings of length s+t. Using this map, we prove th…
Random Surfaces with Boundary
Chaim Even-Zohar, Michael Farber
A surface with boundary is randomly generated by gluing polygons along some of their sides. We show that its genus and number of boundary components asymptotically follow a bivaria…