S. Fried

activity

20192025

α

-lazy version of Markov chains in estimation and testing problems

2 citations · 5 across the 19 of their papers we have counts for

collaborators

19 papers

math.CO2025

Counting k-ary words by number of adjacency differences of a prescribed size

Sela Fried, Toufik Mansour, Mark Shattuck

Recently, the general problem of enumerating permutations $π = π_{1} \dots π_{n}$ such that $π_{i + r} - π_{i} \neq = s$ for all $1 \leq i \leq n - r$ , where $r$ and $s$ are fixed, was considered by…

math.CO2024

Counting $r \times s$ rectangles in (Catalan) words

Sela Fried, Toufik Mansour

Generalizing previous results, we introduce and study a new statistic on words, that we call rectangle capacity. For two fixed positive integers $r$ and $s$ , this statistic counts…

math.CO2023

Staircase graph words

Sela Fried, Toufik Mansour

Generalizing the notion of staircase words, introduced by Knopfmacher et.\ al, we define staircase graph words. These are functions $w$ from the vertex set $V$ of a graph into the…

math.CO2023

The total number of descents and levels in tensor words and cyclic tensor words

Sela Fried, Toufik Mansour

We obtain an explicit formula for the total number of descents and levels in tensor words and cyclic tensor words of arbitrary dimension. We also establish the exact maximal number…

math.CO2023

On the maximal sum of the entries of a matrix power

Sela Fried, Toufik Mansour

Let $p_{n}$ be the maximal sum of the entries of $A^{2}$ , where $A$ is a square matrix of size $n$ , consisting of the numbers $1, 2, \dots, n^{2}$ , each appearing exactly once. We prove th…

math.CO2023★ 1 cited

Random Walk Labelings of Perfect Trees and Other Graphs

Sela Fried, Toufik Mansour

A Random walk labeling of a graph $G$ is any labeling of $G$ that could have been obtained by performing a random walk on $G$ . Continuing two recent works, we calculate the number…

math.CO2023

Further Results on Random Walk Labelings

Sela Fried, Toufik Mansour

Recently, we initiated the study of random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that each vertex i…

math.CO2023

Graph Labelings Obtainable by Random Walks

Sela Fried, Toufik Mansour

We initiate the study of what we refer to as random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that the…

math.HO2022

Equivalent conditions for the $n$ th element of the Beatty sequence $B_{2}$ being even

Sela Fried

We provide equivalent conditions for the $n$ th element of the Beatty sequence $B_{2}$ being even. In particular, we show that the integer sequences A090892 and A120752 in th…

math.CO2022

On a conjecture of McNeil

Sela Fried

Suppose that the $n^{2}$ vertices of the grid graph $P_{n}^{2}$ are labeled, such that the set of their labels is ${1, 2, \dots, n^{2}}$ . The labeling induces a walk on $P_{n}^{2}$ , beginning…

math.CO2022

The minimal sum of squares over partitions with a nonnegative rank

Sela Fried

Motivated by a question of Defant and Propp (2020) regarding the connection between the degrees of noninvertibility of functions and those of their iterates, we address the combina…

math.CO2022

The expected degree of noninvertibility of compositions of functions and a related combinatorial identity

Sela Fried

Recently, Defant and Propp [2020] defined the degree of noninvertibility of a function $f : X \to Y$ between two finite nonempty sets by $\text{deg}(f)=\frac{1}{|X|}\sum_{x\in X…

math.CO2021

On the coefficients of the distinct monomials in the expansion of $x_{1} (x_{1} + x_{2}) \dots (x_{1} + x_{2} + \dots + x_{n})$

Sela Fried

We initiate the study of the coefficients of the distinct monomials in the expansion of the multivariate polynomials $x_{1} (x_{1} + x_{2}) \dots (x_{1} + x_{2} + \dots + x_{n}), n \in N$ . In particular…

math.NT2021

$Θ$ -Hilbertianity and strong $Θ$ -Hilbertianity

Sela Fried, Dan Haran

$Θ$ -Hilbertianity and its strengthening, strong $Θ$ -Hilbertianity, are two generalizations of Hilbertianity inspired by Jarden's definition of $p$ -Hilbertianity and strong $p$ -Hilb…

math.PR2021

The restrictiveness of the hazard rate order and the moments of the maximal coordinate of a random vector uniformly distributed on the probability n-simplex

Sela Fried

Continuing the work of [9] who defined the restrictiveness of stochastic orders and calculated the restrictiveness of the usual stochastic order and the likelihood ratio order, we…

stat.ML2021★ 2 cited

On the $α$ -lazy version of Markov chains in estimation and testing problems

Sela Fried, Geoffrey Wolfer

Given access to a single long trajectory generated by an unknown irreducible Markov chain $M$ , we simulate an $α$ -lazy version of $M$ which is ergodic. This enables us to generaliz…

math.ST2021★ 2 cited

Identity testing of reversible Markov chains

Sela Fried, Geoffrey Wolfer

We consider the problem of identity testing of Markov chain transition matrices based on a single trajectory of observations under the distance notion introduced by Daskalakis et a…

math.PR2020

On the restrictiveness of the hazard rate order

S. Fried

Every element $θ = (θ_{1}, \dots, θ_{n})$ of the probability $n$ -simplex induces a probability distribution $P_{θ}$ of a random variable $X$ that can assume only a finite number of real val…

math.PR2019

The probability that two random points on the $n$ -probability simplex are comparable with respect to the first order stochastic dominance and the monotone likelihood ratio partial orders

Sela Fried

First order stochastic dominance and monotone likelihood ratio are two partial orders on the $n$ -probability simplex that play an important role in the establishment of structural…

Counting k-ary words by number of adjacency differences of a prescribed size

Counting r×s rectangles in (Catalan) words

Staircase graph words

The total number of descents and levels in tensor words and cyclic tensor words

On the maximal sum of the entries of a matrix power

Random Walk Labelings of Perfect Trees and Other Graphs

Further Results on Random Walk Labelings

Graph Labelings Obtainable by Random Walks

Equivalent conditions for the nth element of the Beatty sequence B2​​ being even

On a conjecture of McNeil

The minimal sum of squares over partitions with a nonnegative rank

The expected degree of noninvertibility of compositions of functions and a related combinatorial identity

On the coefficients of the distinct monomials in the expansion of x1​(x1​+x2​)⋯(x1​+x2​+⋯+xn​)

Θ-Hilbertianity and strong Θ-Hilbertianity

The restrictiveness of the hazard rate order and the moments of the maximal coordinate of a random vector uniformly distributed on the probability n-simplex

On the α-lazy version of Markov chains in estimation and testing problems

Identity testing of reversible Markov chains

On the restrictiveness of the hazard rate order

The probability that two random points on the n-probability simplex are comparable with respect to the first order stochastic dominance and the monotone likelihood ratio partial orders

Counting $r \times s$ rectangles in (Catalan) words

Equivalent conditions for the $n$ th element of the Beatty sequence $B_{2}$ being even

On the coefficients of the distinct monomials in the expansion of $x_{1} (x_{1} + x_{2}) \dots (x_{1} + x_{2} + \dots + x_{n})$

$Θ$ -Hilbertianity and strong $Θ$ -Hilbertianity

On the $α$ -lazy version of Markov chains in estimation and testing problems

The probability that two random points on the $n$ -probability simplex are comparable with respect to the first order stochastic dominance and the monotone likelihood ratio partial orders