arXiv subjects

Mohammad Sharifi

Publications and source records attributed to Mohammad Sharifi.

6 recordsLinked to original sources

arXiv2026

Online Preemptive Matching Revisited

We study the online preemptive matching problem, in which the edges of a graph arrive sequentially and the algorithm must maintain a matching by accepting or rejecting arriving edges and possibly discarding previously accepted ones. We prove a new upper bound of $0.5661$ on the competitive ratio achievable for the problem. This bound applies to arbitrary randomized algorithms, bipartite graphs and if we allow the algorithm to output a fractional solution. Our result improves upon the strongest previously known upper bound of $2-\sqrt{2} \approx 0.585$, due to Huang et al. [SODA'19]. Previous hardness constructions relied on edge sequences described by vertex arrivals where each arriving vertex reveals its edges to yet unvaried vertices. Under such sequences, Huang et al. showed that there exists a non-preemptive online algorithm with competitive ratio $\sim0.567$ (or $2-\sqrt{2}$ for fractional solutions). Consequently, our hardness construction is the first result which shows hardness for instances where the optimal algorithm employs preemption.

cs.DS↗

arXiv2025

Complexity of Financial Time Series: Multifractal and Multiscale Entropy Analyses

We employed Multifractal Detrended Fluctuation Analysis (MF-DFA) and Refined Composite Multiscale Sample Entropy (RCMSE) to investigate the complexity of Bitcoin, GBP/USD, gold, and natural gas price log-return time series. This study provides a comparative analysis of these markets and offers insights into their predictability and associated risks. Each tool presents a unique method to quantify time series complexity. The RCMSE and MF-DFA methods demonstrate a higher complexity for the Bitcoin time series than others. It is discussed that the increased complexity of Bitcoin may be attributable to the presence of higher nonlinear correlations within its log-return time series.

q-fin.ST↗

arXiv2024

Fairness and Efficiency in Online Class Matching

The online bipartite matching problem, extensively studied in the literature, deals with the allocation of online arriving vertices (items) to a predetermined set of offline vertices (agents). However, little attention has been given to the concept of class fairness, where agents are categorized into different classes, and the matching algorithm must ensure equitable distribution across these classes. We here focus on randomized algorithms for the fair matching of indivisible items, subject to various definitions of fairness. Our main contribution is the first (randomized) non-wasteful algorithm that simultaneously achieves a $1/2$ approximation to class envy-freeness (CEF) while simultaneously ensuring an equivalent approximation to the class proportionality (CPROP) and utilitarian social welfare (USW) objectives. We supplement this result by demonstrating that no non-wasteful algorithm can achieve an $α$-CEF guarantee for $α> 0.761$. In a similar vein, we provide a novel input instance for deterministic divisible matching that demonstrates a nearly tight CEF approximation. Lastly, we define the ``price of fairness,'' which represents the trade-off between optimal and fair matching. We demonstrate that increasing the level of fairness in the approximation of the solution leads to a decrease in the objective of maximizing USW, following an inverse proportionality relationship.

cs.GT↗

arXiv2023

Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap

Recently, some studies on the fair allocation of indivisible goods notice a connection between a purely combinatorial problem called the Rainbow Cycle problem and a fairness notion known as $\efx$: assuming that the rainbow cycle number for parameter $d$ (i.e. $\rainbow(d)$) is $O(d^β\log^γd)$, we can find a $(1-ε)$-$\efx$ allocation with $O_ε(n^{\fracβ{β+1}}\log^{\fracγ{β+1}} n)$ number of discarded goods \cite{chaudhury2021improving}. The best upper bound on $\rainbow(d)$ is improved in a series of works to $O(d^4)$ \cite{chaudhury2021improving}, $O(d^{2+o(1)})$ \cite{berendsohn2022fixed}, and finally to $O(d^2)$ \cite{Akrami2022}.\footnote{We refer to the note at the end of the introduction for a short discussion on the result of \cite{Akrami2022}.} Also, via a simple observation, we have $\rainbow(d) \in Ω(d)$ \cite{chaudhury2021improving}. In this paper, we introduce another problem in extremal combinatorics. For a parameter $\ell$, we define the rainbow path degree and denote it by $\ech(\ell)$. We show that any lower bound on $\ech(\ell)$ yields an upper bound on $\rainbow(d)$. Next, we prove that $\ech(\ell) \in Ω(\ell^2/\log n)$ which yields an almost tight upper bound of $\rainbow(d) \in Ω(d \log d)$. This in turn proves the existence of $(1-ε)$-$\efx$ allocation with $O_ε(\sqrt{n \log n})$ number of discarded goods. In addition, for the special case of the Rainbow Cycle problem that the edges in each part form a permutation, we improve the upper bound to $\rainbow(d) \leq 2d-4$. We leverage $\ech(\ell)$ to achieve this bound. Our conjecture is that the exact value of $\ech(\ell) $ is $ \lfloor \frac{\ell^2}{2} \rfloor -1$. We provide some experiments that support this conjecture. Assuming this conjecture is correct, we have $\rainbow(d) \in Θ(d)$.

cs.GT↗

arXiv2017

Complexity of eye fixation duration time series in reading of Persian texts: A multifractal detrended fluctuation analysis

There is growing evidence that cognitive processes may have fractal structures as a signature of complexity. It is an an ongoing topic of research to study the class of complexity and how it may differ as a function of cognitive variables. Here, we explore the eye movement trajectories generated during reading different Persian texts. Features of eye movement trajectories were recorded during reading Persian texts using an eye tracker. We show that fixation durations, as the main components of eye movements reflecting cognitive processing, exhibits multifractal behavior. This indicates that multiple exponents are needed to capture the neural and cognitive processes involved in decoding symbols to derive meaning. We test whether multifractal behavior varies as a function of two different fonts, familiarity of the text for readers, and reading silently or aloud, and goal-oriented versus non-goal-oriented reading. We find that, while mean fixation duration is affected by some of these factors, the multifractal pattern in time series of eye fixation durations did not change significantly. Our results suggest that multifractal dynamics may be intrinsic to the reading process.

physics.data-an↗

arXiv2014

Invariance of Spooky Action at a Distance in Quantum Entanglement under Lorentz Transformation

We study the mechanism by which the particle-antiparticle entangled state collapses instantaneously at a distance. By making two key assumptions, we are able to show not only that instantaneous collapse of a wave function at a distance is possible but also that it is an invariant quantity under Lorentz transformation and compatible with relativity. In addition, we will be able to detect in which situation a many-body entangled system exhibits the maximum collapse speed among its entangled particles. Finally we suggest that every force in nature acts via entanglement.

physics.gen-ph↗