國立高雄大學圖資館 |

登入

回首頁

Inference of Hidden Hierarchies From Observable Networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Inference of Hidden Hierarchies From Observable Networks.
作者:	Pebes Trujillo, Miguel Raul.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, 2023
面頁冊數:	158 p.
附註:	Source: Dissertations Abstracts International, Volume: 85-02, Section: A.
附註:	Advisor: Manrique-Vallier, Daniel;Womack, Andrew.
Contained By:	Dissertations Abstracts International85-02A.
標題:	Statistics.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30570933
ISBN:	9798379971977

Inference of Hidden Hierarchies From Observable Networks.
Pebes Trujillo, Miguel Raul.

Inference of Hidden Hierarchies From Observable Networks. - Ann Arbor : ProQuest Dissertations & Theses, 2023 - 158 p.

Source: Dissertations Abstracts International, Volume: 85-02, Section: A.

Thesis (Ph.D.)--Indiana University, 2023.

This item must not be sold to any third party vendors.

The observable dynamics of real-world networks often obey rules imposed by a hierarchical structure of their components. These hierarchies are fundamental for better understanding several natural, social, and artificial systems around us. Not surprisingly, in many phenomena these hierarchies are seldom directly observable and must be inferred only from their effects. In this dissertation, I develop a family of probabilistic models capable of inferring hidden hierarchies from observed network measurements. These models consider both the effect of hierarchies on network constituents and the structure of the hierarchies themselves. I develop estimators for latent hierarchies and computational methods to infer them under a Bayesian approach. I apply these methods to two different data structures that can be driven by an underlying hierarchy, using both simulated and real data. The first is social networks when they are used to represent affection or agonistic behavior in groups, which leads to a straightforward inference of a dominance hierarchy. The second is bipartite networks when one part can be described by a hierarchy and this hierarchy drives the co-occurrence of edges to members of the other part.I characterize hierarchies as directed acyclic graphs (DAGs). The space of hierarchies grows super-exponentially with the number of nodes in a network. This leads to both theoretical and computational inferential issues. I address both and point to avenues of research as potential extensions of my work. On the theoretical side, the main issue is to build models that are tractable while still preserving structure that is rich-enough to describe the connection of the latent hierarchy to the observable dynamics. On the computational side, it quickly becomes impossible to do an exhaustive enumeration of the space of latent hierarchies giving rise to a challenging search for the optimal solution. I deal with this by stochastically exploring the solution space via Markov Chain Monte Carlo algorithms.The developed models and methods have the potential to be widely applied in domains where revealing hidden hierarchies is meaningful. To name a few, artificial intelligence, national security, social and political sciences, international relations, animal behavior and behavioral ecology, biology, and neuroscience could benefit from these advancements. With that scope and in synergy with prior research that has characterized hierarchies differently (e.g. as total orders, rankings, dendograms, etc.), this dissertation contributes to seeding the foundations of a unified statistical framework for the study of hierarchical organization, yet to be created.

ISBN: 9798379971977Subjects--Topical Terms:

182057
Statistics.
Subjects--Index Terms:

Bayesian statistics

Inference of Hidden Hierarchies From Observable Networks.
LDR:03896nmm a2200385 4500 001 655813
005 20240414211937.5
006 m o d
007 cr#unu||||||||
008 240620s2023 ||||||||||||||||| ||eng d
020 $a 9798379971977
035 $a (MiAaPQ)AAI30570933
035 $a AAI30570933
040 $a MiAaPQ $c MiAaPQ
100 1 $a Pebes Trujillo, Miguel Raul. $0 (orcid)0009-0001-0652-5161 $3 966927
245 1 0 $a Inference of Hidden Hierarchies From Observable Networks.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2023
300 $a 158 p.
500 $a Source: Dissertations Abstracts International, Volume: 85-02, Section: A.
500 $a Advisor: Manrique-Vallier, Daniel;Womack, Andrew.
502 $a Thesis (Ph.D.)--Indiana University, 2023.
506 $a This item must not be sold to any third party vendors.
520 $a The observable dynamics of real-world networks often obey rules imposed by a hierarchical structure of their components. These hierarchies are fundamental for better understanding several natural, social, and artificial systems around us. Not surprisingly, in many phenomena these hierarchies are seldom directly observable and must be inferred only from their effects. In this dissertation, I develop a family of probabilistic models capable of inferring hidden hierarchies from observed network measurements. These models consider both the effect of hierarchies on network constituents and the structure of the hierarchies themselves. I develop estimators for latent hierarchies and computational methods to infer them under a Bayesian approach. I apply these methods to two different data structures that can be driven by an underlying hierarchy, using both simulated and real data. The first is social networks when they are used to represent affection or agonistic behavior in groups, which leads to a straightforward inference of a dominance hierarchy. The second is bipartite networks when one part can be described by a hierarchy and this hierarchy drives the co-occurrence of edges to members of the other part.I characterize hierarchies as directed acyclic graphs (DAGs). The space of hierarchies grows super-exponentially with the number of nodes in a network. This leads to both theoretical and computational inferential issues. I address both and point to avenues of research as potential extensions of my work. On the theoretical side, the main issue is to build models that are tractable while still preserving structure that is rich-enough to describe the connection of the latent hierarchy to the observable dynamics. On the computational side, it quickly becomes impossible to do an exhaustive enumeration of the space of latent hierarchies giving rise to a challenging search for the optimal solution. I deal with this by stochastically exploring the solution space via Markov Chain Monte Carlo algorithms.The developed models and methods have the potential to be widely applied in domains where revealing hidden hierarchies is meaningful. To name a few, artificial intelligence, national security, social and political sciences, international relations, animal behavior and behavioral ecology, biology, and neuroscience could benefit from these advancements. With that scope and in synergy with prior research that has characterized hierarchies differently (e.g. as total orders, rankings, dendograms, etc.), this dissertation contributes to seeding the foundations of a unified statistical framework for the study of hierarchical organization, yet to be created.
590 $a School code: 0093.
650 4 $a Statistics. $3 182057
650 4 $a Information science. $3 190425
653 $a Bayesian statistics
653 $a Computational statistics
653 $a Directed acyclic graphs
653 $a Hierarchy
653 $a Network inference
690 $a 0463
690 $a 0723
710 2 $a Indiana University. $b Statistics. $3 966928
773 0 $t Dissertations Abstracts International $g 85-02A.
790 $a 0093
791 $a Ph.D.
792 $a 2023
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30570933