Settling the Sharp Reconstruction Thresholds of Random Graph Matching

Wu, Yihong; Xu, Jiaming; Yu, Sophie H.

doi:10.1109/tit.2022.3169005

Cited by 28 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As for random graph matching problems, so far most of the theoretical study was carried out for Erdős-Rényi graph models since Erdős-Rényi graph is arguably the most canonical random graph model. Along this line, much progress has been made recently, including information-theoretic analysis [8,9,13,14,27,31,50,59,61,62] and proposals for various efficient algorithms [4,6,10,11,[16][17][18][20][21][22]26,29,32,34,[37][38][39]43,48,49,51,54,63,64]. Despite of extensive efforts from the community, we still did not yet completely understand the computational phase transition for random graph matching.…”

Section: Background and Related Resultsmentioning

confidence: 99%

A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs

Ding,

Du,

Gong

2024

Random Struct Algorithms

View full text Add to dashboard Cite

For two independent Erdős–Rényi graphs , we study the maximal overlap (i.e., the number of common edges) of these two graphs over all possible vertex correspondence. We present a polynomial‐time algorithm which finds a vertex correspondence whose overlap approximates the maximal overlap up to a multiplicative factor that is arbitrarily close to 1. As a by‐product, we prove that the maximal overlap is asymptotically for with some constant .

show abstract

Section: Background and Related Resultsmentioning

confidence: 99%

A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs

Ding,

Du,

Gong

2024

Random Struct Algorithms

View full text Add to dashboard Cite

show abstract

“…Persuasion, at times, involves exerting one's influence on others, which is why it is often viewed as a contentious endeavor. As per Sophie (2022), the Persuasion Knowledge Theory suggests that consumers have developed what is known as "persuasion knowledge" -the ability to recognize attempts by marketers to influence them. In today's world, consumers are increasingly aware of marketers' motives.…”

Section: Theoretical Frameworkmentioning

confidence: 99%

Product placement in Namaste Wahala in the global film industry and brand recall in Nigeria

Mosopefoluwa,

Boluwatife,

Eric

2024

J. Media Commun. Stud.

View full text Add to dashboard Cite

Many firms utilize Nollywood in Nigeria as a marketing platform for product placement. Within this context, this study investigates product placement in the movie "Namaste Wahala" in the global film industry and its effect on brand recall among Nigerian undergraduate students from Caleb University and the Lagos State University of Science and Technology (LASUSTECH). The aim is to determine if they can remember the brands they saw and how it influences their purchasing decisions after exposure to product placement in the movie. This study adopts Dual Coding Theory and Persuasion Knowledge Theory, employing a traditional positivist research design, which informed the choice of the survey method. Slovin's Formula and ratio analysis were used to sample respondents from Caleb University and LASUSTECH in Lagos State, with 400 questionnaires administered (120 at Caleb University and 280 at LASUSTECH) based on the population strength of the two institutions, where undergraduate students were randomly selected. Findings suggest that while respondents are generally aware of product placement in movies, brand recall and perception are not significantly high. Moreover, the majority of respondents recalled brands placed in foreign movies more than those in Nigerian movies. The study concludes that these findings have implications for marketing practitioners, researchers and movie producers.

show abstract

A Polynomial Time Iterative Algorithm for Matching Gaussian Matrices with Non-vanishing Correlation

Ding,

2024

Found Comput Math

View full text Add to dashboard Cite

Settling the Sharp Reconstruction Thresholds of Random Graph Matching

Cited by 28 publications

References 18 publications

A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs

A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs

Product placement in Namaste Wahala in the global film industry and brand recall in Nigeria

A Polynomial Time Iterative Algorithm for Matching Gaussian Matrices with Non-vanishing Correlation

Contact Info

Product

Resources

About