Searcharxiv⌕ Search

arXiv · 0708.2044

Density-Profile Processes Describing Biological Signaling Networks: Almost Sure Convergence to Deterministic Trajectories

Abstract

We introduce jump processes in R^k, called density-profile process, to model biological signaling networks. They describe the macroscopic evolution of finite-size spin-flip models with k types of spins interacting through a non-reversible Glauber dynamics. We focus on the the k-dimensional empirical-magnetization vector in the thermodynamic limit, and prove that, within arbitrary finite time-intervals, its path converges almost surely to a deterministic trajectory determined by a first-order (non-linear) differential equation. As parameters of the spin-flip dynamics change, the associated dynamical system may go through bifurcations, associated to phase transitions in the statistical mechanical setting. We present a simple example of spin-flip stochastic model leading to a dynamical system with Hopf and pitchfork bifurcations; depending on the parameter values, the magnetization random path can either converge to a unique stable fixed point, converge to one of a pair of stable fixed points, or asymptotically evolve close to a deterministic orbit in R^k.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Roberto Fernández, Luiz Renato Fontes, E. Jordão Neves. 2007-08-15. Density-Profile Processes Describing Biological Signaling Networks: Almost Sure Convergence to Deterministic Trajectories. https://arxiv.org/abs/0708.2044

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Pairwise Negative Correlation for Uniform Spanning Subgraphs of the Complete Graph

We study pairwise negative correlation for three families of uniform spanning-subgraph measures on the complete graph. In Part~I, we consider the uniform probability measure on connected spanning subgraphs and prove pairwise negative correlation for all sufficiently large complete graphs. In Part~II, we study the uniform measure on spanning forests with a prescribed number of connected components and prove pairwise negative correlation for every fixed number of components when the number of vertices is sufficiently large. In Part~III, we consider connected spanning subgraphs with prescribed excess and establish the analogous result for every fixed excess. The three parts are self-contained and are intended as separate manuscripts.

math.PR↗

Naturality characterizes product measures and relative product measures

We show that the formation of the product measure is the only natural way to assign to each tuple of probability measures on measurable spaces a probability measure on the product space. Here, naturality is meant in the sense of category theory and amounts to the condition that the assignment commutes with pushforward along measurable maps. In the standard Borel setting, we also prove an analogous result for relative products over a fixed base probability space. As a corollary, we conclude that the formation of relative products is a lax symmetric monoidal functor.

math.PR↗

A Dimension-Free Bound on the Poincaré Constant of Isotropic Log-Concave Measures

The Kannan--Lovász--Simonovits (KLS) conjecture asserts that isotropic log-concave probability measures have Poincaré constants bounded by a universal constant, independently of dimension. We give a deterministic variational proof with an explicit bound on the Poincaré constant $C_P(μ)\le25$, where $μ$ is any isotropic log-concave probability measure. Starting from elliptic moment estimates and a quadratic variance inequality, we establish geometric bounds on normalized Appell coefficient norms through \emph{joint} maximization over the measure and test function. Variation of the measure gives a maximum-principle inequality, while stationarity in the test function controls the highest-order cumulant terms. Two concave barriers constructed from quadratic and cubic polynomials close the induction. A weighted Helmholtz--Hodge decomposition then controls the curl correction of weighted divergence, yielding a curvature estimate for compatible symmetric tensor fields that is uniform in rank. Quadratic duality converts this estimate into an operator comparison for centered integration, linking the coefficient bounds to control of the inverse gradient. A spectral-radius estimate and a scalar growth inequality for adjoint iterates then yield the Poincaré bound. The final estimate is independent of the auxiliary positive curvature, allowing approximation to complete the proof for general isotropic log-concave measures.

math.PR↗