中文
相关论文

相关论文: The time evolution of permutations under random st…

200 篇论文

In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…

概率论 · 数学 2018-01-30 Enes Ozel

We examine the distribution and popularity of different parameters (such as the number of descents, runs, valleys, peaks, right-to-left minima, and more) on the sets of increasing and flattened permutations. For each parameter, we provide…

组合数学 · 数学 2024-10-22 Jean-Luc Baril , José L. Ramírez

This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…

组合数学 · 数学 2016-11-10 Robertas Petuchovas

The unitary time evolution of a critical quantum spin chain with an impurity is calculated, and the entanglement evolution is shown. Moreover, we show that the reduced density matrix of a part of the chain evolves such that the fidelity of…

量子物理 · 物理学 2007-05-23 Stein Olav Skrøvseth

We investigate the time evolution of entanglement in a process where a mobile particle is scattered by static spins. We show that entanglement increases monotonically during a transient and then saturates to a steady-state value. For a…

量子物理 · 物理学 2015-05-13 F. Ciccarello , M. Paternostro , G. M. Palma , M. Zarcone

Multisets are like sets, except that they can contain multiple copies of their elements. If there are $n_i$ copies of $i$, $1\leq i\leq t$, in multiset $M_t$, then there are $\binom{n_1+\cdots+n_t}{n_1,\ldots, n_t}$ possible permutations of…

概率论 · 数学 2026-02-17 Dudley Stark

We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…

概率论 · 数学 2014-11-10 Ágnes Backhausz , Tamás F. Móri

Homogeneous fragmentations describe the evolution of a unit mass that breaks down randomly into pieces as time passes. They can be thought of as continuous time analogs of a certain type of branching random walks, which suggests the use of…

概率论 · 数学 2007-05-23 Jean Bertoin , Alain Rouault

The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…

概率论 · 数学 2013-10-28 Valentin Féray

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…

组合数学 · 数学 2009-09-30 Emeric Deutsch , Sergi Elizalde

Starting with a collection of $n$ oriented polygonal discs, with an even number $N$ of sides in total, we generate a random oriented surface by randomly matching the sides of discs and properly gluing them together. Encoding the surface in…

组合数学 · 数学 2015-03-09 Sergei Chmutov , Boris Pittel

We study the time evolution of an atom suddenly coupled to a thermal radiation field. As a simplified model of the atom-electromagnetic field system we use a system composed by a harmonic oscillator linearly coupled to a scalar field in the…

统计力学 · 物理学 2007-05-23 G. Flores-Hidalgo

We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path of a decreasing Markov chain on $n$ integers. Under certain…

概率论 · 数学 2012-05-04 Alexander Gnedin , Alexander Iksanov , Alexander Marynych

Let $A$ be a set of natural numbers and let $S_{n,A}$ be the set of all permutations of $[n]=\{1,2,...,n\}$ with cycle lengths belonging to $A$. For $A(n)=A\cap [n]$, the limit $\rho=\lim_{n\to\infty}\mid A(n)\mid/n$ (if it esists) is…

组合数学 · 数学 2021-10-05 Ljuben Mutafchiev

Consider a random permutation of $kn$ objects that permutes $n$ disjoint blocks of size $k$ and then permutes elements within each block. Normalizing its cycle lengths by $kn$ gives a random partition of unity, and we derive the limit law…

组合数学 · 数学 2026-01-06 Nathan Tung

Consider a supercritical birth and death process where the children acquire mutations. We study the mutation rates along the ancestral lineages in a sample of size $n$ from the population at time $T$. The mutation rate is time-inhomogenous…

概率论 · 数学 2024-02-27 Yubo Shuai

We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…

概率论 · 数学 2018-06-14 Nicolas Robles , Dirk Zeindler

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

概率论 · 数学 2009-07-15 Olivier Raimond , Bruno Schapira

The near membrane layer is defined as a region where the concentration of the substance transported across the membrane drops $k$ times. The time evolution of such a layer is studied experimentally by means of the laser interferometric…

凝聚态物理 · 物理学 2007-05-23 Kazimierz Dworecki , Tadeusz Kosztolowicz , Slawomir Wasik , Stanislaw Mrowczynski

This is a review of group entropy and its application to permutation complexity. Specifically we revisit a new approach to the notion of complexity in time serie analysis, based on both permutation entropy and group entropy. As a result,…

数学物理 · 物理学 2024-01-24 José M. Amigó , Roberto Dale , Piergiulio Tempesta