Combinatorial Lévy processes
From MaRDI portal
Publication:1751968
Abstract: Combinatorial Levy processes evolve on general state spaces of countable combinatorial structures. In this setting, the usual Levy process properties of stationary, independent increments are defined in an unconventional way in terms of the symmetric difference operation on sets. In discrete time, the description of combinatorial Levy processes gives rise to the notion of combinatorial random walks. These processes behave differently than random walks and Levy processes on other state spaces. Standard examples include processes on sets, graphs, and n-ary relations, but the framework permits far more general possibilities. The main theorems characterize both finite and infinite state space combinatorial Levy processes by a unique sigma-finite measure. Under the additional assumption of exchangeability, we obtain a more explicit characterization by which every exchangeable combinatorial Levy process corresponds to a Poisson point process on the same state space. Associated behavior of the projection into a space of limiting objects reflects certain structural features of the covering process.
Recommendations
Cites work
- scientific article; zbMATH DE number 3896009 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 6781364 (Why is no real title available?)
- A Markovian Function of a Markov Chain
- A continuum-tree-valued Markov process
- A statistical framework for modern network science
- Additive set-valued Markov processes and graphical methods
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Contact interactions on a lattice
- Discrete temporal models of social networks
- Dynamic random networks and their graph limits
- Edge exchangeable models for interaction networks
- Exchangeable fragmentation-coalescence processes and their equilibrium measures
- Exchangeable graph-valued Feller processes
- Finite exchangeable sequences
- Generalized Markov branching trees
- Graph limits and exchangeable random graphs
- Homogeneous fragmentation processes
- Limits of dense graph sequences
- Probabilistic Symmetries and Invariance Principles
- Pruning Galton-Watson trees and tree-valued Markov processes
- Random Fragmentation and Coagulation Processes
- Random partitions in population genetics
- Real Analysis and Probability
- Regenerative tree growth: structural results and convergence
- Representations for partially exchangeable arrays of random variables
- Restricted exchangeable partitions and embedding of associated hierarchies in continuum random trees
- Subtree prune and regraft: a reversible real tree-valued Markov process
- The coalescent
- The cut-and-paste process
- The sampling theory of selectively neutral alleles
- The ubiquitous Ewens sampling formula
- Time-varying network models
- Tree-valued Markov chains derived from Galton-Watson processes
Cited in
(3)
This page was built for publication: Combinatorial Lévy processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751968)