227,701 research outputs found
Hamiltonian cycles and subsets of discounted occupational measures
We study a certain polytope arising from embedding the Hamiltonian cycle
problem in a discounted Markov decision process. The Hamiltonian cycle problem
can be reduced to finding particular extreme points of a certain polytope
associated with the input graph. This polytope is a subset of the space of
discounted occupational measures. We characterize the feasible bases of the
polytope for a general input graph , and determine the expected numbers of
different types of feasible bases when the underlying graph is random. We
utilize these results to demonstrate that augmenting certain additional
constraints to reduce the polyhedral domain can eliminate a large number of
feasible bases that do not correspond to Hamiltonian cycles. Finally, we
develop a random walk algorithm on the feasible bases of the reduced polytope
and present some numerical results. We conclude with a conjecture on the
feasible bases of the reduced polytope.Comment: revised based on referees comment
Critical random graphs: limiting constructions and distributional properties
We consider the Erdos-Renyi random graph G(n,p) inside the critical window,
where p = 1/n + lambda * n^{-4/3} for some lambda in R. We proved in a previous
paper (arXiv:0903.4730) that considering the connected components of G(n,p) as
a sequence of metric spaces with the graph distance rescaled by n^{-1/3} and
letting n go to infinity yields a non-trivial sequence of limit metric spaces C
= (C_1, C_2, ...). These limit metric spaces can be constructed from certain
random real trees with vertex-identifications. For a single such metric space,
we give here two equivalent constructions, both of which are in terms of more
standard probabilistic objects. The first is a global construction using
Dirichlet random variables and Aldous' Brownian continuum random tree. The
second is a recursive construction from an inhomogeneous Poisson point process
on R_+. These constructions allow us to characterize the distributions of the
masses and lengths in the constituent parts of a limit component when it is
decomposed according to its cycle structure. In particular, this strengthens
results of Luczak, Pittel and Wierman by providing precise distributional
convergence for the lengths of paths between kernel vertices and the length of
a shortest cycle, within any fixed limit component.Comment: 30 pages, 4 figure
Critical random graphs : limiting constructions and distributional properties
We consider the Erdos-Renyi random graph G(n, p) inside the critical window, where p = 1/n + lambda n(-4/3) for some lambda is an element of R. We proved in Addario-Berry et al. [2009+] that considering the connected components of G(n, p) as a sequence of metric spaces with the graph distance rescaled by n(-1/3) and letting n -> infinity yields a non-trivial sequence of limit metric spaces C = (C-1, C-2,...). These limit metric spaces can be constructed from certain random real trees with vertex-identifications. For a single such metric space, we give here two equivalent constructions, both of which are in terms of more standard probabilistic objects. The first is a global construction using Dirichlet random variables and Aldous' Brownian continuum random tree. The second is a recursive construction from an inhomogeneous Poisson point process on R+. These constructions allow us to characterize the distributions of the masses and lengths in the constituent parts of a limit component when it is decomposed according to its cycle structure. In particular, this strengthens results of Luczak et al. [1994] by providing precise distributional convergence for the lengths of paths between kernel vertices and the length of a shortest cycle, within any fixed limit component
Gallavotti-Cohen-Type symmetry related to cycle decompositions for Markov chains and biochemical applications
We slightly extend the fluctuation theorem obtained in \cite{LS} for sums of
generators, considering continuous-time Markov chains on a finite state space
whose underlying graph has multiple edges and no loop. This extended frame is
suited when analyzing chemical systems. As simple corollary we derive in a
different method the fluctuation theorem of D. Andrieux and P. Gaspard for the
fluxes along the chords associated to a fundamental set of oriented cycles
\cite{AG2}.
We associate to each random trajectory an oriented cycle on the graph and we
decompose it in terms of a basis of oriented cycles. We prove a fluctuation
theorem for the coefficients in this decomposition. The resulting fluctuation
theorem involves the cycle affinities, which in many real systems correspond to
the macroscopic forces. In addition, the above decomposition is useful when
analyzing the large deviations of additive functionals of the Markov chain. As
example of application, in a very general context we derive a fluctuation
relation for the mechanical and chemical currents of a molecular motor moving
along a periodic filament.Comment: 23 pages, 5 figures. Correction
On invariant generating sets for the cycle space
Consider a unimodular random graph, or just a finitely generated Cayley
graph. When does its cycle space have an invariant random generating set of
cycles such that every edge is contained in finitely many of the cycles?
Generating the free Loop model as a factor of iid is closely connected
to having such a generating set for FK-Ising cluster. We show that geodesic
cycles do not always form such a generating set, by showing for a parameter
regime of the FK-Ising model on the lamplighter group the origin is contained
in infinitely many geodesic cycles. This answers a question by Angel, Ray and
Spinka. Then we take a look at how the property of having an invariant locally
finite generating set for the cycle space is preserved by Bernoulli
percolation, and apply it to the problem of factor of iid presentations of the
free Loop model
- âŠ