Variations on Hammersley's interacting particle process

DOI10.47443/DML.2021.0049MaRDI QIDQ6370842arXivFDO

Authors Arda Atalik, H. S. Melihcan Erol, Gökhan Yıldırım, Mustafa Harun Yılmaz

Publication date 21 June 2021

Published in arXiv

Full work available at URL https://doi.org/10.47443/DML.2021.0049

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

arXiv classification

cs.DMmath.PR

Abstract: The longest increasing subsequence problem for permutations has been studied extensively in the last fifty years. The interpretation of the longest increasing subsequence as the longest 21-avoiding subsequence in the context of permutation patterns leads to many interesting research directions. We introduce and study the statistical properties of Hammersleytype interacting particle processes related to these generalizations and explore the finer structures of their distributions. We also propose three different interacting particle systems in the plane analogous to the Hammersley process in one dimension and obtain estimates for the asymptotic orders of the mean and variance of the number of particles in the systems.

This page was built for publication: Variations on Hammersley's interacting particle process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6370842)