SearcharxivSearch

arXiv subjects

Parthanil Roy

Publications and source records attributed to Parthanil Roy.

At least 19 recordsLinked to original sources

A Statistical Framework for Learning Preferences from the Past

In many real-world settings such as online recommendation or consumer choice modeling, individuals make repeated choices from a fixed set of options. Accurately estimating their underlying preferences is essential for generating personalized future recommendations. Probabilistic models for understanding user choice behavior from past decisions can serve as a valuable addition to existing recommender systems and choice prediction methods. To this end, in this article, we introduce a novel statistical framework for predicting user preferences based on their past choices, under a natural monotonicity assumption: options that were chosen more frequently or more intensely in the past are more likely to be chosen again in the future. Our approach builds on a parametric model proposed by Le Goff and Soulier (2017), originally used to describe how ants in an ant colony select a path among many pre-existing paths. We propose a non-parametric generalization of this model, drawing inspiration from the generalized elephant random walk introduced by Maulik et al. (2024). We develop a method of maximum likelihood estimation of the user preference probabilities under the above-mentioned monotonicity constraint. We also derive theoretical guarantees for our estimator and demonstrate the effectiveness of our method through both simulated experiments and real-world datasets.

stat.ME

Phase Transitions for Elephant Random Walks with Two memory Channels

Elephant random walk, introduced to study the effect of memory on random walks, is a novel type of walk that incorporates the information of one randomly chosen past step to determine the future step. However, memory of a process can be multifaceted and can arise due to interactions of more than one underlying phenomena. To model this, random walks with multiple memory channels were introduced in the statistical physics literature by Saha (2022) - here the information on a bunch of independently chosen past steps is needed to decide the future step. With the help of variance heuristics, this work analyzed the two-channel case and predicted a double phase transition: from diffusive to superdiffusive and from superdiffusive to ballistic regimes. We prove these conjectures rigorously (with some corrections), discover a mildly superdiffusive regime at one of the conjectured transition boundaries, and observe a new second-order phase transition. We also carry out a detailed investigation of the asymptotic behavior of the walk at different regimes.

math.PR

Asymptotic Properties of Generalized Elephant Random Walks

Elephant random walk is a special type of random walk that incorporates the memory of the past to determine its future steps. The probability of this walk taking a particular step (+1 or -1) at a time point, conditioned on the entire history, depends on a linear function of the proportion of steps of that type till that time point. In this work, we consider a generalization of the elephant random walk where we investigate how the dynamics of the random walk will change if we replace this linear function with a generic map satisfying some analytic conditions. We propose a new model, called the multidimensional generalized elephant random walk, that includes several variants of elephant random walk in one and higher dimensions and generalizations thereof. Using tools from the theory of stochastic approximation, we derive the asymptotic behavior of our model leading to newer results on the phase transition boundary between diffusive and non-diffusive regimes. In the process, we extend some results on one-dimensional stochastic approximation process, which can be of independent interest. We also mention a few open problems in this context.

math.PR

Mixing Properties of Stable Random Fields Indexed by Amenable and Hyperbolic Groups

We show that any stationary symmteric $\alpha$-stable ($S\alpha S$) random field indexed by a countable amenable group $G$ is weakly mixing if and only if it is generated by a null action, extending works of Samorodnitsky and Wang-Roy-Stoev for abelian groups to all amenable groups. This enables us to improve significantly the domain of a recently discovered connection to von Neumann algebras. We also establish ergodicity of stationary $S\alpha S$ fields associated with boundary and double boundary actions of a hyperbolic group $G$, where the boundary is equipped with either the Patterson-Sullivan or the hitting measure of a random walk, and the double boundary is equipped with the Bowen-Margulis-Sullivan measure.

math.PR

Group measure space construction, ergodicity and $W^\ast$-rigidity for stable random fields

This work discovers a novel link between probability theory (of stable random fields) and von Neumann algebras. It is established that the group measure space construction corresponding to a minimal representation is an invariant of a stationary symmetric $\alpha$-stable (S$\alpha$S) random field indexed by any countable group $G$. When $G=\mathbb{Z}^d$, we characterize ergodicity (and also absolute non-ergodicity) of stationary S$\alpha$S fields in terms of the central decomposition of this crossed product von Neumann algebra coming from any (not necessarily minimal) Rosinski representation. This shows that ergodicity (or the complete absence of it) is a $W^\ast$-rigid property (in a suitable sense) for this class of fields. All our results have analogues for stationary max-stable random fields as well.

math.PR

Branching random walk with infinite progeny mean: a tale of two tails

We study the extremes of branching random walks under the assumption that the underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or they have lighter tails. In the regularly varying case, it is shown that the point process sequence of normalized extremes converges to a Poisson random measure. We study the asymptotics of the scaled position of the rightmost particle in the $n$-th generation when the tail of the displacement behaves like $\exp(-K(x))$, where either $K$ is a regularly varying function of index $r> 0$, or $K$ has an exponential growth. We identify the exact scaling of the maxima in all cases and show the existence of a non-trivial limit when $r> 1$.

math.PR

Continued fractions, the Chen-Stein method and extreme value theory

In this work, we deal with extreme value theory in the context of continued fractions using techniques from probability theory, ergodic theory and real analysis. We give an upper bound for the rate of convergence in the Doeblin-Iosifescu asymptotics for the exceedances of digits obtained from the regular continued fraction expansion of a number chosen randomly from $(0,1)$ according to the Gauss measure. As a consequence, we significantly improve the best known upper bound on the rate of convergence of the maxima in this case. We observe that the asymptotics of order statistics and the extremal point process can also be investigated using our methods.

math.PR

Maximal Moments and Uniform Modulus of Continuity for Stable Random Fields

In this work, we solve an open problem mentioned in Xiao (2010) and provide sharp bounds on the rate of growth of maximal moments for stationary symmetric stable random fields using structure theorem of finitely generated abelian groups and ergodic theory of quasi-invariant group actions. We also investigate the relationship between this rate of growth and the path regularity properties of self-similar stable random fields with stationary increments, and establish uniform modulus of continuity of such fields. In the process, a new notion of weak effective dimension is introduced for stable random fields and is connected to maximal moments and path properties. Our results establish a boundary between shorter and longer memory in relation to Holder continuity of S alpha S random fields confirming a conjecture of Samorodnitsky (2004).

math.PR

Stable Random Fields, Patterson-Sullivan measures and Extremal Cocycle Growth

We study extreme values of group-indexed stable random fields for discrete groups $G$ acting geometrically on spaces $X$ in the following cases: 1) $G$ acts freely, properly discontinuously by isometries on a CAT(-1) space $X$, 2) $G$ is a lattice in a higher rank Lie group, acting on a symmetric space $X$, 3) $G$ is the mapping class group of a surface acting on its Teichmuller space. The connection between extreme values and the geometric action is mediated by the action of the group $G$ on its limit set equipped with the Patterson-Sullivan measure. Based on motivation from extreme value theory, we introduce an invariant of the action called extremal cocycle growth which measures the distortion of measures on the boundary in comparison to the movement of points in the space $X$ and show that its non-vanishing is equivalent to finiteness of the Bowen-Margulis measure for the associated unit tangent bundle $U(X/G)$ provided $X/G$ has non-arithmetic length spectrum. As a consequence, we establish a dichotomy for the growth-rate of a partial maxima sequence of stationary symmetric $\alpha$-stable ($0 < \alpha < 2$) random fields indexed by groups acting on such spaces. We also establish analogous results for normal subgroups of free groups.

math.DS

Extremes of Multi-type Branching Random Walks: Heaviest Tail Wins

We consider a branching random walk on a multi($Q$)-type, supercritical Galton-Watson tree which satisfies Kesten-Stigum condition. We assume that the displacements associated with the particles of type $Q$ have regularly varying tails of index $α$, while the other types of particles have lighter tails than that of particles of type $Q$. In this article, we derive the weak limit of the sequence of point processes associated with the positions of the particles in the $n^{th}$ generation. We verify that the limiting point process is a randomly scaled scale-decorated Poisson point process (SScDPPP) using the tools developed in \cite{bhattacharya:hazra:roy:2016}. As a consequence, we shall obtain the asymptotic distribution of the position of the rightmost particle in the $n^{th}$ generation.

math.PR

A large sample test for the length of memory of stationary symmetric stable random fields via nonsingular $\mathbb{Z}^d$-actions

Based on the ratio of two block maxima, we propose a large sample test for the length of memory of a stationary symmetric $α$-stable discrete parameter random field. We show that the power function converges to one as the sample-size increases to infinity under various classes of alternatives having longer memory in the sense of Samorodnitsky(2004). Ergodic theory of nonsingular $\mathbb{Z}^d$-actions play a very important role in the design and analysis of our large sample test.

math.PR

Stable random fields indexed by finitely generated free groups

In this work, we investigate the extremal behaviour of left-stationary symmetric $α$-stable (S$α$S) random fields indexed by finitely generated free groups. We begin by studying the rate of growth of a sequence of partial maxima obtained by varying the indexing parameter of the field over balls of increasing size. This leads to a phase-transition that depends on the ergodic properties of the underlying nonsingular action of the free group but is different from what happens in the case of S$α$S random fields indexed by $\mathbb{Z}^d$. The presence of this new dichotomy is confirmed by the study of a stable random field induced by the canonical action of the free group on its Furstenberg-Poisson boundary with the measure being Patterson-Sullivan. This field is generated by a conservative action but its maxima sequence grows as fast as the i.i.d. case contrary to what happens in the case of $\mathbb{Z}^d$. When the action of the free group is dissipative, we also establish that the scaled extremal point process sequence converges weakly to a novel class of point processes that we have termed as randomly thinned cluster Poisson processes. This limit too is very different from that in the case of a lattice.

math.PR

Maxima of stable random fields, nonsingular actions and finitely generated abelian groups: A survey

This is a self-contained introduction to the applications of ergodic theory of nonsingular (also known as quasi-invariant) group actions and the structure theorem for finitely generated abelian groups on the extreme values of stationary symmetric stable random fields indexed by $\mathbb{Z}^d$. It is based on a mini course given in the Eighth Lectures on Probability and Stochastic Processes (held in the Bangalore Centre of Indian Statistical Institute during December 6-10, 2013) except that a few recent references have been added in the concluding part. This article is a survey of existing work and the proofs are therefore skipped or briefly outlined.

math.PR

Branching Random Walks, Stable Point Processes and Regular Variation

Using the language of regular variation, we give a sufficient condition for a point process to be in the superposition domain of attraction of a strictly stable point process. This sufficient condition is then used to obtain an explicit representation of the weak limit of a sequence of point processes induced by a branching random walk with jointly regularly varying displacements. As a consequence, we extend the main result of Durrett (1983) and verify that two related predictions of Brunet and Derrida (2011) remain valid for this model.

math.PR

Point process convergence for branching random walks with regularly varying steps

We consider the limiting behaviour of the point processes associated with a branching random walk with supercritical branching mechanism and balanced regularly varying step size. Assuming that the underlying branching process satisfies Kesten-Stigum condition, it is shown that the point process sequence of properly scaled displacements coming from the n-th generation converges weakly to a Cox cluster process. In particular, we establish that a conjecture of Brunet and Derrida (2011) remains valid in this setup, investigate various other issues mentioned in their paper and recover the main result of Durrett (1983) in our framework.

math.PR

Stable Random Fields, Point Processes and Large Deviations

We investigate the large deviation behaviour of a point process sequence based on a stationary symmetric stable non-Gaussian discrete-parameter random field using the framework of Hult and Samorodnitsky (2010). Depending on the ergodic theoretic and group theoretic structures of the underlying nonsingular group action, we observe different large deviation behaviours of this point process sequence. We use our results to study the large deviations of various functionals (e.g., partial sum, maxima, etc.) of stationary symmetric stable fields.

math.PR

Maximum eigenvalue of symmetric random matrices with dependent heavy tailed entries

This paper deals with symmetric random matrices whose upper diagonal entries are obtained from a linear random field with heavy tailed noise. It is shown that the maximum eigenvalue and the spectral radius of such a random matrix with dependent entries converge to the Frechét distribution after appropriate scaling. This extends a seminal result of Soshnikov(2004) when the tail index is strictly less than one.

math.PR

Ergodic properties of sum- and max-stable stationary random fields via null and positive group actions

We establish characterization results for the ergodicity of stationary symmetric $α$-stable (S$α$S) and $α$-Frechet random fields. We show that the result of Samorodnitsky [Ann. Probab. 33 (2005) 1782-1803] remains valid in the multiparameter setting, that is, a stationary S$α$S ($0<α<2$) random field is ergodic (or, equivalently, weakly mixing) if and only if it is generated by a null group action. Similar results are also established for max-stable random fields. The key ingredient is the adaption of a characterization of positive/null recurrence of group actions by Takahashi [Kodai Math. Sem. Rep. 23 (1971) 131-143], which is dimension-free and different from the one used by Samorodnitsky.

math.PR