Correlation inequalities for edge-reinforced random walk

We prove correlation inequalities for linearly edge-reinforced random walk. These correlation inequalities concern the first entry tree, i.e. the tree of edges used to enter any vertex for the first time. They also involve the asymptotic fraction of time spent on particular edges. Basic ingredients are known FKG-type inequalities and known negative associations for determinantal processes.