English
Related papers

Related papers: Positive crossratios, barycenters, trees and appli…

200 papers

We develop a generalized active contour formalism for image segmentation based on shape templates. The shape template is subjected to a restricted affine transformation (RAT) in order to segment the object of interest. RAT allows for…

Computer Vision and Pattern Recognition · Computer Science 2013-12-04 Jayanth Krishna Mogali , Adithya Kumar Pediredla , Chandra Sekhar Seelamantula

Continuous time branching models are used to create random fractals in a Euclidean space, whose Hausdorff dimension is controlled by an input parameter. Finite realizations are applied in modelling the set of sites visited in models of…

Probability · Mathematics 2018-05-25 R. W. R. Darling , Robin Pemantle

We investigate the mixed spin-$(s,\tfrac12)$ Ising model on a Cayley tree of order three ($k=3$), extending the approach of \cite{Akin2024}. For the representative case $s=5$, the associated recursion leads to an 11-dimensional dynamical…

Mathematical Physics · Physics 2026-02-17 Hasan Akin

Wavelet (Besov) priors are a promising way of reconstructing indirectly measured fields in a regularized manner. We demonstrate how wavelets can be used as a localized basis for reconstructing permeability fields with sharp interfaces from…

Numerical Analysis · Mathematics 2019-07-09 Philipp Wacker , Peter Knabner

Multifractal analysis of multiplicative random cascades is revisited within the framework of {\em mixed asymptotics}. In this new framework, statistics are estimated over a sample which size increases as the resolution scale (or the…

Probability · Mathematics 2008-05-05 Emmanuel Bacry , Arnaud Gloter , Marc Hoffmann , Jean-Francois Muzy

In this article we construct a maximal set of kernels for a multi-parameter linear scale-space that allow us to construct trees for classification and recognition of one-dimensional continuous signals similar the Gaussian linear scale-space…

Statistics Theory · Mathematics 2023-05-24 Leon A. Luxemburg , Steven B. Damelin

Let $d \ge 1$. We study a subspace of the space of automorphic forms of $\mathrm{GL}_d$ over a global field of positive characteristic (or, a function field of a curve over a finite field). We fix a place $\infty$ of $F$, and we consider…

Number Theory · Mathematics 2021-01-08 Satoshi Kondo , Seidai Yasuda

A hyperbolic plane can be modeled by a structure called the enhanced binary tree. We study the ferromagnetic Ising model on top of the enhanced binary tree using the renormalization-group analysis in combination with transfer-matrix…

Statistical Mechanics · Physics 2015-05-30 Seung Ki Baek , Harri Mäkelä , Petter Minnhagen , Beom Jun Kim

The simulation of electromagnetic devices with complex geometries and large-scale discrete systems benefits from advanced computational methods like IsoGeometric Analysis and Domain Decomposition. In this paper, we employ both concepts in…

Computational Engineering, Finance, and Science · Computer Science 2025-01-24 Mario Mally , Bernard Kapidani , Melina Merkel , Sebastian Schöps , Rafael Vázquez

Dilaton effective field theory (dEFT) can be employed to analyze lattice data in gauge theories that lie in close proximity of the lower edge of the conformal window. Under special conditions, we show that it can be used as a diagnostic…

High Energy Physics - Lattice · Physics 2026-02-09 Thomas Appelquist , James Ingoldby , Maurizio Piai

A first-principles theory of resonant magnetic scattering of x rays is presented. The scattering amplitudes are calculated using a standard time-dependent perturbation theory to second order in the electron-photon interaction vertex. In…

Strongly Correlated Electrons · Physics 2009-11-10 E. Arola , M. Horne , P. Strange , H. Winter , Z. Szotek , W. M. Temmerman

This work presents novel algorithms for learning Bayesian network structures with bounded treewidth. Both exact and approximate methods are developed. The exact method combines mixed-integer linear programming formulations for structure…

Artificial Intelligence · Computer Science 2014-06-09 Siqi Nie , Denis Deratani Maua , Cassio Polpo de Campos , Qiang Ji

In 1996, Bodlaender showed the celebrated result that an optimal tree decomposition of a graph of bounded treewidth can be found in linear time. The algorithm is based on an algorithm of Bodlaender and Kloks that computes an optimal tree…

Data Structures and Algorithms · Computer Science 2020-03-19 Ernst Althaus , Sarah Ziegler

A physically reasonable model is introduced in order to estimate, in a functional way, the vast number of distinct graphs which are conventionally neglected in eikonal scattering models that lead to total cross sections increasing with…

High Energy Physics - Theory · Physics 2009-11-07 H. M. Fried , Y. Gabellini

This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the…

Methodology · Statistics 2017-12-05 Mohamad Elmasri

We generalize the notion of fixed point homogeneous isometric group actions to the context of singular Riemannian foliations. We find that in some cases, positively curved manifolds admitting these so-called point leaf maximal SRF's are…

Differential Geometry · Mathematics 2018-05-03 Adam Moreno

The goal of this paper is to obtain quantitative results on the number and on the size of maximal independent sets and maximal matchings in several block-stable graph classes that satisfy a proper sub-criticality condition. In particular we…

Combinatorics · Mathematics 2020-12-29 Michael Drmota , Lander Ramos , Clément Requilé , Juanjo Rué

The understanding of the physical laws determining the infrared behaviour of amplitudes is a longstanding and topical problem. In this paper, we show that energy conservation alone implies strong constraints on the threshold singularity…

High Energy Physics - Theory · Physics 2023-04-05 Zeno Capatti

We study isometric actions of finitely presented groups on $\mathbb{R}$-trees. In this paper, we develop a relative version of the Rips machine to study $\textit{pairs}$ of such actions. An important example of a $\textit{pair}$ is a group…

Group Theory · Mathematics 2016-12-26 Pei Wang

Let $R$ and $B$ be two disjoint sets of points in the plane such that $|B|\leqslant |R|$, and no three points of $R\cup B$ are collinear. We show that the geometric complete bipartite graph $K(R,B)$ contains a non-crossing spanning tree…

Computational Geometry · Computer Science 2015-12-10 Ahmad Biniaz , Prosenjit Bose , Anil Maheshwari , Michiel Smid