Related papers: A note on the run length function for intermittenc…

In this paper, we consider finitely many interval maps simultaneously acting on the unit interval $I = [0, 1]$ in the real line $\mathbb{R}$; each with utmost finitely many jump discontinuities and study certain important statistical…

An L- sequence of a graph $G $ is a sequence of distinct vertices $S = \{v_1, ... , v_k\}$ such that $N[v_i] \setminus \cup_{j=1}^{i-1} N(v_j) \neq \emptyset$. The length of the longest L-sequence is called the L-Grundy domination number,…

An odd hole in a graph is a induced cycle with odd length greater than 3. In an earlier paper (with Sophie Spirkl), solving a longstanding open problem, we gave a polynomial-time algorithm to test if a graph has an odd hole. We subsequently…

We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of the results of Kahn, Galvin and Tetali, and Zhao showing…

We study a delay-sensitive information flow problem where a source streams information to a sink over a directed graph G(V,E) at a fixed rate R possibly using multiple paths to minimize the maximum end-to-end delay, denoted as the…

We consider linear iterated function systems with a random multiplicative error on the real line. Our system is $\{x\mapsto d_i + \lambda_i Y x\}_{i=1}^m$, where $d_i\in \R$ and $\lambda_i>0$ are fixed and $Y> 0$ is a random variable with…

We consider a nearest neighbor random walk on the one-dimensional integer lattice with drift towards the origin determined by an asymptotically vanishing function of the number of visits to zero. We show the existence of distinct regimes…

We prove a deviation bound for the maximum of partial sums of functions of $\alpha$-dependent sequences as defined in Dedecker, Gou{\"e}zel and Merlev{\`e}de (2010). As a consequence, we extend the Rosenthal inequality of Rio (2000) for…

Consider continuous-time random walks on Cayley graphs where the rate assigned to each edge depends only on the corresponding generator. We show that the limiting speed is monotone increasing in the rates for infinite Cayley graphs that…

For random maps, the expected value of the order (i.e. the period of the sequence of compositional iterates) is approximated asymptotically. It is much smaller than the expected value for the product of the cycle lengths.

Let $ ([0,1]^d,T,\mu) $ be a measure-preserving dynamical system so that the correlations decay exponentially for H\"older continuous functions. Suppose that $ \mu $ is absolutely continuous with a density function $ h\in L^q(\mathcal L^d)…

Let $(X,T,\mu,d)$ be a metric measure-preserving system for which $3$-fold correlations decay exponentially for Lipschitz continuous observables. Suppose that $(M_k)$ is a sequence satisfying some weak decay conditions and suppose there…

In their recent paper [8], G.Hata and the fourth author first gave an example of random iterations of two piecewise linear interval maps without (deterministic) indifferent periodic points for which the arcsine law -- a characterization of…

We consider a random $N$-step polymer under the influence of an attractive interaction with the origin and derive a limit law -- after suitable shifting and norming -- for the length of the longest excursion towards the Gumbel distribution.…

Data consisting of a graph with a function mapping into $\mathbb{R}^d$ arise in many data applications, encompassing structures such as Reeb graphs, geometric graphs, and knot embeddings. As such, the ability to compare and cluster such…

We compute the limiting distributions of the lengths of the longest monotone subsequences of random (signed) involutions with or without conditions on the number of fixed points (and negated points) as the sizes of the involutions tend to…

This is my PhD thesis which was defended in May 2021. We call an induced cycle of length at least four a hole. The parity of a hole is the parity of its length. Forbidding holes of certain types in a graph has deep structural implications.…

In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side information represented by a graph G. The objective is to…

This paper demonstrates a duality between the non-robustness of polynomial time dimension and the existence of one-way functions. Polynomial-time dimension (denoted $\mathrm{cdim}_\mathrm{P}$) quantifies the density of information of…

For each integer $t\ge 5$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $t$ and odd.