Search

This paper suggests achieving diversity gains while utilizing low-denisty parity check (LDPC) codes in molecular communications. Intersymbol interference (ISI) causes a significant disadvantage in error performance for molecular communications. Even though decoding LDPC codes with soft decoding yields a considerable enhancement in the bit error rate (BER) curves, this can be further improved by utilizing diversity gain. In order to achieve this, two different messenger molecule types are sent to transmit the message codeword and its interleaved version. The molecular communication channel is then modeled, and the error performance of the proposed method is estimated by Monte-Carlo simulations. This approach provides considerable improvement in the error performance in the scenario where few messenger molecules are transmitted per bit., Comment: 4 pages, 5 figures, 1 table

The focus of this paper is on 3D motion editing. Given a 3D human motion and a textual description of the desired modification, our goal is to generate an edited motion as described by the text. The key challenges include the scarcity of training data and the need to design a model that accurately edits the source motion. In this paper, we address both challenges. We propose a methodology to semi-automatically collect a dataset of triplets comprising (i) a source motion, (ii) a target motion, and (iii) an edit text, introducing the new MotionFix dataset. Access to this data allows us to train a conditional diffusion model, TMED, that takes both the source motion and the edit text as input. We develop several baselines to evaluate our model, comparing it against models trained solely on text-motion pair datasets, and demonstrate the superior performance of our model trained on triplets. We also introduce new retrieval-based metrics for motion editing, establishing a benchmark on the evaluation set of MotionFix. Our results are promising, paving the way for further research in fine-grained motion generation. Code, models, and data are available at https://motionfix.is.tue.mpg.de/ ., Comment: SIGGRAPH Asia 2024 Camera Ready, Project page: https://motionfix.is.tue.mpg.de

We have investigated whether the lack of X-ray pulsations from most neutron star (NS) low-mass X-ray binaries (LMXBs) could be due to the extension of their inner disc to the NS surface. To estimate the inner disc radii, we have employed the model, recently proposed to account for the torque reversals of LMXBs. In this model, the inner disc radius depends on the spin period as well as the dipole moment and the mass inflow rate of the disc. Our model results indicate that most LMXBs have mass accretion rates above the minimum critical rates required for the inner disc to reach down to the NS surface and thereby quench the pulsed X-ray emission. For most sources X-ray pulsations are allowed when the period decreases below a certain critical value. For the same parameters, the model is also consistent with the observed X-ray luminosity ranges of the individual accreting millisecond X-ray pulsars (AMXPs). The paucity of AMXPs compared to the majority population of non-pulsing LMXBs is explained, as well as the fact that AMXPs are transient sources., Comment: 10 pages, 5 figures, accepted for publication in MNRAS

Nowadays a vast literature is available on the Hele-Shaw or incompressible limit for nonlinear degenerate diffusion equations. This problem has attracted a lot of attention due to its applications to tissue growth and crowd motion modelling as it constitutes a way to link soft congestion (or compressible) models to hard congestion (or incompressible) descriptions. In this paper, we address the question of estimating the rate of this asymptotics in the presence of external drifts. In particular, we provide improved results in the 2-Wasserstein distance which are global in time thanks to the contractivity property that holds for strictly convex potentials.

This paper deals with a class of neural SDEs and studies the limiting behavior of the associated sampled optimal control problems as the sample size grows to infinity. The neural SDEs with N samples can be linked to the N-particle systems with centralized control. We analyze the Hamilton--Jacobi--Bellman equation corresponding to the N-particle system and establish regularity results which are uniform in N. The uniform regularity estimates are obtained by the stochastic maximum principle and the analysis of a backward stochastic Riccati equation. Using these uniform regularity results, we show the convergence of the minima of objective functionals and optimal parameters of the neural SDEs as the sample size N tends to infinity. The limiting objects can be identified with suitable functions defined on the Wasserstein space of Borel probability measures. Furthermore, quantitative algebraic convergence rates are also obtained., Comment: 45 pages, 2 figures

We prove well-posedness of a class of kinetic-type Mean Field Games, which typically arise when agents control their acceleration. Such systems include independent variables representing the spatial position as well as velocity. We consider non-separable Hamiltonians without any structural conditions, which depend locally on the density variable. Our analysis is based on two main ingredients: an energy method for the forward-backward system in Sobolev spaces, on the one hand and on a suitable vector field method to control derivatives with respect to the velocity variable, on the other hand. The careful combination of these two techniques reveals interesting phenomena applicable for Mean Field Games involving general classes of drift-diffusion operators and nonlinearities. While many prior existence theories for general Mean Field Games systems take the final datum function to be smoothing, we can allow this function to be non-smoothing, i.e. also depending locally on the final measure. Our well-posedness results hold under an appropriate smallness condition, assumed jointly on the data., Comment: 26 pages

In this paper we unveil novel monotonicity conditions applicable for Mean Field Games through the exploration of finite dimensional $canonical\ transformations$. Our findings contribute to establishing new global well-posedness results for the associated master equations, also in the case of potentially degenerate idiosyncratic noise. Additionally, we show that recent advancements in global well-posedness results, specifically those related to displacement semi-monotone and anti-monotone data, can be easily obtained as a consequence of our main results., Comment: 16 pages

In this note we show how canonical transformations reveal hidden convexity properties for deterministic optimal control problems, which in turn result in global existence of $C^{1,1}_{loc}$ solutions to first order Hamilton--Jacobi--Bellman equations., Comment: 9 pages

The random-magnetic-field classical Heisenberg model is solved in spatial dimensions d>=2 using the recently developed Fourier-Legendre renormalization-group theory for $4\pi$ steradians continuously orientable spins, with renormalization-group flows of 12,500 variables. The random-magnetic-field Heisenberg model is exactly solved in 10 hierarchical models, for d=2,2.26,2.46,2.58,2.63,2.77,2.89,3. For non-zero random fields, ferromagnetic order is seen for d>2. This ordering shows, at d=3, reentrance as a function of temperature., Comment: 6 pages, 6 figures. arXiv admin note: text overlap with arXiv:2202.06049

In this paper we construct global in time classical solutions to mean field games master equations in the lack of idiosyncratic noise in the individual agents' dynamics. These include both deterministic models and dynamics driven solely by a Brownian common noise. We consider a general class of non-separable Hamiltonians and final data functions that are supposed to be displacement monotone. Our main results unify and generalize in particular some of the well-posedness results on displacement monotone master equations obtained recently by Gangbo--M\'esz\'aros and Gangbo--M\'esz\'aros--Mou--Zhang., Comment: 22 pages; to appear in SIAM J. Control Optim

We consider the Shortest Odd Path problem, where given an undirected graph $G$, a weight function on its edges, and two vertices $s$ and $t$ in $G$, the aim is to find an $(s,t)$-path with odd length and, among all such paths, of minimum weight. For the case when the weight function is conservative, i.e., when every cycle has non-negative total weight, the complexity of the Shortest Odd Path problem had been open for 20 years, and was recently shown to be NP-hard. We give a polynomial-time algorithm for the special case when the weight function is conservative and the set $E^-$ of negative-weight edges forms a single tree. Our algorithm exploits the strong connection between Shortest Odd Path and the problem of finding two internally vertex-disjoint paths between two terminals in an undirected edge-weighted graph. It also relies on solving an intermediary problem variant called Shortest Parity-Constrained Odd Path where for certain edges we have parity constraints on their position along the path. Also, we exhibit two FPT algorithms for solving Shortest Odd Path in graphs with conservative weight functions. The first FPT algorithm is parameterized by $|E^-|$, the number of negative edges, or more generally, by the maximum size of a matching in the subgraph of $G$ spanned by $E^-$. Our second FPT algorithm is parameterized by the treewidth of $G$.

This paper examines the Balanced Submodular Flow Problem, that is the problem of finding a feasible submodular flow minimizing the difference between the flow values along the edges. A min-max formula is given to the problem and an algorithm is presented to solve it using $O(m^2)$ submodular function minimizations. Then, these result are extended to the weighted version of the problem. Finally, the Balanced Integer Submodular Flow Problem is discussed., Comment: 22 pages, 1 figure

This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism problem for various graph classes. For example, all non-cospectral graph pairs are distinguished by the proposed combinatorial method, furthermore, even non-isomorphic cospectral graphs can be distinguished assuming certain properties of their eigenspaces. We also investigate a refinement of the aforementioned labeling, called $\mathfrak{s}^k$-labeling, which has both theoretical and practical applications. Among others, it can be used to generate graph fingerprints, which uniquely identify all graphs in the considered databases, including all strongly regular graphs on at most 64 nodes and all graphs on at most 12 nodes. It provably identifies all trees and 3-connected planar graphs up to isomorphism, which -- as a byproduct -- gives a new isomorphism algorithm for both graph classes. The practical importance of this fingerprint lies in significantly speeding up searching in graph databases, which is a commonly required task in biological and chemical applications.

The fallback disc model predicted that anomalous X-ray pulsars (AXPs) and soft-gamma repeaters (SGRs) will evolve to isolated long period pulsars before the discovery of the first two long-period pulsars (LPPs) this year. Unlike normal radio pulsars, LPPs show transient pulsed-radio epochs with unusual and variable pulse shapes, similar to the radio behaviour of the few radio emitting AXP/SGRs. We show that the present properties of the recently discovered second LPP, PSR J0901-4046 ($P \simeq 76$ s), are obtained as a result of evolution in interaction with a fallback disc, as we had already shown for the first discovered LPP, GLEAM-X J162759.5-523504.3 ($P \simeq 1091$ s). While there is only an upper limit to the period derivative, $\dot{P}$, of GLEAM-X J162759.5-523504.3, the $\dot{P}$ of the PSR J0901-4046 has already been measured, providing better constraints for the evolutionary models. The model can produce the source properties with a dipole moment $\mu \simeq 10^{30}$ G cm$^3$. The results are not sensitive to the initial pulsar period. Our results indicate that PSR J0901-4046 went through an AXP/SGR epoch at an age of a few $10^4$ yr, and is $\sim (6 - 8) \times 10^5$ yr old at present., Comment: 5 pages, 1 figure. Accepted for publication in MNRAS Letters

In this paper we propose two new monotonicity conditions that could serve as sufficient conditions for uniqueness of Nash equilibria in mean field games. In this study we aim for $unconditional\ uniqueness$ that is independent of the length of the time horizon, the regularity of the starting distribution of the agents, or the regularization effect of a non-degenerate idiosyncratic noise. Through a rich class of simple examples we show that these new conditions are not only in dichotomy with each other, but also with the two widely studied monotonicity conditions in the literature, the Lasry-Lions monotonicity and displacement monotonicity conditions., Comment: to appear in J. Funct. Anal

In this manuscript we derive a new nonlinear transport equation written on the space of probability measures that allows to study a class of deterministic mean field games and master equations, where the interaction of the agents happens only at the terminal time. The point of view via this transport equation has two important consequences. First, this equation reveals a new monotonicity condition that is sufficient both for the uniqueness of MFG Nash equilibria and for the global in time well-posedness of master equations. Interestingly, this condition is in general in dichotomy with both the Lasry--Lions and displacement monotonicity conditions, studied so far in the literature. Second, in the absence of monotonicity, the conservative form of the transport equation can be used to define weak entropy solutions to the master equation. We construct several concrete examples to demonstrate that MFG Nash equilibria, whether or not they actually exist, may not be selected by the entropy solutions of the master equation., Comment: final version; to appear in Math. Ann

The long-period ($P = 1091$ s) of the recently discovered pulsar GLEAM-X J162759.5-523504.3 can be attained by neutron stars evolving with fallback discs and magnetic dipole moments of a few $10^{30}$ G cm$^3$ at ages greater than $\sim 2 \times 10^5$ yr consistently with the observational upper limits to the period derivative, $\dot{P}$, and the X-ray luminosity, $L_X$, of the source. The current upper limits for $\dot{P}$ allow two alternative present states: (1) The disc is still active with ongoing accretion at a low rate such that the accretion luminosity is much less than the neutron star's cooling luminosity, which in turn is below the upper limit for $L_X$. In this scenario the spin-down will continue at $\dot{P} \sim 10^{-10}$ s s$^{-1}$ until the disc becomes inactive; the final period will be $P \sim$ a few $10^3$ s. (2) The disc is already inactive, there is no accretion. In this case the period evolution has leveled off to the observed value in the final period range. The remaining, very weak, dipole torque sustaining asymptotic spin-down at $\dot{P} \sim 4 \times 10^{-18}$ s s$^{-1}$. Long periods $P \sim$ a few $10^3$ s were predicted for the final states of soft gamma repeaters and anomalous X-ray pulsars with relatively strong dipole fields in earlier work with the fallback disc model., Comment: 4 pages, 1 figure, Updated version, Accepted for publication in MNRAS Letters

A complexity classification scheme is developed from the fractal spectra of spin-glass chaos and demonstrated with multigeographic multicultural music and brain electroencephalogram signals. Systematic patterns are found to emerge. Chaos under scale change is the essence of spin-glass ordering and can be obtained, continuously tailor-made, from the exact renormalization-group solution of Ising models on frustrated hierarchical lattices. The music pieces are from Turkish music, namely Arabesque, Rap, Pop, Classical, and Western music, namely Blues, Jazz, Pop, Classical. A surprising group defection occurs., Comment: 9 pages, 5 figures, 1 table