Zobrazeno 1 - 10
of 523
pro vyhledávání: '"jain, Vishesh"'
Publikováno v:
Comptes Rendus. Mathématique, Vol 361, Iss G5, Pp 869-876 (2023)
Let $G = (V,E)$ be an undirected graph with maximum degree $\Delta $ and vertex conductance $\Psi ^*(G)$. We show that there exists a symmetric, stochastic matrix $P$, with off-diagonal entries supported on $E$, whose spectral gap $\gamma ^*(P)$ sati
Externí odkaz:
https://doaj.org/article/1b48c082c99f43eab47c474704726d42
Autor:
Jain, Vishesh, Sawhney, Mehtaab
Consider shuffling a deck of $n$ cards, labeled $1$ through $n$, as follows: at each time step, pick one card uniformly with your right hand and another card, independently and uniformly with your left hand; then swap the cards. How long does it take
Externí odkaz:
http://arxiv.org/abs/2410.23944
Autor:
Jain, Vishesh, Mizgerd, Clayton
Let $G = (V,E)$ be a graph on $n$ vertices and let $m^*(G)$ denote the size of a maximum matching in $G$. We show that for any $\delta > 0$ and for any $1 \leq k \leq (1-\delta)m^*(G)$, the down-up walk on matchings of size $k$ in $G$ mixes in time p
Externí odkaz:
http://arxiv.org/abs/2408.03466
Consider a bipartite quantum system, where Alice and Bob jointly possess a pure state $|\psi\rangle$. Using local quantum operations on their respective subsystems, and unlimited classical communication, Alice and Bob may be able to transform $|\psi\
Externí odkaz:
http://arxiv.org/abs/2406.03335
We present an explicit subset $A\subseteq \mathbb{N} = \{0,1,\ldots\}$ such that $A + A = \mathbb{N}$ and for all $\varepsilon > 0$, \[\lim_{N\to \infty}\frac{\big|\big\{(n_1,n_2): n_1 + n_2 = N, (n_1,n_2)\in A^2\big\}\big|}{N^{\varepsilon}} = 0.\] T
Externí odkaz:
http://arxiv.org/abs/2405.08650
Autor:
Bitesh Kumar, Kaushal Kulkarni, Dhua Anjan Kumar, Goel Prabudh, Yadav Devendra Kumar, Jain Vishesh, Agarwala Sandeep, Kaur Kavneet, Kandasamy Devasenathipathy
Publikováno v:
Journal of Indian Association of Pediatric Surgeons, Vol 29, Iss 6, Pp 589-595 (2024)
Background: Intranodal hemangiomas are rare benign vascular tumors of the lymph nodes, often misdiagnosed as malignant lymphadenopathies due to their clinical and radiological features. This case report and systematic review aim to elucidate the epid
Externí odkaz:
https://doaj.org/article/14d557b050f641aa82848b5a1856b775
We study Glauber dynamics for sampling from discrete distributions $\mu$ on the hypercube $\{\pm 1\}^n$. Recently, techniques based on spectral independence have successfully yielded optimal $O(n)$ relaxation times for a host of different distributio
Externí odkaz:
http://arxiv.org/abs/2307.10466
For a finite graph $F$ and a value $p \in [0,1]$, let $I(F,p)$ denote the largest $y$ for which there is a sequence of graphs of edge density approaching $p$ so that the induced $F$-density of the sequence approaches $y$. We show that for all $F$ on
Externí odkaz:
http://arxiv.org/abs/2306.13014
Let $G$ be a graph on $n$ vertices of maximum degree $\Delta$. We show that, for any $\delta > 0$, the down-up walk on independent sets of size $k \leq (1-\delta)\alpha_c(\Delta)n$ mixes in time $O_{\Delta,\delta}(k\log{n})$, thereby resolving a conj
Externí odkaz:
http://arxiv.org/abs/2305.06198
Autor:
Jain, Vishesh, Pham, Huy Tuan
We show that the threshold for the binomial random $3$-partite, $3$-uniform hypergraph $G^{3}((n,n,n),p)$ to contain a Latin square is $\Theta(\log{n}/n)$. We also prove analogous results for Steiner triple systems and proper list edge-colorings of t
Externí odkaz:
http://arxiv.org/abs/2212.06109