Searcharxiv⌕ Search

arXiv subjects

P. -L. Giscard

Publications and source records attributed to P. -L. Giscard.

17 recordsLinked to original sources
arXiv2020

Counting walks by their last erased self-avoiding polygons using sieves

Let $G$ be an infinite, vertex-transitive lattice with degree $λ$ and fix a vertex on it. Consider all cycles of length exactly $l$ from this vertex to itself on $G$. Erasing loops chronologically from these cycles, what is the fraction $F_p/λ^{\ell(p)}$ of cycles of length $l$ whose last erased loop is some chosen self-avoiding polygon $p$ of length $\ell(p)$, when $l\to\infty$ ? We use combinatorial sieves to prove an exact formula for $F_p/λ^{\ell(p)}$ that we evaluate explicitly. We further prove that for all self-avoiding polygons $p$, $F_p\in\mathbb{Q}[χ]$ with $χ$ an irrational number depending on the lattice, e.g. $χ=1/π$ on the infinite square lattice. In stark contrast we current methods, we proceed via purely deterministic arguments relying on Viennot's theory of heaps of pieces seen as a semi-commutative extension of number theory. Our approach also sheds light on the origin of the difference between exponents stemming from loop-erased walk and self-avoiding polygon models, and suggests a natural route to bridge the gap between both.

math.CO↗
arXiv2020

Tridiagonalization of systems of coupled linear differential equations with variable coefficients by a Lanczos-like method

We show constructively that, under certain regularity assumptions, any system of coupled linear differential equations with variable coefficients can be tridiagonalized by a time-dependent Lanczos-like method. The proof we present formally establishes the convergence of the Lanczos-like algorithm and yields a full characterization of algorithmic breakdowns. From there, the solution of the original differential system is available in closed form. This is a key piece in evaluating the elusive ordered exponential function both formally and numerically.

math.CA↗
arXiv2020

Elementary Integral Series for Heun Functions. With an Application to Black-Hole Perturbation Theory

Heun differential equations are the most general second order Fuchsian equations with four regular singularities. An explicit integral series representation of Heun functions involving only elementary integrands has hitherto been unknown and noted as an important open problem in a recent review. We provide explicit integral representations of the solutions of all equations of the Heun class: general, confluent, bi-confluent, doubly-confluent and triconfluent, with integrals involving only rational functions and exponential integrands. All the series are illustrated with concrete examples of use. These results stem from the technique of path-sums, which we use to evaluate the path-ordered exponential of a variable matrix chosen specifically to yield Heun functions. We demonstrate the utility of the integral series by providing the first representation of the solution to the Teukolsky radial equation governing the metric perturbations of rotating black holes that is convergent everywhere from the black hole horizon up to spatial infinity.

math-ph↗
arXiv2017

The All-Paths and Cycles Graph Kernel

With the recent rise in the amount of structured data available, there has been considerable interest in methods for machine learning with graphs. Many of these approaches have been kernel methods, which focus on measuring the similarity between graphs. These generally involving measuring the similarity of structural elements such as walks or paths. Borgwardt and Kriegel proposed the all-paths kernel but emphasized that it is NP-hard to compute and infeasible in practice, favouring instead the shortest-path kernel. In this paper, we introduce a new algorithm for computing the all-paths kernel which is very efficient and enrich it further by including the simple cycles as well. We demonstrate how it is feasible even on large datasets to compute all the paths and simple cycles up to a moderate length. We show how to count labelled paths/simple cycles between vertices of a graph and evaluate a labelled path and simple cycles kernel. Extensive evaluations on a variety of graph datasets demonstrate that the all-paths and cycles kernel has superior performance to the shortest-path kernel and state-of-the-art performance overall.

cs.LG↗
arXiv2017

Evaluating balance on social networks from their simple cycles

Signed networks have long been used to represent social relations of amity (+) and enmity (-) between individuals. Group of individuals who are cyclically connected are said to be balanced if the number of negative edges in the cycle is even and unbalanced otherwise. In its earliest and most natural formulation, the balance of a social network was thus defined from its simple cycles, cycles which do not visit any vertex more than once. Because of the inherent difficulty associated with finding such cycles on very large networks, social balance has since then been studied via other means. In this article we present the balance as measured from the simple cycles and primitive orbits of social networks. We specifically provide two measures of balance: the proportion $R_\ell$ of negative simple cycles of length $\ell$ for each $\ell\leq 20$ which generalises the triangle index, and a ratio $K_\ell$ which extends the relative signed clustering coefficient introduced by Kunegis. To do so, we use a Monte Carlo implementation of a novel exact formula for counting the simple cycles on any weighted directed graph. Our method is free from the double-counting problem affecting previous cycle-based approaches, does not require edge-reciprocity of the underlying network, provides a gray-scale measure of balance for each cycle length separately and is sufficiently tractable that it can be implemented on a standard desktop computer. We observe that social networks exhibit strong inter-edge correlations favouring balanced situations and we determine the corresponding correlation length $ξ$. For longer simple cycles, $R_\ell$ undergoes a sharp transition to values expected from an uncorrelated model. This transition is absent from synthetic random networks, strongly suggesting that it carries a sociological meaning warranting further research.

cs.SI↗
arXiv2015

Walk-Sums, Continued Fractions and Unique Factorisation on Digraphs

We show that the series of all walks between any two vertices of any (possibly weighted) directed graph $\mathcal{G}$ is given by a universal continued fraction of finite depth and breadth involving the simple paths and simple cycles of $\mathcal{G}$. A simple path is a walk forbidden to visit any vertex more than once. We obtain an explicit formula giving this continued fraction. Our results are based on an equivalent to the fundamental theorem of arithmetic: we demonstrate that arbitrary walks on $\mathcal{G}$ factorize uniquely into nesting products of simple paths and simple cycles, where nesting is a product operation between walks that we define. We show that the simple paths and simple cycles are the prime elements of the set of all walks on $\mathcal{G}$ equipped with the nesting product. We give an algorithm producing the prime factorization of individual walks, and obtain a recursive formula producing the prime factorization of sets of walks. Our results have already found applications in machine learning, matrix computations and quantum mechanics.

cs.DM↗
arXiv2014

Exact Inference on Gaussian Graphical Models of Arbitrary Topology using Path-Sums

We present the path-sum formulation for exact statistical inference of marginals on Gaussian graphical models of arbitrary topology. The path-sum formulation gives the covariance between each pair of variables as a branched continued fraction of finite depth and breadth. Our method originates from the closed-form resummation of infinite families of terms of the walk-sum representation of the covariance matrix. We prove that the path-sum formulation always exists for models whose covariance matrix is positive definite: i.e.~it is valid for both walk-summable and non-walk-summable graphical models of arbitrary topology. We show that for graphical models on trees the path-sum formulation is equivalent to Gaussian belief propagation. We also recover, as a corollary, an existing result that uses determinants to calculate the covariance matrix. We show that the path-sum formulation formulation is valid for arbitrary partitions of the inverse covariance matrix. We give detailed examples demonstrating our results.

math.ST↗
arXiv2014

An Exact Formulation of the Time-Ordered Exponential using Path-Sums

We present the path-sum formulation for $\mathsf{OE}[\mathsf{H}](t',t)=\mathcal{T}\,\text{exp}\big(\int_{t}^{t'}\!\mathsf{H}(τ)\,dτ\big)$, the time-ordered exponential of a time-dependent matrix $\mathsf{H}(t)$. The path-sum formulation gives $\mathsf{OE}[\mathsf{H}]$ as a branched continued fraction of finite depth and breadth. The terms of the path-sum have an elementary interpretation as self-avoiding walks and self-avoiding polygons on a graph. Our result is based on a representation of the time-ordered exponential as the inverse of an operator, the mapping of this inverse to sums of walks on graphs and the algebraic structure of sets of walks. We give examples demonstrating our approach. We establish a super-exponential decay bound for the magnitude of the entries of the time-ordered exponential of sparse matrices. We give explicit results for matrices with commonly encountered sparse structures.

math-ph↗
arXiv2014

An Explicit Bound for Dynamical Localisation in an Interacting Many-Body System

We characterise and study dynamical localisation of a finite interacting quantum many-body system. We present explicit bounds on the disorder strength required for the onset of localisation of the dynamics of arbitrary ensemble of sites of the XYZ spin-1/2 model. We obtain these results using a novel form of the fractional moment criterion, which we establish, together with a generalisation of the self-avoiding walk representation of the system Green's functions, called path-sums. These techniques are not specific to the XYZ model and hold in a much more general setting. We further present bounds for two observable quantities in the localised regime: the magnetisation of any sublattice of the system as well as the linear magnetic response function of the system. We confirm our results through numerical simulations.

math-ph↗
arXiv2012

Evaluating Matrix Functions by Resummations on Graphs: the Method of Path-Sums

We introduce the method of path-sums which is a tool for exactly evaluating a function of a discrete matrix with possibly non-commuting entries, based on the closed-form resummation of infinite families of terms in the corresponding Taylor series. If the matrix is finite, our approach yields the exact result in a finite number of steps. We achieve this by combining a mapping between matrix powers and walks on a weighted directed graph with a universal graph-theoretic result on the structure of such walks. We present path-sum expressions for a matrix raised to a complex power, the matrix exponential, matrix inverse, and matrix logarithm. We show that the quasideterminants of a matrix can be naturally formulated in terms of a path-sum, and present examples of the application of the path-sum method. We show that obtaining the inversion height of a matrix inverse and of quasideterminants is an NP-complete problem.

math.QA↗
arXiv2011

Tunable Supersolids of Rydberg Excitations Described by Quantum Evolutions on Graphs

We show that transient supersolid quantum states of Rydberg-excitations can be created dynamically from a Mott insulator of ground state atoms in a 2D optical-lattices by irradiating it with short laser pulses. The structure of these supersolids is tunable via the choice of laser parameters. We calculate first, second and fourth order correlation functions as well as the pressure to characterize the supersolid states. Our study is based on the development of a general theoretical tool for obtaining the dynamics of strongly interacting quantum systems whose initial state is accurately known. We show that this method allows to accurately approximate the evolution of quantum systems analytically with a number of operations growing polynomially.

quant-ph↗
arXiv2009

Quantum Mechanical Limits to Inertial Mass Sensing by Nanomechanical Systems

We determine the quantum mechanical limits to inertial mass-sensing based on nanomechanical systems. We first consider a harmonically oscillating cantilever whose vibration frequency is changed by mass accretion at its surface. We show that its zero-point fluctuations limit the mass sensitivity, for attainable parameters, to about an electron mass. In contrast to the case of a classical cantilever, we find the mass sensitivity of the quantum mechanical cantilever is independent of its resonant frequency in a certain parameter regime at low temperatures. We then consider an optomechanical setup in which the cantilever is reflective and forms one end of a laser-driven Fabry-Pérot cavity. For a resonator finesse of 5 the mass sensitivity at T=0 is limited by cavity noise to about a quarter of a Dalton, but this setup has a more favorable temperature dependency at finite temperature, compared to the free cantilever.

quant-ph↗
arXiv2009

Operators for the Aharonov-Anandan and Samuel-Bhandari Phases

We construct an operator for the Aharonov-Anandan phase for time independent Hamiltonians. This operator is shown to generate the motion of cyclic quantum systems through an equation of evolution involving only geometric quantities, i.e. the distance between quantum states, the geometric phase and the total length of evolution. From this equation, we derive an operator for the Samuel and Bhandari phase (SB-phase) for non cyclic evolutions. Finally we show how the SB-phase can be used to construct an operator corresponding to a quantum clock which commutator with the Hamiltonian has a canonical expectation value.

quant-ph↗
arXiv2009

Considerations about the Aharonov-Anandan Phase for Time Independent Hamiltonians

We present a method for calculating the Aharonov-Anandan phase for time-independent Hamiltonians that avoids the calculation of evolution operators. We compare the generic method used to calculate the Aharonov-Anandan phase with the method proposed here through four examples; a spin-1/2 particle in a constant magnetic field, an arbitrary infinite-sized Hamiltonian with two known eigenvalues, a Fabry-Perot cavity with one movable mirror and a three mirrors cavity with a slightly transmissive movable middle mirror.

quant-ph↗
arXiv2007

Entangling the ro-vibrational modes of a macroscopic mirror using radiation pressure

We consider the dynamics of a vibrating and rotating end-mirror of an optical Fabry-P{érot} cavity that can sustain Laguerre-Gaussian modes. We demonstrate theoretically that since the intra-cavity field carries linear as well as angular momentum, radiation pressure can create bipartite entanglement between a vibrational and a rotational mode of the mirror. Further we show that the ratio of vibrational and rotational couplings with the radiation field can easily be adjusted experimentally, which makes the generation and detection of entanglement robust to uncertainties in the cavity manufacture. This constitutes the first proposal to demonstrate entanglement between two qualitatively different degrees of freedom of the same macroscopic object.

quant-ph↗
arXiv2007

Entanglement of a Laguerre-Gaussian cavity mode with a rotating mirror

It has previously been shown theoretically that the exchange of linear momentum between the light field in an optical cavity and a vibrating end mirror can entangle the electromagnetic field with the vibrational motion of that mirror. In this paper we consider the rotational analog of this situation and show that radiation torque can similarly entangle a Laguerre-Gaussian cavity mode with a rotating end mirror. We examine the mirror-field entanglement as a function of ambient temperature, radiation detuning and orbital angular momentum carried by the cavity mode.

quant-ph↗