Search arXiv⌕ Search

arXiv · math/0402343

Dynamics of exponential linear map in functional space

Abstract

We consider the question of existence of a unique invariant probability distribution which satisfies some evolutionary property. The problem arises from the random graph theory but to answer it we treat it as a dynamical system in the functional space, where we look for a global attractor. We consider the following bifurcation problem: Given a probability measure $μ$, which corresponds to the weight distribution of a link of a random graph we form a positive linear operator $Φ$ (convolution) on distribution functions and then we analyze a family of its exponents with a parameter $λ$ which corresponds to connectivity of a sparse random graph. We prove that for every measure $μ$ (\emph{i.e.}, convolution $Φ$) and every $λ< e$ there exists a unique globally attracting fixed point of the operator, which yields the existence and uniqueness of the limit probability distribution on the random graph. This estimate was established earlier \cite{KarpSipser} for deterministic weight distributions (Dirac measures $μ$) and is known as $e$-cutoff phenomena, as for such distributions and $λ>e$ there is no fixed point attractor. We thus establish this phenomenon in a much more general sense.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz. 2004-02-21. Dynamics of exponential linear map in functional space. https://arxiv.org/abs/math/0402343

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

KEEP EXPLORING

Related papers

Piecewise Smooth Dynamical Systems Regularized by Convolution

We present a general regularization procedure for piecewise smooth vector fields whose discontinuity locus is a variety of normal crossings type. We show that such regularization can be smoothed through a finite sequence of blowings-up, thereby reducing the problem to the study of the dynamics of a smooth vector field in a manifold with corners. The procedure will be illustrated in the cases of piecewise smooth vector fields on $\mathbb{R}^2$ with discontinuity locus $x=0$ or $xy=0$, and on $\mathbb{R}^3$ with discontinuity locus $xyz=0$. We will see that some unexpected dynamical phenomena such as Bogdanov-Takens bifurcations and Bykov cycles may arise even in the case of piecewise constant vector fields.

math.DS↗

Multiple ergodic averages for commuting multiplicative actions

We study the convergence of multiple ergodic averages involving several commuting multiplicative actions. We prove that for finitely generated systems, the averages $$\frac{1}{N}\sum_{n=1}^N S_{1,n}F_1\cdot\ldots\cdot S_{\ell,n}F_\ell$$ converge in norm, settling a conjecture of Frantzikinakis. Our proofs feature tools from ergodic theory and probabilistic number theory. We exploit some stability properties of additive functions to establish a novel variant of \Katai's orthogonality criterion, which leads to box seminorm control for our averages. Using the theory of magic extensions introduced by Host and a delicate complexity reduction argument, we eventually reduce our problem to known convergence results.

math.DS↗

Abelian maximal pattern complexity and extremal words

We study the Abelian maximal pattern complexity $p_{α}^{\ast \mathrm{ab}}(k)$ of infinite words over finite alphabets. For recurrent aperiodic words using exactly $\ell\geq 2$ letters, we prove the sharp lower bound $p_{α}^{\ast \mathrm{ab}}(k)\geq k+\ell-1$ and give a structural characterization of those words attaining equality for every $k\geq 1$. Without assuming recurrence, we prove that an infinite word $α$ is aperiodic if and only if $\binom{p_{α}^{\ast \mathrm{ab}}(k)}{2}\geq k$ for every positive integer $k$. For aperiodic words over $\ell\geq 2$ letters, each occurring infinitely often, we further prove that $p_α^{\ast \mathrm{ab}}(k)\geq m$ whenever $\binom{m}{2}\leq(\ell-1)(k-\ell+2)$, for all positive integers $m,k$. Together with a matching construction, this shows that the minimum Abelian maximal pattern complexity in this class is $\sqrt{2(\ell-1)k}+O_{\ell}(1)$. We call a word an Abelian pattern Sturmian word if, for every positive integer $k$, its Abelian maximal pattern complexity is the least positive integer $m$ satisfying $\binom{m}{2}\geq k$. We show that a word is Abelian pattern Sturmian if and only if, after relabeling its alphabet, it is the characteristic word of an infinite set $E\subset\mathbb{N}_0$ whose bipartite incidence graph is a forest. This graph has two disjoint copies of $\mathbb{N}_0$ as its vertex classes, with a left vertex $r$ adjacent to a right vertex $s$ exactly when $r+s\in E$.

math.DS↗