Search results for "60C05"

showing 4 items of 4 documents

Adjacency matrices of random digraphs: singularity and anti-concentration

2017

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability at least $1-C\ln^{3} d/\sqrt{d}$ for $C\leq d\leq cn/\ln^2 n$, where $c, C$ are positive absolute constants. To this end, we establish a few properties of $d$-regular directed graphs. One of them, a Littlewood-Offord type anti-concentration property, is of independent interest. Let $J$ be a subset of vertices of $G$ with $|J|\approx n/d$. Let $\delta_i$ be the indicator of the event that the vertex $i$ is connected to $J$ and define $\delta = (\delta_1, …

0102 computer and information sciences01 natural scienceslittlewood–offord theory60C05 60B20 05C80 15B52 46B06law.inventionCombinatoricsSingularityanti-concentrationlawFOS: MathematicsMathematics - CombinatoricsAdjacency matrix0101 mathematicsMathematicsinvertibility of random matricesApplied Mathematics010102 general mathematicsProbability (math.PR)random regular graphsDirected graphsingular probabilityGraphVertex (geometry)Invertible matrix010201 computation theory & mathematicsadjacency matricesCombinatorics (math.CO)Mathematics - ProbabilityAnalysis
researchProduct

Variable Length Memory Chains: Characterization of stationary probability measures

2021

Variable Length Memory Chains (VLMC), which are generalizations of finite order Markov chains, turn out to be an essential tool to modelize random sequences in many domains, as well as an interesting object in contemporary probability theory. The question of the existence of stationary probability measures leads us to introduce a key combinatorial structure for words produced by a VLMC: the Longest Internal Suffix. This notion allows us to state a necessary and sufficient condition for a general VLMC to admit a unique invariant probability measure. This condition turns out to get a much simpler form for a subclass of VLMC: the stable VLMC. This natural subclass, unlike the general case, enj…

Statistics and ProbabilityPure mathematicsLongest Internal SuffixStationary distributionMarkov chain60J05 60C05 60G10Probability (math.PR)010102 general mathematics01 natural sciencesMeasure (mathematics)Variable Length Memory Chains010104 statistics & probabilityProbability theoryConvergence of random variablesFOS: MathematicsCountable setState spaceRenewal theory[MATH]Mathematics [math]0101 mathematicsstable context treessemi-Markov chainsMathematics - Probabilitystationary probability measureMathematicsBernoulli
researchProduct

A PHASE TRANSITION FOR LARGE VALUES OF BIFURCATING AUTOREGRESSIVE MODELS

2019

We describe the asymptotic behavior of the number $$Z_n[a_n,\infty )$$ of individuals with a large value in a stable bifurcating autoregressive process, where $$a_n\rightarrow \infty $$ . The study of the associated first moment is equivalent to the annealed large deviation problem of an autoregressive process in a random environment. The trajectorial behavior of $$Z_n[a_n,\infty )$$ is obtained by the study of the ancestral paths corresponding to the large deviation event together with the environment of the process. This study of large deviations of autoregressive processes in random environment is of independent interest and achieved first. The estimates for bifurcating autoregressive pr…

Statistics and Probability[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Phase transitionrandom environmentGeneral Mathematicsmedia_common.quotation_subjectmoderate deviationslimit-theoremsmarkov-chainsStatistics::Other StatisticsBranching processdeviation inequalities92D2501 natural sciencesAsymmetry010104 statistics & probability[MATH.MATH-ST]Mathematics [math]/Statistics [math.ST]Convergence (routing)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Applied mathematics60C05[MATH]Mathematics [math]0101 mathematicsautoregressive process60J20lawMathematicsBranching processmedia_commonEvent (probability theory)parametersconvergenceMarkov chain010102 general mathematics[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Large deviationslarge deviations Mathematics Subject Classification (2010): 60J8060K37Autoregressive modelcellsLarge deviations theoryStatistics Probability and Uncertaintyasymmetry60F10
researchProduct

Characterization of stationary probability measures for Variable Length Markov Chains

2020

By introducing a key combinatorial structure for words produced by a Variable Length Markov Chain (VLMC), the longest internal suffix, precise characterizations of existence and uniqueness of a stationary probability measure for a VLMC chain are given. These characterizations turn into necessary and sufficient conditions for VLMC associated to a subclass of probabilised context trees: the shift-stable context trees. As a by-product, we prove that a VLMC chain whose stabilized context tree is again a context tree has at most one stationary probability measure.

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR][MATH.MATH-PR] Mathematics [math]/Probability [math.PR]60J05 60C05 60G10Probability (math.PR)FOS: MathematicsMathematics - Probability
researchProduct