Tootfinder

This https://arxiv.org/abs/2305.16882 has been replaced.
link: https://scholar.google.com/scholar?q=a

Link Residual Closeness of Harary Graphs
The study of networks characteristics is an important subject in different fields, like math, chemistry, transportation, social network analysis etc. The residual closeness is one of the most sensitive measure of graphs vulnerability. In this article we calculate the link residual closeness of Harary graphs.

This https://arxiv.org/abs/2304.05360 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

A Third Information-Theoretic Approach to Finite de Finetti Theorems
A new finite form of de Finetti's representation theorem is established using elementary information-theoretic tools. The distribution of the first $k$ random variables in an exchangeable vector of $n\geq k$ random variables is close to a mixture of product distributions. Closeness is measured in terms of the relative entropy and an explicit bound is provided. This bound is tighter than those obtained via earlier information-theoretic proofs, and its utility extends to random variables taking v…

Edit Distance of Finite State Transducers
C. Aiswarya, Amaldev Manuel, Saina Sunny
https://arxiv.org/abs/2404.16518 https://arxiv.org…

Edit Distance of Finite State Transducers
We lift metrics over words to metrics over word-to-word transductions, by defining the distance between two transductions as the supremum of the distances of their respective outputs over all inputs. This allows to compare transducers beyond equivalence. Two transducers are close (resp. $k$-close) with respect to a metric if their distance is finite (resp. at most $k$). Over integer-valued metrics computing the distance between transducers is equivalent to deciding the closeness and $k$-close…

windsurfers: Windsurfers network (1986)
A network of interpersonal contacts among windsurfers in southern California during the Fall of 1986. The edge weights indicate the perception of social affiliations majored by the tasks in which each individual was asked​ to sort cards with other surfer’s name in the order of closeness.
This network has 43 nodes and 336 edges.
Tags: Social, Offline, Weighted

#WordWeavers 20Mar- Who raised your side character (SC)? What was their relationship like?
Her father raised her, a miller with a large heart and a warm soul. She's a spitting image of her late mother, and he both loves his daughter and fears for her. She grows into her own, and their closeness lessens with age and distance. Time will tell if they reconnect.

How can we transform moments of pain into moments of closeness?

windsurfers: Windsurfers network (1986)
A network of interpersonal contacts among windsurfers in southern California during the Fall of 1986. The edge weights indicate the perception of social affiliations majored by the tasks in which each individual was asked​ to sort cards with other surfer’s name in the order of closeness.
This network has 43 nodes and 336 edges.
Tags: Social, Offline, Weighted

Compressibility and Stochastic Stability of Monotone Markov Chain
Sergey Foss, Michael Scheutzow
https://arxiv.org/abs/2403.15259 https://

Compressibility and Stochastic Stability of Monotone Markov Chain
For a stochastically monotone Markov chain taking values in a Polish space, we present a number of conditions for existence and for uniqueness of its stationary regime, as well as for closeness of its transient trajectories. In particular, we generalise a basic result by Bhattacharya and Majumdar (2007) where a certain form of mixing, or swap condition was assumed uniformly over the state space. We do not rely on continuity properties of transition probabilities.

#WordWeavers 20Mar- Who raised your side character (SC)? What was their relationship like?
Her father raised her, a miller with a large heart and a warm soul. She's a spitting image of her late mother, and he both loves his daughter and fears for her. She grows into her own, and their closeness lessens with age and distance. Time will tell if they reconnect.

windsurfers: Windsurfers network (1986)
A network of interpersonal contacts among windsurfers in southern California during the Fall of 1986. The edge weights indicate the perception of social affiliations majored by the tasks in which each individual was asked​ to sort cards with other surfer’s name in the order of closeness.
This network has 43 nodes and 336 edges.
Tags: Social, Offline, Weighted

Profile of Vulnerability Remediations in Dependencies Using Graph Analysis
Fernando Vera, Palina Pauliuchenka, Ethan Oh, Bai Chien Kao, Louis DiValentin, David A. Bader
https://arxiv.org/abs/2403.04989

Profile of Vulnerability Remediations in Dependencies Using Graph Analysis
This research introduces graph analysis methods and a modified Graph Attention Convolutional Neural Network (GAT) to the critical challenge of open source package vulnerability remediation by analyzing control flow graphs to profile breaking changes in applications occurring from dependency upgrades intended to remediate vulnerabilities. Our approach uniquely applies node centrality metrics -- degree, norm, and closeness centrality -- to the GAT model, enabling a detailed examination of package…

This https://arxiv.org/abs/2404.00686 has been replaced.
link: https://scholar.google.com/scholar?q=a

Utilizing Maximum Mean Discrepancy Barycenter for Propagating the Uncertainty of Value Functions in Reinforcement Learning
Accounting for the uncertainty of value functions boosts exploration in Reinforcement Learning (RL). Our work introduces Maximum Mean Discrepancy Q-Learning (MMD-QL) to improve Wasserstein Q-Learning (WQL) for uncertainty propagation during Temporal Difference (TD) updates. MMD-QL uses the MMD barycenter for this purpose, as MMD provides a tighter estimate of closeness between probability measures than the Wasserstein distance. Firstly, we establish that MMD-QL is Probably Approximately Correct…

windsurfers: Windsurfers network (1986)
A network of interpersonal contacts among windsurfers in southern California during the Fall of 1986. The edge weights indicate the perception of social affiliations majored by the tasks in which each individual was asked​ to sort cards with other surfer’s name in the order of closeness.
This network has 43 nodes and 336 edges.
Tags: Social, Offline, Weighted

Node Centrality Approximation For Large Networks Based On Inductive Graph Neural Networks
Yiwei Zou, Ting Li, Zong-fu Luo
https://arxiv.org/abs/2403.04977 …

Node Centrality Approximation For Large Networks Based On Inductive Graph Neural Networks
Closeness Centrality (CC) and Betweenness Centrality (BC) are crucial metrics in network analysis, providing essential reference for discerning the significance of nodes within complex networks. These measures find wide applications in critical tasks, such as community detection and network dismantling. However, their practical implementation on extensive networks remains computationally demanding due to their high time complexity. To mitigate these computational challenges, numerous approximat…

Quantum Soft Covering and Decoupling with Relative Entropy Criterion
Xingyi He, Touheed Anwar Atif, S. Sandeep Pradhan
https://arxiv.org/abs/2402.11112 htt…

Quantum Soft Covering and Decoupling with Relative Entropy Criterion
We propose quantum soft covering problems for fully quantum channels and classical-quantum (CQ) channels using relative entropy as a criterion of operator closeness. We prove covering lemmas by deriving one-shot bounds on the rates in terms of smooth min-entropies and smooth max-divergences, respectively. In the asymptotic regime, we show that for quantum channels, the rate infimum defined as the logarithm of the minimum rank of the input state is the coherent information between the reference …

This https://arxiv.org/abs/2306.05186 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

Innovation Processes for Inference
Urn models for innovation have proven to capture fundamental empirical laws shared by several real-world processes. The so-called urn model with triggering includes, as particular cases, an urn representation of the two-parameter Poisson-Dirichlet process and the Dirichlet process, seminal in Bayesian non-parametric inference. In this work, we leverage this connection to introduce a novel approach for quantifying closeness between symbolic sequences and test it within the framework of the autho…

windsurfers: Windsurfers network (1986)
A network of interpersonal contacts among windsurfers in southern California during the Fall of 1986. The edge weights indicate the perception of social affiliations majored by the tasks in which each individual was asked​ to sort cards with other surfer’s name in the order of closeness.
This network has 43 nodes and 336 edges.
Tags: Social, Offline, Weighted

windsurfers: Windsurfers network (1986)
A network of interpersonal contacts among windsurfers in southern California during the Fall of 1986. The edge weights indicate the perception of social affiliations majored by the tasks in which each individual was asked​ to sort cards with other surfer’s name in the order of closeness.
This network has 43 nodes and 336 edges.
Tags: Social, Offline, Weighted

Robust radial basis function interpolation based on geodesic distance for the numerical coupling of multiphysics problems
Michele Bucelli, Francesco Regazzoni, Luca Dede', Alfio Quarteroni
https://arxiv.org/abs/2403.03665

Robust radial basis function interpolation based on geodesic distance for the numerical coupling of multiphysics problems
Multiphysics simulations frequently require transferring solution fields between subproblems with non-matching spatial discretizations, typically using interpolation techniques. Standard methods are usually based on measuring the closeness between points by means of the Euclidean distance, which does not account for curvature, cuts, cavities or other non-trivial geometrical or topological features of the domain. This may lead to spurious oscillations in the interpolant in proximity to these fea…

windsurfers: Windsurfers network (1986)
A network of interpersonal contacts among windsurfers in southern California during the Fall of 1986. The edge weights indicate the perception of social affiliations majored by the tasks in which each individual was asked​ to sort cards with other surfer’s name in the order of closeness.
This network has 43 nodes and 336 edges.
Tags: Social, Offline, Weighted

windsurfers: Windsurfers network (1986)
A network of interpersonal contacts among windsurfers in southern California during the Fall of 1986. The edge weights indicate the perception of social affiliations majored by the tasks in which each individual was asked​ to sort cards with other surfer’s name in the order of closeness.
This network has 43 nodes and 336 edges.
Tags: Social, Offline, Weighted

Robust radial basis function interpolation based on geodesic distance for the numerical coupling of multiphysics problems
Michele Bucelli, Francesco Regazzoni, Luca Dede', Alfio Quarteroni
https://arxiv.org/abs/2403.03665

Robust radial basis function interpolation based on geodesic distance for the numerical coupling of multiphysics problems
Multiphysics simulations frequently require transferring solution fields between subproblems with non-matching spatial discretizations, typically using interpolation techniques. Standard methods are usually based on measuring the closeness between points by means of the Euclidean distance, which does not account for curvature, cuts, cavities or other non-trivial geometrical or topological features of the domain. This may lead to spurious oscillations in the interpolant in proximity to these fea…

windsurfers: Windsurfers network (1986)
A network of interpersonal contacts among windsurfers in southern California during the Fall of 1986. The edge weights indicate the perception of social affiliations majored by the tasks in which each individual was asked​ to sort cards with other surfer’s name in the order of closeness.
This network has 43 nodes and 336 edges.
Tags: Social, Offline, Weighted