Search Results - "Pinsky, Ross G."

Refine Results
  1. 1

    Permutations avoiding a pattern of length three under Mallows distributions by Pinsky, Ross G.

    Published in Random structures & algorithms (01-07-2021)
    “…We consider permutations avoiding a pattern of length three under the family of Mallows distributions. In particular, for any pattern τ∈S3∖{321}, we obtain…”
    Get full text
    Journal Article
  2. 2

    The infinite limit of separable permutations by Pinsky, Ross G.

    Published in Random structures & algorithms (01-12-2021)
    “…Let Pnsep denote the uniform probability measure on the set of separable permutations in Sn. Let ℕ∗=ℕ∪{∞} with an appropriate metric and denote by S(ℕ,ℕ∗) the…”
    Get full text
    Journal Article
  3. 3

    Spectral analysis of a class of nonlocal elliptic operators related to Brownian motion with random jumps by Pinsky, Ross G.

    “…Let D\subset R^d be a bounded domain and let \mathcal P(D) denote the space of probability measures on D. Consider a Brownian motion in D which is killed at…”
    Get full text
    Journal Article
  4. 4
  5. 5

    The speed of a random walk excited by its recent history by Pinsky, Ross G.

    Published in Advances in applied probability (01-03-2016)
    “…Let N and M be positive integers satisfying 1≤ M≤ N, and let 0< p0 < p1 < 1. Define a process {Xn}n=0∞ on ℤ as follows. At each step, the process jumps either…”
    Get full text
    Journal Article
  6. 6

    Probabilistic and combinatorial aspects of the card-cyclic to random insertion shuffle by Pinsky, Ross G.

    Published in Random structures & algorithms (01-03-2015)
    “…Consider a permutation σ ∈ Sn as a deck of cards numbered from 1 to n and laid out in a row, where σj denotes the number of the card that is in the j‐th…”
    Get full text
    Journal Article
  7. 7

    Transience, recurrence and the speed of a random walk in a site-based feedback environment by Pinsky, Ross G., Travers, Nicholas F.

    Published in Probability theory and related fields (01-04-2017)
    “…We study a random walk on Z which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, p and q . R…”
    Get full text
    Journal Article
  8. 8

    Ergodic behavior of diffusions with random jumps from the boundary by Ben-Ari, Iddo, Pinsky, Ross G.

    “…We consider a diffusion process on D ⊂ R d , which upon hitting ∂ D , is redistributed in D according to a probability measure depending continuously on its…”
    Get full text
    Journal Article
  9. 9

    Absolute continuity/singularity and relative entropy properties for probability measures induced by diffusions on infinite time intervals by Ben-Ari, Iddo, Pinsky, Ross G.

    “…In this paper we study mutual absolute continuity, finiteness of relative entropy and the possibility of their equivalence for probability measures on C ( [ 0…”
    Get full text
    Journal Article
  10. 10

    Transcience/Recurrence for Normally Reflected Brownian Motion in Unbounded Domains by Pinsky, Ross G.

    Published in The Annals of probability (01-03-2009)
    “…Let $D \subsetneq R^{d}$ be an unbounded domain and let B(t) be a Brownian motion in D with normal reflection at the boundary. We study the…”
    Get full text
    Journal Article
  11. 11

    A probabilistic approach to bounded/positive solutions for Schrödinger operators with certain classes of potentials by Pinsky, Ross G.

    “…Consider the equation {(^*)\qquad \qquad \qquad \qquad \qquad \frac 12\Delta u-Vu=0 \text { in }R^d, \qquad \qquad \qquad \qquad \qquad \qquad } for d\ge 3…”
    Get full text
    Journal Article
  12. 12

    Asymptotics for the heat equation in the exterior of a shrinking compact set in the plane via Brownian hitting times by Pinsky, Ross G.

    “…Let D_{r}=\{x\in R^{2}:|x|\le r\} and let \gamma be a continuous, nonincreasing function on [0,\infty ) satisfying \lim _{t\to \infty }\gamma (t)=0. Consider…”
    Get full text
    Journal Article
  13. 13

    Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns by Pinsky, Ross G.

    Published in Discrete mathematics (01-12-2024)
    “…For η∈S3, let Snav(η) denote the set of permutations in Sn that avoid the pattern η, and let Enav(η) denote the expectation with respect to the uniform…”
    Get full text
    Journal Article
  14. 14

    When the Law of Large Numbers Fails for Increasing Subsequences of Random Permutations by Pinsky, Ross G.

    Published in The Annals of probability (01-03-2007)
    “…Let the random variable $Z_{n,k}$ denote the number of increasing subsequences of length k in a random permutation from $S_{n}$, the symmetric group of…”
    Get full text
    Journal Article
  15. 15

    Two measures of efficiency for the secretary problem with multiple items at each rank by Pinsky, Ross G.

    Published in Advances in applied mathematics (01-09-2024)
    “…For 2≤k∈N, consider the following adaptation of the classical secretary problem. There are k items at each of n linearly ordered ranks. The kn items are…”
    Get full text
    Journal Article
  16. 16

    A PROBABILISTIC APPROACH TO THE LIOUVILLE PROPERTY FOR SCHRÖDINGER OPERATORS WITH AN APPLICATION TO INFINITE CONFIGURATIONS OF BALLS by HESS-GREEN, RACHEL, PINSKY, ROSS G.

    “…Consider the equation (*) $\frac{1} {2}\Delta u - Vu - 0inR^d $ for d≥ 3, where V ≥ 0. One says that the Liouville property holds if the only bounded solution…”
    Get full text
    Journal Article
  17. 17

    The secretary problem with biased arrival order via a Mallows distribution by Pinsky, Ross G.

    Published in Advances in applied mathematics (01-09-2022)
    “…We solve the secretary problem in the case that the ranked items arrive in a statistically biased order rather than in uniformly random order. The bias is…”
    Get full text
    Journal Article
  18. 18
  19. 19
  20. 20