7,784 research outputs found
Unemployment insurance and the uninsured
Under federal-state law workers who quit a job are not entitled to receive unemployment insurance benefits. To show how the existence of the uninsured affects wages and employment, I extend an equilibrium search model to account for two types of unemployed workers: those who are currently receiving unemployment benefits and for whom an increase in unemployment benefits reduces the incentive to work, and those who are currently not insured. For these, work provides an added value in the form of future eligibility, and an increase in unemployment benefits increases their willingness to work. Incorporating both types into a search model permits me to solve analytically for the endogenous wage dispersion and insurance rate in the economy. I show that, in general equilibrium when firms adjust their job creation margin, the wage dispersion is reduced and the overall effect of benefits can be signed: higher unemployment benefits increase average wages and decrease the vacancy-to-unemployment ratio.Unemployment insurance
Testing Odd Direct Sums Using High Dimensional Expanders
In this work, using methods from high dimensional expansion, we show that the property of k-direct-sum is testable for odd values of k . Previous work of [Kaufman and Lubotzky, 2014] could inherently deal only with the case that k is even, using a reduction to linearity testing. Interestingly, our work is the first to combine the topological notion of high dimensional expansion (called co-systolic expansion) with the combinatorial/spectral notion of high dimensional expansion (called colorful expansion) to obtain the result.
The classical k-direct-sum problem applies to the complete complex; Namely it considers a function defined over all k-subsets of some n sized universe. Our result here applies to any collection of k-subsets of an n-universe, assuming this collection of subsets forms a high dimensional expander
Local-To-Global Agreement Expansion via the Variance Method
Agreement expansion is concerned with set systems for which local assignments to the sets with almost perfect pairwise consistency (i.e., most overlapping pairs of sets agree on their intersections) implies the existence of a global assignment to the ground set (from which the sets are defined) that agrees with most of the local assignments.
It is currently known that if a set system forms a two-sided or a partite high dimensional expander then agreement expansion is implied. However, it was not known whether agreement expansion can be implied for one-sided high dimensional expanders.
In this work we show that agreement expansion can be deduced for one-sided high dimensional expanders assuming that all the vertices\u27 links (i.e., the neighborhoods of the vertices) are agreement expanders. Thus, for one-sided high dimensional expander, an agreement expansion of the large complicated complex can be deduced from agreement expansion of its small simple links.
Using our result, we settle the open question whether the well studied Ramanujan complexes are agreement expanders. These complexes are neither partite nor two-sided high dimensional expanders. However, they are one-sided high dimensional expanders for which their links are partite and hence are agreement expanders. Thus, our result implies that Ramanujan complexes are agreement expanders, answering affirmatively the aforementioned open question.
The local-to-global agreement expansion that we prove is based on the variance method that we develop. We show that for a high dimensional expander, if we define a function on its top faces and consider its local averages over the links then the variance of these local averages is much smaller than the global variance of the original function. This decreasing in the variance enables us to construct one global agreement function that ties together all local agreement functions
High Dimensional Random Walks and Colorful Expansion
Random walks on bounded degree expander graphs have numerous applications,
both in theoretical and practical computational problems. A key property of
these walks is that they converge rapidly to their stationary distribution.
In this work we {\em define high order random walks}: These are
generalizations of random walks on graphs to high dimensional simplicial
complexes, which are the high dimensional analogues of graphs. A simplicial
complex of dimension has vertices, edges, triangles, pyramids, up to
-dimensional cells. For any , a high order random walk on
dimension moves between neighboring -faces (e.g., edges) of the complex,
where two -faces are considered neighbors if they share a common
-face (e.g., a triangle). The case of recovers the well studied
random walk on graphs.
We provide a {\em local-to-global criterion} on a complex which implies {\em
rapid convergence of all high order random walks} on it. Specifically, we prove
that if the -dimensional skeletons of all the links of a complex are
spectral expanders, then for {\em all} the high order random walk
on dimension converges rapidly to its stationary distribution.
We derive our result through a new notion of high dimensional combinatorial
expansion of complexes which we term {\em colorful expansion}. This notion is a
natural generalization of combinatorial expansion of graphs and is strongly
related to the convergence rate of the high order random walks.
We further show an explicit family of {\em bounded degree} complexes which
satisfy this criterion. Specifically, we show that Ramanujan complexes meet
this criterion, and thus form an explicit family of bounded degree high
dimensional simplicial complexes in which all of the high order random walks
converge rapidly to their stationary distribution.Comment: 27 page
High Dimensional Expanders and Property Testing
We show that the high dimensional expansion property as defined by Gromov,
Linial and Meshulam, for simplicial complexes is a form of testability. Namely,
a simplicial complex is a high dimensional expander iff a suitable property is
testable. Using this connection, we derive several testability results
Dynamics of shear homeomorphisms of tori and the Bestvina-Handel algorithm
Sharkovskii proved that the existence of a periodic orbit in a
one-dimensional dynamical system implies existence of infinitely many periodic
orbits. We obtain an analog of Sharkovskii's theorem for periodic orbits of
shear homeomorphisms of the torus. This is done by obtaining a dynamical order
relation on the set of simple orbits and simple pairs. We then use this order
relation for a global analysis for a quantum chaotic physical system called the
kicked accelerated particle.Comment: 31 pages, 24 figures, to appear in Topological Methods in Nonlinear
Analysi
- …