Search

In two-dimensional flat space, the oscillatory motion of a closed folded string--or alternatively, two massless particles connected by a string--can be quantized using the 't Hooft equation. This paper presents an alternative method for quantizing the folded string in anti-de Sitter space. By using variables inspired by integrability, setting $g \equiv {(R_\text{AdS})^2 \over 2\pi \alpha'}$ to a specific p-dependent $\mathcal{O}(1)$ value, and applying a particular boundary condition to the antisymmetrized wavefunction, we obtain a spectrum that precisely matches that of fermion bilinear operators in the disorder-averaged Sachdev-Ye-Kitaev model with p-fermion interactions., Comment: 25 pages, 7 figures

Seizure recurrence is an important concern after an initial unprovoked seizure; without drug treatment, it occurs within 2 years in 40-50% of cases. The decision to treat currently relies on predictors of seizure recurrence risk that are inaccurate, resulting in unnecessary, possibly harmful, treatment in some patients and potentially preventable seizures in others. Because of the link between brain lesions and seizure recurrence, we developed a recurrence prediction tool using machine learning and clinical 3T brain MRI. We developed NeuroMorphix, a feature construction approach based on MRI brain anatomy. Each of seven NeuroMorphix features measures the absolute or relative difference between corresponding regions in each cerebral hemisphere. FreeSurfer was used to segment brain regions and to generate values for morphometric parameters (8 for each cortical region and 5 for each subcortical region). The parameters were then mapped to whole brain NeuroMorphix features, yielding a total of 91 features per subject. Features were generated for a first seizure patient cohort (n = 169) categorised into seizure recurrence and non-recurrence subgroups. State-of-the-art classification algorithms were trained and tested using NeuroMorphix features to predict seizure recurrence. Classification models using the top 5 features, ranked by sequential forward selection, demonstrated excellent performance in predicting seizure recurrence, with area under the ROC curve of 88-93%, accuracy of 83-89%, and F1 score of 83-90%. Highly ranked features aligned with structural alterations known to be associated with epilepsy. This study highlights the potential for targeted, data-driven approaches to aid clinical decision-making in brain disorders., Comment: This work has been submitted to the IEEE TMI for possible publication

We explore the relationship between two popular concepts on allocating divisible items: competitive equilibrium (CE) and allocations with maximum Nash welfare, i.e., allocations where the weighted geometric mean of the utilities is maximal. When agents have homogeneous concave utility functions, these two concepts coincide: the classical Eisenberg-Gale convex program that maximizes Nash welfare over feasible allocations yields a competitive equilibrium. However, these two concepts diverge for non-homogeneous utilities. From a computational perspective, maximizing Nash welfare amounts to solving a convex program for any concave utility functions, computing CE becomes PPAD-hard already for separable piecewise linear concave (SPLC) utilities. We introduce the concept of Gale-substitute utility functions, an analogue of the weak gross substitutes (WGS) property for the so-called Gale demand system. For Gale-substitutes utilities, we show that any allocation maximizing Nash welfare provides an approximate-CE with surprisingly strong guarantees, where every agent gets at least half the maximum utility they can get at any CE, and is approximately envy-free. Gale-substitutes include examples of utilities where computing CE is PPAD hard: in particular, all separable concave utilities, and the previously studied non-separable class of Leontief-free utilities. We introduce a new, general class of utility functions called generalized network utilities based on the generalized flow model; this class includes SPLC and Leontief-free utilities. We show that all such utilities are Gale-substitutes. Conversely, although some agents may get much higher utility at a Nash welfare maximizing allocation than at a CE, we show a price of anarchy type result: for general concave utilities, every CE achieves at least $(1/e)^{1/e} > 0.69$ fraction of the maximum Nash welfare, and this factor is tight.

We show that for a particular model, the quantum mechanical bootstrap is capable of finding exact results. We consider a solvable system with Hamiltonian $H=SZ(1-Z)S$, where $Z$ and $S$ satisfy canonical commutation relations. While this model may appear unusual, using an appropriate coordinate transformation, the Schr\"odinger equation can be cast into a standard form with a P\"oschl-Teller-type potential. Since the system is defined on an interval, it is well-known that $S$ is not self-adjoint. Nevertheless, the bootstrap method can still be implemented, producing an infinite set of positivity constraints. Using a certain operator ordering, the energy eigenvalues are only constrained into bands. With an alternative ordering, however, we find that a finite number of constraints is sufficient to fix the low-lying energy levels exactly., Comment: 32 pages, 10 figures

Traumatic Brain Injury (TBI) poses a significant global public health challenge, contributing to high morbidity and mortality rates and placing a substantial economic burden on healthcare systems worldwide. The diagnosis of TBI relies on clinical information along with Computed Tomography (CT) scans. Addressing the multifaceted challenges posed by TBI has seen the development of innovative, data-driven approaches, for this complex condition. Particularly noteworthy is the prevalence of mild TBI (mTBI), which constitutes the majority of TBI cases where conventional methods often fall short. As such, we review the state-of-the-art Machine Learning (ML) techniques applied to clinical information and CT scans in TBI, with a particular focus on mTBI. We categorize ML applications based on their data sources, and there is a spectrum of ML techniques used to date. Most of these techniques have primarily focused on diagnosis, with relatively few attempts at predicting the prognosis. This review may serve as a source of inspiration for future research studies aimed at improving the diagnosis of TBI using data-driven approaches and standard diagnostic data., Comment: The manuscript has 34 pages, 3 figures, and 4 tables

Mild Traumatic Brain Injury (mTBI) is a common and challenging condition to diagnose accurately. Timely and precise diagnosis is essential for effective treatment and improved patient outcomes. Traditional diagnostic methods for mTBI often have limitations in terms of accuracy and sensitivity. In this study, we introduce an innovative approach to enhance mTBI diagnosis using 3D Computed Tomography (CT) images and a metric learning technique trained with triplet loss. To address these challenges, we propose a Residual Triplet Convolutional Neural Network (RTCNN) model to distinguish between mTBI cases and healthy ones by embedding 3D CT scans into a feature space. The triplet loss function maximizes the margin between similar and dissimilar image pairs, optimizing feature representations. This facilitates better context placement of individual cases, aids informed decision-making, and has the potential to improve patient outcomes. Our RTCNN model shows promising performance in mTBI diagnosis, achieving an average accuracy of 94.3%, a sensitivity of 94.1%, and a specificity of 95.2%, as confirmed through a five-fold cross-validation. Importantly, when compared to the conventional Residual Convolutional Neural Network (RCNN) model, the RTCNN exhibits a significant improvement, showcasing a remarkable 22.5% increase in specificity, a notable 16.2% boost in accuracy, and an 11.3% enhancement in sensitivity. Moreover, RTCNN requires lower memory resources, making it not only highly effective but also resource-efficient in minimizing false positives while maximizing its diagnostic accuracy in distinguishing normal CT scans from mTBI cases. The quantitative performance metrics provided and utilization of occlusion sensitivity maps to visually explain the model's decision-making process further enhance the interpretability and transparency of our approach.

Various first order approaches have been proposed in the literature to solve Linear Programming (LP) problems, recently leading to practically efficient solvers for large-scale LPs. From a theoretical perspective, linear convergence rates have been established for first order LP algorithms, despite the fact that the underlying formulations are not strongly convex. However, the convergence rate typically depends on the Hoffman constant of a large matrix that contains the constraint matrix, as well as the right hand side, cost, and capacity vectors. We introduce a first order approach for LP optimization with a convergence rate depending polynomially on the circuit imbalance measure, which is a geometric parameter of the constraint matrix, and depending logarithmically on the right hand side, capacity, and cost vectors. This provides much stronger convergence guarantees. For example, if the constraint matrix is totally unimodular, we obtain polynomial-time algorithms, whereas the convergence guarantees for approaches based on primal-dual formulations may have arbitrarily slow convergence rates for this class. Our approach is based on a fast gradient method due to Necoara, Nesterov, and Glineur (Math. Prog. 2019); this algorithm is called repeatedly in a framework that gradually fixes variables to the boundary. This technique is based on a new approximate version of Tardos's method, that was used to obtain a strongly polynomial algorithm for combinatorial LPs (Oper. Res. 1986).

We consider dynamic auctions for finding Walrasian equilibria in markets with indivisible items and strong gross substitutes valuation functions. Each price adjustment step in these auction algorithms requires finding an inclusion-wise minimal maximal overdemanded set or an inclusion-wise minimal maximal underdemanded set at the current prices. Both can be formulated as a submodular function minimization problem. We observe that minimizing this submodular function corresponds to a polymatroid sum problem, and using this viewpoint, we give a fast and simple push-relabel algorithm for finding the required sets. This improves on the previously best running time of Murota, Shioura and Yang (ISAAC 2013). Our algorithm is an adaptation of the push-relabel framework by Frank and Mikl\'os (JJIAM 2012) to the particular setting. We obtain a further improvement for the special case of unit-supplies. We further show the following monotonicty properties of Walrasian prices: both the minimal and maximal Walrasian prices can only increase if supply of goods decreases, or if the demand of buyers increases. This is derived from a fine-grained analysis of market prices. We call "packing prices" a price vector such that there is a feasible allocation where each buyer obtains a utility maximizing set. Conversely, by "covering prices" we mean a price vector such that there exists a collection of utility maximizing sets of the buyers that include all available goods. We show that for strong gross substitutes valuations, the component-wise minimal packing prices coincide with the minimal Walrasian prices and the component-wise maximal covering prices coincide with the maximal Walrasian prices. These properties in turn lead to the price monotonicity results., Comment: Added new results for maximal Walrasian prices and other types of ascending auctions. Improved introduction

Mild Traumatic Brain Injury (mTBI) is a significant public health challenge due to its high prevalence and potential for long-term health effects. Despite Computed Tomography (CT) being the standard diagnostic tool for mTBI, it often yields normal results in mTBI patients despite symptomatic evidence. This fact underscores the complexity of accurate diagnosis. In this study, we introduce an interpretable 3D Multi-Modal Residual Convolutional Neural Network (MRCNN) for mTBI diagnostic model enhanced with Occlusion Sensitivity Maps (OSM). Our MRCNN model exhibits promising performance in mTBI diagnosis, demonstrating an average accuracy of 82.4%, sensitivity of 82.6%, and specificity of 81.6%, as validated by a five-fold cross-validation process. Notably, in comparison to the CT-based Residual Convolutional Neural Network (RCNN) model, the MRCNN shows an improvement of 4.4% in specificity and 9.0% in accuracy. We show that the OSM offers superior data-driven insights into CT images compared to the Grad-CAM approach. These results highlight the efficacy of the proposed multi-modal model in enhancing the diagnostic precision of mTBI., Comment: Accepted by the Australasian Joint Conference on Artificial Intelligence 2023 (AJCAI 2023). 12 pages and 5 Figures

Optimal auction design is a fundamental problem in algorithmic game theory. This problem is notoriously difficult already in very simple settings. Recent work in differentiable economics showed that neural networks can efficiently learn known optimal auction mechanisms and discover interesting new ones. In an attempt to theoretically justify their empirical success, we focus on one of the first such networks, RochetNet, and a generalized version for affine maximizer auctions. We prove that they satisfy mode connectivity, i.e., locally optimal solutions are connected by a simple, piecewise linear path such that every solution on the path is almost as good as one of the two local optima. Mode connectivity has been recently investigated as an intriguing empirical and theoretically justifiable property of neural networks used for prediction problems. Our results give the first such analysis in the context of differentiable economics, where neural networks are used directly for solving non-convex optimization problems., Comment: Conference paper published at NeurIPS 2023

In an attempt to establish a link between different quantization methods, I examine the massless 't Hooft equation, which governs meson bound state wavefunctions in 2d SU(N) gauge theory in the large-N limit. The integral equation can also be obtained by lightcone quantizing a folded string in flat space. The folded string is a limiting case of a more general setup: a four-segmented string moving in AdS$_3$. I compute its classical spectral curve by using celestial variables and planar bipartite graphs (on-shell diagrams/brane tilings). The adjugate of the Kasteleyn matrix vanishes at two special points, which ensures that the string segments form a closed loop in target space. The Hamiltonian takes on a Ruijsenaars-Schneider form and the phase space is a coadjoint SL(2) orbit whose middle region has been removed. In AdS, the 't Hooft equation acquires an extra term, which has previously been proposed as an effective confining potential in QCD. After an integral transform, the equation can be inverted in terms of a finite difference equation. I show that this difference equation can be interpreted as the quantized (non-analytic) spectral curve of the string. I calculate the spectrum numerically, which interpolates between $M^2=n(n+1)$ in the tensionless limit and 't Hooft's nearly linear Regge trajectory at infinite AdS radius., Comment: 51 pages, 16 figures, v2: figure 14 replaced, minor changes

The two-point function of a free massive scalar field on a fixed background can be evaluated in the large mass limit by using a semiclassical geodesic approximation. In de Sitter space, however, this poses a puzzle. Certain spacelike separated points are not connected by real geodesics despite the corresponding two-point function in the Bunch-Davies state being non-vanishing. We resolve this puzzle by considering complex geodesics after analytically continuing to the sphere. We compute one-loop corrections to the correlator and discuss the implications of our results to de Sitter holography., Comment: 20+13 pages, 5 figures. v2: updated refs to match published version

Diffusional kurtosis imaging (DKI) is a methodology for measuring the extent of non-Gaussian diffusion in biological tissue, which has shown great promise in clinical diagnosis, treatment planning and monitoring of many neurological diseases and disorders. However, robust, fast and accurate estimation of kurtosis from clinically feasible data acquisitions remains a challenge. In this study, we first outline a new accurate approach of estimating mean kurtosis via the sub-diffusion mathematical framework. Crucially, this extension of the conventional DKI overcomes the limitation on the maximum b-value of the latter. Kurtosis and diffusivity can now be simply computed as functions of the sub-diffusion model parameters. Second, we propose a new fast and robust fitting procedure to estimate the sub-diffusion model parameters using two diffusion times without increasing acquisition time as for the conventional DKI. Third, our sub-diffusion based kurtosis mapping method is evaluated using both simulations and the Connectome 1.0 human brain data. Exquisite tissue contrast is achieved even when the diffusion encoded data is collected in only minutes. In summary, our findings suggest robust, fast and accurate estimation of mean kurtosis can be realised within a clinically feasible diffusion weighted magnetic resonance imaging data acquisition time.

For any $\eps>0$, we give a simple, deterministic $(4+\eps)$-approximation algorithm for the Nash social welfare (NSW) problem under submodular valuations. We also consider the asymmetric variant of the problem, where the objective is to maximize the weighted geometric mean of agents' valuations, and give an $(\omega + 2 + \eps) \ee$-approximation if the ratio between the largest weight and the average weight is at most $\omega$. We also show that the $\nfrac12$-EFX envy-freeness property can be attained simultaneously with a constant-factor approximation. More precisely, we can find an allocation in polynomial time that is both $\nfrac12$-EFX and a $(8+\eps)$-approximation to the symmetric NSW problem under submodular valuations., Comment: 27 pages. Appeared in STOC 2023. This version improves the proofs and gives a new FPT result

We consider the minimum-norm-point (MNP) problem over polyhedra, a well-studied problem that encompasses linear programming. We present a general algorithmic framework that combines two fundamental approaches for this problem: active set methods and first order methods. Our algorithm performs first order update steps, followed by iterations that aim to `stabilize' the current iterate with additional projections, i.e., find a locally optimal solution whilst keeping the current tight inequalities. Such steps have been previously used in active set methods for the nonnegative least squares (NNLS) problem. We bound on the number of iterations polynomially in the dimension and in the associated circuit imbalance measure. In particular, the algorithm is strongly polynomial for network flow instances. Classical NNLS algorithms such as the Lawson-Hanson algorithm are special instantiations of our framework; as a consequence, we obtain convergence bounds for these algorithms. Our preliminary computational experiments show promising practical performance.

We study the planar anti-de Sitter black hole in the p-wave holographic superconductor model. We identify a critical coupling value which determines the type of phase transition. Beyond the horizon, at specific temperatures flat spacetime emerges. Numerical analysis close to these temperatures demonstrates the appearance of a large number of alternating Kasner epochs., Comment: v2: 24 pages, 20 figures, references added. v1: 23 pages, 20 figures

A set function can be extended to the unit cube in various ways; the correlation gap measures the ratio between two natural extensions. This quantity has been identified as the performance guarantee in a range of approximation algorithms and mechanism design settings. It is known that the correlation gap of a monotone submodular function is at least $1-1/e$, and this is tight for simple matroid rank functions. We initiate a fine-grained study of the correlation gap of matroid rank functions. In particular, we present an improved lower bound on the correlation gap as parametrized by the rank and girth of the matroid. We also show that for any matroid, the correlation gap of its weighted matroid rank function is minimized under uniform weights. Such improved lower bounds have direct applications for submodular maximization under matroid constraints, mechanism design, and contention resolution schemes.

We develop a new `subspace layered least squares' interior point method (IPM) for solving linear programs. Applied to an $n$-variable linear program in standard form, the iteration complexity of our IPM is up to an $O(n^{1.5} \log n)$ factor upper bounded by the \emph{straight line complexity} (SLC) of the linear program. This term refers to the minimum number of segments of any piecewise linear curve that traverses the \emph{wide neighborhood} of the central path, a lower bound on the iteration complexity of any IPM that follows a piecewise linear trajectory along a path induced by a self-concordant barrier. In particular, our algorithm matches the number of iterations of any such IPM up to the same factor $O(n^{1.5}\log n)$. As our second contribution, we show that the SLC of any linear program is upper bounded by $2^{n + o(1)}$, which implies that our IPM's iteration complexity is at most exponential. This in contrast to existing iteration complexity bounds that depend on either bit-complexity or condition measures; these can be unbounded in the problem dimension. We achieve our upper bound by showing that the central path is well-approximated by a combinatorial proxy we call the \emph{max central path}, which consists of $2n$ shadow vertex simplex paths. Our upper bound complements the lower bounds of Allamigeon, Benchimol, Gaubert, and Joswig (SIAGA 2018), and Allamigeon, Gaubert, and Vandame (STOC 2022), who constructed linear programs with exponential SLC. Finally, we show that each iteration of our IPM can be implemented in strongly polynomial time. Along the way, we develop a deterministic algorithm that approximates the singular value decomposition of a matrix in strongly polynomial time to high accuracy, which may be of independent interest.

I show that the motion of a closed string consisting of $n$ segments in AdS$_3$ can be embedded into the mutation dynamics of the $Y^{n,0}$ brane tiling. The determinant of the Kasteleyn matrix computes the spectral curve. The dynamics is governed by a Y-system with additional constraints ensuring that the string closes in target space. The constraints can be deformed by coupling the worldsheet to a background two-form whose field strength is proportional to the volume form., Comment: 40 pages, 22 figures

The recent study of holographic superconductors has shown the emergence of a Kasner universe behind the event horizon. This paper serves to add to the discussion by introducing two modifications to the holographic superconductor model: an axion field term and an Einstein-Maxwell-scalar (EMS) coupling term. We first discuss the effect the modification parameters have on the condensate then explore the black hole interior dynamics. Features previously identified in the interior are found in the model presented, including the collapse of the Einstein-Rosen bridge, Josephson oscillations and Kasner inversions/transitions. However, we find that by increasing the EMS coupling parameter, the collapse does not occur near the axion-Reissner-Nordstr\"om horizon and the oscillations are no longer present; the geometry entering into a Kasner regime after a large-$r$ collapse instead., Comment: v2: 23 Pages, 16 Figures, minor typos corrected, Figure 2 corrected, references added, new axion model added. v1: 20 Pages, 13 Figures

We study the problem of maximizing Nash welfare (MNW) while allocating indivisible goods to asymmetric agents. The Nash welfare of an allocation is the weighted geometric mean of agents' utilities, and the allocation with maximum Nash welfare is known to satisfy several desirable fairness and efficiency properties. However, computing such an MNW allocation is NP-hard, even for two agents with identical, additive valuations. Hence, we aim to identify tractable classes that either admit a PTAS, an FPTAS, or an exact polynomial-time algorithm. To this end, we design a PTAS for finding an MNW allocation for the case of asymmetric agents with identical, additive valuations, thus generalizing a similar result for symmetric agents. Our techniques can also be adapted to give a PTAS for the problem of computing the optimal $p$-mean welfare. We also show that an MNW allocation can be computed exactly in polynomial time for identical agents with $k$-ary valuations when $k$ is a constant, where every agent has at most $k$ different values for the goods. Next, we consider the special case where every agent finds at most two goods valuable, and show that this class admits an efficient algorithm, even for general monotone valuations. In contrast, we note that when agents can value three or more goods, maximizing Nash welfare is NP-hard, even when agents are symmetric and have additive valuations, showing our algorithmic result is essentially tight. Finally, we show that for constantly many asymmetric agents with additive valuations, the MNW problem admits an FPTAS., Comment: 20 pages

We study the circuit diameter of polyhedra, introduced by Borgwardt, Finhold, and Hemmecke (SIDMA 2015) as a relaxation of the combinatorial diameter. We show that the circuit diameter of a system $\{x \in \mathbb{R}^n: Ax=b, 0\leq x\leq u\}$ for $A \in \mathbb{R}^{m \times n}$ is bounded by $O(m \min\{m, n-m\} \log(m+ \kappa_A)+n \log n)$, where $\kappa_A$ is the circuit imbalance measure of the constraint matrix. This yields a strongly polynomial circuit diameter bound if e.g., all entries of $A$ have polynomially bounded encoding length in $n$. Further, we present circuit augmentation algorithms for LPs using the minimum-ratio circuit cancelling rule. Even though the standard minimum-ratio circuit cancelling algorithm is not finite in general, our variant can solve an LP in $O(mn^2\log(n+\kappa_A))$ augmentation steps.

Quantitative susceptibility mapping (QSM) is a valuable MRI post-processing technique that quantifies the magnetic susceptibility of body tissue from phase data. However, the traditional QSM reconstruction pipeline involves multiple non-trivial steps, including phase unwrapping, background field removal, and dipole inversion. These intermediate steps not only increase the reconstruction time but amplify noise and errors. This study develops a large-stencil Laplacian preprocessed deep learning-based neural network for near instant quantitative field and susceptibility mapping (i.e., iQFM and iQSM) from raw MR phase data. The proposed iQFM and iQSM methods were compared with established reconstruction pipelines on simulated and in vivo datasets. In addition, experiments on patients with intracranial hemorrhage and multiple sclerosis were also performed to test the generalization of the novel neural networks. The proposed iQFM and iQSM methods yielded comparable results to multi-step methods in healthy subjects while dramatically improving reconstruction accuracies on intracranial hemorrhages with large susceptibilities. The reconstruction time was also substantially shortened from minutes using multi-step methods to only 30 milliseconds using the trained iQFM and iQSM neural networks.

We study properties and applications of various circuit imbalance measures associated with linear spaces. These measures describe possible ratios between nonzero entries of support-minimal nonzero vectors of the space. The fractional circuit imbalance measure turns out to be a crucial parameter in the context of linear programming, and two integer variants can be used to describe integrality properties of associated polyhedra. We give an overview of the properties of these measures, and survey classical and recent applications, in particular, for linear programming algorithms with running time dependence on the constraint matrix only, and for circuit augmentation algorithms. We also present new bounds on the diameter and circuit diameter of polyhedra in terms of the fractional circuit imbalance measure.

I show how to compute the spectral curve of piecewise linear Nambu-Goto strings in three-dimensional anti-de Sitter spacetime in terms of `celestial' embedding variables., Comment: 30 pages, 8 figures

We characterize a rich class of valuated matroids, called R-minor valuated matroids that includes the indicator functions of matroids, and is closed under operations such as taking minors, duality, and induction by network. We exhibit a family of valuated matroids that are not R-minor based on sparse paving matroids. Valuated matroids are inherently related to gross substitute valuations in mathematical economics. By the same token we refute the Matroid Based Valuation Conjecture by Ostrovsky and Paes Leme (Theoretical Economics 2015) asserting that every gross substitute valuation arises from weighted matroid rank functions by repeated applications of merge and endowment operations. Our result also has implications in the context of Lorentzian polynomials: it reveals the limitations of known construction operations., Comment: 67 pages. TheoretiCS journal version

We study the equilibrium computation problem in the Fisher market model with constrained piecewise linear concave (PLC) utilities. This general class captures many well-studied special cases, including markets with PLC utilities, markets with satiation, and matching markets. For the special case of PLC utilities, although the problem is PPAD-hard, Devanur and Kannan (FOCS 2008) gave a polynomial-time algorithm when the number of items is constant. Our main result is a fixed parameter approximation scheme for computing an approximate equilibrium, where the parameters are the number of agents and the approximation accuracy. This provides an answer to an open question by Devanur and Kannan for PLC utilities, and gives a simpler and faster algorithm for matching markets as the one by Alaei, Jalaly and Tardos (EC 2017). The main technical idea is to work with the stronger concept of thrifty equilibria, and approximating the input utility functions by `robust' utilities that have favorable marginal properties. With some restrictions, the results also extend to the Arrow--Debreu exchange market model.

This paper is concerned with a class of approximate non-linear transformations that compress solutions of the (generalized) sinh-Gordon equation into parametrically small regions in two-dimensional spacetime. Given the sinh-Gordon field near a time-slice, a long Nambu-Goto string can be constructed in three-dimensional anti-de Sitter space. The string is then approximated to arbitrary accuracy by a slightly smoothed piecewise linear string of N segments. The corresponding sinh-Gordon field has a comb-like structure and its size is controlled by the amount of smoothing applied to the segmented string. In a (singular) large-N limit, the transformation commutes with time evolution. As an example, a static cosh-Gordon solution is discussed in detail. The corresponding smooth and segmented string solutions are obtained and the compressed cosh-Gordon potential is investigated., Comment: 6 pages, 9 figures

Mathematical models are becoming increasingly important in magnetic resonance imaging (MRI), as they provide a mechanistic approach for making a link between tissue microstructure and signals acquired using the medical imaging instrument. The Bloch equations, which describes spin and relaxation in a magnetic field, is a set of integer order differential equations with a solution exhibiting mono-exponential behaviour in time. Parameters of the model may be estimated using a non-linear solver, or by creating a dictionary of model parameters from which MRI signals are simulated and then matched with experiment. We have previously shown the potential efficacy of a magnetic resonance fingerprinting (MRF) approach, i.e. dictionary matching based on the classical Bloch equations, for parcellating the human cerebral cortex. However, this classical model is unable to describe in full the mm-scale MRI signal generated based on an heterogenous and complex tissue micro-environment. The time-fractional order Bloch equations has been shown to provide, as a function of time, a good fit of brain MRI signals. We replaced the integer order Bloch equations with the previously reported time-fractional counterpart within the MRF framework and performed experiments to parcellate human gray matter, which is cortical brain tissue with different cyto-architecture at different spatial locations. Our findings suggest that the time-fractional order parameters, {\alpha} and {\beta}, potentially associate with the effect of interareal architectonic variability, hypothetically leading to more accurate cortical parcellation.

Cross-modality image estimation involves the generation of images of one medical imaging modality from that of another modality. Convolutional neural networks (CNNs) have been shown to be useful in identifying, characterising and extracting image patterns. Generative adversarial networks (GANs) use CNNs as generators and estimated images are discriminated as true or false based on an additional network. CNNs and GANs within the image estimation framework may be considered more generally as deep learning approaches, since imaging data tends to be large, leading to a larger number of network weights. Almost all research in the CNN/GAN image estimation literature has involved the use of MRI data with the other modality primarily being PET or CT. This review provides an overview of the use of CNNs and GANs for MRI-based cross-modality medical image estimation. We outline the neural networks implemented, and detail network constructs employed for CNN and GAN image-to-image estimators. Motivations behind cross-modality image estimation are provided as well. GANs appear to provide better utility in cross-modality image estimation in comparison with CNNs, a finding drawn based on our analysis involving metrics comparing estimated and actual images. Our final remarks highlight key challenges faced by the cross-modality medical image estimation field, and suggestions for future research are outlined.

Diffusion MRI measures of the human brain provide key insight into microstructural variations across individuals and into the impact of central nervous system diseases and disorders. One approach to extract information from diffusion signals has been to use biologically relevant analytical models to link millimetre scale diffusion MRI measures with microscale influences. The other approach has been to represent diffusion as an anomalous transport process and infer microstructural information from the different anomalous diffusion equation parameters. In this study, we investigated how parameters of various anomalous diffusion models vary with age in the human brain white matter, particularly focusing on the corpus callosum. We first unified several established anomalous diffusion models (the super-diffusion, sub-diffusion, quasi-diffusion and fractional Bloch-Torrey models) under the continuous time random walk modelling framework. This unification allows a consistent parameter fitting strategy to be applied from which meaningful model parameter comparisons can be made. We then provided a novel way to derive the diffusional kurtosis imaging (DKI) model, which is shown to be a degree two approximation of the sub-diffusion model. This link between the DKI and sub-diffusion models led to a new robust technique for generating maps of kurtosis and diffusivity using the sub-diffusion parameters \b{eta}_SUB and D_SUB. Superior tissue contrast is achieved in kurtosis maps based on the sub-diffusion model. 7T diffusion weighted MRI data for 65 healthy participants in the age range 19-78 years was used in this study. Results revealed that anomalous diffusion model parameters {\alpha} and \b{eta} have shown consistent positive correlation with age in the corpus callosum, indicating {\alpha} and \b{eta} are sensitive to tissue microstructural changes in aging.

In this note we discuss various classical membrane solutions in AdS$_4$ spacetime: simple embeddings given by polynomials in ambient space, solutions with non-linear waves, and piecewise linear solutions., Comment: 21 pages, 13 figures

In this note we analyse the equations of motion of a minimally coupled Rarita-Schwinger field near the horizon of an anti-de Sitter-Schwarzschild geometry. We find that at special complex values of the frequency and momentum there exist two independent regular solutions that are ingoing at the horizon. These special points in Fourier space are associated with the `pole-skipping' phenomenon in thermal two-point functions of operators that are holographically dual to the bulk fields. We find that the leading pole-skipping point is located at a positive imaginary frequency with the distance from the origin being equal to half of the Lyapunov exponent for maximally chaotic theories., Comment: 9 pages, 2 figures