Searcharxiv⌕ Search

arXiv subjects

Arvind Singh

Publications and source records attributed to Arvind Singh.

At least 37 records · Page 2Linked to original sources

Enhancement in optically induced ultrafast THz response of MoSe2MoS2 heterobilayer

THz conductivity of large area MoS2 and MoSe2 monolayers as well as their vertical heterostructure, MoSe2MoS2 is measured in the 0.3-5 THz frequency range. Compared to the monolayers, the ultrafast THz reflectivity of the MoSe2MoS2 heterobilayer is enhanced many folds when optically excited above the direct band gap energies of the constituting monolayers. The free carriers generated in the heterobilayer evolve with the characteristic times found in each of the two monolayers. Surprisingly, the same enhancement is recorded in the ultrafst THz reflectivity of the heterobilayer when excited below the MoS2 bandgap energy. A mechanism accounting for these observations is proposed.

physics.app-ph↗

Magnetic field-dependent resistance crossover and logarithmic to non-saturating magnetoresistance in topological insulator Bi$_2$Te$_3$

We report a metal-insulator like transition in single crystalline 3D topological insulator Bi2Te3 at a temperature of 230K in presence of an external magnetic field applied normal to the surface. This transition becomes more prominent at larger magnetic field strength with the residual resistance value increasing linearly with the magnetic field. At low temperature, the magnetic field dependence of the magnetoresistance shows a transition from logarithmic to linear behavior and the onset magnetic field value for this transition decreases with increasing temperature. The logarithmic magnetoresistance indicates the weak anti-localization of the surface Dirac electrons while the high temperature behavior originates from the bulk carriers due to intrinsic impurities. At even higher temperatures beyond~230 K, a completely classical Lorentz model type quadratic behavior of the magnetoresistance is observed. We also show that the experimentally observed anomalies at ~230K in the magneto-transport properties do not originate from any stacking fault in Bi2Te3.

cond-mat.mes-hall↗

Photo-Seebeck effect in single-crystalline bismuth telluride topological insulator

Bismuth telluride is a low energy bulk band-gap topological system with conducting surface states. Besides its very good thermoelectric properties, it also makes a very good candidate for broadband photodetectors. Here, we report temperature-dependent photo-Seebeck effect in a bulk single crystalline bismuth telluride. On light illumination, an electrically biased sample shows distinguishable contributions in the measured current due to both the Seebeck effect and the normal photo-generated carriers within a narrow layer of the sample. Detailed experiments are performed to elucidate the distinction between the Seebeck contribution and the photogenerated current. The temperature-dependence of the photocurrent without Seebeck contribution shows a sign reversal from negative to positive at a specific temperature depending on the wavelength of photoexcitation light.

cond-mat.mes-hall↗

From Turbulence to Landscapes: Universality of Logarithmic Mean Profiles in Bounded Complex Systems

The logarithmic mean-velocity profile is a key experimental and theoretical result in wall-bounded turbulence. Similarly, here we show that the topographic surface emerging between parallel zero-elevation boundaries presents an intermediate region with a logarithmic mean-elevation profile. We use model simulations, which account for growth, erosion, and smoothing processes and give rise to complex topography with channel branching and fractal river networks, as well as data from a physical landscape-evolution experiment. Dimensional and self-similarity arguments are used to corroborate this finding. Our results suggest a universality of the logarithmic scaling in bounded complex systems out of equilibrium, of which landscape topography and turbulence are quintessential examples.

physics.geo-ph↗

Application Inference using Machine Learning based Side Channel Analysis

The proliferation of ubiquitous computing requires energy-efficient as well as secure operation of modern processors. Side channel attacks are becoming a critical threat to security and privacy of devices embedded in modern computing infrastructures. Unintended information leakage via physical signatures such as power consumption, electromagnetic emission (EM) and execution time have emerged as a key security consideration for SoCs. Also, information published on purpose at user privilege level accessible through software interfaces results in software only attacks. In this paper, we used a supervised learning based approach for inferring applications executing on android platform based on features extracted from EM side-channel emissions and software exposed dynamic voltage frequency scaling(DVFS) states. We highlight the importance of machine learning based approach in utilizing these multi-dimensional features on a complex SoC, against profiling-based approaches. We also show that learning the instantaneous frequency states polled from onboard frequency driver (cpufreq) is adequate to identify a known application and flag potentially malicious unknown application. The experimental results on benchmarking applications running on ARMv8 processor in Snapdragon 820 board demonstrates early detection of these apps, and atleast 85% accuracy in detecting unknown applications. Overall, the highlight is to utilize a low-complexity path to application inference attacks through learning instantaneous frequency states pattern of CPU core.

cs.CR↗

Once reinforced random walk on $\mathbb{Z}\times Γ$

We revisit an unpublished paper of Vervoort (2002) on the once reinforced random walk, and prove that this process is recurrent on any graph of the form $\mathbb{Z}\times Γ$, with $Γ$ a finite graph, for sufficiently large reinforcement parameter. We also obtain a shape theorem for the set of visited sites, and show that the fluctuations around this shape are of polynomial order. The proof involves sharp general estimates on the time spent on subgraphs of the ambiant graph which might be of independent interest.

math.PR↗

Blindsight: Blinding EM Side-Channel Leakage using Built-In Fully Integrated Inductive Voltage Regulator

Modern high-performance as well as power-constrained System-on-Chips (SoC) are increasingly using hardware accelerated encryption engines to secure computation, memory access, and communication operations. The electromagnetic (EM) emission from a chip leaks information of the underlying logical operations and can be collected using low-cost non-invasive measurements. EM based side-channel attacks (EMSCA) have emerged as a major threat to security of encryption engines in a SoC. This paper presents the concept of Blindsight where a high-frequency inductive voltage regulator (IVR) integrated on the same chip with an encryption engine is used to increase resistance against EMSCA. High-frequency (~100MHz) IVRs are present in modern microprocessors to improve energy-efficiency. We show that an IVR with a randomized control loop (R-IVR) can reduce EMSCA as the integrated inductance acts as a strong EM emitter and blinds an adversary from EM emission of the encryption engine. The EM measurements are performed on a test-chip containing two architectures of a 128-bit Advanced Encryption Standard (AES) engine powered by a high-frequency R-IVR and under two attack scenarios, one, where an adversary gains complete physical access of the target device and the other, where the adversary is only in proximity of the device. In both attack modes, an adversary can observe information leakage in Test Vector Leakage Assessment (TVLA) test in a baseline IVR (B-IVR, without control loop randomization). However, we show that EM emission from the R-IVR blinds the attacker and significantly reduces SCA vulnerability of the AES engine. A range of practical side-channel analysis including TVLA, Correlation Electromagnetic Analysis (CEMA), and a template based CEMA shows that R-IVR can reduce information leakage and prevent key extraction even against a skilled adversary.

cs.CR↗

Almost-sure asymptotic for the number of heaps inside a random sequence

We study the minimum number of heaps required to sort a random sequence using a generalization of Istrate and Bonchis's algorithm (2015). In a previous paper, the authors proved that the expected number of heaps grows logarithmically. In this note, we improve on the previous result by establishing the almost-sure and L 1 convergence.

math.PR↗

The geometry of a critical percolation cluster on the UIPT

We consider a critical Bernoulli site percolation on the uniform infinite planar triangulation. We study the tail distributions of the peeling time, perimeter, and volume of the hull of a critical cluster. The exponents obtained here differs by a factor 2 from those computed previously by Angel and Curien (2015) in the case of critical site percolation on the uniform infinite half-plane triangulation.

math.PR↗

From Hammersley's lines to Hammersley's trees

We construct a stationary random tree, embedded in the upper half plane, with prescribed offspring distribution and whose vertices are the atoms of a unit Poisson point process. This process which we call Hammersley's tree process extends the usual Hammersley's line process. Just as Hammersley's process is related to the problem of the longest increasing subsequence, this model also has a combinatorial interpretation: it counts the number of heaps (i.e. increasing trees) required to store a random permutation. This problem was initially considered by Byers et. al (2011) and Istrate and Bonchis (2015) in the case of regular trees. We show, in particular, that the number of heaps grows logarithmically with the size of the permutation.

math.PR↗

Percolation by cumulative merging and phase transition for the contact process on random graphs

Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging smaller clusters and cumulating their weights. For several classical random weighted graphs, we show that there exists a phase transition regarding the existence of an infinite cluster. The motivation for introducing this partition arises from a connection with the contact process as it roughly describes the geometry of the sets where the process survives for a long time. We give a sufficient condition on a graph to ensure that the contact process has a non trivial phase transition in terms of the existence of an infinite cluster. As an application, we prove that the contact process admits a sub-critical phase on d-dimensional random geometric graphs and on random Delaunay triangulations. To the best of our knowledge, these are the first examples of graphs with unbounded degrees where the critical parameter is shown to be strictly positive.

math.PR↗

Continuous-time vertex reinforced jump processes on Galton-Watson trees

We consider a continuous-time vertex reinforced jump process on a supercritical Galton-Watson tree. This process takes values in the set of vertices of the tree and jumps to a neighboring vertex with rate proportional to the local time at that vertex plus a constant $c$. The walk is either transient or recurrent depending on this parameter $c$. In this paper, we complete results previously obtained by Davis and Volkov [Probab. Theory Related Fields 123 (2002) 281-300, Probab. Theory Related Fields 128 (2004) 42-62] and Collevecchio [Ann. Probab. 34 (2006) 870-878, Electron. J. Probab. 14 (2009) 1936-1962] by proving that there is a unique (explicit) positive $c_{\mathrm{crit}}$ such that the walk is recurrent for $c\leq c_{\mathrm{crit}}$ and transient for $c>c_{\mathrm{crit}}$.

math.PR↗

Localization on 4 sites for Vertex-reinforced random walks on $\mathbb Z$

We characterize non-decreasing weight functions for which the associated one-dimensional vertex reinforced random walk (VRRW) localizes on 4 sites. A phase transition appears for weights of order $n\log \log n$: for weights growing faster than this rate, the VRRW localizes almost surely on at most 4 sites whereas for weights growing slower, the VRRW cannot localize on less than 5 sites. When $w$ is of order $n\log \log n$, the VRRW localizes almost surely on either 4 or 5 sites, both events happening with positive probability.

math.PR↗

Localization of a vertex reinforced random walks on $\Z$ with sub-linear weights

We consider a vertex reinforced random walk on the integer lattice with sub-linear reinforcement. Under some assumptions on the regular variation of the weight function, we characterize whether the walk gets stuck on a finite interval. When this happens, we estimate the size of the localization set. In particular, we show that, for any odd number $N$ larger than or equal to 5, there exists a vertex reinforced random walk which localizes with positive probability on exactly $N$ consecutive sites.

math.PR↗

Recurrence and transience of a multi-excited random walk on a regular tree

We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the recurrence/transience property of the walk. In particular, we prove that the asymptotic behavior of the walk depends on the order of the excitations, which contrasts with the one dimensional setting studied by Zerner (2005). We also consider the limiting speed of the walk in the transient regime and conjecture that it is not a monotonic function of the environment.

math.PR↗

Rates of convergence of a transient diffusion in a spectrally negative Lévy potential

We consider a diffusion process $X$ in a random Lévy potential $\mathbb{V}$ which is a solution of the informal stochastic differential equation \begin{eqnarray*}\cases{dX_t=dβ_t-{1/2}\mathbb{V}'(X_t) dt,\cr X_0=0,}\end{eqnarray*} ($β$ B. M. independent of $\mathbb{V}$). We study the rate of convergence when the diffusion is transient under the assumption that the Lévy process $\mathbb{V}$ does not possess positive jumps. We generalize the previous results of Hu--Shi--Yor for drifted Brownian potentials. In particular, we prove a conjecture of Carmona: provided that there exists $0<κ<1$ such that $\mathbf{E}[e^{κ\mathbb{V}_1}]=1$, then $X_t/t^κ$ converges to some nondegenerate distribution. These results are in a way analogous to those obtained by Kesten--Kozlov--Spitzer for the transient random walk in a random environment.

math.PR↗

Rate of growth of a transient cookie random walk

We consider a one-dimensional transient cookie random walk. It is known from a previous paper that a cookie random walk $(X_n)$ has positive or zero speed according to some positive parameter $α>1$ or $\le 1$. In this article, we give the exact rate of growth of $(X_n)$ in the zero speed regime, namely: for $0<α<1$, $X_n/n^{\frac{α+1}{2}}$ converges in law to a Mittag-Leffler distribution whereas for $α=1$, $X_n(\log n)/n$ converges in probability to some positive constant.

math.PR↗